author  wenzelm 
Sat, 09 Dec 2006 18:05:36 +0100  
changeset 21717  410ca6910f6f 
parent 21647  fccafa917a68 
child 21735  0c65e072f4be 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

20807  4 
New in this Isabelle version 
17754
58a306d9f736
* Command 'find_theorems': support * wildcard in name: criterion.
wenzelm
parents:
17725
diff
changeset

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

6 

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

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

8 

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

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

10 
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

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

12 

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

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

14 
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

15 
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

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

17 

20807  18 
* Theory syntax: some popular names (e.g. "class", "if", "fun") are 
19 
now keywords. INCOMPATIBILITY, use double quotes. 

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

20 

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

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

22 
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

23 
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

24 
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

25 
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

26 
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

27 
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

28 

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

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

30 

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

33 
suppressed from proof state output. Note that the ProofGeneral 

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

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

36 
limit is imposed. 

37 

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

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

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

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

41 
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

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

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

44 

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

45 

17865  46 
*** Document preparation *** 
47 

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

50 
current context. 

21339  51 

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

17865  54 

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

57 
arguments on the LHS may be given.) 

58 

59 

17865  60 

17779  61 
*** Pure *** 
62 

20807  63 
* class_package.ML offers a combination of axclasses and locales to 
64 
achieve Haskelllike type classes in Isabelle. See 

65 
HOL/ex/Classpackage.thy for examples. 

66 

67 
* Yet another code generator framework allows to generate executable 

68 
code for ML and Haskell (including "class"es). A short usage sketch: 

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

69 

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

70 
internal compilation: 
21545  71 
code_gen <list of constants (term syntax)> (SML #) 
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

72 
writing SML code to a file: 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

73 
code_gen <list of constants (term syntax)> (SML <filename>) 
20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset

74 
writing Haskell code to a bunch of files: 
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

75 
code_gen <list of constants (term syntax)> (Haskell <filename>) 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

76 

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

77 
Reasonable default setup of framework in HOL/Main. 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

78 

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

79 
See HOL/ex/Code*.thy for examples. 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

80 

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

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

82 

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

83 
[code fun]: select a theorem as function equation for a specific constant 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

84 
[code nofun]: deselect a theorem as function equation for a specific constant 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

85 
[code inline]: select an equation theorem for unfolding (inlining) in place 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

86 
[code noinline]: deselect an equation theorem for unfolding (inlining) in place 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

87 

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

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

89 

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

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

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

92 

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

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

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

95 

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

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

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

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

99 

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

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

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

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

103 

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

104 
For code_instance and code_class, target SML is silently ignored. 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

105 

21215
7c9337a0e30a
made locale partial_order compatible with axclass order
haftmann
parents:
21209
diff
changeset

106 
See HOL theories and HOL/ex/Code*.thy for usage examples. Doc/Isar/Advanced/Codegen/ 
7c9337a0e30a
made locale partial_order compatible with axclass order
haftmann
parents:
21209
diff
changeset

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

108 

19254  109 
* Command 'no_translations' removes translation rules from theory 
110 
syntax. 

111 

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

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

115 
correspondence to type class and instance declarations. 

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

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

19711  118 

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

120 
instantiation that matches an instance against the most general 

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

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

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

124 
recursion over such type arguments. Incomplete specification patterns 

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

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

129 

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

132 

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

134 
then guess x and y by clarify 

135 

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

137 
proof tools being involved here. 

138 

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

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

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

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

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

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

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

147 

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

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

18020  151 

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

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

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

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

156 

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

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

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

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

160 

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

163 

18308  164 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
165 

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

167 

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

170 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  171 
'unfolded' attribute may be replaced by firstclass proof text. 
172 

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

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

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

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

176 
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

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

178 

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

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

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

184 
originally first one. 

19220  185 

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

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

187 
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

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

189 

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

192 
(essentially a disjunction of cases with local parameters and 

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

18910  194 
adequately; in this notation common elimination rules look like this: 
18901  195 

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

197 
assumes "EX x. P x" 

198 
obtains x where "P x" 

199 

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

201 
assumes "A & B" 

202 
obtains A and B 

203 

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

205 
assumes "A  B" 

206 
obtains 

207 
A 

208 
 B 

209 

18910  210 
The subsequent classical rules even refer to the formal "thesis" 
18901  211 
explicitly: 
212 

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

214 
obtains "~ thesis" 

215 

18910  216 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
217 
obtains "thesis ==> something" 

18901  218 

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

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

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

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

224 
case_names). 

18901  225 

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

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

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

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

229 
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

230 

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

233 
toplevel lemma. 

234 

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

237 

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

240 
to occur. 

241 

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

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

243 
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

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

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

246 

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

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

248 
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

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

250 

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

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

252 
primitive that also works in a locale context (both for constants and 
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset

253 
fixed variables). Type declaration and internal syntactic 
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset

254 
representation of given constants retrieved from the context. 
19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

255 

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

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

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

260 

19665  261 
axiomatization 
21595  262 
eq (infix "===" 50) where 
263 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

264 

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

266 
definition g where "g x = f x x" 

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

267 

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

271 

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

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

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

19088  276 
parameters implicit and using the original short name. See also 
19083  277 
HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic 
278 
entities from a monomorphic theory. 

279 

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

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

283 
'translations' in common applications. 

19084  284 

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

285 
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

286 
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

287 
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

288 
'translations' with explicit "CONST" markup to accommodate this. 
19665  289 

19783  290 
* Isar/locales: improved parameter handling: 
291 
 use of locales "var" and "struct" no longer necessary; 

292 
 parameter renamings are no longer required to be injective. 

293 
This enables, for example, to define a locale for endomorphisms thus: 

294 
locale endom = homom mult mult h. 

295 

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

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

297 
Instead of accumulating the specification, the imported expression is 
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

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

299 
INCOMPATIBILITY: different normal form of locale expressions. 
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

300 
In particular, in interpretations of locales with predicates, 
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

301 
goals repesenting already interpreted fragments are not removed 
19984
29bb4659f80a
Method intro_locales replaced by intro_locales and unfold_locales.
ballarin
parents:
19931
diff
changeset

302 
automatically. Use methods `intro_locales' and `unfold_locales'; see below. 
29bb4659f80a
Method intro_locales replaced by intro_locales and unfold_locales.
ballarin
parents:
19931
diff
changeset

303 

29bb4659f80a
Method intro_locales replaced by intro_locales and unfold_locales.
ballarin
parents:
19931
diff
changeset

304 
* Isar/locales: new methods `intro_locales' and `unfold_locales' provide 
29bb4659f80a
Method intro_locales replaced by intro_locales and unfold_locales.
ballarin
parents:
19931
diff
changeset

305 
backward reasoning on locales predicates. The methods are aware of 
29bb4659f80a
Method intro_locales replaced by intro_locales and unfold_locales.
ballarin
parents:
19931
diff
changeset

306 
interpretations and discharge corresponding goals. `intro_locales' is 
29bb4659f80a
Method intro_locales replaced by intro_locales and unfold_locales.
ballarin
parents:
19931
diff
changeset

307 
less aggressive then `unfold_locales' and does not unfold predicates to 
29bb4659f80a
Method intro_locales replaced by intro_locales and unfold_locales.
ballarin
parents:
19931
diff
changeset

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

309 

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

310 
* Isar/locales: the order in which locale fragments are accumulated 
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

311 
has changed. This enables to override declarations from fragments 
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

312 
due to interpretations  for example, unwanted simp rules. 
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

313 

18233  314 
* Provers/induct: improved internal context management to support 
315 
local fixes and defines onthefly. Thus explicit metalevel 

316 
connectives !! and ==> are rarely required anymore in inductive goals 

317 
(using objectlogic connectives for this purpose has been long 

318 
obsolete anyway). The subsequent proof patterns illustrate advanced 

319 
techniques of natural induction; general datatypes and inductive sets 

18267  320 
work analogously (see also src/HOL/Lambda for realistic examples). 
321 

322 
(1) This is how to ``strengthen'' an inductive goal wrt. certain 

18239  323 
parameters: 
18233  324 

325 
lemma 

326 
fixes n :: nat and x :: 'a 

327 
assumes a: "A n x" 

328 
shows "P n x" 

329 
using a  {* make induct insert fact a *} 

20503  330 
proof (induct n arbitrary: x)  {* generalize goal to "!!x. A n x ==> P n x" *} 
18248  331 
case 0 
18233  332 
show ?case sorry 
333 
next 

18248  334 
case (Suc n) 
18239  335 
note `!!x. A n x ==> P n x`  {* induction hypothesis, according to induction rule *} 
336 
note `A (Suc n) x`  {* induction premise, stemming from fact a *} 

18233  337 
show ?case sorry 
338 
qed 

339 

18267  340 
(2) This is how to perform induction over ``expressions of a certain 
18233  341 
form'', using a locally defined inductive parameter n == "a x" 
18239  342 
together with strengthening (the latter is usually required to get 
18267  343 
sufficiently flexible induction hypotheses): 
18233  344 

345 
lemma 

346 
fixes a :: "'a => nat" 

347 
assumes a: "A (a x)" 

348 
shows "P (a x)" 

349 
using a 

20503  350 
proof (induct n == "a x" arbitrary: x) 
18233  351 
... 
352 

18267  353 
See also HOL/Isar_examples/Puzzle.thy for an application of the this 
354 
particular technique. 

355 

18901  356 
(3) This is how to perform existential reasoning ('obtains' or 
357 
'obtain') by induction, while avoiding explicit objectlogic 

358 
encodings: 

359 

360 
lemma 

361 
fixes n :: nat 

362 
obtains x :: 'a where "P n x" and "Q n x" 

20503  363 
proof (induct n arbitrary: thesis) 
18267  364 
case 0 
365 
obtain x where "P 0 x" and "Q 0 x" sorry 

18399  366 
then show thesis by (rule 0) 
18267  367 
next 
368 
case (Suc n) 

369 
obtain x where "P n x" and "Q n x" by (rule Suc.hyps) 

370 
obtain x where "P (Suc n) x" and "Q (Suc n) x" sorry 

371 
then show thesis by (rule Suc.prems) 

372 
qed 

373 

20503  374 
Here the 'arbitrary: thesis' specification essentially modifies the 
375 
scope of the formal thesis parameter, in order to the get the whole 

18267  376 
existence statement through the induction as expected. 
18233  377 

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

378 
* Provers/induct: mutual induction rules are now specified as a list 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

379 
of rule sharing the same induction cases. HOL packages usually 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

380 
provide foo_bar.inducts for mutually defined items foo and bar 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

381 
(e.g. inductive sets or datatypes). INCOMPATIBILITY, users need to 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

382 
specify mutual induction rules differently, i.e. like this: 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

383 

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

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

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

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

387 

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

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

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

390 

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

391 
* Provers/induct: improved handling of simultaneous goals. Instead of 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

392 
introducing objectlevel conjunction, the statement is now split into 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

393 
several conclusions, while the corresponding symbolic cases are 
18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

394 
nested accordingly. INCOMPATIBILITY, proofs need to be structured 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

395 
explicitly. For example: 
18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

396 

8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

397 
lemma 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

398 
fixes n :: nat 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

399 
shows "P n" and "Q n" 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

400 
proof (induct n) 
18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

401 
case 0 case 1 
18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

402 
show "P 0" sorry 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

403 
next 
18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

404 
case 0 case 2 
18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

405 
show "Q 0" sorry 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

406 
next 
18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

407 
case (Suc n) case 1 
18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

408 
note `P n` and `Q n` 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

409 
show "P (Suc n)" sorry 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

410 
next 
18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

411 
case (Suc n) case 2 
18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

412 
note `P n` and `Q n` 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

413 
show "Q (Suc n)" sorry 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

414 
qed 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

415 

18601
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

416 
The split into subcases may be deferred as follows  this is 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

417 
particularly relevant for goal statements with local premises. 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

418 

b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

419 
lemma 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

420 
fixes n :: nat 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

421 
shows "A n ==> P n" and "B n ==> Q n" 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

422 
proof (induct n) 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

423 
case 0 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

424 
{ 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

425 
case 1 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

426 
note `A 0` 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

427 
show "P 0" sorry 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

428 
next 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

429 
case 2 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

430 
note `B 0` 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

431 
show "Q 0" sorry 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

432 
} 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

433 
next 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

434 
case (Suc n) 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

435 
note `A n ==> P n` and `B n ==> Q n` 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

436 
{ 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

437 
case 1 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

438 
note `A (Suc n)` 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

439 
show "P (Suc n)" sorry 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

440 
next 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

441 
case 2 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

442 
note `B (Suc n)` 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

443 
show "Q (Suc n)" sorry 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

444 
} 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

445 
qed 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

446 

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

447 
If simultaneous goals are to be used with mutual rules, the statement 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

448 
needs to be structured carefully as a twolevel conjunction, using 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

449 
lists of propositions separated by 'and': 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

450 

18507  451 
lemma 
452 
shows "a : A ==> P1 a" 

453 
"a : A ==> P2 a" 

454 
and "b : B ==> Q1 b" 

455 
"b : B ==> Q2 b" 

456 
"b : B ==> Q3 b" 

457 
proof (induct set: A B) 

18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

458 

18399  459 
* Provers/induct: support coinduction as well. See 
460 
src/HOL/Library/Coinductive_List.thy for various examples. 

461 

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

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

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

464 

18674  465 
* Simplifier: by default the simplifier trace only shows top level rewrites 
466 
now. That is, trace_simp_depth_limit is set to 1 by default. Thus there is 

467 
less danger of being flooded by the trace. The trace indicates where parts 

468 
have been suppressed. 

469 

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

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

471 
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

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

473 

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

476 
least one premise. 

477 

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

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

482 

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

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

484 
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

485 
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

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

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

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

489 

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

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

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

492 
for example "A > B" => "Pi A (%_. B)". 
17779  493 

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

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

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

496 

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

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

498 
(trailing "_") by default; use '!' option for full details. 
8b26f58c5646
* Pure: 'print_theory' now suppresses entities with internal name;
wenzelm
parents:
20607
diff
changeset

499 

17865  500 

17806  501 
*** HOL *** 
502 

21406  503 
* New syntactic class "size"; overloaded constant "size" now 
504 
has type "'a::size ==> bool" 

505 

506 
* Constants "Divides.op div", "Divides.op mod" and "Divides.op dvd" no named 

507 
"Divides.div", "Divides.mod" and "Divides.dvd" 

508 
INCOMPATIBILITY for ML code directly refering to constant names. 

509 

21320  510 
* Replaced "auto_term" by the conceptually simpler method "relation", 
511 
which just applies the instantiated termination rule with no further 

512 
simplifications. 

513 
INCOMPATIBILITY: 

514 
Replace 

515 
termination by (auto_term "MYREL") 

516 
with 

517 
termination by (relation "MYREL") auto 

518 

21240
8e75fb38522c
Made "termination by lexicographic_order" the default for "fun" definitions.
krauss
parents:
21226
diff
changeset

519 
* Automated termination proofs "by lexicographic_order" are now 
8e75fb38522c
Made "termination by lexicographic_order" the default for "fun" definitions.
krauss
parents:
21226
diff
changeset

520 
included in the abbreviated function command "fun". No explicit 
8e75fb38522c
Made "termination by lexicographic_order" the default for "fun" definitions.
krauss
parents:
21226
diff
changeset

521 
"termination" command is necessary anymore. 
8e75fb38522c
Made "termination by lexicographic_order" the default for "fun" definitions.
krauss
parents:
21226
diff
changeset

522 
INCOMPATIBILITY: If a "fun"definition cannot be proved terminating by 
8e75fb38522c
Made "termination by lexicographic_order" the default for "fun" definitions.
krauss
parents:
21226
diff
changeset

523 
a lexicographic size order, then the command fails. Use the expanded 
8e75fb38522c
Made "termination by lexicographic_order" the default for "fun" definitions.
krauss
parents:
21226
diff
changeset

524 
version "function" for these cases. 
8e75fb38522c
Made "termination by lexicographic_order" the default for "fun" definitions.
krauss
parents:
21226
diff
changeset

525 

8e75fb38522c
Made "termination by lexicographic_order" the default for "fun" definitions.
krauss
parents:
21226
diff
changeset

526 
* New method "lexicographic_order" automatically synthesizes 
8e75fb38522c
Made "termination by lexicographic_order" the default for "fun" definitions.
krauss
parents:
21226
diff
changeset

527 
termination relations as lexicographic combinations of size measures. 
8e75fb38522c
Made "termination by lexicographic_order" the default for "fun" definitions.
krauss
parents:
21226
diff
changeset

528 
Usage for (function package) termination proofs: 
8e75fb38522c
Made "termination by lexicographic_order" the default for "fun" definitions.
krauss
parents:
21226
diff
changeset

529 

8e75fb38522c
Made "termination by lexicographic_order" the default for "fun" definitions.
krauss
parents:
21226
diff
changeset

530 
termination 
8e75fb38522c
Made "termination by lexicographic_order" the default for "fun" definitions.
krauss
parents:
21226
diff
changeset

531 
by lexicographic_order 
8e75fb38522c
Made "termination by lexicographic_order" the default for "fun" definitions.
krauss
parents:
21226
diff
changeset

532 

21226
a607ae87ee81
fieldupdate in records is generalised to take a function on the field
schirmer
parents:
21215
diff
changeset

533 
* Records: generalised fieldupdate to take a function on the field 
a607ae87ee81
fieldupdate in records is generalised to take a function on the field
schirmer
parents:
21215
diff
changeset

534 
rather than the new value: r(A := x) is translated to A_update (K x) r 
a607ae87ee81
fieldupdate in records is generalised to take a function on the field
schirmer
parents:
21215
diff
changeset

535 
The Kcombinator that is internally used is called K_record. 
a607ae87ee81
fieldupdate in records is generalised to take a function on the field
schirmer
parents:
21215
diff
changeset

536 
INCOMPATIBILITY: Usage of the plain update functions has to be 
a607ae87ee81
fieldupdate in records is generalised to take a function on the field
schirmer
parents:
21215
diff
changeset

537 
adapted. 
a607ae87ee81
fieldupdate in records is generalised to take a function on the field
schirmer
parents:
21215
diff
changeset

538 

21200  539 
* axclass "semiring_0" now contains annihilation axioms 
540 
("x * 0 = 0","0 * x = 0"), which are required for a semiring. Richer 

541 
structures do not inherit from semiring_0 anymore, because this property 

542 
is a theorem there, not an axiom. 

543 
INCOMPATIBILITY: In instances of semiring_0, there is more to prove, but 

544 
this is mostly trivial. 

545 

546 
* axclass "recpower" was generalized to arbitrary monoids, not just 

547 
commutative semirings. 

548 
INCOMPATIBILITY: If you use recpower and need commutativity or a semiring 

549 
property, add the corresponding classes. 

550 

21215
7c9337a0e30a
made locale partial_order compatible with axclass order
haftmann
parents:
21209
diff
changeset

551 
* Locale Lattic_Locales.partial_order changed (to achieve consistency with 
7c9337a0e30a
made locale partial_order compatible with axclass order
haftmann
parents:
21209
diff
changeset

552 
axclass order): 
7c9337a0e30a
made locale partial_order compatible with axclass order
haftmann
parents:
21209
diff
changeset

553 
 moved to Orderings.partial_order 
7c9337a0e30a
made locale partial_order compatible with axclass order
haftmann
parents:
21209
diff
changeset

554 
 additional parameter ``less'' 
7c9337a0e30a
made locale partial_order compatible with axclass order
haftmann
parents:
21209
diff
changeset

555 
INCOMPATIBILITY. 
7c9337a0e30a
made locale partial_order compatible with axclass order
haftmann
parents:
21209
diff
changeset

556 

21099  557 
* Constant "List.list_all2" in List.thy now uses authentic syntax. 
558 
INCOMPATIBILITY: translations containing list_all2 may go wrong. On Isar 

559 
level, use abbreviations instead. 

560 

561 
* Constant "List.op mem" in List.thy now has proper name: "List.memberl" 

562 
INCOMPATIBILITY: rarely occuring name references (e.g. ``List.op mem.simps'') 

563 
require renaming (e.g. ``List.memberl.simps''). 

564 

20712
b3cd1233167f
renamed 0 and 1 to HOL.zero and HOL.one respectivly
haftmann
parents:
20620
diff
changeset

565 
* Renamed constants in HOL.thy: 
b3cd1233167f
renamed 0 and 1 to HOL.zero and HOL.one respectivly
haftmann
parents:
20620
diff
changeset

566 
0 ~> HOL.zero 
b3cd1233167f
renamed 0 and 1 to HOL.zero and HOL.one respectivly
haftmann
parents:
20620
diff
changeset

567 
1 ~> HOL.one 
b3cd1233167f
renamed 0 and 1 to HOL.zero and HOL.one respectivly
haftmann
parents:
20620
diff
changeset

568 
INCOMPATIBILITY: ML code directly refering to constant names may need adaption 
b3cd1233167f
renamed 0 and 1 to HOL.zero and HOL.one respectivly
haftmann
parents:
20620
diff
changeset

569 
This in general only affects handwritten proof tactics, simprocs and so on. 
b3cd1233167f
renamed 0 and 1 to HOL.zero and HOL.one respectivly
haftmann
parents:
20620
diff
changeset

570 

21462
74ddf3a522f8
added Isar syntax for adding parameters to axclasses
haftmann
parents:
21447
diff
changeset

571 
* New theory Code_Generator providing class 'eq', 
20607  572 
allowing for code generation with polymorphic equality. 
573 

20485  574 
* Numeral syntax: type 'bin' which was a mere type copy of 'int' has been 
20500  575 
abandoned in favour of plain 'int'. INCOMPATIBILITY  Significant changes 
576 
for setting up numeral syntax for types: 

20485  577 

578 
 new constants Numeral.pred and Numeral.succ instead 

579 
of former Numeral.bin_pred and Numeral.bin_succ. 

580 
 Use integer operations instead of bin_add, bin_mult and so on. 

581 
 Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps. 

582 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

583 

584 
See HOL/Integ/IntArith.thy for an example setup. 

585 

19895  586 
* New top level command 'normal_form' computes the normal form of a term 
587 
that may contain free variables. For example 'normal_form "rev[a,b,c]"' 

588 
prints '[b,c,a]'. This command is suitable for heavyduty computations 

589 
because the functions are compiled to ML first. 

590 
INCOMPATIBILITY: new keywords 'normal_form' must quoted when used as 

591 
an identifier. 

592 

17996  593 
* Alternative iff syntax "A <> B" for equality on bool (with priority 
594 
25 like >); output depends on the "iff" print_mode, the default is 

595 
"A = B" (with priority 50). 

596 

19279  597 
* Renamed constants in HOL.thy and Orderings.thy: 
19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

598 
op + ~> HOL.plus 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

599 
op  ~> HOL.minus 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

600 
uminus ~> HOL.uminus 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

601 
op * ~> HOL.times 
19277  602 
op < ~> Orderings.less 
603 
op <= ~> Orderings.less_eq 

19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

604 

77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

605 
Adaptions may be required in the following cases: 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

606 

19377  607 
a) Userdefined constants using any of the names "plus", "minus", "times", 
608 
"less" or "less_eq". The standard syntax translations for "+", "" and "*" 

609 
may go wrong. 

19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

610 
INCOMPATIBILITY: use more specific names. 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

611 

19277  612 
b) Variables named "plus", "minus", "times", "less", "less_eq" 
19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

613 
INCOMPATIBILITY: use more specific names. 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

614 

19377  615 
c) Permutative equations (e.g. "a + b = b + a") 
616 
Since the change of names also changes the order of terms, permutative 

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

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

619 
distribution). 

620 
INCOMPATIBILITY: rewrite proofs 

19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

621 

77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

622 
d) ML code directly refering to constant names 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

623 
This in general only affects handwritten proof tactics, simprocs and so on. 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

624 
INCOMPATIBILITY: grep your sourcecode and replace names. 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

625 

21265  626 
* Relations less (<) and less_eq (<=) are also available on type bool. 
627 
Modified syntax to disallow nesting without explicit parentheses, 

628 
e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". 

629 

18674  630 
* "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only). 
631 

20716
a6686a8e1b68
Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents:
20712
diff
changeset

632 
* Relation composition operator "op O" now has precedence 75 and binds 
a6686a8e1b68
Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents:
20712
diff
changeset

633 
stronger than union and intersection. INCOMPATIBILITY. 
a6686a8e1b68
Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents:
20712
diff
changeset

634 

19377  635 
* The old set interval syntax "{m..n(}" (and relatives) has been removed. 
636 
Use "{m..<n}" (and relatives) instead. 

637 

17865  638 
* In the context of the assumption "~(s = t)" the Simplifier rewrites 
639 
"t = s" to False (by simproc "neq_simproc"). For backward 

640 
compatibility this can be disabled by ML "reset use_neq_simproc". 

17779  641 

18979  642 
* "m dvd n" where m and n are numbers is evaluated to True/False by simp. 
643 

19211  644 
* Theorem Cons_eq_map_conv no longer has attribute `simp'. 
645 

19279  646 
* Theorem setsum_mult renamed to setsum_right_distrib. 
647 

19211  648 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
649 
'rule' method. 

650 

17809
195045659c06
Tactics sat and satx reimplemented, several improvements
webertj
parents:
17806
diff
changeset

651 
* Tactics 'sat' and 'satx' reimplemented, several improvements: goals 
195045659c06
Tactics sat and satx reimplemented, several improvements
webertj
parents:
17806
diff
changeset

652 
no longer need to be stated as "<prems> ==> False", equivalences (i.e. 
17865  653 
"=" on type bool) are handled, variable names of the form "lit_<n>" 
654 
are no longer reserved, significant speedup. 

655 

20136  656 
* Tactics 'sat' and 'satx' can now replay MiniSat proof traces. zChaff is 
657 
still supported as well. 

658 

18480
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

659 
* inductive and datatype: provide projections of mutual rules, bundled 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

660 
as foo_bar.inducts; 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

661 

21256  662 
* Library: moved theories Parity, GCD, Binomial, Infinite_Set to Library. 
663 

664 
* Library: moved theory Accessible_Part to main HOL. 

19572
a4b3176f19dd
* Library: theory Accessible_Part has been move to main HOL.
wenzelm
parents:
19508
diff
changeset

665 

18446  666 
* Library: added theory Coinductive_List of potentially infinite lists 
667 
as greatest fixedpoint. 

18399  668 

19254  669 
* Library: added theory AssocList which implements (finite) maps as 
19252  670 
association lists. 
17809
195045659c06
Tactics sat and satx reimplemented, several improvements
webertj
parents:
17806
diff
changeset

671 

20807  672 
* New proof method "evaluation" for efficiently solving a goal (i.e. a 
673 
boolean expression) by compiling it to ML. The goal is "proved" (via 

674 
the oracle "Evaluation") if it evaluates to True. 

675 

676 
* Linear arithmetic now splits certain operators (e.g. min, max, abs) 

677 
also when invoked by the simplifier. This results in the simplifier 

21056  678 
being more powerful on arithmetic goals. INCOMPATIBILITY. Set 
20807  679 
fast_arith_split_limit to 0 to obtain the old behavior. 
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
20188
diff
changeset

680 

20067
26bac504ef90
hex and binary numerals (contributed by Rafal Kolanski)
kleing
parents:
20040
diff
changeset

681 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  682 

20807  683 
* New method: reify eqs (t), where eqs are equations for an 
684 
interpretation I :: 'a list => 'b => 'c and t::'c is an optional 

685 
parameter, computes a term s::'b and a list xs::'a list and proves the 

686 
theorem I xs s = t. This is also known as reification or quoting. The 

687 
resulting theorem is applied to the subgoal to substitute t with I xs 

688 
s. If t is omitted, the subgoal itself is reified. 

689 

690 
* New method: reflection corr_thm eqs (t). The parameters eqs and (t) 

691 
are as explained above. corr_thm is a theorem for I vs (f t) = I vs t, 

692 
where f is supposed to be a computable function (in the sense of code 

693 
generattion). The method uses reify to compute s and xs as above then 

694 
applies corr_thm and uses normalization by evaluation to "prove" f s = 

695 
r and finally gets the theorem t = r, which is again applied to the 

696 
subgoal. An Example is available in HOL/ex/ReflectionEx.thy. 

697 

698 
* Reflection: Automatic refification now handels binding, an example 

699 
is available in HOL/ex/ReflectionEx.thy 

700 

701 

20169  702 
*** HOLAlgebra *** 
703 

21170  704 
* Formalisation of ideals and the quotient construction over rings. 
705 

706 
* Order and lattice theory no longer based on records. 

707 
INCOMPATIBILITY. 

708 

709 
* Method algebra is now set up via an attribute. For examples see 

710 
CRing.thy. INCOMPATIBILITY: the method is now weaker on combinations 

711 
of algebraic structures. 

20318
0e0ea63fe768
Restructured algebra library, added ideals and quotient rings.
ballarin
parents:
20217
diff
changeset

712 

0e0ea63fe768
Restructured algebra library, added ideals and quotient rings.
ballarin
parents:
20217
diff
changeset

713 
* Renamed `CRing.thy' to `Ring.thy'. INCOMPATIBILITY. 
20169  714 

20807  715 

19653  716 
*** HOLComplex *** 
717 

718 
* Theory Real: new method ferrack implements quantifier elimination 

719 
for linear arithmetic over the reals. The quantifier elimination 

720 
feature is used only for decision, for compatibility with arith. This 

721 
means a goal is either solved or left unchanged, no simplification. 

722 

723 

17878  724 
*** ML *** 
725 

21056  726 
* Pure/table: 
727 

728 
Function `...tab.foldl` removed. 

729 
INCOMPATIBILITY: use `...tabfold` instead 

730 

20857  731 
* Pure/library: 
732 

21056  733 
`gen_rem(s)` abandoned in favour of `remove` / `subtract`. 
20951
868120282837
gen_rem(s) abandoned in favour of remove / subtract
haftmann
parents:
20919
diff
changeset

734 
INCOMPATIBILITY: 
868120282837
gen_rem(s) abandoned in favour of remove / subtract
haftmann
parents:
20919
diff
changeset

735 
rewrite "gen_rem eq (xs, x)" to "remove (eq o swap) x xs" 
868120282837
gen_rem(s) abandoned in favour of remove / subtract
haftmann
parents:
20919
diff
changeset

736 
rewrite "gen_rems eq (xs, ys)" to "subtract (eq o swap) ys xs" 
868120282837
gen_rem(s) abandoned in favour of remove / subtract
haftmann
parents:
20919
diff
changeset

737 
drop "swap" if "eq" is symmetric. 
868120282837
gen_rem(s) abandoned in favour of remove / subtract
haftmann
parents:
20919
diff
changeset

738 

868120282837
gen_rem(s) abandoned in favour of remove / subtract
haftmann
parents:
20919
diff
changeset

739 
* Pure/library: 
868120282837
gen_rem(s) abandoned in favour of remove / subtract
haftmann
parents:
20919
diff
changeset

740 

21056  741 
infixes `ins` `ins_string` `ins_int` have been abandoned in favour of `insert`. 
20857  742 
INCOMPATIBILITY: rewrite "x ins(_...) xs" to "insert (op =) x xs" 
743 

20607  744 
* Pure/General/susp.ML: 
745 

746 
New module for delayed evaluations. 

747 

18450
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

748 
* Pure/library: 
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

749 

20348  750 
Semantically identical functions "equal_list" and "eq_list" have been 
751 
unified to "eq_list". 

752 

753 
* Pure/library: 

754 

18450
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

755 
val burrow: ('a list > 'b list) > 'a list list > 'b list list 
18549
5308a6ea3b96
rearranged burrow_split to fold_burrow to allow composition with fold_map
haftmann
parents:
18540
diff
changeset

756 
val fold_burrow: ('a list > 'c > 'b list * 'd) > 'a list list > 'c > 'b list list * 'd 
18450
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

757 

18540  758 
The semantics of "burrow" is: "take a function with *simulatanously* 
759 
transforms a list of value, and apply it *simulatanously* to a list of 

760 
list of values of the appropriate type". Confer this with "map" which 

761 
would *not* apply its argument function simulatanously but in 

18549
5308a6ea3b96
rearranged burrow_split to fold_burrow to allow composition with fold_map
haftmann
parents:
18540
diff
changeset

762 
sequence. "fold_burrow" has an additional context. 
18540  763 

764 
Both actually avoid the usage of "unflat" since they hide away 

765 
"unflat" from the user. 

18450
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

766 

18446  767 
* Pure/library: functions map2 and fold2 with curried syntax for 
768 
simultanous mapping and folding: 

769 

18422
875451c9d253
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18399
diff
changeset

770 
val map2: ('a > 'b > 'c) > 'a list > 'b list > 'c list 
875451c9d253
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18399
diff
changeset

771 
val fold2: ('a > 'b > 'c > 'c) > 'a list > 'b list > 'c > 'c 
875451c9d253
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18399
diff
changeset

772 

18446  773 
* Pure/library: indexed lists  some functions in the Isabelle library 
774 
treating lists over 'a as finite mappings from [0...n] to 'a have been 

775 
given more convenient names and signatures reminiscent of similar 

776 
functions for alists, tables, etc: 

18051  777 

778 
val nth: 'a list > int > 'a 

779 
val nth_map: int > ('a > 'a) > 'a list > 'a list 

780 
val fold_index: (int * 'a > 'b > 'b) > 'a list > 'b > 'b 

781 

18446  782 
Note that fold_index starts counting at index 0, not 1 like foldln 
783 
used to. 

784 

19653  785 
* Pure/library: general ``divide_and_conquer'' combinator on lists. 
786 

19032  787 
* Pure/General/name_mangler.ML provides a functor for generic name 
21109  788 
mangling (bijective mapping from expression values to strings). 
18446  789 

19032  790 
* Pure/General/rat.ML implements rational numbers. 
791 

792 
* Pure/General/table.ML: the join operations now works via exceptions 

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

793 
DUP/SAME instead of type option. This is simpler in simple cases, and 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

794 
admits slightly more efficient complex applications. 
18446  795 

18642  796 
* Pure: datatype Context.generic joins theory/Proof.context and 
18644  797 
provides some facilities for code that works in either kind of 
18642  798 
context, notably GenericDataFun for uniform theory and proof data. 
799 

18862
bd83590be0f7
* Pure: 'advanced' translation functions use Context.generic instead of just theory;
wenzelm
parents:
18815
diff
changeset

800 
* Pure: 'advanced' translation functions (parse_translation etc.) now 
bd83590be0f7
* Pure: 'advanced' translation functions use Context.generic instead of just theory;
wenzelm
parents:
18815
diff
changeset

801 
use Context.generic instead of just theory. 
bd83590be0f7
* Pure: 'advanced' translation functions use Context.generic instead of just theory;
wenzelm
parents:
18815
diff
changeset

802 

18737  803 
* Pure: simplified internal attribute type, which is now always 
804 
Context.generic * thm > Context.generic * thm. Global (theory) 

805 
vs. local (Proof.context) attributes have been discontinued, while 

18738  806 
minimizing code duplication. Thm.rule_attribute and 
807 
Thm.declaration_attribute build canonical attributes; see also 

19006
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

808 
structure Context for further operations on Context.generic, notably 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

809 
GenericDataFun. INCOMPATIBILITY, need to adapt attribute type 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

810 
declarations and definitions. 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

811 

19508  812 
* Pure/kernel: consts certification ignores sort constraints given in 
813 
signature declarations. (This information is not relevant to the 

814 
logic, but only for type inference.) IMPORTANT INTERNAL CHANGE. 

815 

816 
* Pure: axiomatic type classes are now purely definitional, with 

817 
explicit proofs of class axioms and super class relations performed 

818 
internally. See Pure/axclass.ML for the main internal interfaces  

819 
notably AxClass.define_class supercedes AxClass.add_axclass, and 

820 
AxClass.axiomatize_class/classrel/arity supercede 

821 
Sign.add_classes/classrel/arities. 

822 

19006
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

823 
* Pure/Isar: Args/Attrib parsers operate on Context.generic  
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

824 
global/local versions on theory vs. Proof.context have been 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

825 
discontinued; Attrib.syntax and Method.syntax have been adapted 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

826 
accordingly. INCOMPATIBILITY, need to adapt parser expressions for 
2427684c201c
* ML/Pure: generic Args/Attrib syntax everywhere;
wenzelm
parents:
18979
diff
changeset

827 
attributes, methods, etc. 
18642  828 

18446  829 
* Pure: several functions of signature "... > theory > theory * ..." 
830 
have been reoriented to "... > theory > ... * theory" in order to 

831 
allow natural usage in combination with the >, >>, > and 

832 
fold_map combinators. 

18051  833 

21647
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset

834 
* Pure: official theorem names (closed derivations) and additional 
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset

835 
comments (tags) are now strictly separate. Name hints  which are 
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset

836 
maintained as tags  may be attached any time without affecting the 
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset

837 
derivation. 
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset

838 

18020  839 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  840 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  841 
achieve the old behaviour. 
842 

843 
* Pure: the "Goal" constant is now called "prop", supporting a 

844 
slightly more general idea of ``protecting'' metalevel rule 

845 
statements. 

846 

20040
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

847 
* Pure: Logic.(un)varify only works in a global context, which is now 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

848 
enforced instead of silently assumed. INCOMPATIBILITY, may use 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

849 
Logic.legacy_(un)varify as temporary workaround. 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

850 

20090  851 
* Pure: structure Name provides scalable operations for generating 
852 
internal variable names, notably Name.variants etc. This replaces 

853 
some popular functions from term.ML: 

854 

855 
Term.variant > Name.variant 

856 
Term.variantlist > Name.variant_list (*canonical argument order*) 

857 
Term.invent_names > Name.invent_list 

858 

859 
Note that lowlevel renaming rarely occurs in new code  operations 

860 
from structure Variable are used instead (see below). 

861 

20040
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

862 
* Pure: structure Variable provides fundamental operations for proper 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

863 
treatment of fixed/schematic variables in a context. For example, 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

864 
Variable.import introduces fixes for schematics of given facts and 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

865 
Variable.export reverses the effect (up to renaming)  this replaces 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

866 
various freeze_thaw operations. 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

867 

18567  868 
* Pure: structure Goal provides simple interfaces for 
17981
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

869 
init/conclude/finish and tactical prove operations (replacing former 
20040
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

870 
Tactic.prove). Goal.prove is the canonical way to prove results 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

871 
within a given context; Goal.prove_global is a degraded version for 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

872 
theory level goals, including a global Drule.standard. Note that 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

873 
OldGoals.prove_goalw_cterm has long been obsolete, since it is 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

874 
illbehaved in a local proof context (e.g. with local fixes/assumes or 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

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

876 

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

877 
* Isar: simplified treatment of userlevel errors, using exception 
18687  878 
ERROR of string uniformly. Function error now merely raises ERROR, 
18686
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

879 
without any side effect on output channels. The Isar toplevel takes 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

880 
care of proper display of ERROR exceptions. ML code may use plain 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

881 
handle/can/try; cat_error may be used to concatenate errors like this: 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

882 

cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

883 
... handle ERROR msg => cat_error msg "..." 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

884 

cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

885 
Toplevel ML code (run directly or through the Isar toplevel) may be 
18687  886 
embedded into the Isar toplevel with exception display/debug like 
887 
this: 

18686
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

888 

cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

889 
Isar.toplevel (fn () => ...) 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

890 

cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

891 
INCOMPATIBILITY, removed special transform_error facilities, removed 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

892 
obsolete variants of userlevel exceptions (ERROR_MESSAGE, 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

893 
Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL) 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

894 
 use plain ERROR instead. 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

895 

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

896 
* Isar: theory setup now has type (theory > theory), instead of a 
18722
0888eca0f1be
* ML/Isar: theory setup has type (theory > theory);
wenzelm
parents:
18696
diff
changeset

897 
list. INCOMPATIBILITY, may use #> to compose setup functions. 
0888eca0f1be
* ML/Isar: theory setup has type (theory > theory);
wenzelm
parents:
18696
diff
changeset

898 

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

899 
* Isar: installed ML toplevel pretty printer for type Proof.context, 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

900 
subject to ProofContext.debug/verbose flags. 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

901 

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

902 
* Isar: Toplevel.theory_to_proof admits transactions that modify the 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

903 
theory before entering a proof state. Transactions now always see a 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

904 
quasifunctional intermediate checkpoint, both in interactive and 
18590
f6a553aa3d81
Pure/Isar: Toplevel.theory_to_proof admits transactions that modify the theory;
wenzelm
parents:
18568
diff
changeset

905 
batch mode. 
18567  906 

17878  907 
* Simplifier: the simpset of a running simplification process now 
908 
contains a proof context (cf. Simplifier.the_context), which is the 

909 
very context that the initial simpset has been retrieved from (by 

17890  910 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  911 
(solver, looper etc.) may depend on arbitrary proof data. 
912 

913 
* Simplifier.inherit_context inherits the proof context (plus the 

914 
local bounds) of the current simplification process; any simproc 

915 
etc. that calls the Simplifier recursively should do this! Removed 

916 
former Simplifier.inherit_bounds, which is already included here  

17890  917 
INCOMPATIBILITY. Tools based on lowlevel rewriting may even have to 
918 
specify an explicit context using Simplifier.context/theory_context. 

17878  919 

920 
* Simplifier/Classical Reasoner: more abstract interfaces 

921 
change_simpset/claset for modifying the simpset/claset reference of a 

922 
theory; raw versions simpset/claset_ref etc. have been discontinued  

923 
INCOMPATIBILITY. 

924 

18540  925 
* Provers: more generic wrt. syntax of objectlogics, avoid hardwired 
926 
"Trueprop" etc. 

927 

17878  928 

20988
0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

929 
*** System *** 
0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

930 

21471
03a5ef1936c5
* settings: ML_IDENTIFIER includes the Isabelle version identifier;
wenzelm
parents:
21462
diff
changeset

931 
* settings: ML_IDENTIFIER  which is appended to user specific heap 
03a5ef1936c5
* settings: ML_IDENTIFIER includes the Isabelle version identifier;
wenzelm
parents:
21462
diff
changeset

932 
locations  now includes the Isabelle version identifier as well. 
03a5ef1936c5
* settings: ML_IDENTIFIER includes the Isabelle version identifier;
wenzelm
parents:
21462
diff
changeset

933 
This simplifies use of multiple Isabelle installations. 
03a5ef1936c5
* settings: ML_IDENTIFIER includes the Isabelle version identifier;
wenzelm
parents:
21462
diff
changeset

934 

20988
0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

935 
* isabelleprocess: option S (secure mode) disables some critical 
0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

936 
operations, notably runtime compilation and evaluation of ML source 
0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

937 
code. 
0887d0dd3210
* isabelleprocess: option S (secure mode) disables some critical operations;
wenzelm
parents:
20951
diff
changeset

938 

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

939 

17720  940 
New in Isabelle2005 (October 2005) 
941 
 

14655
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset

942 

8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset

943 
*** General *** 
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset

944 

15130  945 
* Theory headers: the new header syntax for Isar theories is 
946 

947 
theory <name> 

16234  948 
imports <theory1> ... <theoryN> 
949 
uses <file1> ... <fileM> 

15130  950 
begin 
951 

16234  952 
where the 'uses' part is optional. The previous syntax 
953 

954 
theory <name> = <theory1> + ... + <theoryN>: 

955 

16717  956 
will disappear in the next release. Use isatool fixheaders to convert 
957 
existing theory files. Note that there is no change in ancient 

17371  958 
nonIsar theories now, but these will disappear soon. 
15130  959 

15475
fdf9434b04ea
 Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset

960 
* Theory loader: parent theories can now also be referred to via 
16234  961 
relative and absolute paths. 
962 

17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

963 
* Command 'find_theorems' searches for a list of criteria instead of a 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

964 
list of constants. Known criteria are: intro, elim, dest, name:string, 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

965 
simp:term, and any term. Criteria can be preceded by '' to select 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

966 
theorems that do not match. Intro, elim, dest select theorems that 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

967 
match the current goal, name:s selects theorems whose fully qualified 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

968 
name contain s, and simp:term selects all simplification rules whose 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

969 
lhs match term. Any other term is interpreted as pattern and selects 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

970 
all theorems matching the pattern. Available in ProofGeneral under 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

971 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  972 

17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

973 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  974 

975 
prints the last 100 theorems matching the pattern "(_::nat) + _ + _", 

976 
matching the current goal as introduction rule and not having "HOL." 

977 
in their name (i.e. not being defined in theory HOL). 

16013
3010430d894d
removed find_rewrites (superceded by improved thms_containing);
wenzelm
parents:
16000
diff
changeset

978 

17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

979 
* Command 'thms_containing' has been discontinued in favour of 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

980 
'find_theorems'; INCOMPATIBILITY. 
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

981 

17385  982 
* Communication with Proof General is now 8bit clean, which means that 
983 
Unicode text in UTF8 encoding may be used within theory texts (both 

17408
551c9a4dd693
command 'thms_containing' has been discontinued in favour of 'find_theorems';
wenzelm
parents:
17402
diff
changeset

984 
formal and informal parts). Cf. option U of the Isabelle Proof 
17538  985 
General interface. Here are some simple examples (cf. src/HOL/ex): 
986 

987 
http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html 

988 
http://isabelle.in.tum.de/library/HOL/ex/Chinese.html 

17385  989 

17425  990 
* Improved efficiency of the Simplifier and, to a lesser degree, the 
991 
Classical Reasoner. Typical big applications run around 2 times 

992 
faster. 

993 

15703  994 

995 
*** Document preparation *** 

996 

16234  997 
* Commands 'display_drafts' and 'print_drafts' perform simple output 
998 
of raw sources. Only those symbols that do not require additional 

999 
LaTeX packages (depending on comments in isabellesym.sty) are 

1000 
displayed properly, everything else is left verbatim. isatool display 

1001 
and isatool print are used as front ends (these are subject to the 

1002 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

1003 

17047
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1004 
* Command tags control specific markup of certain regions of text, 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1005 
notably folding and hiding. Predefined tags include "theory" (for 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1006 
theory begin and end), "proof" for proof commands, and "ML" for 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1007 
commands involving ML code; the additional tags "visible" and 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1008 
"invisible" are unused by default. Users may give explicit tag 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1009 
specifications in the text, e.g. ''by %invisible (auto)''. The 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1010 
interpretation of tags is determined by the LaTeX job during document 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1011 
preparation: see option V of isatool usedir, or options n and t of 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1012 
isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag, 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1013 
\isadroptag. 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1014 

e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1015 
Several document versions may be produced at the same time via isatool 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1016 
usedir (the generated index.html will link all of them). Typical 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1017 
specifications include ''V document=theory,proof,ML'' to present 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1018 
theory/proof/ML parts faithfully, ''V outline=/proof,/ML'' to fold 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1019 
proof and ML commands, and ''V mutilated=theory,proof,ML'' to omit 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1020 
these parts without any formal replacement text. The Isabelle site 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1021 
default settings produce ''document'' and ''outline'' versions as 
e2e2d75bb37b
* Command tags control specific markup of certain regions of text (replaces usedir H);
wenzelm
parents:
17016
diff
changeset

1022 
specified above. 
16234  1023 

17402  1024 
* Several new antiquotations: 
15979  1025 

1026 
@{term_type term} prints a term with its type annotated; 

1027 

1028 
@{typeof term} prints the type of a term; 

1029 

16234  1030 
@{const const} is the same as @{term const}, but checks that the 
1031 
argument is a known logical constant; 

15979  1032 

1033 
@{term_style style term} and @{thm_style style thm} print a term or 

16234  1034 
theorem applying a "style" to it 
1035 

17117
e2bed9e82454
* The ML antiquotation prints typechecked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset

1036 
@{ML text} 
e2bed9e82454
* The ML antiquotation prints typechecked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset

1037 

16234  1038 
Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of 
1039 
definitions, equations, inequations etc., 'concl' printing only the 

17393  1040 
conclusion of a metalogical statement theorem, and 'prem1' .. 'prem19' 
16234  1041 
to print the specified premise. TermStyle.add_style provides an ML 
1042 
interface for introducing further styles. See also the "LaTeX Sugar" 

17117
e2bed9e82454
* The ML antiquotation prints typechecked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset

1043 
document practical applications. The ML antiquotation prints 
e2bed9e82454
* The ML antiquotation prints typechecked ML expressions verbatim.
wenzelm
parents:
17097
diff
changeset

1044 
typechecked ML expressions verbatim. 
16234  1045 

17259
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

1046 
* Markup commands 'chapter', 'section', 'subsection', 'subsubsection', 
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

1047 
and 'text' support optional locale specification '(in loc)', which 
17269  1048 
specifies the default context for interpreting antiquotations. For 
1049 
example: 'text (in lattice) {* @{thm inf_assoc}*}'. 

17259
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

1050 

dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

1051 
* Option 'locale=NAME' of antiquotations specifies an alternative 
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

1052 
context interpreting the subsequent argument. For example: @{thm 
17269  1053 
[locale=lattice] inf_assoc}. 
17259
dda237f1d299
Markup commands 'chapter' .. 'text' support optional locale specification;
wenzelm
parents:
17228
diff
changeset

1054 

17097
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

1055 
* Proper output of proof terms (@{prf ...} and @{full_prf ...}) within 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

1056 
a proof context. 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

1057 

78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

1058 
* Proper output of antiquotations for theory commands involving a 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

1059 
proof context (such as 'locale' or 'theorem (in loc) ...'). 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

1060 

17193
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

1061 
* Delimiters of outer tokens (string etc.) now produce separate LaTeX 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

1062 
macros (\isachardoublequoteopen, isachardoublequoteclose etc.). 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

1063 

83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

1064 
* isatool usedir: new option C (default true) controls whether option 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

1065 
D should include a copy of the original document directory; C false 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

1066 
prevents unwanted effects such as copying of administrative CVS data. 
83708f724822
* Delimiters of outer tokens now produce separate LaTeX macros;
wenzelm
parents:
17189
diff
changeset

1067 

16234  1068 

1069 
*** Pure *** 

1070 

1071 
* Considerably improved version of 'constdefs' command. Now performs 

1072 
automatic typeinference of declared constants; additional support for 

1073 
local structure declarations (cf. locales and HOL records), see also 

1074 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

1075 
sequential dependencies of definitions within a single 'constdefs' 

1076 
section; moreover, the declared name needs to be an identifier. If 

1077 
all fails, consider to fall back on 'consts' and 'defs' separately. 

1078 

1079 
* Improved indexed syntax and implicit structures. First of all, 

1080 
indexed syntax provides a notational device for subscripted 

1081 
application, using the new syntax \<^bsub>term\<^esub> for arbitrary 

1082 
expressions. Secondly, in a local context with structure 

1083 
declarations, number indexes \<^sub>n or the empty index (default 

1084 
number 1) refer to a certain fixed variable implicitly; option 

1085 
show_structs controls printing of implicit structures. Typical 

1086 
applications of these concepts involve record types and locales. 

1087 

1088 
* New command 'no_syntax' removes grammar declarations (and 

1089 
translations) resulting from the given syntax specification, which is 

1090 
interpreted in the same manner as for the 'syntax' command. 

1091 

1092 
* 'Advanced' translation functions (parse_translation etc.) may depend 

1093 
on the signature of the theory context being presently used for 

1094 
parsing/printing, see also isarref manual. 

1095 

16856  1096 
* Improved 'oracle' command provides a typesafe interface to turn an 
1097 
ML expression of type theory > T > term into a primitive rule of 

1098 
type theory > T > thm (i.e. the functionality of Thm.invoke_oracle 

1099 
is already included here); see also FOL/ex/IffExample.thy; 

1100 
INCOMPATIBILITY. 

1101 

17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1102 
* axclass: name space prefix for class "c" is now "c_class" (was "c" 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1103 
before); "cI" is no longer bound, use "c.intro" instead. 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1104 
INCOMPATIBILITY. This change avoids clashes of fact bindings for 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1105 
axclasses vs. locales. 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1106 

16234  1107 
* Improved internal renaming of symbolic identifiers  attach primes 
1108 
instead of base 26 numbers. 

1109 

1110 
* New flag show_question_marks controls printing of leading question 

1111 
marks in schematic variable names. 

1112 

1113 
* In schematic variable names, *any* symbol following \<^isub> or 

1114 
\<^isup> is now treated as part of the base name. For example, the 

1115 
following works without printing of awkward ".0" indexes: 

1116 

1117 
lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1" 

1118 
by simp 

1119 

1120 
* Inner syntax includes (*(*nested*) comments*). 

1121 

17548  1122 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  1123 
annotations as "(00...)". 
1124 

1125 
* Clear separation of logical types and nonterminals, where the latter 

1126 
may only occur in 'syntax' specifications or type abbreviations. 

1127 
Before that distinction was only partially implemented via type class 

1128 
"logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper 

1129 
use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very 

1130 
exotic syntax specifications may require further adaption 

17691  1131 
(e.g. Cube/Cube.thy). 
16234  1132 

1133 
* Removed obsolete type class "logic", use the top sort {} instead. 

1134 
Note that nonlogical types should be declared as 'nonterminals' 

1135 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

1136 
specifications. 

1137 

17095  1138 
* Attributes 'induct' and 'cases': type or set names may now be 
1139 
locally fixed variables as well. 

1140 

16234  1141 
* Simplifier: can now control the depth to which conditional rewriting 
1142 
is traced via the PG menu Isabelle > Settings > Trace Simp Depth 

1143 
Limit. 

1144 

1145 
* Simplifier: simplification procedures may now take the current 

1146 
simpset into account (cf. Simplifier.simproc(_i) / mk_simproc 

1147 
interface), which is very useful for calling the Simplifier 

1148 
recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs 

1149 
is gone  use prems_of_ss on the simpset instead. Moreover, the 

1150 
lowlevel mk_simproc no longer applies Logic.varify internally, to 

1151 
allow for use in a context of fixed variables. 

1152 

1153 
* thin_tac now works even if the assumption being deleted contains !! 

1154 
or ==>. More generally, erule now works even if the major premise of 

1155 
the elimination rule contains !! or ==>. 

1156 

17597  1157 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  1158 

16234  1159 
* Reorganized bootstrapping of the Pure theories; CPure is now derived 
1160 
from Pure, which contains all common declarations already. Both 

1161 
theories are defined via plain Isabelle/Isar .thy files. 

1162 
INCOMPATIBILITY: elements of CPure (such as the CPure.intro / 

1163 
CPure.elim / CPure.dest attributes) now appear in the Pure name space; 

1164 
use isatool fixcpure to adapt your theory and ML sources. 

1165 

1166 
* New syntax 'name(ij, i, i, ...)' for referring to specific 

1167 
selections of theorems in named facts via index ranges. 

1168 

17097
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

1169 
* 'print_theorems': in theory mode, really print the difference 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

1170 
wrt. the last state (works for interactive theory development only), 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

1171 
in proof mode print all local facts (cf. 'print_facts'); 
78f1b66f70a4
* Proper output of proof terms within a proof context;
wenzelm
parents:
17095
diff
changeset

1172 

17397  1173 
* 'hide': option '(open)' hides only base names. 
1174 

17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1175 
* More efficient treatment of intermediate checkpoints in interactive 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1176 
theory development. 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1177 

17663
28be54ff74f8
Added entries for code_module, code_library, and value.
berghofe
parents:
17641
diff
changeset

1178 
* Code generator is now invoked via code_module (incremental code 
17664  1179 
generation) and code_library (modular code generation, ML structures 
1180 
for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains' 

1181 
must be quoted when used as identifiers. 

1182 

1183 
* New 'value' command for reading, evaluating and printing terms using 

1184 
the code generator. INCOMPATIBILITY: command keyword 'value' must be 

1185 
quoted when used as identifier. 

17663
28be54ff74f8
Added entries for code_module, code_library, and value.
berghofe
parents:
17641
diff
changeset

1186 

16234  1187 

1188 
*** Locales *** 

17095  1189 

17385  1190 
* New commands for the interpretation of locale expressions in 
1191 
theories (1), locales (2) and proof contexts (3). These generate 

1192 
proof obligations from the expression specification. After the 

1193 
obligations have been discharged, theorems of the expression are added 

1194 
to the theory, target locale or proof context. The synopsis of the 

1195 
commands is a follows: 

1196 

17095  1197 
(1) interpretation expr inst 
1198 
(2) interpretation target < expr 

1199 
(3) interpret expr inst 

17385  1200 

17095  1201 
Interpretation in theories and proof contexts require a parameter 
1202 
instantiation of terms from the current context. This is applied to 

17385  1203 
specifications and theorems of the interpreted expression. 
1204 
Interpretation in locales only permits parameter renaming through the 

1205 
locale expression. Interpretation is smart in that interpretations 

1206 
that are active already do not occur in proof obligations, neither are 

1207 
instantiated theorems stored in duplicate. Use 'print_interps' to 

1208 
inspect active interpretations of a particular locale. For details, 

17436  1209 
see the Isar Reference manual. Examples can be found in 
1210 
HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy. 

16234  1211 

1212 
INCOMPATIBILITY: former 'instantiate' has been withdrawn, use 

1213 
'interpret' instead. 

1214 

17385  1215 
* New context element 'constrains' for adding type constraints to 
1216 
parameters. 

1217 

1218 
* Context expressions: renaming of parameters with syntax 

1219 
redeclaration. 

17095  1220 

1221 
* Locale declaration: 'includes' disallowed. 

1222 

16234  1223 
* Proper static binding of attribute syntax  i.e. types / terms / 
1224 
facts mentioned as arguments are always those of the locale definition 

1225 
context, independently of the context of later invocations. Moreover, 

1226 
locale operations (renaming and type / term instantiation) are applied 

1227 
to attribute arguments as expected. 

1228 

1229 
INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of 

1230 
actual attributes; rare situations may require Attrib.attribute to 

1231 
embed those attributes into Attrib.src that lack concrete syntax. 

1232 
Attribute implementations need to cooperate properly with the static 

1233 
binding mechanism. Basic parsers Args.XXX_typ/term/prop and 

1234 
Attrib.XXX_thm etc. already do the right thing without further 

1235 
intervention. Only unusual applications  such as "where" or "of" 

1236 
(cf. src/Pure/Isar/attrib.ML), which process arguments depending both 

1237 
on the context and the facts involved  may have to assign parsed 

1238 
values to argument tokens explicitly. 

1239 

1240 
* Changed parameter management in theorem generation for long goal 

1241 
statements with 'includes'. INCOMPATIBILITY: produces a different 

1242 
theorem statement in rare situations. 

1243 

17228  1244 
* Locale inspection command 'print_locale' omits notes elements. Use 
1245 
'print_locale!' to have them included in the output. 

1246 

16234  1247 

1248 
*** Provers *** 

1249 

1250 
* Provers/hypsubst.ML: improved version of the subst method, for 

1251 
singlestep rewriting: it now works in bound variable contexts. New is 

1252 
'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may 

1253 
rewrite a different subterm than the original subst method, which is 

1254 
still available as 'simplesubst'. 

1255 

1256 
* Provers/quasi.ML: new transitivity reasoners for transitivity only 

1257 
and quasi orders. 

1258 

1259 
* Provers/trancl.ML: new transitivity reasoner for transitive and 

1260 
reflexivetransitive closure of relations. 

1261 

1262 
* Provers/blast.ML: new reference depth_limit to make blast's depth 

1263 
limit (previously hardcoded with a value of 20) userdefinable. 

1264 

1265 
* Provers/simplifier.ML has been moved to Pure, where Simplifier.setup 

1266 
is peformed already. Objectlogics merely need to finish their 

1267 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  1268 

15475
fdf9434b04ea
 Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset

1269 

14700
2f885b7e5ba7
reimplementation of HOL records; only one type is created for
schirmer
parents:
14699
diff
changeset

1270 
*** HOL *** 
2f885b7e5ba7
reimplementation of HOL records; only one type is created for
schirmer
parents:
14699
diff
changeset

1271 

16234  1272 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  1273 

1274 
syntax (epsilon) 

1275 
"_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10) 

1276 

16234  1277 
The symbol \<some> is displayed as the alternative epsilon of LaTeX 
1278 
and xsymbol; use option 'm epsilon' to get it actually printed. 

1279 
Moreover, the mathematically important symbolic identifier \<epsilon> 

1280 
becomes available as variable, constant etc. INCOMPATIBILITY, 

1281 

1282 
* "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x". 

1283 
Similarly for all quantifiers: "ALL x > y" etc. The xsymbol for >= 

17371  1284 
is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to 
17016
73c74cb1d744
mentioned change to exp_ge_add_one_self, new transitivity rules
avigad
parents:
16997
diff
changeset

1285 
support corresponding Isar calculations. 
16234  1286 

1287 
* "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>" 

1288 
instead of ":". 

1289 

1290 
* theory SetInterval: changed the syntax for open intervals: 

1291 

1292 
Old New 

1293 
{..n(} {..<n} 

1294 
{)n..} {n<..} 

1295 
{m..n(} {m..<n} 

1296 
{)m..n} {m<..n} 

1297 
{)m..n(} {m<..<n} 

1298 

1299 
The old syntax is still supported but will disappear in the next 

1300 
release. For conversion use the following Emacs search and replace 

1301 
patterns (these are not perfect but work quite well): 

15046  1302 

1303 
{)\([^\.]*\)\.\. > {\1<\.\.} 

1304 
\.\.\([^(}]*\)(} > \.\.<\1} 

1305 

17533  1306 
* Theory Commutative_Ring (in Library): method comm_ring for proving 
1307 
equalities in commutative rings; method 'algebra' provides a generic 

1308 
interface. 

17389
b4743198b939
Method comm_ring for proving equalities in commutative rings.
wenzelm
parents:
17385
diff
changeset

1309 

b4743198b939
Method comm_ring for proving equalities in commutative rings.
wenzelm
parents:
17385
diff
changeset

1310 
* Theory Finite_Set: changed the syntax for 'setsum', summation over 
16234  1311 
finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is 
17371  1312 
now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can 
17189  1313 
be a tuple pattern. 
16234  1314 

1315 
Some new syntax forms are available: 

1316 

1317 
"\<Sum>x  P. e" for "setsum (%x. e) {x. P}" 

1318 
"\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}" 

1319 
"\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}" 

1320 
"\<Sum>x < k. e" for "setsum (%x. e) {..<k}" 

1321 

1322 
The latter form "\<Sum>x < k. e" used to be based on a separate 

1323 
function "Summation", which has been discontinued. 

1324 

1325 
* theory Finite_Set: in structured induction proofs, the insert case 

1326 
is now 'case (insert x F)' instead of the old counterintuitive 'case 

1327 
(insert F x)'. 

1328 

1329 
* The 'refute' command has been extended to support a much larger 

1330 
fragment of HOL, including axiomatic type classes, constdefs and 

1331 
typedefs, inductive datatypes and recursion. 

1332 

17700  1333 
* New tactics 'sat' and 'satx' to prove propositional tautologies. 
1334 
Requires zChaff with proof generation to be installed. See 

1335 
HOL/ex/SAT_Examples.thy for examples. 

17619  1336 

16234  1337 
* Datatype induction via method 'induct' now preserves the name of the 
1338 
induction variable. For example, when proving P(xs::'a list) by 

1339 
induction on xs, the induction step is now P(xs) ==> P(a#xs) rather 

1340 
than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY 

1341 
in unstructured proof scripts. 

1342 

1343 
* Reworked implementation of records. Improved scalability for 

1344 
records with many fields, avoiding performance problems for type 

1345 
inference. Records are no longer composed of nested field types, but 

1346 
of nested extension types. Therefore the record type only grows linear 

1347 
in the number of extensions and not in the number of fields. The 

1348 
toplevel (users) view on records is preserved. Potential 

1349 
INCOMPATIBILITY only in strange cases, where the theory depends on the 

1350 
old record representation. The type generated for a record is called 

1351 
<record_name>_ext_type. 

1352 

1353 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

1354 
proofs triggered by a record definition or a simproc (if 

1355 
quick_and_dirty is enabled). Definitions of large records can take 

1356 
quite long. 

1357 

1358 
New simproc record_upd_simproc for simplification of multiple record 

1359 
updates enabled by default. Moreover, trivial updates are also 

1360 
removed: r(x := x r) = r. INCOMPATIBILITY: old proofs break 

1361 
occasionally, since simplification is more powerful by default. 

1362 

17275
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1363 
* typedef: proper support for polymorphic sets, which contain extra 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1364 
typevariables in the term. 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1365 

16234  1366 
* Simplifier: automatically reasons about transitivity chains 
1367 
involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics 

1368 
provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY: 

1369 
old proofs break occasionally as simplification may now solve more 

1370 
goals than previously. 

1371 

1372 
* Simplifier: converts x <= y into x = y if assumption y <= x is 

1373 
present. Works for all partial orders (class "order"), in particular 

1374 
numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y 

1375 
just like y <= x. 

1376 

1377 
* Simplifier: new simproc for "let x = a in f x". If a is a free or 

1378 
bound variable or a constant then the let is unfolded. Otherwise 

1379 
first a is simplified to b, and then f b is simplified to g. If 

1380 
possible we abstract b from g arriving at "let x = b in h x", 

1381 
otherwise we unfold the let and arrive at g. The simproc can be 

1382 
enabled/disabled by the reference use_let_simproc. Potential 

1383 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  1384 

16563  1385 
* Classical reasoning: the meson method now accepts theorems as arguments. 
1386 

17595  1387 
* Prover support: prerelease of the IsabelleATP linkup, which runs background 
1388 
jobs to provide advice on the provability of subgoals. 

1389 

16891  1390 
* Theory OrderedGroup and Ring_and_Field: various additions and 
1391 
improvements to faciliate calculations involving equalities and 

1392 
inequalities. 

1393 

1394 
The following theorems have been eliminated or modified 

1395 
(INCOMPATIBILITY): 

16888  1396 

1397 
abs_eq now named abs_of_nonneg 

17371  1398 
abs_of_ge_0 now named abs_of_nonneg 
1399 
abs_minus_eq now named abs_of_nonpos 

16888  1400 
imp_abs_id now named abs_of_nonneg 
1401 
imp_abs_neg_id now named abs_of_nonpos 

1402 
mult_pos now named mult_pos_pos 

1403 
mult_pos_le now named mult_nonneg_nonneg 

1404 
mult_pos_neg_le now named mult_nonneg_nonpos 

1405 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

1406 
mult_neg now named mult_neg_neg 

1407 
mult_neg_le now named mult_nonpos_nonpos 

1408 

16891  1409 
* Theory Parity: added rules for simplifying exponents. 
1410 

17092  1411 
* Theory List: 