author  haftmann 
Thu, 10 May 2007 10:22:17 +0200  
changeset 22921  475ff421a6a3 
parent 22871  9ffb43b19ec6 
child 22965  b81bbe298406 
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 

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

38 
suppressed from proof state output. Note that the ProofGeneral 

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

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

41 
limit is imposed. 

42 

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

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

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

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

46 
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

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

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

49 

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

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

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

52 

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

53 

17865  54 
*** Document preparation *** 
55 

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

58 
current context. 

21339  59 

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

17865  62 

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

21735  65 
arguments may be given on the LHS.) 
21717  66 

67 

17865  68 

17779  69 
*** Pure *** 
70 

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

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

72 
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

73 

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

75 
 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

76 
explicitly to the table of defining equations 
22754  77 
 primitive definitions are not used as defining equations by default any longer 
22735  78 
 defining equations are now definitly restricted to meta "==" and object 
79 
equality "=" 

80 
 HOL theories have been adopted accordingly 

81 

20807  82 
* 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

83 
achieve Haskelllike type classes in Isabelle. See 
20807  84 
HOL/ex/Classpackage.thy for examples. 
85 

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

87 
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

88 

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

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

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

92 
code_gen <list of constants (term syntax)> (SML <filename>) 
22735  93 
writing OCaml code to a file: 
94 
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

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

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

97 

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

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

99 

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

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

101 

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

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

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

106 

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

108 

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

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

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

111 

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

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

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

114 

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

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

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

117 
where instance ::= <type constructor> :: <class> 
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_class <and_list of classes> 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

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

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

122 

22735  123 
code_instance and code_class only apply to target Haskell. 
124 

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

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

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

127 

19254  128 
* Command 'no_translations' removes translation rules from theory 
129 
syntax. 

130 

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

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

134 
correspondence to type class and instance declarations. 

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

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

19711  137 

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

139 
instantiation that matches an instance against the most general 

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

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

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

143 
recursion over such type arguments. Incomplete specification patterns 

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

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

148 

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

151 

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

153 
then guess x and y by clarify 

154 

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

156 
proof tools being involved here. 

157 

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

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

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

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

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

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

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

166 

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

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

18020  170 

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

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

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

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

175 

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

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

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

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

179 

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

182 

18308  183 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
184 

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

186 

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

189 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  190 
'unfolded' attribute may be replaced by firstclass proof text. 
191 

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

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

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

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

195 
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

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

197 

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

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

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

203 
originally first one. 

19220  204 

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

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

206 
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

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

208 

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

211 
(essentially a disjunction of cases with local parameters and 

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

18910  213 
adequately; in this notation common elimination rules look like this: 
18901  214 

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

216 
assumes "EX x. P x" 

217 
obtains x where "P x" 

218 

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

220 
assumes "A & B" 

221 
obtains A and B 

222 

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

224 
assumes "A  B" 

225 
obtains 

226 
A 

227 
 B 

228 

18910  229 
The subsequent classical rules even refer to the formal "thesis" 
18901  230 
explicitly: 
231 

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

233 
obtains "~ thesis" 

234 

18910  235 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
236 
obtains "thesis ==> something" 

18901  237 

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

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

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

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

243 
case_names). 

18901  244 

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

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

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

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

248 
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

249 

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

252 
toplevel lemma. 

253 

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

256 

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

259 
to occur. 

260 

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

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

262 
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

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

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

265 

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

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

267 
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

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

269 

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

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

271 
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

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

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

274 

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

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

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

279 

19665  280 
axiomatization 
21595  281 
eq (infix "===" 50) where 
282 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

283 

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

285 
definition g where "g x = f x x" 

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

286 

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

290 

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

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

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

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

298 

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

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

302 
'translations' in common applications. 

19084  303 

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

304 
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

305 
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

306 
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

307 
'translations' with explicit "CONST" markup to accommodate this. 
19665  308 

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

311 
abbreviations on output. 

312 

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

315 
 parameter renamings are no longer required to be injective. 

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

317 
locale endom = homom mult mult h. 

318 

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

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

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

323 
predicates, goals repesenting already interpreted fragments are not 

324 
removed automatically. Use methods `intro_locales' and 

325 
`unfold_locales'; see below. 

326 

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

328 
provide backward reasoning on locales predicates. The methods are 

329 
aware of interpretations and discharge corresponding goals. 

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

331 
unfold predicates to assumptions. 

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

332 

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

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

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

336 

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

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

340 
(using objectlogic connectives for this purpose has been long 

341 
obsolete anyway). The subsequent proof patterns illustrate advanced 

342 
techniques of natural induction; general datatypes and inductive sets 

18267  343 
work analogously (see also src/HOL/Lambda for realistic examples). 
344 

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

18239  346 
parameters: 
18233  347 

348 
lemma 

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

350 
assumes a: "A n x" 

351 
shows "P n x" 

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

20503  353 
proof (induct n arbitrary: x)  {* generalize goal to "!!x. A n x ==> P n x" *} 
18248  354 
case 0 
18233  355 
show ?case sorry 
356 
next 

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

18233  360 
show ?case sorry 
361 
qed 

362 

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

368 
lemma 

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

370 
assumes a: "A (a x)" 

371 
shows "P (a x)" 

372 
using a 

20503  373 
proof (induct n == "a x" arbitrary: x) 
18233  374 
... 
375 

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

378 

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

381 
encodings: 

382 

383 
lemma 

384 
fixes n :: nat 

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

20503  386 
proof (induct n arbitrary: thesis) 
18267  387 
case 0 
388 
obtain x where "P 0 x" and "Q 0 x" sorry 

18399  389 
then show thesis by (rule 0) 
18267  390 
next 
391 
case (Suc n) 

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

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

394 
then show thesis by (rule Suc.prems) 

395 
qed 

396 

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

18267  399 
existence statement through the induction as expected. 
18233  400 

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

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

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

403 
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

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

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

406 

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

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

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

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

410 

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

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

412 
new format. 
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 
* Provers/induct: improved handling of simultaneous goals. Instead of 
96260fb11449
* Provers/induct: support simultaneous goals with mutual rules;
wenzelm
parents:
18495
diff
changeset

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

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

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

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

419 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

438 

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

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

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

441 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

462 
show "P (Suc n)" sorry 
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 2 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

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

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

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

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

469 

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

470 
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

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

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

473 

18507  474 
lemma 
475 
shows "a : A ==> P1 a" 

476 
"a : A ==> P2 a" 

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

478 
"b : B ==> Q2 b" 

479 
"b : B ==> Q3 b" 

480 
proof (induct set: A B) 

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

481 

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

484 

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

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

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

487 

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

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

491 
trace indicates where parts have been suppressed. 

18674  492 

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

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

494 
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

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

496 

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

499 
least one premise. 

500 

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

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

505 

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

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

507 
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

508 
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

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

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

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

512 

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

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

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

515 
for example "A > B" => "Pi A (%_. B)". 
17779  516 

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

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

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

519 

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

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

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

522 

17865  523 

17806  524 
*** HOL *** 
525 

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

528 

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

530 

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

532 

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

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

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

535 

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

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

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

538 

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

541 

22450  542 
* 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

543 

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

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

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

546 

22450  547 
classes "meet_semilorder" and "join_semilorder" now named 
548 
"lower_semilattice" and "upper_semilattice" 

549 
class "lorder" now named "lattice" 

550 
class "comp_lat" now named "complete_lattice" 

551 

552 
Instantiation of lattice classes allows explicit definitions 

553 
for "inf" and "sup" operations. 

554 

555 
INCOMPATIBILITY. Theorem renames: 

556 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

592 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

610 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

639 

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

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

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

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

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

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

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

646 

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

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

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

649 

22450  650 
meet_min ~> inf_min 
651 
join_max ~> sup_max 

652 

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

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

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

656 

22845  657 
* Classes "order" and "linorder": 
22316  658 
potential INCOMPATIBILITY: order of proof goals in order/linorder instance 
659 
proofs changed. 

660 

22218  661 
* Dropped lemma duplicate def_imp_eq in favor of meta_eq_to_obj_eq. 
662 
INCOMPATIBILITY. 

663 

664 
* Dropped lemma duplicate if_def2 in favor of if_bool_eq_conj. 

665 
INCOMPATIBILITY. 

666 

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

669 

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

22316  671 
dvd" to "Divides.div", "Divides.mod" and "Divides.dvd". INCOMPATIBILITY. 
22126  672 

673 
* Added method "lexicographic_order" automatically synthesizes 

674 
termination relations as lexicographic combinations of size measures 

675 
 'function' package. 

676 

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

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

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

680 
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

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

682 

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

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

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

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

688 

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

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

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

692 

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

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

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

695 

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

699 

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

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

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

703 

704 
* Renamed constants "0" to "HOL.zero" and "1" to "HOL.one". 

705 
INCOMPATIBILITY. 

706 

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

708 
generation with polymorphic equality. 

709 

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

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

712 
significant changes for setting up numeral syntax for types: 

20485  713 

714 
 new constants Numeral.pred and Numeral.succ instead 

715 
of former Numeral.bin_pred and Numeral.bin_succ. 

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

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

718 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

719 

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

721 

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

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

725 
suitable for heavyduty computations because the functions are 

726 
compiled to ML first. 

19895  727 

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

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

731 

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

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

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

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

736 
op * ~> HOL.times 
19277  737 
op < ~> Orderings.less 
738 
op <= ~> Orderings.less_eq 

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

739 

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

740 
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

741 

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

744 
may go wrong. 

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

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

746 

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

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

749 

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

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

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

754 
distribution). 

755 
INCOMPATIBILITY: rewrite proofs 

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

756 

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

757 
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

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

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

760 

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

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

764 

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

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

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

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

769 

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

19377  772 

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

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

17779  776 

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

779 

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

19211  781 

19279  782 
* Theorem setsum_mult renamed to setsum_right_distrib. 
783 

19211  784 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
22126  785 
``rule'' method. 
786 

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

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

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

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

791 
speedup. 

792 

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

794 
zChaff is still supported as well. 

795 

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

797 
bundled as foo_bar.inducts; 

798 

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

800 
Library. 

21256  801 

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

803 

18446  804 
* Library: added theory Coinductive_List of potentially infinite lists 
805 
as greatest fixedpoint. 

18399  806 

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

809 

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

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

20807  813 

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

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

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

818 

22126  819 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  820 

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

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

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

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

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

827 

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

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

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

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

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

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

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

835 

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

837 
is available in HOL/ex/ReflectionEx.thy 

838 

839 

20169  840 
*** HOLAlgebra *** 
841 

21170  842 
* Formalisation of ideals and the quotient construction over rings. 
843 

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

845 
INCOMPATIBILITY. 

846 

22126  847 
* Renamed lemmas least_carrier > least_closed and greatest_carrier > 
848 
greatest_closed. INCOMPATIBILITY. 

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

849 

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

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

853 

22126  854 
* Renamed theory CRing to Ring. 
20169  855 

20807  856 

19653  857 
*** HOLComplex *** 
858 

859 
* Theory Real: new method ferrack implements quantifier elimination 

860 
for linear arithmetic over the reals. The quantifier elimination 

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

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

863 

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

866 
and norm :: 'a => real. 

867 

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

870 
is now defined as range of_real; potential INCOMPATIBILITY. 

871 

872 
* Hyperreal: Several constants that previously worked only for the 

873 
reals have been generalized, so they now work over arbitrary vector 

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

875 
INCOMPATIBILITY. 

21791  876 

877 
Infinitesimal :: ('a::real_normed_vector) star set" 

878 
HFinite :: ('a::real_normed_vector) star set" 

879 
HInfinite :: ('a::real_normed_vector) star set" 

880 
approx :: ('a::real_normed_vector) star => 'a star => bool 

881 
monad :: ('a::real_normed_vector) star => 'a star set 

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

883 
(NS)LIMSEQ :: [nat, 'a::real_normed_vector, 'a] => bool 

884 
(NS)convergent :: (nat => 'a::real_normed_vector) => bool 

885 
(NS)Bseq :: (nat => 'a::real_normed_vector) => bool 

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

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

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

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

890 

891 
* Complex: Some complexspecific constants are now abbreviations for 

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

894 
polymorphic versions (INCOMPATIBILITY): 

21791  895 

896 
approx < capprox 

897 
HFinite < CFinite 

898 
HInfinite < CInfinite 

899 
Infinitesimal < CInfinitesimal 

900 
monad < cmonad 

901 
galaxy < cgalaxy 

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

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

904 
(ns)deriv < (ns)cderiv 

905 

19653  906 

17878  907 
*** ML *** 
908 

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

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

22848  913 

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

916 
compiletime. For example: 

917 

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

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

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

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

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

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

924 
ML {* @{thm asm_rl} *} 

925 
ML {* @{thms asm_rl} *} 

22376  926 
ML {* @{const_name c} *} 
927 
ML {* @{const_syntax c} *} 

22138  928 
ML {* @{context} *} 
929 
ML {* @{theory} *} 

930 
ML {* @{theory Pure} *} 

931 
ML {* @{simpset} *} 

932 
ML {* @{claset} *} 

933 
ML {* @{clasimpset} *} 

934 

22151  935 
The same works for sources being ``used'' within an Isar context. 
936 

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

939 

20348  940 
* Pure/library: 
941 

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

942 
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

943 
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

944 

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

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

950 

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

953 

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

954 
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

955 
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

956 

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

959 
given more convenient names and signatures reminiscent of similar 

960 
functions for alists, tables, etc: 

18051  961 

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

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

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

965 

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

968 

22126  969 
* Pure/library: added general ``divide_and_conquer'' combinator on 
970 
lists. 

19032  971 

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

973 
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

974 
admits slightly more efficient complex applications. 
18446  975 

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

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

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

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

982 

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

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

18738  986 
minimizing code duplication. Thm.rule_attribute and 
987 
Thm.declaration_attribute build canonical attributes; see also 

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

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

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

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

991 

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

22126  994 
logic, but only for type inference.) IMPORTANT INTERNAL CHANGE, 
995 
potential INCOMPATIBILITY. 

19508  996 

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

998 
explicit proofs of class axioms and super class relations performed 

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

1000 
notably AxClass.define_class supercedes AxClass.add_axclass, and 

1001 
AxClass.axiomatize_class/classrel/arity supercede 

1002 
Sign.add_classes/classrel/arities. 

1003 

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

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

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

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

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

1008 
attributes, methods, etc. 
18642  1009 

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

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

1013 
fold_map combinators. 

18051  1014 

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

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

1016 
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

1017 
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

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

1019 

18020  1020 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  1021 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  1022 
achieve the old behaviour. 
1023 

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

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

1026 
statements. 

1027 

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

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

1029 
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

1030 
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

1031 

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

1034 
some popular functions from term.ML: 

1035 

1036 
Term.variant > Name.variant 

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

1038 
Term.invent_names > Name.invent_list 

1039 

1040 
Note that lowlevel renaming rarely occurs in new code  operations 

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

1042 

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

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

1044 
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

1045 
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

1046 
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

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

1048 

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

1050 
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

1051 
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

1052 
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

1053 
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

1054 
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

1055 
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

1056 
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

1057 

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

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

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

1061 
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

1062 
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

1063 

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

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

1065 

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

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

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

1069 

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

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

1071 

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

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

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

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

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

1076 

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

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

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

1079 

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

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

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

1082 

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

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

1084 
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

1085 
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

1086 
batch mode. 
18567  1087 

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

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

17890  1091 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  1092 
(solver, looper etc.) may depend on arbitrary proof data. 
1093 

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

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

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

1097 
former Simplifier.inherit_bounds, which is already included here  

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

17878  1100 

1101 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

1104 
INCOMPATIBILITY. 

1105 

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

1108 

17878  1109 

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

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

1111 

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

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

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

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

1115 

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

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

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

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

1119 

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

1120 

17720  1121 
New in Isabelle2005 (October 2005) 
1122 
 

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

1123 

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

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

1125 

15130  1126 
* Theory headers: the new header syntax for Isar theories is 
1127 

1128 
theory <name> 

16234  1129 
imports <theory1> ... <theoryN> 
1130 
uses <file1> ... <fileM> 

15130  1131 
begin 
1132 

16234  1133 
where the 'uses' part is optional. The previous syntax 
1134 

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

1136 

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

17371  1139 
nonIsar theories now, but these will disappear soon. 
15130  1140 

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

1141 
* Theory loader: parent theories can now also be referred to via 
16234  1142 
relative and absolute paths. 
1143 

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

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

1145 
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

1146 
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

1147 
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

1148 
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

1149 
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

1150 
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

1151 
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

1152 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  1153 

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

1154 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  1155 

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

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

1158 
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

1159 

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

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

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

1162 

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

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

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

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

17385  1170 

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

1173 
faster. 

1174 

15703  1175 

1176 
*** Document preparation *** 

1177 

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

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

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

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

1183 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

1184 

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

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

1186 
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

1187 
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

1188 
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

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

1190 
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

1191 
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

1192 
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

1193 
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

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

1195 

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

1196 
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

1197 
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

1198 
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

1199 
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

1200 
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

1201 
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

1202 
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

1203 
specified above. 
16234  1204 

17402  1205 
* Several new antiquotations: 
15979  1206 

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

1208 

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

1210 

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

15979  1213 

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

16234  1215 
theorem applying a "style" to it 
1216 

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

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

1218 

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

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

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

1225 
typechecked ML expressions verbatim. 
16234  1226 

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

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

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

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

1231 

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

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

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

1235 

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

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

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

1238 

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

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

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

1241 

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

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

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

1244 

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

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

1246 
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

1247 
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

1248 

16234  1249 

1250 
*** Pure *** 

1251 

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

1253 
automatic typeinference of declared constants; additional support for 

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

1255 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

1256 
sequential dependencies of definitions within a single 'constdefs' 

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

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

1259 

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

1261 
indexed syntax provides a notational device for subscripted 

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

1263 
expressions. Secondly, in a local context with structure 

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

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

1266 
show_structs controls printing of implicit structures. Typical 

1267 
applications of these concepts involve record types and locales. 

1268 

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

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

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

1272 

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

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

1275 
parsing/printing, see also isarref manual. 

1276 

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

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

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

1281 
INCOMPATIBILITY. 

1282 

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

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

1284 
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

1285 
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

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

1287 

16234  1288 
* Improved internal renaming of symbolic identifiers  attach primes 
1289 
instead of base 26 numbers. 

1290 

1291 
* New flag show_question_marks controls printing of leading question 

1292 
marks in schematic variable names. 

1293 

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

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

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

1297 

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

1299 
by simp 

1300 

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

1302 

17548  1303 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  1304 
annotations as "(00...)". 
1305 

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

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

1308 
Before that distinction was only partially implemented via type class 

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

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

1311 
exotic syntax specifications may require further adaption 

17691  1312 
(e.g. Cube/Cube.thy). 
16234  1313 

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

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

1316 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

1317 
specifications. 

1318 

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

1321 

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

1324 
Limit. 

1325 

1326 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

1332 
allow for use in a context of fixed variables. 

1333 

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

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

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

1337 

17597  1338 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  1339 

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

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

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

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

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

1346 

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

1348 
selections of theorems in named facts via index ranges. 

1349 

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

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

1351 
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

1352 
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

1353 

17397  1354 
* 'hide': option '(open)' hides only base names. 
1355 

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

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

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

1358 

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

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

1362 
must be quoted when used as identifiers. 

1363 

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

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

1366 
quoted when used as identifier. 

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

1367 

16234  1368 

1369 
*** Locales *** 

17095  1370 

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

1373 
proof obligations from the expression specification. After the 

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

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

1376 
commands is a follows: 

1377 

17095  1378 
(1) interpretation expr inst 
1379 
(2) interpretation target < expr 

1380 
(3) interpret expr inst 

17385  1381 

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

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

1386 
locale expression. Interpretation is smart in that interpretations 

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

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

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

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

16234  1392 

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

1394 
'interpret' instead. 

1395 

17385  1396 
* New context element 'constrains' for adding type constraints to 
1397 
parameters. 

1398 

1399 
* Context expressions: renaming of parameters with syntax 

1400 
redeclaration. 

17095  1401 

1402 
* Locale declaration: 'includes' disallowed. 

1403 

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

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

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

1408 
to attribute arguments as expected. 

1409 

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

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

421c3522f160
major reorganization and cleanup;
wenzelm 