author  wenzelm 
Tue, 21 Oct 2008 20:18:07 +0200  
changeset 28650  a7ba12e0d3b7 
parent 28633  7b2cb494e11c 
child 28676  78688a5fafc2 
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 

28629
c5a915b45390
goaldirected proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset

50 
* Goaldirected proof now enforces strict proof irrelevance wrt. sort 
c5a915b45390
goaldirected proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset

51 
hypotheses. Sorts required in the course of reasoning need to be 
c5a915b45390
goaldirected proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset

52 
covered by the constraints in the initial statement, completed by the 
c5a915b45390
goaldirected proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset

53 
type instance information of the background theory. Nontrivial sort 
c5a915b45390
goaldirected proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset

54 
hypotheses, which rarely occur in practice, may be specified via 
28633  55 
vacuous propositions of the form SORT_CONSTRAINT('a::c). For example: 
28629
c5a915b45390
goaldirected proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset

56 

c5a915b45390
goaldirected proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset

57 
lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ... 
c5a915b45390
goaldirected proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset

58 

c5a915b45390
goaldirected proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset

59 
The result contains an implicit sort hypotheses as before  
28631  60 
SORT_CONSTRAINT premises are eliminated as part of the canonical rule 
61 
normalization. 

28629
c5a915b45390
goaldirected proof now enforces strict proof irrelevance wrt. sort hypotheses;
wenzelm
parents:
28606
diff
changeset

62 

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

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

64 

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

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

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

67 

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

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

71 
code generator framework). 

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

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

74 
fun etc. 

75 
INCOMPATIBILITY. 

76 

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

79 

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

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

81 

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

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

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

84 
methods intro_locales and unfold_locales to clarify. 
27681  85 

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

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

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

88 

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

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

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

91 

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

92 
* 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

93 

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

96 

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

97 

27381  98 
*** Document preparation *** 
99 

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

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

102 
syntax just like the Isar command 'by'. 
27381  103 

104 

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

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

106 

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

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

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

109 

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

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

111 

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

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

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

28606  116 
within the theory via plain ML wrapper functions. Basic Sledgehammer 
117 
commands are covered in the isarref manual 

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

118 

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

119 
* Wrapper scripts for remote SystemOnTPTP service allows to use 
28475  120 
sledgehammer without local ATP installation (Vampire etc.). See also 
121 
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

122 
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

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

124 

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

127 

128 
* Command "value" now integrates different evaluation 

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

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

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

28227  133 

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

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

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

136 
means of predicate "wf", use rule wf_wellorderI. INCOMPATIBILITY. 
27823  137 

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

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

141 
preorder_class.*. 

142 

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

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

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

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

147 
semiring_div. INCOMPATIBILITY. This involves the following theorem 

148 
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

149 

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

150 
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

151 
zero_dvd_iff ~> dvd_0_left_iff 
28559  152 
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

153 
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

154 
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

155 
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

156 
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

157 

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

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

161 
corresponding theorems renamed accordingly. INCOMPATIBILY. To 

162 
recover tupled syntax, use syntax declarations like: 

27556  163 

164 
hide (open) const gcd 

165 
abbreviation gcd where 

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

167 
notation (output) 

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

169 

170 
(analogously for lcm, zgcd, zlcm). 

171 

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

27551  173 

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

174 
* 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

175 
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

176 
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

177 
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

178 
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

179 
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

180 
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

181 
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

182 
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

183 
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

184 
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

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

186 

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

189 

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

192 
the corresponding theory Plain should be ancestor of every further 

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

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

195 
explicitly. 

27421  196 

28248  197 
* The metis method now fails in the usual manner, rather than raising 
198 
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

199 

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

200 
* 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

201 
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

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

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

204 
(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

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

206 
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

207 
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

208 
rule: prod.exhaust) here. 
27122  209 

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

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

211 

27122  212 
* Removed fact "case_split_thm", which duplicates "case_split". 
213 

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

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

216 
represented as datatype. The characteristic theorems have to be 

217 
proven. INCOMPATIBILITY. Also observe that the following theorems 

218 
have disappeared in favour of existing ones: 

219 

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

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

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

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

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

224 
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

225 

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

228 
theorems. Changes in simp rules. INCOMPATIBILITY. 

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

229 

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

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

231 
menu. 
28067  232 

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

233 

27696  234 
*** HOLAlgebra *** 
235 

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

236 
* 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

237 
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

238 
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

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

240 

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

241 
* 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

242 

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

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

246 

247 
* Renamed the following theorems. INCOMPATIBILITY. 

248 
UpperD ~> Upper_memD 

249 
LowerD ~> Lower_memD 

250 
least_carrier ~> least_closed 

251 
greatest_carrier ~> greatest_closed 

252 
greatest_Lower_above ~> greatest_Lower_below 

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

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

254 
one_not_zero ~> carrier_one_not_zero (collision with assumption) 
27696  255 

27793  256 

27485  257 
*** HOLNSA *** 
258 

259 
* Created new image HOLNSA, containing theories of nonstandard 

260 
analysis which were previously part of HOLComplex. Entry point 

261 
Hyperreal.thy remains valid, but theories formerly using 

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

263 

264 

27704  265 
*** ZF *** 
266 

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

268 

269 

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

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

271 

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

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

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

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

277 
the cterm carefully, avoiding slow Thm.cterm_of. 

278 

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

279 
* 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

280 
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

281 
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

282 
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

283 
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

284 
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

285 
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

286 

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

287 
* 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

288 
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

289 
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

290 
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

291 
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

292 

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

293 
* 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

294 
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

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

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

297 

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

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

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

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

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

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

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

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

305 

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

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

307 
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

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

309 

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

310 
* 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

311 
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

312 
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

313 
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

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

315 

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

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

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

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

322 

27380  323 
* Antiquotations: blockstructured compilation context indicated by 
27391  324 
\<lbrace> ... \<rbrace>; additional antiquotation forms: 
325 

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

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

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

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

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

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

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

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

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

334 
@{lemma (open) ...}  open derivation 
27380  335 

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

336 

27979  337 
*** System *** 
338 

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

339 
* 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

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

341 

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

344 
installed (the old isabelleinterface script silently falls back on 

345 
isabelleprocess). The PROOFGENERAL_HOME setting determines the 

346 
installation location of the Proof General distribution. 

347 

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

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

351 
process wrapper has been discontinued.) 

352 

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

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

355 
userinterface components to provide detailed feedback on internal 

356 
prover operations. 

357 

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

359 

360 

27143  361 

27008  362 
New in Isabelle2008 (June 2008) 
363 
 

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

364 

25522  365 
*** General *** 
366 

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

369 

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

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

373 
provides a proper context already. 

374 

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

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

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

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

378 

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

26659  381 
space take precedence. INCOMPATIBILITY in rare situations, may try to 
26650  382 
swap theory imports. 
383 

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

386 

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

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

389 
white space without escapes. 

390 

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

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

393 
"foo_bar". 

394 

25522  395 

25502  396 
*** Pure *** 
397 

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

400 

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

403 

404 
(1) unused_thms 

405 
Only finds unused theorems in the current theory. 

406 

407 
(2) unused_thms thy_1 ... thy_n  

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

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

410 

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

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

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

414 
their ancestors. 

415 

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

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

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

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

423 

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

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

26874  426 
usually the case when using Proof General with the default settings). 
26681  427 

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

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

431 
that tools may maintain dynamically scoped facts systematically, using 

432 
PureThy.add_thms_dynamic. 

433 

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

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

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

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

438 
update of theories within ML code. 
26479  439 

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

440 
* 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

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

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

443 
depending on former CPure need to refer to Pure. 
26650  444 

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

448 
INCOMPATIBILITY. 

449 

26874  450 
* Command 'setup': discontinued implicit version with ML reference. 
26434  451 

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

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

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

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

25502  457 

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

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

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

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

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

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

463 

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

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

465 
"(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

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

467 

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

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

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

470 

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

473 
predicates. 

26765  474 

475 

26762  476 
*** Document preparation *** 
477 

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

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

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

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

26914  484 

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

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

26762  488 

489 

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

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

491 

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

494 
"primrec" command distinguishes oldstyle and newstyle specifications 

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

496 
When adjusting theories, beware: constants stemming from newstyle 

497 
primrec specifications have authentic syntax. 

498 

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

500 
with multithreading. 

501 

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

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

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

505 

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

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

508 
reconstruction_modulus, reconstruction_sorts renamed 

509 
sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY. 

510 

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

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

514 
and makes them available separately. See 

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

516 

517 
* More flexible generation of measure functions for termination 

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

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

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

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

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

523 
type and generates all solutions by prologstyle backwards proof using 

524 
the declared rules. 

525 

526 
This setup also deals with rules like 

527 

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

529 

530 
which accommodates nested datatypes that recurse through lists. 

531 
Similar rules are predeclared for products and option types. 

532 

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

533 
* 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

534 

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

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

536 

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

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

539 

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

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

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

543 

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

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

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

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

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

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

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

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

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

552 

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

553 
 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

554 
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

555 
the unknowns in the rule is a set. 
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 
 Higher order unification and forward proofs: 
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 
then have "EX S. P S" .. 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

562 

27008  563 
no longer works (due to the incompleteness of the HO unification 
564 
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

565 

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

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

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

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

569 
qed 
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 
 Calculational reasoning with subst (or similar rules): 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

572 
The proof pattern 
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 
have "P (S::'a set)" <...> 
df1f238a05f7
Added entry explaining incompatibilities introduced by replacing sets by predicates.
berghofe
parents:
26955
diff
changeset

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

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

577 

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

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

580 

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

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

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

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

584 

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

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

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

587 

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

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

589 

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

592 
type of the form 

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

593 

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

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

595 

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

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

597 

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

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

599 

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

602 

26513  603 
* Explicit class "eq" for executable equality. INCOMPATIBILITY. 
604 

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

26445  607 
INCOMPATIBILITY. 
608 

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

611 

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

612 
* 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

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

614 

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

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

26355  618 

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

619 
* 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

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

621 

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

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

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

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

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

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

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

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

629 

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

630 
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

631 
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

632 
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

633 

26231  634 
* Library/Option_ord.thy: Canonical order on option type. 
635 

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

26197  638 

26231  639 
* Library/Countable.thy: Type class for countable types. 
640 

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

641 
* 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

642 
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

643 
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

644 
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

645 
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

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

647 

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

648 
* 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

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

650 
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

651 
[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

652 

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

653 
* 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

654 
(whose purpose mainly is for various fold_set functionals) have been 
26874  655 
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

656 
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

657 
lower_semilattice (resp. upper_semilattice) and linorder. 
26139  658 
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

659 

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

660 
* 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

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

662 

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

663 
* 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

664 
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

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

666 

26874  667 
* Renamed theorems "power.simps" to "power_int.simps". 
27067  668 
INCOMPATIBILITY. 
25961  669 

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

670 
* Class semiring_div provides basic abstract properties of semirings 
25942  671 
with division and modulo operations. Subsumes former class dvd_mod. 
672 

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

673 
* 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

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

675 

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

676 
* 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

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

678 

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

679 
* 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

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

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

682 

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

684 
syntax. INCOMPATIBILITY. 
25522  685 

686 
* Definitions subset_def, psubset_def, set_diff_def, Compl_def, 

687 
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def, 

688 
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def, 

689 
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def, 

690 
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

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

692 

25705  693 
* 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

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

696 

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

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

700 

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

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

703 
wellorders on sets and on types. 

26877  704 

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

705 

26197  706 
*** ZF *** 
707 

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

710 

711 
Datatype > Datatype_ZF 

712 
Inductive > Inductive_ZF 

713 
Int > Int_ZF 

714 
IntDiv > IntDiv_ZF 

715 
Nat > Nat_ZF 

716 
List > List_ZF 

717 
Main > Main_ZF 

718 

719 
INCOMPATIBILITY: ZF theories that import individual theories below 

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

721 
available, as trivial extension of Main_ZF. 

26197  722 

723 

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

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

725 

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

728 

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

729 
* 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

730 
(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

731 

27067  732 
* Removed obsolete "use_legacy_bindings" function. 
26188  733 

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

734 
* 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

735 
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

736 
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

737 
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

738 
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

739 

26874  740 
* Functions system/system_out provide a robust way to invoke external 
27008  741 
shell commands, with propagation of interrupts (requires Poly/ML 5.2). 
26874  742 
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

743 

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

744 

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

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

746 

25971  747 
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs  
748 
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

749 

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

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

751 
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

752 
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

753 

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

756 

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

759 
isatool yxml as described in the Isabelle system manual. 

25651  760 

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

764 

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

767 

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

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

771 
script. 

772 

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

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

775 
optimal performance tuning. The corresponding usedir option M allows 

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

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

778 

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

780 
adverse effect of Isabelle flooding interactive frontends (notably 

781 
ProofGeneral / XEmacs). 

782 

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

783 

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

784 

25429  785 
New in Isabelle2007 (November 2007) 
786 
 

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

787 

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

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

789 

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

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

22826  794 

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

795 
* 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

796 
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

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

798 

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

799 
* 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

800 
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

801 
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

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

803 

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

806 
quotes. 

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

807 

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

808 
* 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

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

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

811 
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

812 
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

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

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

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

816 
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

817 

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

818 
* 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

819 
identification, instead of the traditional scheme of full physical 
23889  820 
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

821 
(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

822 
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

823 
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

824 

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

825 
* 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

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

829 

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

831 
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

832 
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

833 
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

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

835 
'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

836 

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

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

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

841 
ambiguities introduced later on. INCOMPATIBILITY: constants in parse 

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

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

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

845 

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

846 
* 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

847 
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

848 
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

849 
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

850 
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

851 
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

852 
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

853 

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

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

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

856 
support a specific search form (see ProofGeneral/CHANGES). 
22965  857 

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

860 
suppressed from proof state output. Note that the ProofGeneral 

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

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

863 
limit is imposed. 

864 

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

865 
* 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

866 
``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

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

868 
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

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

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

871 

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

872 
* 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

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

874 

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

875 

17865  876 
*** Document preparation *** 
877 

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

880 
current context. 

21339  881 

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

17865  884 

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

21735  887 
arguments may be given on the LHS.) 
21717  888 

889 

17779  890 
*** Pure *** 
891 

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

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

896 
constants with qualified polymorphism (according to the class 

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

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

899 
between global polymorphic consts and internal locale representation. 

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

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

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

906 

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

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

909 
writing SML code to a file: 
25199  910 
export_code <list of constants (term syntax)> in SML <filename> 
22735  911 
writing OCaml code to a file: 
25199  912 
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

913 
writing Haskell code to a bunch of files: 
25199  914 
export_code <list of constants (term syntax)> in Haskell <filename> 
915 

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

25184  917 
method ``eval'' 
918 

919 
Reasonable default setup of framework in HOL. 

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

920 

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

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

922 

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

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

926 
[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

927 

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

929 

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

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

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

932 

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

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

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

935 

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

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

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

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

939 

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

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

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

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

943 

25199  944 
code_instance and code_class only are effective to target Haskell. 
22735  945 

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

24800  948 
generation from Isabelle/HOL theories is available via "isatool doc 
949 
codegen". 

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

950 

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

953 
annotations). 

954 

19254  955 
* Command 'no_translations' removes translation rules from theory 
956 
syntax. 

957 

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

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

961 
correspondence to type class and instance declarations. 

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

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

19711  964 

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

966 
instantiation that matches an instance against the most general 

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

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

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

970 
recursion over such type arguments. Incomplete specification patterns 

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

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

975 

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

978 
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

979 
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

980 
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

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

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

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

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

985 
toplevel undo/redo and fail to work with multithreading. 
24086  986 

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

987 
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

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

989 

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

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

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

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

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

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

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

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

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

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

999 

24086  1000 
* Named collections of theorems may be easily installed as context 
24800  1001 
data using the functor NamedThmsFun (see also 
24086  1002 
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

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

1004 
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

1005 
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

1006 
order. 
24086  1007 

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

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

1011 
difference of the original declaration context wrt. the application 

1012 
context encountered later on. 

1013 

1014 
* Isar: proper interfaces for simplification procedures. Command 

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

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

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

1018 

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

1020 
abbreviates a theorem reference involving an internal dummy fact, 

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

1022 
the background context will persist. This form of inplace 

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

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

1025 

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

1026 
* 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

1027 
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

1028 
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

1029 
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

1030 
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

1031 
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

1032 
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

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

1034 

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

1035 
* 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

1036 
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

1037 
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

1038 
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

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

1040 

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

1043 

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

1045 
then guess x and y by clarify 

1046 

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

1048 
proof tools being involved here. 

1049 

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

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

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

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

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

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

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

1058 

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

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

18020  1062 

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

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

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

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

1067 

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

1068 
* 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

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

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

1071 

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

1074 

18308  1075 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
1076 

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

1078 

18540  1079 
* Isar: added command 'unfolding', which is structurally similar to 
1080 
'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

1081 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  1082 
'unfolded' attribute may be replaced by firstclass proof text. 
1083 

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

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

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

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

1087 
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

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

1089 

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

1092 

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

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

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

1098 
originally first one. 

19220  1099 

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

1100 
* 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

1101 
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

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

1103 

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

1106 
(essentially a disjunction of cases with local parameters and 

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

18910  1108 
adequately; in this notation common elimination rules look like this: 
18901  1109 

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

1111 
assumes "EX x. P x" 

1112 
obtains x where "P x" 

1113 

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

1115 
assumes "A & B" 

1116 
obtains A and B 

1117 

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

1119 
assumes "A  B" 

1120 
obtains 

1121 
A 

1122 
 B 

1123 

18910  1124 
The subsequent classical rules even refer to the formal "thesis" 
18901  1125 
explicitly: 
1126 

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

1128 
obtains "~ thesis" 

1129 

18910  1130 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
1131 
obtains "thesis ==> something" 

18901  1132 

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

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

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

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

1138 
case_names). 

18901  1139 

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

1140 
* 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

1141 
"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

1142 
(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

1143 
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

1144 

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

1147 
toplevel lemma. 

1148 

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

1151 

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

1154 
to occur. 

1155 

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

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

1157 
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

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

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

1160 

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

1161 
* 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

1162 
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

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

1164 

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

1165 
* 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

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

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

1170 
current context. 

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

1171 

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

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

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

1176 

19665  1177 
axiomatization 
21595  1178 
eq (infix "===" 50) where 
1179 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

1180 

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

1182 
definition g where "g x = f x x" 

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

1183 

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

1187 

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

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

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

19088  1192 
parameters implicit and using the original short name. See also 
25177  1193 
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
19083  1194 
entities from a monomorphic theory. 
1195 

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

19363  1197 
not inherited by general import expressions. Also note that 
1198 
'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

1199 
'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

1200 
prevents folding of abbreviations in term output. 
19084  1201 

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

1202 
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

1203 
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

1204 
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

1205 
'translations' with explicit "CONST" markup to accommodate this. 
19665  1206 

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

1209 
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

1210 

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

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

1212 

24738  1213 
inductive conj for A B 
1214 
where "A ==> B ==> conj A B" 

1215 

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

1218 
abbreviations on output. 

1219 

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

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

1223 
endomorphisms as locale endom = homom mult mult h. 

19783  1224 

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

1225 
* 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

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

1229 
predicates, goals repesenting already interpreted fragments are not 

1230 
removed automatically. Use methods `intro_locales' and 

1231 
`unfold_locales'; see below. 

1232 

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

1234 
provide backward reasoning on locales predicates. The methods are 

1235 
aware of interpretations and discharge corresponding goals. 

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

1237 
unfold predicates to assumptions. 

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

1238 

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

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

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

1242 

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

1245 
unfolded in interpreted theorems. This is useful for replacing 

1246 
defined concepts (constants depending on locale parameters) by 

1247 
concepts already existing in the target context. Example: 

1248 

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

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

1251 

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

1254 
partial_order. 

1255 

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

1259 
(using objectlogic connectives for this purpose has been long 

1260 
obsolete anyway). Common proof patterns are explained in 

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

1263 
examples. 

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

1264 

24859  1265 
* 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

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

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

1268 
accordingly. INCOMPATIBILITY, proofs need to be structured explicitly, 
25177  1269 
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

1270 

24859  1271 
* Method "induct": mutual induction rules are now specified as a list 
24800  1272 
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

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

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

1276 

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

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

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

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

1281 

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

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

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

1284 

24859  1285 
* Method "coinduct": dual of induction, see 
18399  1286 
src/HOL/Library/Coinductive_List.thy for various examples. 
1287 

24859  1288 
* Method "cases", "induct", "coinduct": the ``(open)'' option is 
1289 
considered a legacy feature. 

1290 

20919
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset

1291 
* Attribute "symmetric" produces result with standardized schematic 
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset

1292 
variables (index 0). Potential INCOMPATIBILITY. 
dab803075c62
attribute "symmetric": standardized schematic variables;
wenzelm
parents:
20857
diff
changeset

1293 

22126  1294 
* Simplifier: by default the simplifier trace only shows top level 
1295 
rewrites now. That is, trace_simp_depth_limit is set to 1 by 

1296 
default. Thus there is less danger of being flooded by the trace. The 

1297 
trace indicates where parts have been suppressed. 

18674  1298 

18536
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1299 
* Provers/classical: removed obsolete classical version of elim_format 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1300 
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

1301 
manipulating the claset. 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1302 

18694  1303 
* Provers/classical: stricter checks to ensure that supplied intro, 
1304 
dest and elim rules are wellformed; dest and elim rules must have at 

1305 
least one premise. 

1306 

1307 
* Provers/classical: attributes dest/elim/intro take an optional 

18695  1308 
weight argument for the rule (just as the Pure versions). Weights are 
18696  1309 
ignored by automated tools, but determine the search order of single 
18694  1310 
rule steps. 
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18549
diff
changeset

1311 

18536
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1312 
* Syntax: input syntax now supports dummy variable binding "%_. b", 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1313 
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

1314 
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

1315 
"{_. _}" match any set comprehension as expected. Potential 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1316 
INCOMPATIBILITY  parse translations need to cope with syntactic 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1317 
constant "_idtdummy" in the binding position. 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1318 

ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1319 
* Syntax: removed obsolete syntactic constant "_K" and its associated 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1320 
parse translation. INCOMPATIBILITY  use dummy abstraction instead, 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

1321 
for example "A > B" => "Pi A (%_. B)". 
17779  1322 

20582
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset

1323 
* Pure: 'class_deps' command visualizes the subclass relation, using 
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset

1324 
the graph browser tool. 
ebd0e03c6a9b
* Pure: 'class_deps' command visualizes the subclass relation;
wenzelm
parents:
20503
diff
changeset

1325 

24800  1326 
* Pure: 'print_theory' now suppresses certain internal declarations by 
1327 
default; use '!' option for full details. 

20620
8b26f58c5646
* Pure: 'print_theory' now suppresses entities with internal name;
wenzelm
parents:
20607
diff
changeset

1328 

17865  1329 

17806  1330 
*** HOL *** 
1331 

25129  1332 
* Method "metis" proves goals by applying the Metis generalpurpose 
1333 
resolution prover (see also http://gilith.com/software/metis/). 

1334 
Examples are in the directory MetisExamples. WARNING: the 

1335 
Isabelle/HOLMetis integration does not yet work properly with 

1336 
multithreading. 

1337 

1338 
* Command 'sledgehammer' invokes external automatic theorem provers as 

1339 
background processes. It generates calls to the "metis" method if 

1340 
successful. These can be pasted into the proof. Users do not have to 

1341 
wait for the automatic provers to return. WARNING: does not really 

1342 
work with multithreading. 

1343 

24804  1344 
* New "auto_quickcheck" feature tests outermost goal statements for 
1345 
potential counterexamples. Controlled by ML references 

1346 
auto_quickcheck (default true) and auto_quickcheck_time_limit (default 

25129  1347 
5000 milliseconds). Fails silently if statements is outside of 
1348 
executable fragment, or any other codgenerator problem occurs. 

24804  1349 

25184  1350 
* New constant "undefined" with axiom "undefined x = undefined". 
1351 

1352 
* Added class "HOL.eq", allowing for code generation with polymorphic 

1353 
equality. 

1354 

1355 
* Some renaming of class constants due to canonical name prefixing in 

1356 
the new 'class' package: 

1357 

1358 
HOL.abs ~> HOL.abs_class.abs 

1359 
HOL.divide ~> HOL.divide_class.divide 

1360 
0 ~> HOL.zero_class.zero 

1361 
1 ~> HOL.one_class.one 

1362 
op + ~> HOL.plus_class.plus 

1363 
op  ~> HOL.minus_class.minus 

1364 
uminus ~> HOL.minus_class.uminus 

1365 
op * ~> HOL.times_class.times 

1366 
op < ~> HOL.ord_class.less 

1367 
op <= > HOL.ord_class.less_eq 

1368 
Nat.power ~> Power.power_class.power 

1369 
Nat.size ~> Nat.size_class.size 

1370 
Numeral.number_of ~> Numeral.number_class.number_of 

1371 
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf 

1372 
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup 

1373 
Orderings.min ~> Orderings.ord_class.min 

1374 
Orderings.max ~> Orderings.ord_class.max 

1375 
Divides.op div ~> Divides.div_class.div 

1376 
Divides.op mod ~> Divides.div_class.mod 

1377 
Divides.op dvd ~> Divides.div_class.dvd 

1378 

1379 
INCOMPATIBILITY. Adaptions may be required in the following cases: 

1380 

1381 
a) Userdefined constants using any of the names "plus", "minus", 

1382 
"times", "less" or "less_eq". The standard syntax translations for 

1383 
"+", "" and "*" may go wrong. INCOMPATIBILITY: use more specific 

1384 
names. 

1385 

1386 
b) Variables named "plus", "minus", "times", "less", "less_eq" 

1387 
INCOMPATIBILITY: use more specific names. 

1388 

1389 
c) Permutative equations (e.g. "a + b = b + a") 

1390 
Since the change of names also changes the order of terms, permutative 

1391 
rewrite rules may get applied in a different order. Experience shows 

1392 
that this is rarely the case (only two adaptions in the whole Isabelle 

1393 
distribution). INCOMPATIBILITY: rewrite proofs 

1394 

1395 
d) ML code directly refering to constant names 

1396 
This in general only affects handwritten proof tactics, simprocs and 
