author  wenzelm 
Sun, 26 Nov 2006 18:07:36 +0100  
changeset 21537  45b3a85ee548 
parent 21471  03a5ef1936c5 
child 21545  54cc492d80a9 
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 

21344  48 
* Added antiquotation @{theory name} which prints the name $A$, after 
21358  49 
checking that it refers to a valid ancestor theory in the current 
50 
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 

55 

17779  56 
*** Pure *** 
57 

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

60 
HOL/ex/Classpackage.thy for examples. 

61 

62 
* Yet another code generator framework allows to generate executable 

63 
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

64 

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

65 
internal compilation: 
21125  66 
code_gen <list of constants (term syntax)> (SML *) 
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

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

68 
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

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

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

71 

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

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

73 

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

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

75 

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

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

77 

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

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

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

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

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

82 

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

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

84 

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

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

86 
{(target) <andlist of const target syntax>}+ 
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 
code_type <andlist of type constructors> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

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

90 

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

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

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

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

94 

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

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

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

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

98 

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

99 
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

100 

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

101 
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

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

103 

19254  104 
* Command 'no_translations' removes translation rules from theory 
105 
syntax. 

106 

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

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

110 
correspondence to type class and instance declarations. 

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

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

19711  113 

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

115 
instantiation that matches an instance against the most general 

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

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

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

119 
recursion over such type arguments. Incomplete specification patterns 

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

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

124 

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

127 

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

129 
then guess x and y by clarify 

130 

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

132 
proof tools being involved here. 

133 

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

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

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

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

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

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

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

142 

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

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

18020  146 

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

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

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

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

151 

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

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

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

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

155 

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

158 

18308  159 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
160 

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

162 

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

165 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  166 
'unfolded' attribute may be replaced by firstclass proof text. 
167 

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

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

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

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

171 
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

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

173 

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

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

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

179 
originally first one. 

19220  180 

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

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

182 
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

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

184 

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

187 
(essentially a disjunction of cases with local parameters and 

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

18910  189 
adequately; in this notation common elimination rules look like this: 
18901  190 

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

192 
assumes "EX x. P x" 

193 
obtains x where "P x" 

194 

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

196 
assumes "A & B" 

197 
obtains A and B 

198 

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

200 
assumes "A  B" 

201 
obtains 

202 
A 

203 
 B 

204 

18910  205 
The subsequent classical rules even refer to the formal "thesis" 
18901  206 
explicitly: 
207 

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

209 
obtains "~ thesis" 

210 

18910  211 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
212 
obtains "thesis ==> something" 

18901  213 

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

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

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

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

219 
case_names). 

18901  220 

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

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

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

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

224 
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

225 

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

228 
toplevel lemma. 

229 

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

232 

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

235 
to occur. 

236 

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

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

238 
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

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

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

241 

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

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

243 
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

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

245 

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

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

247 
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

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

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

250 

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

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

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

255 

19665  256 
axiomatization 
257 
eq (infix "===" 50) 

258 
where eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

259 

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

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

261 
"f x y = x + y + 1" 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

262 
"g x = f x x" 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

263 

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

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

267 

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

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

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

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

275 

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

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

279 
'translations' in common applications. 

19084  280 

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

281 
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

282 
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

283 
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

284 
'translations' with explicit "CONST" markup to accommodate this. 
19665  285 

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

288 
 parameter renamings are no longer required to be injective. 

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

290 
locale endom = homom mult mult h. 

291 

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

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

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

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

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

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

297 
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

298 
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

299 

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

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

301 
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

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

303 
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

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

305 

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

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

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

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

309 

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

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

313 
(using objectlogic connectives for this purpose has been long 

314 
obsolete anyway). The subsequent proof patterns illustrate advanced 

315 
techniques of natural induction; general datatypes and inductive sets 

18267  316 
work analogously (see also src/HOL/Lambda for realistic examples). 
317 

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

18239  319 
parameters: 
18233  320 

321 
lemma 

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

323 
assumes a: "A n x" 

324 
shows "P n x" 

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

20503  326 
proof (induct n arbitrary: x)  {* generalize goal to "!!x. A n x ==> P n x" *} 
18248  327 
case 0 
18233  328 
show ?case sorry 
329 
next 

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

18233  333 
show ?case sorry 
334 
qed 

335 

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

341 
lemma 

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

343 
assumes a: "A (a x)" 

344 
shows "P (a x)" 

345 
using a 

20503  346 
proof (induct n == "a x" arbitrary: x) 
18233  347 
... 
348 

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

351 

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

354 
encodings: 

355 

356 
lemma 

357 
fixes n :: nat 

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

20503  359 
proof (induct n arbitrary: thesis) 
18267  360 
case 0 
361 
obtain x where "P 0 x" and "Q 0 x" sorry 

18399  362 
then show thesis by (rule 0) 
18267  363 
next 
364 
case (Suc n) 

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

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

367 
then show thesis by (rule Suc.prems) 

368 
qed 

369 

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

18267  372 
existence statement through the induction as expected. 
18233  373 

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

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

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

376 
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

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

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

379 

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

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

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

382 
(induct type: foo bar) 
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 
The ML function ProjectRule.projections turns oldstyle rules into the 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

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

386 

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

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

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

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

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

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

392 

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

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

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

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

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

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

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

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

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

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

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

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

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

405 
show "P (Suc n)" 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 2 
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 "Q (Suc n)" sorry 
8ac97f71369d
* induct: improved treatment of mutual goals and mutual rules;
wenzelm
parents:
18450
diff
changeset

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

411 

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

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

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

414 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

431 
note `A n ==> P n` and `B n ==> Q n` 
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 
case 1 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

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

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

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

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

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

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

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

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

442 

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

443 
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

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

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

446 

18507  447 
lemma 
448 
shows "a : A ==> P1 a" 

449 
"a : A ==> P2 a" 

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

451 
"b : B ==> Q2 b" 

452 
"b : B ==> Q3 b" 

453 
proof (induct set: A B) 

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

454 

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

457 

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

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

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

460 

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

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

464 
have been suppressed. 

465 

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

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

467 
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

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

469 

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

472 
least one premise. 

473 

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

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

478 

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

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

480 
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

481 
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

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

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

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

485 

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

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

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

488 
for example "A > B" => "Pi A (%_. B)". 
17779  489 

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

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

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

492 

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

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

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

495 

17865  496 

17806  497 
*** HOL *** 
498 

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

501 

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

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

504 
INCOMPATIBILITY for ML code directly refering to constant names. 

505 

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

508 
simplifications. 

509 
INCOMPATIBILITY: 

510 
Replace 

511 
termination by (auto_term "MYREL") 

512 
with 

513 
termination by (relation "MYREL") auto 

514 

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

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

516 
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

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

518 
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

519 
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

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

521 

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

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

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

524 
Usage for (function package) termination proofs: 
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 
termination 
8e75fb38522c
Made "termination by lexicographic_order" the default for "fun" definitions.
krauss
parents:
21226
diff
changeset

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

528 

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

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

530 
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

531 
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

532 
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

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

534 

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

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

538 
is a theorem there, not an axiom. 

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

540 
this is mostly trivial. 

541 

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

543 
commutative semirings. 

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

545 
property, add the corresponding classes. 

546 

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

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

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

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

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

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

552 

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

555 
level, use abbreviations instead. 

556 

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

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

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

560 

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

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

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

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

564 
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

565 
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

566 

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

567 
* New theory Code_Generator providing class 'eq', 
20607  568 
allowing for code generation with polymorphic equality. 
569 

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

20485  573 

574 
 new constants Numeral.pred and Numeral.succ instead 

575 
of former Numeral.bin_pred and Numeral.bin_succ. 

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

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

578 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

579 

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

581 

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

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

585 
because the functions are compiled to ML first. 

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

587 
an identifier. 

588 

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

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

592 

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

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

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

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

597 
op * ~> HOL.times 
19277  598 
op < ~> Orderings.less 
599 
op <= ~> Orderings.less_eq 

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

600 

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

601 
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

602 

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

605 
may go wrong. 

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

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

607 

19277  608 
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

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

610 

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

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

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

615 
distribution). 

616 
INCOMPATIBILITY: rewrite proofs 

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

617 

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

618 
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

619 
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

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

621 

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

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

625 

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

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

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

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

630 

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

633 

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

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

17779  637 

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

19211  640 
* Theorem Cons_eq_map_conv no longer has attribute `simp'. 
641 

19279  642 
* Theorem setsum_mult renamed to setsum_right_distrib. 
643 

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

646 

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

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

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

651 

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

654 

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

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

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

657 

21256  658 
* Library: moved theories Parity, GCD, Binomial, Infinite_Set to Library. 
659 

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

661 

18446  662 
* Library: added theory Coinductive_List of potentially infinite lists 
663 
as greatest fixedpoint. 

18399  664 

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

667 

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

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

671 

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

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

21056  674 
being more powerful on arithmetic goals. INCOMPATIBILITY. Set 
20807  675 
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

676 

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

677 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  678 

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

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

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

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

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

685 

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

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

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

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

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

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

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

693 

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

695 
is available in HOL/ex/ReflectionEx.thy 

696 

697 

20169  698 
*** HOLAlgebra *** 
699 

21170  700 
* Formalisation of ideals and the quotient construction over rings. 
701 

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

703 
INCOMPATIBILITY. 

704 

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

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

707 
of algebraic structures. 

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

708 

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

709 
* Renamed `CRing.thy' to `Ring.thy'. INCOMPATIBILITY. 
20169  710 

20807  711 

19653  712 
*** HOLComplex *** 
713 

714 
* Theory Real: new method ferrack implements quantifier elimination 

715 
for linear arithmetic over the reals. The quantifier elimination 

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

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

718 

719 

17878  720 
*** ML *** 
721 

21056  722 
* Pure/table: 
723 

724 
Function `...tab.foldl` removed. 

725 
INCOMPATIBILITY: use `...tabfold` instead 

726 

20857  727 
* Pure/library: 
728 

21056  729 
`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

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

731 
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

732 
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

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

734 

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

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

736 

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

20607  740 
* Pure/General/susp.ML: 
741 

742 
New module for delayed evaluations. 

743 

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

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

745 

20348  746 
Semantically identical functions "equal_list" and "eq_list" have been 
747 
unified to "eq_list". 

748 

749 
* Pure/library: 

750 

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

751 
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

752 
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

753 

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

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

757 
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

758 
sequence. "fold_burrow" has an additional context. 
18540  759 

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

761 
"unflat" from the user. 

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

762 

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

765 

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

766 
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

767 
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

768 

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

771 
given more convenient names and signatures reminiscent of similar 

772 
functions for alists, tables, etc: 

18051  773 

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

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

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

777 

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

780 

19653  781 
* Pure/library: general ``divide_and_conquer'' combinator on lists. 
782 

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

19032  786 
* Pure/General/rat.ML implements rational numbers. 
787 

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

789 
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

790 
admits slightly more efficient complex applications. 
18446  791 

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

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

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

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

798 

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

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

18738  802 
minimizing code duplication. Thm.rule_attribute and 
803 
Thm.declaration_attribute build canonical attributes; see also 

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

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

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

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

807 

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

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

811 

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

813 
explicit proofs of class axioms and super class relations performed 

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

815 
notably AxClass.define_class supercedes AxClass.add_axclass, and 

816 
AxClass.axiomatize_class/classrel/arity supercede 

817 
Sign.add_classes/classrel/arities. 

818 

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

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

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

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

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

823 
attributes, methods, etc. 
18642  824 

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

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

828 
fold_map combinators. 

18051  829 

18020  830 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  831 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  832 
achieve the old behaviour. 
833 

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

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

836 
statements. 

837 

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

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

839 
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

840 
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

841 

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

844 
some popular functions from term.ML: 

845 

846 
Term.variant > Name.variant 

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

848 
Term.invent_names > Name.invent_list 

849 

850 
Note that lowlevel renaming rarely occurs in new code  operations 

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

852 

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

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

854 
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

855 
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

856 
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

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

858 

18567  859 
* 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

860 
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

861 
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

862 
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

863 
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

864 
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

865 
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

866 
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

867 

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

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

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

871 
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

872 
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

873 

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

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

875 

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

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

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

879 

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

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

881 

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

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

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

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

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

886 

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

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

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

889 

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

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

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

892 

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

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

894 
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

895 
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

896 
batch mode. 
18567  897 

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

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

17890  901 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  902 
(solver, looper etc.) may depend on arbitrary proof data. 
903 

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

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

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

907 
former Simplifier.inherit_bounds, which is already included here  

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

17878  910 

911 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

914 
INCOMPATIBILITY. 

915 

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

918 

17878  919 

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

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

921 

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

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

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

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

925 

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

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

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

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

929 

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

930 

17720  931 
New in Isabelle2005 (October 2005) 
932 
 

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

933 

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

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

935 

15130  936 
* Theory headers: the new header syntax for Isar theories is 
937 

938 
theory <name> 

16234  939 
imports <theory1> ... <theoryN> 
940 
uses <file1> ... <fileM> 

15130  941 
begin 
942 

16234  943 
where the 'uses' part is optional. The previous syntax 
944 

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

946 

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

17371  949 
nonIsar theories now, but these will disappear soon. 
15130  950 

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

951 
* Theory loader: parent theories can now also be referred to via 
16234  952 
relative and absolute paths. 
953 

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

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

955 
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

956 
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

957 
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

958 
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

959 
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

960 
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

961 
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

962 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  963 

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

964 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  965 

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

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

968 
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

969 

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

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

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

972 

17385  973 
* Communication with Proof General is now 8bit clean, which means that 
974 
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

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

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

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

17385  980 

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

983 
faster. 

984 

15703  985 

986 
*** Document preparation *** 

987 

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

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

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

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

993 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

994 

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

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

996 
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

997 
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

998 
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

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

1000 
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

1001 
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

1002 
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

1003 
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

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

1005 

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

1006 
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

1007 
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

1008 
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

1009 
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

1010 
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

1011 
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

1012 
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

1013 
specified above. 
16234  1014 

17402  1015 
* Several new antiquotations: 
15979  1016 

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

1018 

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

1020 

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

15979  1023 

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

16234  1025 
theorem applying a "style" to it 
1026 

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

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

1028 

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

17393  1031 
conclusion of a metalogical statement theorem, and 'prem1' .. 'prem19' 
16234  1032 
to print the specified premise. TermStyle.add_style provides an ML 
1033 
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

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

1035 
typechecked ML expressions verbatim. 
16234  1036 

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

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

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

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

1041 

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

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

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

1045 

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

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

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

1048 

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

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

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

1051 

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

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

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

1054 

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

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

1056 
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

1057 
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

1058 

16234  1059 

1060 
*** Pure *** 

1061 

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

1063 
automatic typeinference of declared constants; additional support for 

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

1065 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

1066 
sequential dependencies of definitions within a single 'constdefs' 

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

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

1069 

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

1071 
indexed syntax provides a notational device for subscripted 

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

1073 
expressions. Secondly, in a local context with structure 

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

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

1076 
show_structs controls printing of implicit structures. Typical 

1077 
applications of these concepts involve record types and locales. 

1078 

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

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

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

1082 

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

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

1085 
parsing/printing, see also isarref manual. 

1086 

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

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

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

1091 
INCOMPATIBILITY. 

1092 

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

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

1094 
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

1095 
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

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

1097 

16234  1098 
* Improved internal renaming of symbolic identifiers  attach primes 
1099 
instead of base 26 numbers. 

1100 

1101 
* New flag show_question_marks controls printing of leading question 

1102 
marks in schematic variable names. 

1103 

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

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

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

1107 

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

1109 
by simp 

1110 

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

1112 

17548  1113 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  1114 
annotations as "(00...)". 
1115 

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

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

1118 
Before that distinction was only partially implemented via type class 

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

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

1121 
exotic syntax specifications may require further adaption 

17691  1122 
(e.g. Cube/Cube.thy). 
16234  1123 

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

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

1126 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

1127 
specifications. 

1128 

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

1131 

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

1134 
Limit. 

1135 

1136 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

1142 
allow for use in a context of fixed variables. 

1143 

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

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

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

1147 

17597  1148 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  1149 

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

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

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

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

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

1156 

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

1158 
selections of theorems in named facts via index ranges. 

1159 

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

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

1161 
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

1162 
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

1163 

17397  1164 
* 'hide': option '(open)' hides only base names. 
1165 

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

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

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

1168 

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

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

1172 
must be quoted when used as identifiers. 

1173 

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

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

1176 
quoted when used as identifier. 

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

1177 

16234  1178 

1179 
*** Locales *** 

17095  1180 

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

1183 
proof obligations from the expression specification. After the 

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

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

1186 
commands is a follows: 

1187 

17095  1188 
(1) interpretation expr inst 
1189 
(2) interpretation target < expr 

1190 
(3) interpret expr inst 

17385  1191 

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

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

1196 
locale expression. Interpretation is smart in that interpretations 

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

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

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

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

16234  1202 

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

1204 
'interpret' instead. 

1205 

17385  1206 
* New context element 'constrains' for adding type constraints to 
1207 
parameters. 

1208 

1209 
* Context expressions: renaming of parameters with syntax 

1210 
redeclaration. 

17095  1211 

1212 
* Locale declaration: 'includes' disallowed. 

1213 

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

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

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

1218 
to attribute arguments as expected. 

1219 

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

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

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

1223 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

1229 
values to argument tokens explicitly. 

1230 

1231 
* Changed parameter management in theorem generation for long goal 

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

1233 
theorem statement in rare situations. 

1234 

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

1237 

16234  1238 

1239 
*** Provers *** 

1240 

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

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

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

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

1245 
still available as 'simplesubst'. 

1246 

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

1248 
and quasi orders. 

1249 

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

1251 
reflexivetransitive closure of relations. 

1252 

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

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

1255 

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

1257 
is peformed already. Objectlogics merely need to finish their 

1258 
initial simpset configuration as before. INCOMPATIBILITY. 

15703  1259 

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

1260 

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

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

1262 

16234  1263 
* Symbolic syntax of Hilbert Choice Operator is now as follows: 
14878  1264 

1265 
syntax (epsilon) 

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

1267 

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

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

1271 
becomes available as variable, constant etc. INCOMPATIBILITY, 

1272 

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

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

17371  1275 
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

1276 
support corresponding Isar calculations. 
16234  1277 

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

1279 
instead of ":". 

1280 

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

1282 

1283 
Old New 

1284 
{..n(} {..<n} 

1285 
{)n..} {n<..} 

1286 
{m..n(} {m..<n} 

1287 
{)m..n} {m<..n} 

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

1289 

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

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

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

15046  1293 

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

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

1296 

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

1299 
interface. 

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

1300 

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

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

1306 
Some new syntax forms are available: 

1307 

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

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

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

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

1312 

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

1314 
function "Summation", which has been discontinued. 

1315 

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

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

1318 
(insert F x)'. 

1319 

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

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

1322 
typedefs, inductive datatypes and recursion. 

1323 

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

1326 
HOL/ex/SAT_Examples.thy for examples. 

17619  1327 

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

1330 
induction on xs, the induction step is now P(xs) ==> P(a#xs) rather 

1331 
than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY 

1332 
in unstructured proof scripts. 

1333 

1334 
* Reworked implementation of records. Improved scalability for 

1335 
records with many fields, avoiding performance problems for type 

1336 
inference. Records are no longer composed of nested field types, but 

1337 
of nested extension types. Therefore the record type only grows linear 

1338 
in the number of extensions and not in the number of fields. The 

1339 
toplevel (users) view on records is preserved. Potential 

1340 
INCOMPATIBILITY only in strange cases, where the theory depends on the 

1341 
old record representation. The type generated for a record is called 

1342 
<record_name>_ext_type. 

1343 

1344 
Flag record_quick_and_dirty_sensitive can be enabled to skip the 

1345 
proofs triggered by a record definition or a simproc (if 

1346 
quick_and_dirty is enabled). Definitions of large records can take 

1347 
quite long. 

1348 

1349 
New simproc record_upd_simproc for simplification of multiple record 

1350 
updates enabled by default. Moreover, trivial updates are also 

1351 
removed: r(x := x r) = r. INCOMPATIBILITY: old proofs break 

1352 
occasionally, since simplification is more powerful by default. 

1353 

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

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

1355 
typevariables in the term. 
44d8fbc2e52d
axclass: name space prefix is now "c_class" instead of just "c";
wenzelm
parents:
17269
diff
changeset

1356 

16234  1357 
* Simplifier: automatically reasons about transitivity chains 
1358 
involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics 

1359 
provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY: 

1360 
old proofs break occasionally as simplification may now solve more 

1361 
goals than previously. 

1362 

1363 
* Simplifier: converts x <= y into x = y if assumption y <= x is 

1364 
present. Works for all partial orders (class "order"), in particular 

1365 
numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y 

1366 
just like y <= x. 

1367 

1368 
* Simplifier: new simproc for "let x = a in f x". If a is a free or 

1369 
bound variable or a constant then the let is unfolded. Otherwise 

1370 
first a is simplified to b, and then f b is simplified to g. If 

1371 
possible we abstract b from g arriving at "let x = b in h x", 

1372 
otherwise we unfold the let and arrive at g. The simproc can be 

1373 
enabled/disabled by the reference use_let_simproc. Potential 

1374 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  1375 

16563  1376 
* Classical reasoning: the meson method now accepts theorems as arguments. 
1377 

17595  1378 
* Prover support: prerelease of the IsabelleATP linkup, which runs background 
1379 
jobs to provide advice on the provability of subgoals. 

1380 

16891  1381 
* Theory OrderedGroup and Ring_and_Field: various additions and 
1382 
improvements to faciliate calculations involving equalities and 

1383 
inequalities. 

1384 

1385 
The following theorems have been eliminated or modified 

1386 
(INCOMPATIBILITY): 

16888  1387 

1388 
abs_eq now named abs_of_nonneg 

17371  1389 
abs_of_ge_0 now named abs_of_nonneg 
1390 
abs_minus_eq now named abs_of_nonpos 

16888  1391 
imp_abs_id now named abs_of_nonneg 
1392 
imp_abs_neg_id now named abs_of_nonpos 

1393 
mult_pos now named mult_pos_pos 

1394 
mult_pos_le now named mult_nonneg_nonneg 

1395 
mult_pos_neg_le now named mult_nonneg_nonpos 

1396 
mult_pos_neg2_le now named mult_nonneg_nonpos2 

1397 
mult_neg now named mult_neg_neg 

1398 
mult_neg_le now named mult_nonpos_nonpos 

1399 

16891  1400 
* Theory Parity: added rules for simplifying exponents. 
1401 

17092  1402 
* Theory List: 
1403 

1404 
The following theorems have been eliminated or modified 

1405 
(INCOMPATIBILITY): 

1406 

1407 
list_all_Nil now named list_all.simps(1) 

1408 
list_all_Cons now named list_all.simps(2) 

1409 
list_all_conv now named list_all_iff 

1410 
set_mem_eq now named mem_iff 

1411 

16929 