author  wenzelm 
Mon, 30 Apr 2007 13:32:58 +0200  
changeset 22826  0f4c501a691e 
parent 22799  ed7d53db2170 
child 22845  5f9138bcb3d7 
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 

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

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

24 

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

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

26 
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

27 
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

28 
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

29 
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

30 
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

31 
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

32 

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

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

34 

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

37 
suppressed from proof state output. Note that the ProofGeneral 

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

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

40 
limit is imposed. 

41 

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

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

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

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

45 
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

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

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

48 

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

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

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

51 

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

52 

17865  53 
*** Document preparation *** 
54 

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

57 
current context. 

21339  58 

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

17865  61 

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

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

66 

17865  67 

17779  68 
*** Pure *** 
69 

22735  70 
* code generator: 
71 
 Isar "definition"s and primitive instance definitions are added explicitly 

72 
to the table of defining equations 

22754  73 
 primitive definitions are not used as defining equations by default any longer 
22735  74 
 defining equations are now definitly restricted to meta "==" and object 
75 
equality "=" 

76 
 HOL theories have been adopted accordingly 

77 

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

80 
HOL/ex/Classpackage.thy for examples. 

81 

82 
* Yet another code generator framework allows to generate executable 

83 
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

84 

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

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

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

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

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

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

93 

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

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

95 

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

96 
Theorem attributs for selecting and transforming function equations theorems: 
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 
[code fun]: select a theorem as function equation for a specific constant 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

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

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

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

102 

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

104 

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

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

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

107 

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

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

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

110 

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

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

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

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

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

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

118 

22735  119 
code_instance and code_class only apply to target Haskell. 
120 

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

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

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

123 

19254  124 
* Command 'no_translations' removes translation rules from theory 
125 
syntax. 

126 

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

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

130 
correspondence to type class and instance declarations. 

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

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

19711  133 

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

135 
instantiation that matches an instance against the most general 

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

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

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

139 
recursion over such type arguments. Incomplete specification patterns 

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

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

144 

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

147 

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

149 
then guess x and y by clarify 

150 

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

152 
proof tools being involved here. 

153 

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

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

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

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

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

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

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

162 

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

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

18020  166 

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

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

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

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

171 

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

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

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

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

175 

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

178 

18308  179 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
180 

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

182 

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

185 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  186 
'unfolded' attribute may be replaced by firstclass proof text. 
187 

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

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

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

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

191 
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

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

193 

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

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

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

199 
originally first one. 

19220  200 

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

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

202 
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

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

204 

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

207 
(essentially a disjunction of cases with local parameters and 

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

18910  209 
adequately; in this notation common elimination rules look like this: 
18901  210 

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

212 
assumes "EX x. P x" 

213 
obtains x where "P x" 

214 

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

216 
assumes "A & B" 

217 
obtains A and B 

218 

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

220 
assumes "A  B" 

221 
obtains 

222 
A 

223 
 B 

224 

18910  225 
The subsequent classical rules even refer to the formal "thesis" 
18901  226 
explicitly: 
227 

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

229 
obtains "~ thesis" 

230 

18910  231 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
232 
obtains "thesis ==> something" 

18901  233 

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

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

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

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

239 
case_names). 

18901  240 

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

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

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

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

244 
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

245 

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

248 
toplevel lemma. 

249 

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

252 

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

255 
to occur. 

256 

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

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

258 
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

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

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

261 

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

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

263 
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

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

265 

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

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

267 
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

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

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

270 

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

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

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

275 

19665  276 
axiomatization 
21595  277 
eq (infix "===" 50) where 
278 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

279 

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

281 
definition g where "g x = f x x" 

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

282 

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

286 

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

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

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

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

294 

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

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

298 
'translations' in common applications. 

19084  299 

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

300 
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

301 
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

302 
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

303 
'translations' with explicit "CONST" markup to accommodate this. 
19665  304 

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

307 
abbreviations on output. 

308 

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

311 
 parameter renamings are no longer required to be injective. 

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

313 
locale endom = homom mult mult h. 

314 

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

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

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

319 
predicates, goals repesenting already interpreted fragments are not 

320 
removed automatically. Use methods `intro_locales' and 

321 
`unfold_locales'; see below. 

322 

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

324 
provide backward reasoning on locales predicates. The methods are 

325 
aware of interpretations and discharge corresponding goals. 

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

327 
unfold predicates to assumptions. 

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

328 

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

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

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

332 

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

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

336 
(using objectlogic connectives for this purpose has been long 

337 
obsolete anyway). The subsequent proof patterns illustrate advanced 

338 
techniques of natural induction; general datatypes and inductive sets 

18267  339 
work analogously (see also src/HOL/Lambda for realistic examples). 
340 

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

18239  342 
parameters: 
18233  343 

344 
lemma 

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

346 
assumes a: "A n x" 

347 
shows "P n x" 

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

20503  349 
proof (induct n arbitrary: x)  {* generalize goal to "!!x. A n x ==> P n x" *} 
18248  350 
case 0 
18233  351 
show ?case sorry 
352 
next 

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

18233  356 
show ?case sorry 
357 
qed 

358 

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

364 
lemma 

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

366 
assumes a: "A (a x)" 

367 
shows "P (a x)" 

368 
using a 

20503  369 
proof (induct n == "a x" arbitrary: x) 
18233  370 
... 
371 

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

374 

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

377 
encodings: 

378 

379 
lemma 

380 
fixes n :: nat 

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

20503  382 
proof (induct n arbitrary: thesis) 
18267  383 
case 0 
384 
obtain x where "P 0 x" and "Q 0 x" sorry 

18399  385 
then show thesis by (rule 0) 
18267  386 
next 
387 
case (Suc n) 

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

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

390 
then show thesis by (rule Suc.prems) 

391 
qed 

392 

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

18267  395 
existence statement through the induction as expected. 
18233  396 

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

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

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

399 
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

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

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

402 

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

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

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

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

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

409 

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

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

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

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

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

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

415 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

434 

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

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

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

437 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

465 

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

466 
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

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

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

469 

18507  470 
lemma 
471 
shows "a : A ==> P1 a" 

472 
"a : A ==> P2 a" 

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

474 
"b : B ==> Q2 b" 

475 
"b : B ==> Q3 b" 

476 
proof (induct set: A B) 

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

477 

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

480 

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

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

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

483 

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

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

487 
trace indicates where parts have been suppressed. 

18674  488 

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

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

490 
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

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

492 

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

495 
least one premise. 

496 

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

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

501 

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

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

503 
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

504 
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

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

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

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

508 

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

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

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

511 
for example "A > B" => "Pi A (%_. B)". 
17779  512 

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

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

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

515 

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

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

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

518 

17865  519 

17806  520 
*** HOL *** 
521 

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

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

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

524 

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

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

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

527 

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

530 

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

532 

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

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

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

535 

22450  536 
classes "meet_semilorder" and "join_semilorder" now named 
537 
"lower_semilattice" and "upper_semilattice" 

538 
class "lorder" now named "lattice" 

539 
class "comp_lat" now named "complete_lattice" 

540 

541 
Instantiation of lattice classes allows explicit definitions 

542 
for "inf" and "sup" operations. 

543 

544 
INCOMPATIBILITY. Theorem renames: 

545 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

581 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

599 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

628 

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

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

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

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

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

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

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

635 

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

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

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

638 

22450  639 
meet_min ~> inf_min 
640 
join_max ~> sup_max 

641 

22384
33a46e6c7f04
prefix of class interpretation not mandatory any longer
haftmann
parents:
22376
diff
changeset

642 
* Class (axclass + locale) "preorder" and "linear": facts "refl", "trans" and 
33a46e6c7f04
prefix of class interpretation not mandatory any longer
haftmann
parents:
22376
diff
changeset

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

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

645 

22316  646 
* Addes class (axclass + locale) "preorder" as superclass of "order"; 
647 
potential INCOMPATIBILITY: order of proof goals in order/linorder instance 

648 
proofs changed. 

649 

22218  650 
* Dropped lemma duplicate def_imp_eq in favor of meta_eq_to_obj_eq. 
651 
INCOMPATIBILITY. 

652 

653 
* Dropped lemma duplicate if_def2 in favor of if_bool_eq_conj. 

654 
INCOMPATIBILITY. 

655 

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

658 

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

22316  660 
dvd" to "Divides.div", "Divides.mod" and "Divides.dvd". INCOMPATIBILITY. 
22126  661 

662 
* Added method "lexicographic_order" automatically synthesizes 

663 
termination relations as lexicographic combinations of size measures 

664 
 'function' package. 

665 

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

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

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

669 
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

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

671 

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

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

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

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

677 

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

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

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

681 

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

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

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

684 

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

688 

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

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

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

692 

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

694 
INCOMPATIBILITY. 

695 

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

697 
generation with polymorphic equality. 

698 

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

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

701 
significant changes for setting up numeral syntax for types: 

20485  702 

703 
 new constants Numeral.pred and Numeral.succ instead 

704 
of former Numeral.bin_pred and Numeral.bin_succ. 

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

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

707 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

708 

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

710 

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

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

714 
suitable for heavyduty computations because the functions are 

715 
compiled to ML first. 

19895  716 

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

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

720 

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

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

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

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

725 
op * ~> HOL.times 
19277  726 
op < ~> Orderings.less 
727 
op <= ~> Orderings.less_eq 

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

728 

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

729 
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

730 

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

733 
may go wrong. 

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

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

735 

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

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

738 

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

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

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

743 
distribution). 

744 
INCOMPATIBILITY: rewrite proofs 

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

745 

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

746 
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

747 
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

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

749 

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

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

753 

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

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

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

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

758 

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

19377  761 

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

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

17779  765 

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

768 

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

19211  770 

19279  771 
* Theorem setsum_mult renamed to setsum_right_distrib. 
772 

19211  773 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
22126  774 
``rule'' method. 
775 

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

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

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

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

780 
speedup. 

781 

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

783 
zChaff is still supported as well. 

784 

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

786 
bundled as foo_bar.inducts; 

787 

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

789 
Library. 

21256  790 

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

792 

18446  793 
* Library: added theory Coinductive_List of potentially infinite lists 
794 
as greatest fixedpoint. 

18399  795 

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

798 

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

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

20807  802 

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

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

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

807 

22126  808 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  809 

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

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

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

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

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

816 

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

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

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

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

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

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

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

824 

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

826 
is available in HOL/ex/ReflectionEx.thy 

827 

828 

20169  829 
*** HOLAlgebra *** 
830 

21170  831 
* Formalisation of ideals and the quotient construction over rings. 
832 

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

834 
INCOMPATIBILITY. 

835 

22126  836 
* Renamed lemmas least_carrier > least_closed and greatest_carrier > 
837 
greatest_closed. INCOMPATIBILITY. 

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

838 

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

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

842 

22126  843 
* Renamed theory CRing to Ring. 
20169  844 

20807  845 

19653  846 
*** HOLComplex *** 
847 

848 
* Theory Real: new method ferrack implements quantifier elimination 

849 
for linear arithmetic over the reals. The quantifier elimination 

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

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

852 

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

855 
and norm :: 'a => real. 

856 

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

859 
is now defined as range of_real; potential INCOMPATIBILITY. 

860 

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

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

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

864 
INCOMPATIBILITY. 

21791  865 

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

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

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

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

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

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

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

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

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

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

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

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

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

879 

880 
* Complex: Some complexspecific constants are now abbreviations for 

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

883 
polymorphic versions (INCOMPATIBILITY): 

21791  884 

885 
approx < capprox 

886 
HFinite < CFinite 

887 
HInfinite < CInfinite 

888 
Infinitesimal < CInfinitesimal 

889 
monad < cmonad 

890 
galaxy < cgalaxy 

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

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

893 
(ns)deriv < (ns)cderiv 

894 

19653  895 

17878  896 
*** ML *** 
897 

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

900 
compiletime. For example: 

901 

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

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

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

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

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

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

908 
ML {* @{thm asm_rl} *} 

909 
ML {* @{thms asm_rl} *} 

22376  910 
ML {* @{const_name c} *} 
911 
ML {* @{const_syntax c} *} 

22138  912 
ML {* @{context} *} 
913 
ML {* @{theory} *} 

914 
ML {* @{theory Pure} *} 

915 
ML {* @{simpset} *} 

916 
ML {* @{claset} *} 

917 
ML {* @{clasimpset} *} 

918 

22151  919 
The same works for sources being ``used'' within an Isar context. 
920 

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

923 

20348  924 
* Pure/library: 
925 

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

926 
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

927 
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

928 

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

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

934 

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

937 

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

938 
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

939 
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

940 

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

943 
given more convenient names and signatures reminiscent of similar 

944 
functions for alists, tables, etc: 

18051  945 

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

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

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

949 

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

952 

22126  953 
* Pure/library: added general ``divide_and_conquer'' combinator on 
954 
lists. 

19032  955 

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

957 
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

958 
admits slightly more efficient complex applications. 
18446  959 

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

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

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

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

966 

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

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

18738  970 
minimizing code duplication. Thm.rule_attribute and 
971 
Thm.declaration_attribute build canonical attributes; see also 

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

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

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

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

975 

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

22126  978 
logic, but only for type inference.) IMPORTANT INTERNAL CHANGE, 
979 
potential INCOMPATIBILITY. 

19508  980 

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

982 
explicit proofs of class axioms and super class relations performed 

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

984 
notably AxClass.define_class supercedes AxClass.add_axclass, and 

985 
AxClass.axiomatize_class/classrel/arity supercede 

986 
Sign.add_classes/classrel/arities. 

987 

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

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

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

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

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

992 
attributes, methods, etc. 
18642  993 

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

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

997 
fold_map combinators. 

18051  998 

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

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

1000 
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

1001 
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

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

1003 

18020  1004 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  1005 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  1006 
achieve the old behaviour. 
1007 

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

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

1010 
statements. 

1011 

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

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

1013 
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

1014 
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

1015 

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

1018 
some popular functions from term.ML: 

1019 

1020 
Term.variant > Name.variant 

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

1022 
Term.invent_names > Name.invent_list 

1023 

1024 
Note that lowlevel renaming rarely occurs in new code  operations 

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

1026 

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

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

1028 
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

1029 
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

1030 
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

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

1032 

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

1034 
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

1035 
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

1036 
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

1037 
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

1038 
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

1039 
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

1040 
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

1041 

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

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

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

1045 
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

1046 
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

1047 

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

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

1049 

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

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

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

1053 

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

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

1055 

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

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

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

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

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

1060 

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

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

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

1063 

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

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

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

1066 

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

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

1068 
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

1069 
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

1070 
batch mode. 
18567  1071 

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

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

17890  1075 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  1076 
(solver, looper etc.) may depend on arbitrary proof data. 
1077 

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

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

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

1081 
former Simplifier.inherit_bounds, which is already included here  

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

17878  1084 

1085 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

1088 
INCOMPATIBILITY. 

1089 

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

1092 

17878  1093 

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

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

1095 

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

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

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

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

1099 

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

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

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

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

1103 

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

1104 

17720  1105 
New in Isabelle2005 (October 2005) 
1106 
 

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

1107 

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

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

1109 

15130  1110 
* Theory headers: the new header syntax for Isar theories is 
1111 

1112 
theory <name> 

16234  1113 
imports <theory1> ... <theoryN> 
1114 
uses <file1> ... <fileM> 

15130  1115 
begin 
1116 

16234  1117 
where the 'uses' part is optional. The previous syntax 
1118 

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

1120 

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

17371  1123 
nonIsar theories now, but these will disappear soon. 
15130  1124 

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

1125 
* Theory loader: parent theories can now also be referred to via 
16234  1126 
relative and absolute paths. 
1127 

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

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

1129 
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

1130 
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

1131 
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

1132 
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

1133 
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

1134 
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

1135 
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

1136 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  1137 

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

1138 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  1139 

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

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

1142 
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

1143 

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

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

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

1146 

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

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

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

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

17385  1154 

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

1157 
faster. 

1158 

15703  1159 

1160 
*** Document preparation *** 

1161 

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

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

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

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

1167 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

1168 

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

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

1170 
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

1171 
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

1172 
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

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

1174 
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

1175 
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

1176 
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

1177 
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

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

1179 

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

1180 
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

1181 
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

1182 
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

1183 
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

1184 
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

1185 
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

1186 
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

1187 
specified above. 
16234  1188 

17402  1189 
* Several new antiquotations: 
15979  1190 

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

1192 

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

1194 

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

15979  1197 

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

16234  1199 
theorem applying a "style" to it 
1200 

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

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

1202 

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

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

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

1209 
typechecked ML expressions verbatim. 
16234  1210 

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

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

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

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

1215 

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

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

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

1219 

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

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

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

1222 

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

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

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

1225 

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

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

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

1228 

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

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

1230 
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

1231 
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

1232 

16234  1233 

1234 
*** Pure *** 

1235 

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

1237 
automatic typeinference of declared constants; additional support for 

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

1239 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

1240 
sequential dependencies of definitions within a single 'constdefs' 

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

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

1243 

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

1245 
indexed syntax provides a notational device for subscripted 

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

1247 
expressions. Secondly, in a local context with structure 

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

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

1250 
show_structs controls printing of implicit structures. Typical 

1251 
applications of these concepts involve record types and locales. 

1252 

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

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

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

1256 

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

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

1259 
parsing/printing, see also isarref manual. 

1260 

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

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

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

1265 
INCOMPATIBILITY. 

1266 

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

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

1268 
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

1269 
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

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

1271 

16234  1272 
* Improved internal renaming of symbolic identifiers  attach primes 
1273 
instead of base 26 numbers. 

1274 

1275 
* New flag show_question_marks controls printing of leading question 

1276 
marks in schematic variable names. 

1277 

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

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

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

1281 

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

1283 
by simp 

1284 

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

1286 

17548  1287 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  1288 
annotations as "(00...)". 
1289 

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

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

1292 
Before that distinction was only partially implemented via type class 

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

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

1295 
exotic syntax specifications may require further adaption 

17691  1296 
(e.g. Cube/Cube.thy). 
16234  1297 

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

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

1300 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

1301 
specifications. 

1302 

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

1305 

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

1308 
Limit. 

1309 

1310 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

1316 
allow for use in a context of fixed variables. 

1317 

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

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

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

1321 

17597  1322 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  1323 

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

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

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

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

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

1330 

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

1332 
selections of theorems in named facts via index ranges. 

1333 

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

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

1335 
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

1336 
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

1337 

17397  1338 
* 'hide': option '(open)' hides only base names. 
1339 

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

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

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

1342 

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

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

1346 
must be quoted when used as identifiers. 

1347 

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

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

1350 
quoted when used as identifier. 

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

1351 

16234  1352 

1353 
*** Locales *** 

17095  1354 

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

1357 
proof obligations from the expression specification. After the 

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

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

1360 
commands is a follows: 

1361 

17095  1362 
(1) interpretation expr inst 
1363 
(2) interpretation target < expr 

1364 
(3) interpret expr inst 

17385  1365 

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

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

1370 
locale expression. Interpretation is smart in that interpretations 

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

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

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

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

16234  1376 

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

1378 
'interpret' instead. 

1379 

17385  1380 
* New context element 'constrains' for adding type constraints to 
1381 
parameters. 

1382 

1383 
* Context expressions: renaming of parameters with syntax 

1384 
redeclaration. 

17095  1385 

1386 
* Locale declaration: 'includes' disallowed. 

1387 

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

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

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

1392 
to attribute arguments as expected. 

1393 

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

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

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

1397 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

1403 
values to argument tokens explicitly. 

1404 

1405 
* Changed parameter management in theorem generation for long goal 

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

1407 
theorem statement in rare situations. 

1408 

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

1411 

16234  1412 
