author  nipkow 
Sat, 19 May 2007 07:47:51 +0200  
changeset 23013  c38c9039dc13 
parent 22997  d4f3b015b50b 
child 23029  79ee75dc1e59 
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 

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

11 
tolerate_legacy_features flag (default true). 

12 

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

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

14 
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

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

16 

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

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

18 
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

19 
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

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

21 

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

24 
quotes. 

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

25 

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

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

27 
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

28 
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

29 
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

30 
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

31 
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

32 
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

33 

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

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

35 

22965  36 
* Proof General interface: A search form for the "Find Theorems" command is 
37 
now available via Cc Ca Cf. The old minibuffer interface is available 

38 
via Cc Ca Cm. Variable prooffindtheoremscommand (customizable via 

39 
'ProofGeneral > Advanced > Internals > Prover Config') controls the 

40 
default behavior of 'ProofGeneral > Find Theorems' (Cc Cf): set to 

41 
isarfindtheoremsform or isarfindtheoremsminibuffer. 

42 

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

45 
suppressed from proof state output. Note that the ProofGeneral 

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

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

48 
limit is imposed. 

49 

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

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

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

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

53 
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

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

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

56 

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

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

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

59 

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

60 

17865  61 
*** Document preparation *** 
62 

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

65 
current context. 

21339  66 

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

17865  69 

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

21735  72 
arguments may be given on the LHS.) 
21717  73 

74 

17865  75 

17779  76 
*** Pure *** 
77 

22921
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22871
diff
changeset

78 
* code generator: consts in 'consts_code' Isar commands are now referred 
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22871
diff
changeset

79 
to by usual term syntax (including optional type annotations). 
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22871
diff
changeset

80 

22735  81 
* code generator: 
22921
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22871
diff
changeset

82 
 Isar 'definition's, 'constdef's and primitive instance definitions are added 
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22871
diff
changeset

83 
explicitly to the table of defining equations 
22754  84 
 primitive definitions are not used as defining equations by default any longer 
22735  85 
 defining equations are now definitly restricted to meta "==" and object 
86 
equality "=" 

87 
 HOL theories have been adopted accordingly 

88 

20807  89 
* class_package.ML offers a combination of axclasses and locales to 
22921
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22871
diff
changeset

90 
achieve Haskelllike type classes in Isabelle. See 
20807  91 
HOL/ex/Classpackage.thy for examples. 
92 

93 
* Yet another code generator framework allows to generate executable 

22921
475ff421a6a3
consts in consts_code Isar commands are now referred to by usual term syntax
haftmann
parents:
22871
diff
changeset

94 
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

95 

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

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

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

99 
code_gen <list of constants (term syntax)> (SML <filename>) 
22735  100 
writing OCaml code to a file: 
101 
code_gen <list of constants (term syntax)> (OCaml <filename>) 

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

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

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

104 

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

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

106 

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

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

108 

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

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

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

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

113 

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

115 

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

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

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

118 

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

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

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

121 

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

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

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

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

125 

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

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

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

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

129 

22735  130 
code_instance and code_class only apply to target Haskell. 
131 

132 
See HOL theories and HOL/ex/Codegenerator*.thy for usage examples. 

133 
Doc/Isar/Advanced/Codegen/ provides a tutorial. 

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

134 

19254  135 
* Command 'no_translations' removes translation rules from theory 
136 
syntax. 

137 

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

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

141 
correspondence to type class and instance declarations. 

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

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

19711  144 

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

146 
instantiation that matches an instance against the most general 

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

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

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

150 
recursion over such type arguments. Incomplete specification patterns 

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

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

155 

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

158 

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

160 
then guess x and y by clarify 

161 

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

163 
proof tools being involved here. 

164 

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

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

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

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

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

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

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

173 

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

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

18020  177 

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

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

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

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

182 

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

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

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

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

186 

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

189 

18308  190 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
191 

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

193 

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

196 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  197 
'unfolded' attribute may be replaced by firstclass proof text. 
198 

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

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

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

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

202 
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

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

204 

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

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

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

210 
originally first one. 

19220  211 

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

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

213 
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

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

215 

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

218 
(essentially a disjunction of cases with local parameters and 

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

18910  220 
adequately; in this notation common elimination rules look like this: 
18901  221 

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

223 
assumes "EX x. P x" 

224 
obtains x where "P x" 

225 

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

227 
assumes "A & B" 

228 
obtains A and B 

229 

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

231 
assumes "A  B" 

232 
obtains 

233 
A 

234 
 B 

235 

18910  236 
The subsequent classical rules even refer to the formal "thesis" 
18901  237 
explicitly: 
238 

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

240 
obtains "~ thesis" 

241 

18910  242 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
243 
obtains "thesis ==> something" 

18901  244 

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

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

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

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

250 
case_names). 

18901  251 

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

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

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

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

255 
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

256 

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

259 
toplevel lemma. 

260 

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

263 

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

266 
to occur. 

267 

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

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

269 
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

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

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

272 

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

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

274 
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

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

276 

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

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

278 
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

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

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

281 

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

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

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

286 

19665  287 
axiomatization 
21595  288 
eq (infix "===" 50) where 
289 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

290 

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

292 
definition g where "g x = f x x" 

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

293 

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

297 

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

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

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

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

305 

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

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

309 
'translations' in common applications. 

19084  310 

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

311 
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

312 
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

313 
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

314 
'translations' with explicit "CONST" markup to accommodate this. 
19665  315 

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

318 
abbreviations on output. 

319 

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

322 
 parameter renamings are no longer required to be injective. 

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

324 
locale endom = homom mult mult h. 

325 

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

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

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

330 
predicates, goals repesenting already interpreted fragments are not 

331 
removed automatically. Use methods `intro_locales' and 

332 
`unfold_locales'; see below. 

333 

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

335 
provide backward reasoning on locales predicates. The methods are 

336 
aware of interpretations and discharge corresponding goals. 

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

338 
unfold predicates to assumptions. 

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

339 

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

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

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

343 

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

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

347 
(using objectlogic connectives for this purpose has been long 

348 
obsolete anyway). The subsequent proof patterns illustrate advanced 

349 
techniques of natural induction; general datatypes and inductive sets 

18267  350 
work analogously (see also src/HOL/Lambda for realistic examples). 
351 

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

18239  353 
parameters: 
18233  354 

355 
lemma 

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

357 
assumes a: "A n x" 

358 
shows "P n x" 

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

20503  360 
proof (induct n arbitrary: x)  {* generalize goal to "!!x. A n x ==> P n x" *} 
18248  361 
case 0 
18233  362 
show ?case sorry 
363 
next 

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

18233  367 
show ?case sorry 
368 
qed 

369 

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

375 
lemma 

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

377 
assumes a: "A (a x)" 

378 
shows "P (a x)" 

379 
using a 

20503  380 
proof (induct n == "a x" arbitrary: x) 
18233  381 
... 
382 

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

385 

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

388 
encodings: 

389 

390 
lemma 

391 
fixes n :: nat 

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

20503  393 
proof (induct n arbitrary: thesis) 
18267  394 
case 0 
395 
obtain x where "P 0 x" and "Q 0 x" sorry 

18399  396 
then show thesis by (rule 0) 
18267  397 
next 
398 
case (Suc n) 

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

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

401 
then show thesis by (rule Suc.prems) 

402 
qed 

403 

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

18267  406 
existence statement through the induction as expected. 
18233  407 

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

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

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

410 
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

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

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

413 

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

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

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

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

417 

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

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

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

420 

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

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

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

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

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

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

426 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

445 

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

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

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

448 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

476 

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

477 
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

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

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

480 

18507  481 
lemma 
482 
shows "a : A ==> P1 a" 

483 
"a : A ==> P2 a" 

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

485 
"b : B ==> Q2 b" 

486 
"b : B ==> Q3 b" 

487 
proof (induct set: A B) 

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

488 

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

491 

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

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

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

494 

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

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

498 
trace indicates where parts have been suppressed. 

18674  499 

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

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

501 
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

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

503 

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

506 
least one premise. 

507 

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

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

512 

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

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

514 
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

515 
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

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

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

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

519 

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

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

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

522 
for example "A > B" => "Pi A (%_. B)". 
17779  523 

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

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

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

526 

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

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

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

529 

17865  530 

17806  531 
*** HOL *** 
532 

22997  533 
* Constant renames due to introduction of canonical name prefixing for 
534 
class package: 

535 

536 
HOL.abs ~> HOL.minus_class.abs 

537 
HOL.divide ~> HOL.divide_class.divide 

538 
Nat.power ~> Nat.power_class.power 

539 
Nat.size ~> Nat.size_class.size 

540 
Numeral.number_of ~> Numeral.number_class.number_of 

541 

22845  542 
* case expressions and primrec: missing cases now mapped to "undefined" 
543 
instead of "arbitrary" 

544 

545 
* new constant "undefined" with axiom "undefined x = undefined" 

546 

547 
* new class "default" with associated constant "default" 

548 

22799
ed7d53db2170
moved code generation pretty integers and characters to separate theories
haftmann
parents:
22754
diff
changeset

549 
* Library/Pretty_Int.thy: maps HOL numerals on target language integer literals 
ed7d53db2170
moved code generation pretty integers and characters to separate theories
haftmann
parents:
22754
diff
changeset

550 
when generating code. 
ed7d53db2170
moved code generation pretty integers and characters to separate theories
haftmann
parents:
22754
diff
changeset

551 

ed7d53db2170
moved code generation pretty integers and characters to separate theories
haftmann
parents:
22754
diff
changeset

552 
* Library/Pretty_Char.thy: maps HOL characters on target language character literals 
ed7d53db2170
moved code generation pretty integers and characters to separate theories
haftmann
parents:
22754
diff
changeset

553 
when generating code. 
ed7d53db2170
moved code generation pretty integers and characters to separate theories
haftmann
parents:
22754
diff
changeset

554 

22735  555 
* Library/Commutative_Ring.thy: switched from recdef to function package; 
556 
constants add, mul, pow now curried. Infix syntax for algebraic operations. 

557 

22450  558 
* Some steps towards more uniform lattice theory development in HOL. 
22422
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

559 

ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

560 
constants "meet" and "join" now named "inf" and "sup" 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

561 
constant "Meet" now named "Inf" 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

562 

22450  563 
classes "meet_semilorder" and "join_semilorder" now named 
564 
"lower_semilattice" and "upper_semilattice" 

565 
class "lorder" now named "lattice" 

566 
class "comp_lat" now named "complete_lattice" 

567 

568 
Instantiation of lattice classes allows explicit definitions 

569 
for "inf" and "sup" operations. 

570 

571 
INCOMPATIBILITY. Theorem renames: 

572 

22422
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

573 
meet_left_le ~> inf_le1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

574 
meet_right_le ~> inf_le2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

575 
join_left_le ~> sup_ge1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

576 
join_right_le ~> sup_ge2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

577 
meet_join_le ~> inf_sup_ord 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

578 
le_meetI ~> le_infI 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

579 
join_leI ~> le_supI 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

580 
le_meet ~> le_inf_iff 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

581 
le_join ~> ge_sup_conv 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

582 
meet_idempotent ~> inf_idem 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

583 
join_idempotent ~> sup_idem 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

584 
meet_comm ~> inf_commute 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

585 
join_comm ~> sup_commute 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

586 
meet_leI1 ~> le_infI1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

587 
meet_leI2 ~> le_infI2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

588 
le_joinI1 ~> le_supI1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

589 
le_joinI2 ~> le_supI2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

590 
meet_assoc ~> inf_assoc 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

591 
join_assoc ~> sup_assoc 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

592 
meet_left_comm ~> inf_left_commute 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

593 
meet_left_idempotent ~> inf_left_idem 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

594 
join_left_comm ~> sup_left_commute 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

595 
join_left_idempotent ~> sup_left_idem 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

596 
meet_aci ~> inf_aci 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

597 
join_aci ~> sup_aci 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

598 
le_def_meet ~> le_iff_inf 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

599 
le_def_join ~> le_iff_sup 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

600 
join_absorp2 ~> sup_absorb2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

601 
join_absorp1 ~> sup_absorb1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

602 
meet_absorp1 ~> inf_absorb1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

603 
meet_absorp2 ~> inf_absorb2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

604 
meet_join_absorp ~> inf_sup_absorb 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

605 
join_meet_absorp ~> sup_inf_absorb 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

606 
distrib_join_le ~> distrib_sup_le 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

607 
distrib_meet_le ~> distrib_inf_le 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

608 

ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

609 
add_meet_distrib_left ~> add_inf_distrib_left 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

610 
add_join_distrib_left ~> add_sup_distrib_left 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

611 
is_join_neg_meet ~> is_join_neg_inf 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

612 
is_meet_neg_join ~> is_meet_neg_sup 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

613 
add_meet_distrib_right ~> add_inf_distrib_right 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

614 
add_join_distrib_right ~> add_sup_distrib_right 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

615 
add_meet_join_distribs ~> add_sup_inf_distribs 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

616 
join_eq_neg_meet ~> sup_eq_neg_inf 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

617 
meet_eq_neg_join ~> inf_eq_neg_sup 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

618 
add_eq_meet_join ~> add_eq_inf_sup 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

619 
meet_0_imp_0 ~> inf_0_imp_0 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

620 
join_0_imp_0 ~> sup_0_imp_0 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

621 
meet_0_eq_0 ~> inf_0_eq_0 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

622 
join_0_eq_0 ~> sup_0_eq_0 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

623 
neg_meet_eq_join ~> neg_inf_eq_sup 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

624 
neg_join_eq_meet ~> neg_sup_eq_inf 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

625 
join_eq_if ~> sup_eq_if 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

626 

ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

627 
mono_meet ~> mono_inf 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

628 
mono_join ~> mono_sup 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

629 
meet_bool_eq ~> inf_bool_eq 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

630 
join_bool_eq ~> sup_bool_eq 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

631 
meet_fun_eq ~> inf_fun_eq 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

632 
join_fun_eq ~> sup_fun_eq 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

633 
meet_set_eq ~> inf_set_eq 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

634 
join_set_eq ~> sup_set_eq 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

635 
meet1_iff ~> inf1_iff 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

636 
meet2_iff ~> inf2_iff 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

637 
meet1I ~> inf1I 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

638 
meet2I ~> inf2I 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

639 
meet1D1 ~> inf1D1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

640 
meet2D1 ~> inf2D1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

641 
meet1D2 ~> inf1D2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

642 
meet2D2 ~> inf2D2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

643 
meet1E ~> inf1E 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

644 
meet2E ~> inf2E 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

645 
join1_iff ~> sup1_iff 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

646 
join2_iff ~> sup2_iff 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

647 
join1I1 ~> sup1I1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

648 
join2I1 ~> sup2I1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

649 
join1I1 ~> sup1I1 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

650 
join2I2 ~> sup1I2 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

651 
join1CI ~> sup1CI 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

652 
join2CI ~> sup2CI 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

653 
join1E ~> sup1E 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

654 
join2E ~> sup2E 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

655 

ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

656 
is_meet_Meet ~> is_meet_Inf 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

657 
Meet_bool_def ~> Inf_bool_def 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

658 
Meet_fun_def ~> Inf_fun_def 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

659 
Meet_greatest ~> Inf_greatest 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

660 
Meet_lower ~> Inf_lower 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

661 
Meet_set_def ~> Inf_set_def 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

662 

ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

663 
listsp_meetI ~> listsp_infI 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

664 
listsp_meet_eq ~> listsp_inf_eq 
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

665 

22450  666 
meet_min ~> inf_min 
667 
join_max ~> sup_max 

668 

22845  669 
* Classes "order" and "linorder": facts "refl", "trans" and 
22384
33a46e6c7f04
prefix of class interpretation not mandatory any longer
haftmann
parents:
22376
diff
changeset

670 
"cases" renamed ro "order_refl", "order_trans" and "linorder_cases", to 
33a46e6c7f04
prefix of class interpretation not mandatory any longer
haftmann
parents:
22376
diff
changeset

671 
avoid clashes with HOL "refl" and "trans". INCOMPATIBILITY. 
33a46e6c7f04
prefix of class interpretation not mandatory any longer
haftmann
parents:
22376
diff
changeset

672 

22845  673 
* Classes "order" and "linorder": 
22316  674 
potential INCOMPATIBILITY: order of proof goals in order/linorder instance 
675 
proofs changed. 

676 

22218  677 
* Dropped lemma duplicate def_imp_eq in favor of meta_eq_to_obj_eq. 
678 
INCOMPATIBILITY. 

679 

680 
* Dropped lemma duplicate if_def2 in favor of if_bool_eq_conj. 

681 
INCOMPATIBILITY. 

682 

22126  683 
* Added syntactic class "size"; overloaded constant "size" now has 
684 
type "'a::size ==> bool" 

685 

686 
* Renamed constants "Divides.op div", "Divides.op mod" and "Divides.op 

22997  687 
dvd" to "Divides.div_class.div", "Divides.div_class.mod" and "Divides.dvd". INCOMPATIBILITY. 
22126  688 

689 
* Added method "lexicographic_order" automatically synthesizes 

690 
termination relations as lexicographic combinations of size measures 

691 
 'function' package. 

692 

693 
* HOL/records: generalised fieldupdate to take a function on the 

694 
field rather than the new value: r(A := x) is translated to A_update 

695 
(K x) r The Kcombinator that is internally used is called K_record. 

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

696 
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

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

698 

22126  699 
* axclass "semiring_0" now contains annihilation axioms x * 0 = 0 and 
700 
0 * x = 0, which are required for a semiring. Richer structures do 

701 
not inherit from semiring_0 anymore, because this property is a 

702 
theorem there, not an axiom. INCOMPATIBILITY: In instances of 

703 
semiring_0, there is more to prove, but this is mostly trivial. 

704 

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

706 
commutative semirings. INCOMPATIBILITY: If you use recpower and need 

707 
commutativity or a semiring property, add the corresponding classes. 

708 

709 
* Unified locale partial_order with class definition (cf. theory 

710 
Orderings), added parameter ``less''. INCOMPATIBILITY. 

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

711 

21099  712 
* Constant "List.list_all2" in List.thy now uses authentic syntax. 
22126  713 
INCOMPATIBILITY: translations containing list_all2 may go wrong. On 
714 
Isar level, use abbreviations instead. 

715 

716 
* Renamed constant "List.op mem" to "List.memberl" INCOMPATIBILITY: 

717 
rarely occuring name references (e.g. ``List.op mem.simps'') require 

718 
renaming (e.g. ``List.memberl.simps''). 

719 

22997  720 
* Renamed constants "0" to "HOL.zero_class.zero" and "1" to "HOL.one_class.one". 
22126  721 
INCOMPATIBILITY. 
722 

723 
* Added theory Code_Generator providing class 'eq', allowing for code 

724 
generation with polymorphic equality. 

725 

726 
* Numeral syntax: type 'bin' which was a mere type copy of 'int' has 

727 
been abandoned in favour of plain 'int'. INCOMPATIBILITY  

728 
significant changes for setting up numeral syntax for types: 

20485  729 

730 
 new constants Numeral.pred and Numeral.succ instead 

731 
of former Numeral.bin_pred and Numeral.bin_succ. 

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

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

734 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

735 

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

737 

22126  738 
* New top level command 'normal_form' computes the normal form of a 
739 
term that may contain free variables. For example ``normal_form 

740 
"rev[a,b,c]"'' produces ``[b,c,a]'' (without proof). This command is 

741 
suitable for heavyduty computations because the functions are 

742 
compiled to ML first. 

19895  743 

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

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

747 

19279  748 
* Renamed constants in HOL.thy and Orderings.thy: 
22997  749 
op + ~> HOL.plus_class.plus 
750 
op  ~> HOL.minus_class.minus 

751 
uminus ~> HOL.minus_class.uminus 

752 
op * ~> HOL.times_class.times 

753 
op < ~> Orderings.ord_class.less 

754 
op <= ~> Orderings.ord_class.less_eq 

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

755 

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

756 
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

757 

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

760 
may go wrong. 

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

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

762 

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

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

765 

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

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

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

770 
distribution). 

771 
INCOMPATIBILITY: rewrite proofs 

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

772 

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

773 
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

774 
This in general only affects handwritten proof tactics, simprocs and so on. 
22997  775 
INCOMPATIBILITY: grep your sourcecode and replace names. Consider use 
776 
of const_name ML antiquotations. 

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

777 

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

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

781 

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

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

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

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

786 

22126  787 
* The old set interval syntax "{m..n(}" (and relatives) has been 
788 
removed. Use "{m..<n}" (and relatives) instead. 

19377  789 

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

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

17779  793 

22126  794 
* "m dvd n" where m and n are numbers is evaluated to True/False by 
795 
simp. 

796 

797 
* Theorem Cons_eq_map_conv no longer declared as ``simp''. 

19211  798 

19279  799 
* Theorem setsum_mult renamed to setsum_right_distrib. 
800 

19211  801 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
22126  802 
``rule'' method. 
803 

804 
* Reimplemented methods ``sat'' and ``satx'', with several 

805 
improvements: goals no longer need to be stated as "<prems> ==> 

806 
False", equivalences (i.e. "=" on type bool) are handled, variable 

807 
names of the form "lit_<n>" are no longer reserved, significant 

808 
speedup. 

809 

810 
* Methods ``sat'' and ``satx'' can now replay MiniSat proof traces. 

811 
zChaff is still supported as well. 

812 

813 
* 'inductive' and 'datatype': provide projections of mutual rules, 

814 
bundled as foo_bar.inducts; 

815 

816 
* Library: moved theories Parity, GCD, Binomial, Infinite_Set to 

817 
Library. 

21256  818 

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

820 

18446  821 
* Library: added theory Coinductive_List of potentially infinite lists 
822 
as greatest fixedpoint. 

18399  823 

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

826 

22126  827 
* Added proof method ``evaluation'' for efficiently solving a goal 
828 
(i.e. a boolean expression) by compiling it to ML. The goal is 

829 
"proved" (via an oracle) if it evaluates to True. 

20807  830 

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

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

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

835 

22126  836 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  837 

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

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

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

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

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

844 

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

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

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

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

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

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

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

852 

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

854 
is available in HOL/ex/ReflectionEx.thy 

855 

856 

20169  857 
*** HOLAlgebra *** 
858 

21170  859 
* Formalisation of ideals and the quotient construction over rings. 
860 

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

862 
INCOMPATIBILITY. 

863 

22126  864 
* Renamed lemmas least_carrier > least_closed and greatest_carrier > 
865 
greatest_closed. INCOMPATIBILITY. 

21896
9a7949815a84
Experimenting with interpretations of "definition".
ballarin
parents:
21879
diff
changeset

866 

21170  867 
* Method algebra is now set up via an attribute. For examples see 
21896
9a7949815a84
Experimenting with interpretations of "definition".
ballarin
parents:
21879
diff
changeset

868 
Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations 
21170  869 
of algebraic structures. 
20318
0e0ea63fe768
Restructured algebra library, added ideals and quotient rings.
ballarin
parents:
20217
diff
changeset

870 

22126  871 
* Renamed theory CRing to Ring. 
20169  872 

20807  873 

19653  874 
*** HOLComplex *** 
875 

876 
* Theory Real: new method ferrack implements quantifier elimination 

877 
for linear arithmetic over the reals. The quantifier elimination 

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

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

880 

22971  881 
* Hyperreal: Functions root and sqrt are now defined on negative real 
882 
inputs so that root n ( x) =  root n x and sqrt ( x) =  sqrt x. 

883 
Nonnegativity side conditions have been removed from many lemmas, so 

884 
that more subgoals may now be solved by simplification; potential 

885 
INCOMPATIBILITY. 

886 

21791  887 
* Real: New axiomatic classes formalize real normed vector spaces and 
888 
algebras, using new overloaded constants scaleR :: real => 'a => 'a 

889 
and norm :: 'a => real. 

890 

22126  891 
* Real: New constant of_real :: real => 'a::real_algebra_1 injects 
892 
from reals into other types. The overloaded constant Reals :: 'a set 

893 
is now defined as range of_real; potential INCOMPATIBILITY. 

894 

23013  895 
* Real: ML code generation is supported now and hence also quickcheck. 
896 
Reals are implemented as arbitrary precision rationals. 

897 

22126  898 
* Hyperreal: Several constants that previously worked only for the 
899 
reals have been generalized, so they now work over arbitrary vector 

900 
spaces. Type annotations may need to be added in some cases; potential 

901 
INCOMPATIBILITY. 

21791  902 

22972
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
diff
changeset

903 
Infinitesimal :: ('a::real_normed_vector) star set 
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
diff
changeset

904 
HFinite :: ('a::real_normed_vector) star set 
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
diff
changeset

905 
HInfinite :: ('a::real_normed_vector) star set 
21791  906 
approx :: ('a::real_normed_vector) star => 'a star => bool 
907 
monad :: ('a::real_normed_vector) star => 'a star set 

908 
galaxy :: ('a::real_normed_vector) star => 'a star set 

22972
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
diff
changeset

909 
(NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool 
21791  910 
(NS)convergent :: (nat => 'a::real_normed_vector) => bool 
911 
(NS)Bseq :: (nat => 'a::real_normed_vector) => bool 

912 
(NS)Cauchy :: (nat => 'a::real_normed_vector) => bool 

913 
(NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool 

914 
is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool 

915 
deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool 

22972
3e96b98d37c6
generalized sgn function to work on any real normed vector space
huffman
parents:
22971
diff
changeset

916 
sgn :: 'a::real_normed_vector => 'a 
21791  917 

918 
* Complex: Some complexspecific constants are now abbreviations for 

22126  919 
overloaded ones: complex_of_real = of_real, cmod = norm, hcmod = 
920 
hnorm. Other constants have been entirely removed in favor of the 

921 
polymorphic versions (INCOMPATIBILITY): 

21791  922 

923 
approx < capprox 

924 
HFinite < CFinite 

925 
HInfinite < CInfinite 

926 
Infinitesimal < CInfinitesimal 

927 
monad < cmonad 

928 
galaxy < cgalaxy 

929 
(NS)LIM < (NS)CLIM, (NS)CRLIM 

930 
is(NS)Cont < is(NS)Contc, is(NS)contCR 

931 
(ns)deriv < (ns)cderiv 

932 

19653  933 

17878  934 
*** ML *** 
935 

22848  936 
* Context data interfaces (Theory/Proof/GenericDataFun): removed 
22863  937 
name/print, uninitialized data defaults to adhoc copy of empty value, 
938 
init only required for impure data. INCOMPATIBILITY: empty really 

939 
need to be empty (no dependencies on theory content!) 

22848  940 

22138  941 
* ML within Isar: antiquotations allow to embed staticallychecked 
942 
formal entities in the source, referring to the context available at 

943 
compiletime. For example: 

944 

945 
ML {* @{typ "'a => 'b"} *} 

946 
ML {* @{term "%x. x"} *} 

947 
ML {* @{prop "x == y"} *} 

948 
ML {* @{ctyp "'a => 'b"} *} 

949 
ML {* @{cterm "%x. x"} *} 

950 
ML {* @{cprop "x == y"} *} 

951 
ML {* @{thm asm_rl} *} 

952 
ML {* @{thms asm_rl} *} 

22376  953 
ML {* @{const_name c} *} 
954 
ML {* @{const_syntax c} *} 

22138  955 
ML {* @{context} *} 
956 
ML {* @{theory} *} 

957 
ML {* @{theory Pure} *} 

958 
ML {* @{simpset} *} 

959 
ML {* @{claset} *} 

960 
ML {* @{clasimpset} *} 

961 

22151  962 
The same works for sources being ``used'' within an Isar context. 
963 

22152  964 
* ML in Isar: improved error reporting; extra verbosity with 
965 
Toplevel.debug enabled. 

966 

20348  967 
* Pure/library: 
968 

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

969 
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

970 
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

971 

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

22126  974 
list of values of the appropriate type". Compare this with "map" which 
18540  975 
would *not* apply its argument function simulatanously but in 
22126  976 
sequence; "fold_burrow" has an additional context. 
18450
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

977 

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

980 

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

981 
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

982 
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

983 

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

986 
given more convenient names and signatures reminiscent of similar 

987 
functions for alists, tables, etc: 

18051  988 

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

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

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

992 

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

995 

22126  996 
* Pure/library: added general ``divide_and_conquer'' combinator on 
997 
lists. 

19032  998 

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

1000 
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

1001 
admits slightly more efficient complex applications. 
18446  1002 

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

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

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

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

1009 

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

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

18738  1013 
minimizing code duplication. Thm.rule_attribute and 
1014 
Thm.declaration_attribute build canonical attributes; see also 

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

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

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

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

1018 

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

22126  1021 
logic, but only for type inference.) IMPORTANT INTERNAL CHANGE, 
1022 
potential INCOMPATIBILITY. 

19508  1023 

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

1025 
explicit proofs of class axioms and super class relations performed 

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

1027 
notably AxClass.define_class supercedes AxClass.add_axclass, and 

1028 
AxClass.axiomatize_class/classrel/arity supercede 

1029 
Sign.add_classes/classrel/arities. 

1030 

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

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

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

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

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

1035 
attributes, methods, etc. 
18642  1036 

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

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

1040 
fold_map combinators. 

18051  1041 

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

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

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

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

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

1046 

18020  1047 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  1048 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  1049 
achieve the old behaviour. 
1050 

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

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

1053 
statements. 

1054 

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

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

1056 
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

1057 
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

1058 

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

1061 
some popular functions from term.ML: 

1062 

1063 
Term.variant > Name.variant 

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

1065 
Term.invent_names > Name.invent_list 

1066 

1067 
Note that lowlevel renaming rarely occurs in new code  operations 

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

1069 

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

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

1071 
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

1072 
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

1073 
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

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

1075 

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

1077 
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

1078 
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

1079 
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

1080 
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

1081 
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

1082 
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

1083 
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

1084 

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

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

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

1088 
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

1089 
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

1090 

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

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

1092 

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

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

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

1096 

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

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

1098 

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

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

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

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

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

1103 

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

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

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

1106 

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

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

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

1109 

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

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

1111 
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

1112 
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

1113 
batch mode. 
18567  1114 

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

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

17890  1118 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  1119 
(solver, looper etc.) may depend on arbitrary proof data. 
1120 

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

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

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

1124 
former Simplifier.inherit_bounds, which is already included here  

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

17878  1127 

1128 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

1131 
INCOMPATIBILITY. 

1132 

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

1135 

17878  1136 

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

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

1138 

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

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

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

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

1142 

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

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

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

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

1146 

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

1147 

17720  1148 
New in Isabelle2005 (October 2005) 
1149 
 

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

1150 

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

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

1152 

15130  1153 
* Theory headers: the new header syntax for Isar theories is 
1154 

1155 
theory <name> 

16234  1156 
imports <theory1> ... <theoryN> 
1157 
uses <file1> ... <fileM> 

15130  1158 
begin 
1159 

16234  1160 
where the 'uses' part is optional. The previous syntax 
1161 

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

1163 

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

17371  1166 
nonIsar theories now, but these will disappear soon. 
15130  1167 

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

1168 
* Theory loader: parent theories can now also be referred to via 
16234  1169 
relative and absolute paths. 
1170 

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

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

1172 
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

1173 
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

1174 
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

1175 
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

1176 
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

1177 
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

1178 
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

1179 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  1180 

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

1181 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  1182 

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

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

1185 
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

1186 

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

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

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

1189 

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

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

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

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

17385  1197 

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

1200 
faster. 

1201 

15703  1202 

1203 
*** Document preparation *** 

1204 

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

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

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

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

1210 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

1211 

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

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

1213 
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

1214 
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

1215 
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

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

1217 
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

1218 
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

1219 
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

1220 
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

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

1222 

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

1223 
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

1224 
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

1225 
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

1226 
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

1227 
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

1228 
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

1229 
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

1230 
specified above. 
16234  1231 

17402  1232 
* Several new antiquotations: 
15979  1233 

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

1235 

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

1237 

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

15979  1240 

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

16234  1242 
theorem applying a "style" to it 
1243 

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

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

1245 

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

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

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

1252 
typechecked ML expressions verbatim. 
16234  1253 

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

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

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

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

1258 

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

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

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

1262 

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

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

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

1265 

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

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

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

1268 

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

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

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

1271 

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

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

1273 
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

1274 
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

1275 

16234  1276 

1277 
*** Pure *** 

1278 

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

1280 
automatic typeinference of declared constants; additional support for 

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

1282 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

1283 
sequential dependencies of definitions within a single 'constdefs' 

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

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

1286 

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

1288 
indexed syntax provides a notational device for subscripted 

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

1290 
expressions. Secondly, in a local context with structure 

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

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

1293 
show_structs controls printing of implicit structures. Typical 

1294 
applications of these concepts involve record types and locales. 

1295 

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

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

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

1299 

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

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

1302 
parsing/printing, see also isarref manual. 

1303 

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

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

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

1308 
INCOMPATIBILITY. 

1309 

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

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

1311 
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

1312 
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

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

1314 

16234  1315 
* Improved internal renaming of symbolic identifiers  attach primes 
1316 
instead of base 26 numbers. 

1317 

1318 
* New flag show_question_marks controls printing of leading question 

1319 
marks in schematic variable names. 

1320 

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

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

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

1324 

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

1326 
by simp 

1327 

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

1329 

17548  1330 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  1331 
annotations as "(00...)". 
1332 

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

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

1335 
Before that distinction was only partially implemented via type class 

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

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

1338 
exotic syntax specifications may require further adaption 

17691  1339 
(e.g. Cube/Cube.thy). 
16234  1340 

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

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

1343 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

1344 
specifications. 

1345 

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

1348 

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

1351 
Limit. 

1352 

1353 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

1359 
allow for use in a context of fixed variables. 

1360 

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

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

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

1364 

17597  1365 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  1366 

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

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

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

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

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

1373 

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

1375 
selections of theorems in named facts via index ranges. 

1376 

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

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

1378 
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

1379 
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

1380 

17397  1381 
* 'hide': option '(open)' hides only base names. 
1382 

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

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

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

1385 

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

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

1389 
must be quoted when used as identifiers. 

1390 

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

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

1393 
quoted when used as identifier. 

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

1394 

16234  1395 

1396 
*** Locales *** 

17095  1397 

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

1400 
proof obligations from the expression specification. After the 

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

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

1403 
commands is a follows: 

1404 

17095  1405 
(1) interpretation expr inst 
1406 
(2) interpretation target < expr 

1407 
(3) interpret expr inst 

17385  1408 

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