author  haftmann 
Mon, 14 Jul 2008 11:04:42 +0200  
changeset 27556  292098f2efdf 
parent 27551  9a5543d4cc24 
child 27599  ca23ef50c178 
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 

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

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

8 

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

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

12 

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

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

15 

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

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

17 

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

18 
* New ML antiquotation @{code}: takes constant as argument, generates 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

19 
corresponding code in background and inserts name of the corresponding 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

20 
resulting ML value/function/datatype constructor binding in place. 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

21 
All occurrences of @{code} with a single ML block are generated 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

22 
simultaneously. Provides a generic and safe interface for 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

23 
instrumentalizing code generation. See HOL/ex/Code_Antiq for a toy 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

24 
example, or HOL/Complex/ex/ReflectedFerrack for a more ambitious 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

25 
application. In future you ought refrain from adhoc compiling 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

26 
generated SML code on the ML toplevel. Note that (for technical 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

27 
reasons) @{code} cannot refer to constants for which userdefined 
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

28 
serializations are set. Refer to the corresponding ML counterpart 
27436  29 
directly in that cases. 
30 

27200  31 
* Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML 
27519
59b54d80d2ae
slightly improved @{lemma} (both for latex and ML);
wenzelm
parents:
27485
diff
changeset

32 
interface instead. 
27200  33 

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

34 

27381  35 
*** Document preparation *** 
36 

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

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

39 
syntax just like the Isar command 'by'. 
27381  40 

41 

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

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

43 

27556  44 
* HOL/Library/GCD: Curried operations gcd, lcm (for nat) and zgcd, zlcm (for int); 
45 
carried together from various gcd/lcm developements in the HOL Distribution. 

46 
zgcd and zlcm replace former igcd and ilcm; corresponding theorems renamed 

47 
accordingly. INCOMPATIBILY. To recover tupled syntax, use syntax declarations like: 

48 

49 
hide (open) const gcd 

50 
abbreviation gcd where 

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

52 
notation (output) 

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

54 

55 
(analogously for lcm, zgcd, zlcm). 

56 

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

27551  58 

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

61 

62 
* New image HOLPlain provides a minimal HOL with the most important tools 

27436  63 
available (inductive, datatype, primrec, ...). By convention the corresponding 
64 
theory Plain should be ancestor of every further (library) theory. Some library 

65 
theories now have ancestor Plain (instead of Main), thus theory Main 

66 
occasionally has to be imported explicitly. 

27421  67 

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

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

69 
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

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

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

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

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

74 
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

75 
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

76 
rule: prod.exhaust) here. 
27122  77 

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

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

79 

27122  80 
* Removed fact "case_split_thm", which duplicates "case_split". 
81 

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

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

84 
represented as datatype. The characteristic theorems have to be 

85 
proven. INCOMPATIBILITY. Also observe that the following theorems 

86 
have disappeared in favour of existing ones: 

87 

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

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

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

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

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

92 
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

93 

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

96 
theorems. Changes in simp rules. INCOMPATIBILITY. 

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

97 

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

98 

27485  99 
*** HOLNSA *** 
100 

101 
* Created new image HOLNSA, containing theories of nonstandard 

102 
analysis which were previously part of HOLComplex. Entry point 

103 
Hyperreal.thy remains valid, but theories formerly using 

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

105 

106 

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

107 
*** ML *** 
27436  108 

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

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

110 
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

111 
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

112 
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

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

114 

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

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

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

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

121 

27380  122 
* Antiquotations: blockstructured compilation context indicated by 
27391  123 
\<lbrace> ... \<rbrace>; additional antiquotation forms: 
124 

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

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

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

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

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

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

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

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

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

133 
@{lemma (open) ...}  open derivation 
27380  134 

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

135 

27143  136 

27008  137 
New in Isabelle2008 (June 2008) 
138 
 

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

139 

25522  140 
*** General *** 
141 

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

144 

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

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

148 
provides a proper context already. 

149 

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

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

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

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

153 

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

26659  156 
space take precedence. INCOMPATIBILITY in rare situations, may try to 
26650  157 
swap theory imports. 
158 

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

161 

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

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

164 
white space without escapes. 

165 

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

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

168 
"foo_bar". 

169 

25522  170 

25502  171 
*** Pure *** 
172 

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

175 

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

178 

179 
(1) unused_thms 

180 
Only finds unused theorems in the current theory. 

181 

182 
(2) unused_thms thy_1 ... thy_n  

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

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

185 

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

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

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

189 
their ancestors. 

190 

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

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

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

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

198 

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

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

26874  201 
usually the case when using Proof General with the default settings). 
26681  202 

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

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

206 
that tools may maintain dynamically scoped facts systematically, using 

207 
PureThy.add_thms_dynamic. 

208 

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

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

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

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

213 
update of theories within ML code. 
26479  214 

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

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

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

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

218 
depending on former CPure need to refer to Pure. 
26650  219 

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

223 
INCOMPATIBILITY. 

224 

26874  225 
* Command 'setup': discontinued implicit version with ML reference. 
26434  226 

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

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

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

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

25502  232 

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

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

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

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

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

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

238 

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

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

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

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

242 

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

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

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

245 

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

248 
predicates. 

26765  249 

250 

26762  251 
*** Document preparation *** 
252 

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

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

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

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

26914  259 

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

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

26762  263 

264 

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

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

266 

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

269 
"primrec" command distinguishes oldstyle and newstyle specifications 

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

271 
When adjusting theories, beware: constants stemming from newstyle 

272 
primrec specifications have authentic syntax. 

273 

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

275 
with multithreading. 

276 

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

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

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

280 

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

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

283 
reconstruction_modulus, reconstruction_sorts renamed 

284 
sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY. 

285 

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

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

289 
and makes them available separately. See 

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

291 

292 
* More flexible generation of measure functions for termination 

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

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

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

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

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

298 
type and generates all solutions by prologstyle backwards proof using 

299 
the declared rules. 

300 

301 
This setup also deals with rules like 

302 

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

304 

305 
which accommodates nested datatypes that recurse through lists. 

306 
Similar rules are predeclared for products and option types. 

307 

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

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

309 

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

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

311 

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

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

314 

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

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

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

318 

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

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

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

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

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

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

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

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

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

327 

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

328 
 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

329 
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

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

331 

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

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

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

334 

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

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

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

337 

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

340 

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

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

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

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

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

345 

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

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

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

348 

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

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

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

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

352 

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

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

355 

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

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

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

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

359 

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

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

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

362 

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

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

364 

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

367 
type of the form 

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

368 

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

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

370 

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

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

372 

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

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

374 

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

377 

26513  378 
* Explicit class "eq" for executable equality. INCOMPATIBILITY. 
379 

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

26445  382 
INCOMPATIBILITY. 
383 

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

386 

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

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

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

389 

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

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

26355  393 

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

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

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

396 

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

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

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

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

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

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

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

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

404 

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

405 
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

406 
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

407 
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

408 

26231  409 
* Library/Option_ord.thy: Canonical order on option type. 
410 

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

26197  413 

26231  414 
* Library/Countable.thy: Type class for countable types. 
415 

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

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

417 
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

418 
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

419 
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

420 
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

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

422 

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

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

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

425 
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

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

427 

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

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

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

431 
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

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

434 

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

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

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

437 

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

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

439 
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

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

441 

26874  442 
* Renamed theorems "power.simps" to "power_int.simps". 
27067  443 
INCOMPATIBILITY. 
25961  444 

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

445 
* Class semiring_div provides basic abstract properties of semirings 
25942  446 
with division and modulo operations. Subsumes former class dvd_mod. 
447 

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

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

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

450 

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

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

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

453 

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

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

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

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

457 

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

459 
syntax. INCOMPATIBILITY. 
25522  460 

461 
* Definitions subset_def, psubset_def, set_diff_def, Compl_def, 

462 
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def, 

463 
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def, 

464 
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def, 

465 
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

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

467 

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

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

471 

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

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

475 

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

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

478 
wellorders on sets and on types. 

26877  479 

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

480 

26197  481 
*** ZF *** 
482 

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

485 

486 
Datatype > Datatype_ZF 

487 
Inductive > Inductive_ZF 

488 
Int > Int_ZF 

489 
IntDiv > IntDiv_ZF 

490 
Nat > Nat_ZF 

491 
List > List_ZF 

492 
Main > Main_ZF 

493 

494 
INCOMPATIBILITY: ZF theories that import individual theories below 

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

496 
available, as trivial extension of Main_ZF. 

26197  497 

498 

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

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

500 

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

503 

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

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

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

506 

27067  507 
* Removed obsolete "use_legacy_bindings" function. 
26188  508 

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

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

510 
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

511 
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

512 
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

513 
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

514 

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

518 

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

519 

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

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

521 

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

524 

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

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

526 
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

527 
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

528 

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

531 

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

534 
isatool yxml as described in the Isabelle system manual. 

25651  535 

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

539 

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

542 

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

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

546 
script. 

547 

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

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

550 
optimal performance tuning. The corresponding usedir option M allows 

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

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

553 

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

555 
adverse effect of Isabelle flooding interactive frontends (notably 

556 
ProofGeneral / XEmacs). 

557 

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

558 

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

559 

25429  560 
New in Isabelle2007 (November 2007) 
561 
 

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

562 

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

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

564 

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

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

22826  569 

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

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

571 
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

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

573 

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

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

575 
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

576 
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

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

578 

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

581 
quotes. 

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

582 

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

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

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

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

586 
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

587 
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

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

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

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

591 
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

592 

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

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

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

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

597 
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

598 
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

599 

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

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

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

604 

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

606 
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

607 
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

608 
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

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

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

611 

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

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

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

616 
ambiguities introduced later on. INCOMPATIBILITY: constants in parse 

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

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

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

620 

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

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

622 
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

623 
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

624 
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

625 
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

626 
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

627 
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

628 

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

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

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

631 
support a specific search form (see ProofGeneral/CHANGES). 
22965  632 

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

635 
suppressed from proof state output. Note that the ProofGeneral 

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

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

638 
limit is imposed. 

639 

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

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

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

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

643 
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

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

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

646 

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

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

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

649 

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

650 

17865  651 
*** Document preparation *** 
652 

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

655 
current context. 

21339  656 

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

17865  659 

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

21735  662 
arguments may be given on the LHS.) 
21717  663 

664 

17779  665 
*** Pure *** 
666 

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

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

671 
constants with qualified polymorphism (according to the class 

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

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

674 
between global polymorphic consts and internal locale representation. 

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

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

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

681 

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

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

684 
writing SML code to a file: 
25199  685 
export_code <list of constants (term syntax)> in SML <filename> 
22735  686 
writing OCaml code to a file: 
25199  687 
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

688 
writing Haskell code to a bunch of files: 
25199  689 
export_code <list of constants (term syntax)> in Haskell <filename> 
690 

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

25184  692 
method ``eval'' 
693 

694 
Reasonable default setup of framework in HOL. 

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

695 

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

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

697 

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

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

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

702 

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

704 

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

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

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

707 

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

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

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

710 

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

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

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

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

714 

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

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

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

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

718 

25199  719 
code_instance and code_class only are effective to target Haskell. 
22735  720 

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

24800  723 
generation from Isabelle/HOL theories is available via "isatool doc 
724 
codegen". 

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

725 

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

728 
annotations). 

729 

19254  730 
* Command 'no_translations' removes translation rules from theory 
731 
syntax. 

732 

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

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

736 
correspondence to type class and instance declarations. 

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

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

19711  739 

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

741 
instantiation that matches an instance against the most general 

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

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

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

745 
recursion over such type arguments. Incomplete specification patterns 

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

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

750 

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

753 
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

754 
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

755 
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

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

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

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

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

760 
toplevel undo/redo and fail to work with multithreading. 
24086  761 

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

762 
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

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

764 

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

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

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

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

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

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

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

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

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

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

774 

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

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

779 
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

780 
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

781 
order. 
24086  782 

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

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

786 
difference of the original declaration context wrt. the application 

787 
context encountered later on. 

788 

789 
* Isar: proper interfaces for simplification procedures. Command 

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

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

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

793 

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

795 
abbreviates a theorem reference involving an internal dummy fact, 

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

797 
the background context will persist. This form of inplace 

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

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

800 

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

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

802 
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

803 
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

804 
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

805 
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

806 
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

807 
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

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

809 

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

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

811 
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

812 
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

813 
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

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

815 

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

818 

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

820 
then guess x and y by clarify 

821 

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

823 
proof tools being involved here. 

824 

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

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

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

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

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

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

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

833 

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

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

18020  837 

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

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

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

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

842 

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

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

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

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

846 

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

849 

18308  850 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
851 

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

853 

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

856 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  857 
'unfolded' attribute may be replaced by firstclass proof text. 
858 

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

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

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

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

862 
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

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

864 

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

867 

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

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

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

873 
originally first one. 

19220  874 

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

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

876 
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

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

878 

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

881 
(essentially a disjunction of cases with local parameters and 

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

18910  883 
adequately; in this notation common elimination rules look like this: 
18901  884 

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

886 
assumes "EX x. P x" 

887 
obtains x where "P x" 

888 

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

890 
assumes "A & B" 

891 
obtains A and B 

892 

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

894 
assumes "A  B" 

895 
obtains 

896 
A 

897 
 B 

898 

18910  899 
The subsequent classical rules even refer to the formal "thesis" 
18901  900 
explicitly: 
901 

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

903 
obtains "~ thesis" 

904 

18910  905 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
906 
obtains "thesis ==> something" 

18901  907 

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

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

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

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

913 
case_names). 

18901  914 

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

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

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

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

918 
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

919 

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

922 
toplevel lemma. 

923 

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

926 

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

929 
to occur. 

930 

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

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

932 
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

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

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

935 

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

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

937 
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

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

939 

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

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

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

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

945 
current context. 

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

946 

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

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

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

951 

19665  952 
axiomatization 
21595  953 
eq (infix "===" 50) where 
954 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

955 

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

957 
definition g where "g x = f x x" 

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

958 

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

962 

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

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

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

19088  967 
parameters implicit and using the original short name. See also 
25177  968 
src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
19083  969 
entities from a monomorphic theory. 
970 

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

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

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

975 
prevents folding of abbreviations in term output. 
19084  976 

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

977 
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

978 
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

979 
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

980 
'translations' with explicit "CONST" markup to accommodate this. 
19665  981 

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

984 
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

985 

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

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

987 

24738  988 
inductive conj for A B 
989 
where "A ==> B ==> conj A B" 

990 

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

993 
abbreviations on output. 

994 

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

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

998 
endomorphisms as locale endom = homom mult mult h. 

19783  999 

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

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

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

1004 
predicates, goals repesenting already interpreted fragments are not 

1005 
removed automatically. Use methods `intro_locales' and 

1006 
`unfold_locales'; see below. 

1007 

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

1009 
provide backward reasoning on locales predicates. The methods are 

1010 
aware of interpretations and discharge corresponding goals. 

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

1012 
unfold predicates to assumptions. 

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

1013 

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

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

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

1017 

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

1020 
unfolded in interpreted theorems. This is useful for replacing 

1021 
defined concepts (constants depending on locale parameters) by 

1022 
concepts already existing in the target context. Example: 

1023 

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

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

1026 

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

1029 
partial_order. 

1030 

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

1034 
(using objectlogic connectives for this purpose has been long 

1035 
obsolete anyway). Common proof patterns are explained in 

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

1038 
examples. 

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

1039 

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

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

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

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

1045 

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

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

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

1051 

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

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

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

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

1056 

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

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

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

1059 

24859  1060 
* Method "coinduct": dual of induction, see 
18399  1061 
src/HOL/Library/Coinductive_List.thy for various examples. 
1062 

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

1065 

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

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

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

1068 

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

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

1072 
trace indicates where parts have been suppressed. 

18674  1073 

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

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

1075 
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

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

1077 

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

1080 
least one premise. 

1081 

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

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

1086 

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

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

1088 
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

1089 
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

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

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

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

1093 

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

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

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

1096 
for example "A > B" => "Pi A (%_. B)". 
17779  1097 

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

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

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

1100 

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

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

1103 

17865  1104 

17806  1105 
*** HOL *** 
1106 

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

1109 
Examples are in the directory MetisExamples. WARNING: the 

1110 
Isabelle/HOLMetis integration does not yet work properly with 

1111 
multithreading. 

1112 

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

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

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

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

1117 
work with multithreading. 

1118 

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

1121 
auto_quickcheck (default true) and auto_quickcheck_time_limit (default 

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

24804  1124 

25184  1125 
* New constant "undefined" with axiom "undefined x = undefined". 
1126 

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

1128 
equality. 

1129 

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

1131 
the new 'class' package: 

1132 

1133 
HOL.abs ~> HOL.abs_class.abs 

1134 
HOL.divide ~> HOL.divide_class.divide 

1135 
0 ~> HOL.zero_class.zero 

1136 
1 ~> HOL.one_class.one 

1137 
op + ~> HOL.plus_class.plus 

1138 
op  ~> HOL.minus_class.minus 

1139 
uminus ~> HOL.minus_class.uminus 

1140 
op * ~> HOL.times_class.times 

1141 
op < ~> HOL.ord_class.less 

1142 
op <= > HOL.ord_class.less_eq 

1143 
Nat.power ~> Power.power_class.power 

1144 
Nat.size ~> Nat.size_class.size 

1145 
Numeral.number_of ~> Numeral.number_class.number_of 

1146 
FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf 

1147 
FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup 

1148 
Orderings.min ~> Orderings.ord_class.min 

1149 
Orderings.max ~> Orderings.ord_class.max 

1150 
Divides.op div ~> Divides.div_class.div 

1151 
Divides.op mod ~> Divides.div_class.mod 

1152 
Divides.op dvd ~> Divides.div_class.dvd 

1153 

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

1155 

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

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

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

1159 
names. 

1160 

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

1162 
INCOMPATIBILITY: use more specific names. 

1163 

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

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

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

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

1168 
distribution). INCOMPATIBILITY: rewrite proofs 

1169 

1170 
d) ML code directly refering to constant names 

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

1172 
so on. INCOMPATIBILITY: grep your sourcecode and replace names. 

1173 
Consider using @{const_name} antiquotation. 

1174 

1175 
* New class "default" with associated constant "default". 

1176 

1177 
* Function "sgn" is now overloaded and available on int, real, complex 

1178 
(and other numeric types), using class "sgn". Two possible defs of 

1179 
sgn are given as equational assumptions in the classes sgn_if and 

1180 
sgn_div_norm; ordered_idom now also inherits from sgn_if. 

1181 
INCOMPATIBILITY. 

1182 

1183 
* Locale "partial_order" now unified with class "order" (cf. theory 

1184 
Orderings), added parameter "less". INCOMPATIBILITY. 

1185 

1186 
* Renamings in classes "order" and "linorder": facts "refl", "trans" and 

1187 
"cases" to "order_refl", "order_trans" and "linorder_cases", to avoid 

1188 
clashes with HOL "refl" and "trans". INCOMPATIBILITY. 

1189 

1190 
* Classes "order" and "linorder": potential INCOMPATIBILITY due to 

1191 
changed order of proof goals in instance proofs. 

1192 

1193 
* The transitivity reasoner for partial and linear orders is set up 

1194 
for classes "order" and "linorder". Instances of the reasoner are available 

1195 
in all contexts importing or interpreting the corresponding locales. 

1196 
Method "order" invokes the reasoner separately; the reasoner 

1197 
is also integrated with the Simplifier as a solver. Diagnostic 

1198 
command 'print_orders' shows the available instances of the reasoner 

1199 
in the current context. 

1200 

1201 
* Localized monotonicity predicate in theory "Orderings"; integrated 

1202 
lemmas max_of_mono and min_of_mono with this predicate. 

1203 
INCOMPATIBILITY. 

1204 

1205 
* Formulation of theorem "dense" changed slightly due to integration 

1206 
with new class dense_linear_order. 

1207 

1208 
* Uniform lattice theory development in HOL. 

1209 

1210 
constants "meet" and "join" now named "inf" and "sup" 

1211 
constant "Meet" now named "Inf" 

1212 

1213 
classes "meet_semilorder" and "join_semilorder" now named 

1214 
"lower_semilattice" and "upper_semilattice" 

1215 
class "lorder" now named "lattice" 

1216 
class "comp_lat" now named "complete_lattice" 

1217 

1218 
Instantiation of lattice classes allows explicit definitions 

1219 
for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices). 

1220 

1221 
INCOMPATIBILITY. Theorem renames: 

1222 

1223 
meet_left_le ~> inf_le1 

1224 
meet_right_le ~> inf_le2 

1225 
join_left_le ~> sup_ge1 

1226 
join_right_le ~> sup_ge2 

1227 
meet_join_le ~> inf_sup_ord 

1228 
le_meetI ~> le_infI 

1229 
join_leI ~> le_supI 

1230 
le_meet ~> le_inf_iff 

1231 
le_join ~> ge_sup_conv 

1232 
meet_idempotent ~> inf_idem 

1233 
join_idempotent ~> sup_idem 

1234 
meet_comm ~> inf_commute 

1235 
join_comm ~> sup_commute 

1236 
meet_leI1 ~> le_infI1 

1237 
meet_leI2 ~> le_infI2 

1238 
le_joinI1 ~> le_supI1 

1239 
le_joinI2 ~> le_supI2 

1240 
meet_assoc ~> inf_assoc 

1241 
join_assoc ~> sup_assoc 

1242 
meet_left_comm ~> inf_left_commute 

1243 
meet_left_idempotent ~> inf_left_idem 

1244 
join_left_comm ~> sup_left_commute 

1245 
join_left_idempotent ~> sup_left_idem 

1246 
meet_aci ~> inf_aci 

1247 
join_aci ~> sup_aci 

1248 
le_def_meet ~> le_iff_inf 

1249 
le_def_join ~> le_iff_sup 

1250 
join_absorp2 ~> sup_absorb2 

1251 
join_absorp1 ~> sup_absorb1 

1252 
meet_absorp1 ~> inf_absorb1 

1253 
meet_absorp2 ~> inf_absorb2 

1254 
meet_join_absorp ~> inf_sup_absorb 

1255 
join_meet_absorp ~> sup_inf_absorb 

1256 
distrib_join_le ~> distrib_sup_le 

1257 
distrib_meet_le ~> distrib_inf_le 

1258 

1259 
add_meet_distrib_left ~> add_inf_distrib_left 

1260 
add_join_distrib_left ~> add_sup_distrib_left 

1261 
is_join_neg_meet ~> is_join_neg_inf 

1262 
is_meet_neg_join ~> is_meet_neg_sup 

1263 
add_meet_distrib_right ~> add_inf_distrib_right 

1264 
add_join_distrib_right ~> add_sup_distrib_right 

1265 
add_meet_join_distribs ~> add_sup_inf_distribs 

1266 
join_eq_neg_meet ~> sup_eq_neg_inf 

1267 
meet_eq_neg_join ~> inf_eq_neg_sup 

1268 
add_eq_meet_join ~> add_eq_inf_sup 

1269 
meet_0_imp_0 ~> inf_0_imp_0 

1270 
join_0_imp_0 ~> sup_0_imp_0 

1271 
meet_0_eq_0 ~> inf_0_eq_0 

1272 
join_0_eq_0 ~> sup_0_eq_0 

1273 
neg_meet_eq_join ~> neg_inf_eq_sup 

1274 
neg_join_eq_meet ~> neg_sup_eq_inf 

1275 
join_eq_if ~> sup_eq_if 

1276 

1277 
mono_meet ~> mono_inf 

1278 
mono_join ~> mono_sup 

1279 
meet_bool_eq ~> inf_bool_eq 

1280 
join_bool_eq ~> sup_bool_eq 

1281 
meet_fun_eq ~> inf_fun_eq 

1282 
join_fun_eq ~> sup_fun_eq 

1283 
meet_set_eq ~> inf_set_eq 

1284 
join_set_eq ~> sup_set_eq 

1285 
meet1_iff ~> inf1_iff 

1286 
meet2_iff ~> inf2_iff 

1287 
meet1I ~> inf1I 

1288 
meet2I ~> inf2I 

1289 
meet1D1 ~> inf1D1 

1290 
meet2D1 ~> inf2D1 

1291 
meet1D2 ~> inf1D2 

1292 
meet2D2 ~> inf2D2 

1293 
meet1E ~> inf1E 

1294 
meet2E ~> inf2E 

1295 
join1_iff ~> sup1_iff 

1296 
join2_iff ~> sup2_iff 

1297 
join1I1 ~> sup1I1 

1298 
join2I1 ~> sup2I1 

1299 
join1I1 ~> sup1I1 

1300 
join2I2 ~> sup1I2 

1301 
join1CI ~> sup1CI 

1302 
join2CI ~> sup2CI 

1303 
join1E ~> sup1E 

1304 
join2E ~> sup2E 

1305 

1306 
is_meet_Meet ~> is_meet_Inf 

1307 
Meet_bool_def ~> Inf_bool_def 

1308 
Meet_fun_def ~> Inf_fun_def 

1309 
Meet_greatest ~> Inf_greatest 

1310 
Meet_lower ~> Inf_lower 

1311 
Meet_set_def ~> Inf_set_def 

1312 

1313 
Sup_def ~> Sup_Inf 

1314 
Sup_bool_eq ~> Sup_bool_def 

1315 
Sup_fun_eq ~> Sup_fun_def 

1316 
Sup_set_eq ~> Sup_set_def 

1317 

1318 
listsp_meetI ~> listsp_infI 

1319 
listsp_meet_eq ~> listsp_inf_eq 

1320 

1321 
meet_min ~> inf_min 

1322 
join_max ~> sup_max 

1323 

1324 
* Added syntactic class "size"; overloaded constant "size" now has 

1325 
type "'a::size ==> bool" 

1326 

24800  1327 
* Internal reorganisation of `size' of datatypes: size theorems 
1328 
"foo.size" are no longer subsumed by "foo.simps" (but are still 

1329 
simplification rules by default!); theorems "prod.size" now named 

25184  1330 
"*.size". 
1331 

1332 
* Class "div" now inherits from class "times" rather than "type". 

1333 
INCOMPATIBILITY. 

24800  1334 

1335 
* HOL/Finite_Set: "namespace" locales Lattice, Distrib_lattice, 

1336 
Linorder etc. have disappeared; operations defined in terms of 

1337 
fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY. 

1338 

25129  1339 
* HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY. 
1340 

24800  1341 
* HOLWord: New extensive library and type for generic, fixed size 
1342 
machine words, with arithemtic, bitwise, shifting and rotating 

1343 
operations, reflection into int, nat, and bool lists, automation for 

1344 
linear arithmetic (by automatic reflection into nat or int), including 

1345 
lemmas on overflow and monotonicity. Instantiated to all appropriate 

1346 
arithmetic type classes, supporting automatic simplification of 

1347 
numerals on all operations. 

24333  1348 

1349 
* Library/Boolean_Algebra: locales for abstract boolean algebras. 

1350 

1351 
* Library/Numeral_Type: numbers as types, e.g. TYPE(32). 

1352 

23850  1353 
* Code generator library theories: 
24993  1354 
 Code_Integer represents HOL integers by big integer literals in target 
23850  1355 
languages. 
24993  1356 
 Code_Char represents HOL characters by character literals in target 
23850  1357 
languages. 
24993  1358 
 Code_Char_chr like Code_Char, but also offers treatment of character 
1359 
codes; includes Code_Integer. 

24800  1360 
 Executable_Set allows to generate code for finite sets using lists. 
1361 
 Executable_Rat implements rational numbers as triples (sign, enumerator, 

23850  1362 
denominator). 
24800  1363 
 Executable_Real implements a subset of real numbers, namly those 
23850  1364 
representable by rational numbers. 
24800  1365 
 Efficient_Nat implements natural numbers by integers, which in general will 
23850  1366 
result in higher efficency; pattern matching with 0/Suc is eliminated; 
24993  1367 
includes Code_Integer. 
1368 
 Code_Index provides an additional datatype index which is mapped to 

1369 
targetlanguage builtin integers. 

26355  1370 
 Code_Message provides an additional datatype message_string which is isomorphic to 
24993  1371 
strings; messages are mapped to targetlanguage strings. 
23850  1372 

23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1373 
* New package for inductive predicates 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1374 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1375 
An nary predicate p with m parameters z_1, ..., z_m can now be defined via 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1376 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1377 
inductive 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1378 
p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1379 
for z_1 :: U_1 and ... and z_n :: U_m 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1380 
where 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1381 
rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1382 
 ... 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1383 

24800  1384 
with full support for typeinference, rather than 
23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1385 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1386 
consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1387 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1388 
abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1389 
where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1390 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1391 
inductive "s z_1 ... z_m" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1392 
intros 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1393 
rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1394 
... 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1395 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1396 
For backward compatibility, there is a wrapper allowing inductive 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1397 
sets to be defined with the new package via 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1398 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1399 
inductive_set 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1400 
s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1401 
for z_1 :: U_1 and ... and z_n :: U_m 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

1402 
where 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset
