author  wenzelm 
Thu, 26 Apr 2007 14:24:08 +0200  
changeset 22808  a7daa74e2980 
parent 22799  ed7d53db2170 
child 22826  0f4c501a691e 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

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

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

6 

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

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

8 

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

9 
* Theory syntax: the header format ``theory A = B + C:'' has been 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

10 
discontinued in favour of ``theory A imports B C begin''. Use isatool 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

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

12 

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

13 
* Theory syntax: the old nonIsar theory file format has been 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

14 
discontinued altogether. Note that ML proof scripts may still be used 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

15 
with Isar theories; migration is usually quite simple with the ML 
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

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

17 

21735  18 
* Theory syntax: some popular names (e.g. "class", "fun", "help", 
19 
"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

20 

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

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

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

23 
functions are now part of the OldGoals structure, which is *not* open 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

24 
by default (consider isatool expandshort before open OldGoals). 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

25 
Removed top_sg, prin, printyp, pprint_term/typ altogether, because 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

26 
these tend to cause confusion about the actual goal (!) context being 
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

27 
used here, which is not necessarily the same as the_context(). 
17918
93e26302733e
* Theory syntax: discontinued nonIsar format and old Isar headers;
wenzelm
parents:
17890
diff
changeset

28 

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

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

30 

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

33 
suppressed from proof state output. Note that the ProofGeneral 

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

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

36 
limit is imposed. 

37 

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

38 
* Local theory targets may be specified by nonnested blocks of 
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset

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

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

41 
that has been implemented on top of these primitives. This concept 
73883a528b26
* Local theory targets ``context/locale/class ... begin'' followed by ``end''.
wenzelm
parents:
21265
diff
changeset

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

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

44 

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

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

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

47 

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

48 

17865  49 
*** Document preparation *** 
50 

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

53 
current context. 

21339  54 

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

17865  57 

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

21735  60 
arguments may be given on the LHS.) 
21717  61 

62 

17865  63 

17779  64 
*** Pure *** 
65 

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

68 
to the table of defining equations 

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

72 
 HOL theories have been adopted accordingly 

73 

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

76 
HOL/ex/Classpackage.thy for examples. 

77 

78 
* Yet another code generator framework allows to generate executable 

79 
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

80 

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

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

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

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

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

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

89 

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

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

91 

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

92 
Theorem attributs for selecting and transforming function equations theorems: 
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 
[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

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

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

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

98 

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

100 

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

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

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

103 

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

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

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

106 

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

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

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

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

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

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

114 

22735  115 
code_instance and code_class only apply to target Haskell. 
116 

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

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

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

119 

19254  120 
* Command 'no_translations' removes translation rules from theory 
121 
syntax. 

122 

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

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

126 
correspondence to type class and instance declarations. 

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

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

19711  129 

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

131 
instantiation that matches an instance against the most general 

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

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

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

135 
recursion over such type arguments. Incomplete specification patterns 

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

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

140 

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

143 

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

145 
then guess x and y by clarify 

146 

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

148 
proof tools being involved here. 

149 

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

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

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

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

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

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

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

158 

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

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

18020  162 

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

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

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

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

167 

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

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

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

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

171 

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

174 

18308  175 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
176 

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

178 

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

181 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  182 
'unfolded' attribute may be replaced by firstclass proof text. 
183 

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

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

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

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

187 
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

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

189 

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

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

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

195 
originally first one. 

19220  196 

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

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

198 
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

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

200 

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

203 
(essentially a disjunction of cases with local parameters and 

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

18910  205 
adequately; in this notation common elimination rules look like this: 
18901  206 

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

208 
assumes "EX x. P x" 

209 
obtains x where "P x" 

210 

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

212 
assumes "A & B" 

213 
obtains A and B 

214 

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

216 
assumes "A  B" 

217 
obtains 

218 
A 

219 
 B 

220 

18910  221 
The subsequent classical rules even refer to the formal "thesis" 
18901  222 
explicitly: 
223 

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

225 
obtains "~ thesis" 

226 

18910  227 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
228 
obtains "thesis ==> something" 

18901  229 

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

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

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

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

235 
case_names). 

18901  236 

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

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

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

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

240 
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

241 

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

244 
toplevel lemma. 

245 

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

248 

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

251 
to occur. 

252 

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

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

254 
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

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

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

257 

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

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

259 
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

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

261 

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

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

263 
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

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

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

266 

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

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

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

271 

19665  272 
axiomatization 
21595  273 
eq (infix "===" 50) where 
274 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

275 

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

277 
definition g where "g x = f x x" 

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

278 

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

282 

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

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

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

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

290 

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

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

294 
'translations' in common applications. 

19084  295 

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

296 
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

297 
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

298 
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

299 
'translations' with explicit "CONST" markup to accommodate this. 
19665  300 

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

303 
abbreviations on output. 

304 

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

307 
 parameter renamings are no longer required to be injective. 

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

309 
locale endom = homom mult mult h. 

310 

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

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

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

315 
predicates, goals repesenting already interpreted fragments are not 

316 
removed automatically. Use methods `intro_locales' and 

317 
`unfold_locales'; see below. 

318 

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

320 
provide backward reasoning on locales predicates. The methods are 

321 
aware of interpretations and discharge corresponding goals. 

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

323 
unfold predicates to assumptions. 

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

324 

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

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

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

328 

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

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

332 
(using objectlogic connectives for this purpose has been long 

333 
obsolete anyway). The subsequent proof patterns illustrate advanced 

334 
techniques of natural induction; general datatypes and inductive sets 

18267  335 
work analogously (see also src/HOL/Lambda for realistic examples). 
336 

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

18239  338 
parameters: 
18233  339 

340 
lemma 

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

342 
assumes a: "A n x" 

343 
shows "P n x" 

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

20503  345 
proof (induct n arbitrary: x)  {* generalize goal to "!!x. A n x ==> P n x" *} 
18248  346 
case 0 
18233  347 
show ?case sorry 
348 
next 

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

18233  352 
show ?case sorry 
353 
qed 

354 

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

360 
lemma 

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

362 
assumes a: "A (a x)" 

363 
shows "P (a x)" 

364 
using a 

20503  365 
proof (induct n == "a x" arbitrary: x) 
18233  366 
... 
367 

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

370 

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

373 
encodings: 

374 

375 
lemma 

376 
fixes n :: nat 

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

20503  378 
proof (induct n arbitrary: thesis) 
18267  379 
case 0 
380 
obtain x where "P 0 x" and "Q 0 x" sorry 

18399  381 
then show thesis by (rule 0) 
18267  382 
next 
383 
case (Suc n) 

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

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

386 
then show thesis by (rule Suc.prems) 

387 
qed 

388 

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

18267  391 
existence statement through the induction as expected. 
18233  392 

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

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

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

395 
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

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

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

398 

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

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

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

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

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

405 

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

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

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

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

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

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

411 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

430 

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

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

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

433 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

461 

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

462 
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

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

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

465 

18507  466 
lemma 
467 
shows "a : A ==> P1 a" 

468 
"a : A ==> P2 a" 

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

470 
"b : B ==> Q2 b" 

471 
"b : B ==> Q3 b" 

472 
proof (induct set: A B) 

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

473 

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

476 

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

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

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

479 

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

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

483 
trace indicates where parts have been suppressed. 

18674  484 

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

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

486 
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

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

488 

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

491 
least one premise. 

492 

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

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

497 

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

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

499 
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

500 
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

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

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

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

504 

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

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

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

507 
for example "A > B" => "Pi A (%_. B)". 
17779  508 

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

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

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

511 

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

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

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

514 

17865  515 

17806  516 
*** HOL *** 
517 

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

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

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

520 

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

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

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

523 

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

526 

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

528 

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

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

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

531 

22450  532 
classes "meet_semilorder" and "join_semilorder" now named 
533 
"lower_semilattice" and "upper_semilattice" 

534 
class "lorder" now named "lattice" 

535 
class "comp_lat" now named "complete_lattice" 

536 

537 
Instantiation of lattice classes allows explicit definitions 

538 
for "inf" and "sup" operations. 

539 

540 
INCOMPATIBILITY. Theorem renames: 

541 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

577 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

595 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

624 

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

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

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

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

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

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

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

631 

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

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

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

634 

22450  635 
meet_min ~> inf_min 
636 
join_max ~> sup_max 

637 

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

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

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

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

641 

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

644 
proofs changed. 

645 

22218  646 
* Dropped lemma duplicate def_imp_eq in favor of meta_eq_to_obj_eq. 
647 
INCOMPATIBILITY. 

648 

649 
* Dropped lemma duplicate if_def2 in favor of if_bool_eq_conj. 

650 
INCOMPATIBILITY. 

651 

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

654 

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

22316  656 
dvd" to "Divides.div", "Divides.mod" and "Divides.dvd". INCOMPATIBILITY. 
22126  657 

658 
* Added method "lexicographic_order" automatically synthesizes 

659 
termination relations as lexicographic combinations of size measures 

660 
 'function' package. 

661 

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

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

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

665 
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

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

667 

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

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

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

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

673 

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

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

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

677 

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

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

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

680 

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

684 

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

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

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

688 

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

690 
INCOMPATIBILITY. 

691 

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

693 
generation with polymorphic equality. 

694 

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

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

697 
significant changes for setting up numeral syntax for types: 

20485  698 

699 
 new constants Numeral.pred and Numeral.succ instead 

700 
of former Numeral.bin_pred and Numeral.bin_succ. 

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

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

703 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

704 

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

706 

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

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

710 
suitable for heavyduty computations because the functions are 

711 
compiled to ML first. 

19895  712 

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

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

716 

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

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

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

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

721 
op * ~> HOL.times 
19277  722 
op < ~> Orderings.less 
723 
op <= ~> Orderings.less_eq 

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

724 

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

725 
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

726 

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

729 
may go wrong. 

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

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

731 

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

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

734 

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

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

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

739 
distribution). 

740 
INCOMPATIBILITY: rewrite proofs 

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

741 

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

742 
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

743 
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

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

745 

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

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

749 

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

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

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

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

754 

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

19377  757 

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

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

17779  761 

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

764 

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

19211  766 

19279  767 
* Theorem setsum_mult renamed to setsum_right_distrib. 
768 

19211  769 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
22126  770 
``rule'' method. 
771 

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

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

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

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

776 
speedup. 

777 

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

779 
zChaff is still supported as well. 

780 

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

782 
bundled as foo_bar.inducts; 

783 

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

785 
Library. 

21256  786 

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

788 

18446  789 
* Library: added theory Coinductive_List of potentially infinite lists 
790 
as greatest fixedpoint. 

18399  791 

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

794 

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

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

20807  798 

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

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

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

803 

22126  804 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  805 

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

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

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

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

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

812 

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

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

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

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

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

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

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

820 

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

822 
is available in HOL/ex/ReflectionEx.thy 

823 

824 

20169  825 
*** HOLAlgebra *** 
826 

21170  827 
* Formalisation of ideals and the quotient construction over rings. 
828 

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

830 
INCOMPATIBILITY. 

831 

22126  832 
* Renamed lemmas least_carrier > least_closed and greatest_carrier > 
833 
greatest_closed. INCOMPATIBILITY. 

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

834 

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

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

838 

22126  839 
* Renamed theory CRing to Ring. 
20169  840 

20807  841 

19653  842 
*** HOLComplex *** 
843 

844 
* Theory Real: new method ferrack implements quantifier elimination 

845 
for linear arithmetic over the reals. The quantifier elimination 

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

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

848 

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

851 
and norm :: 'a => real. 

852 

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

855 
is now defined as range of_real; potential INCOMPATIBILITY. 

856 

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

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

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

860 
INCOMPATIBILITY. 

21791  861 

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

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

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

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

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

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

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

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

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

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

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

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

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

875 

876 
* Complex: Some complexspecific constants are now abbreviations for 

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

879 
polymorphic versions (INCOMPATIBILITY): 

21791  880 

881 
approx < capprox 

882 
HFinite < CFinite 

883 
HInfinite < CInfinite 

884 
Infinitesimal < CInfinitesimal 

885 
monad < cmonad 

886 
galaxy < cgalaxy 

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

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

889 
(ns)deriv < (ns)cderiv 

890 

19653  891 

17878  892 
*** ML *** 
893 

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

896 
compiletime. For example: 

897 

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

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

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

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

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

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

904 
ML {* @{thm asm_rl} *} 

905 
ML {* @{thms asm_rl} *} 

22376  906 
ML {* @{const_name c} *} 
907 
ML {* @{const_syntax c} *} 

22138  908 
ML {* @{context} *} 
909 
ML {* @{theory} *} 

910 
ML {* @{theory Pure} *} 

911 
ML {* @{simpset} *} 

912 
ML {* @{claset} *} 

913 
ML {* @{clasimpset} *} 

914 

22151  915 
The same works for sources being ``used'' within an Isar context. 
916 

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

919 

20348  920 
* Pure/library: 
921 

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

922 
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

923 
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

924 

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

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

930 

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

933 

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

934 
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

935 
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

936 

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

939 
given more convenient names and signatures reminiscent of similar 

940 
functions for alists, tables, etc: 

18051  941 

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

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

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

945 

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

948 

22126  949 
* Pure/library: added general ``divide_and_conquer'' combinator on 
950 
lists. 

19032  951 

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

953 
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

954 
admits slightly more efficient complex applications. 
18446  955 

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

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

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

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

962 

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

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

18738  966 
minimizing code duplication. Thm.rule_attribute and 
967 
Thm.declaration_attribute build canonical attributes; see also 

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

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

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

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

971 

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

22126  974 
logic, but only for type inference.) IMPORTANT INTERNAL CHANGE, 
975 
potential INCOMPATIBILITY. 

19508  976 

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

978 
explicit proofs of class axioms and super class relations performed 

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

980 
notably AxClass.define_class supercedes AxClass.add_axclass, and 

981 
AxClass.axiomatize_class/classrel/arity supercede 

982 
Sign.add_classes/classrel/arities. 

983 

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

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

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

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

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

988 
attributes, methods, etc. 
18642  989 

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

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

993 
fold_map combinators. 

18051  994 

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

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

996 
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

997 
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

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

999 

18020  1000 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  1001 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  1002 
achieve the old behaviour. 
1003 

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

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

1006 
statements. 

1007 

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

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

1009 
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

1010 
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

1011 

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

1014 
some popular functions from term.ML: 

1015 

1016 
Term.variant > Name.variant 

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

1018 
Term.invent_names > Name.invent_list 

1019 

1020 
Note that lowlevel renaming rarely occurs in new code  operations 

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

1022 

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

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

1024 
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

1025 
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

1026 
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

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

1028 

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

1030 
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

1031 
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

1032 
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

1033 
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

1034 
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

1035 
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

1036 
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

1037 

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

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

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

1041 
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

1042 
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

1043 

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

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

1045 

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

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

18686
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 
Isar.toplevel (fn () => ...) 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1051 

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

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

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

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

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

1056 

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

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

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

1059 

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

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

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

1062 

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

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

1064 
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

1065 
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

1066 
batch mode. 
18567  1067 

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

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

17890  1071 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  1072 
(solver, looper etc.) may depend on arbitrary proof data. 
1073 

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

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

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

1077 
former Simplifier.inherit_bounds, which is already included here  

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

17878  1080 

1081 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

1084 
INCOMPATIBILITY. 

1085 

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

1088 

17878  1089 

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

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

1091 

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

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

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

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

1095 

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

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

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

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

1099 

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

1100 

17720  1101 
New in Isabelle2005 (October 2005) 
1102 
 

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

1103 

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

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

1105 

15130  1106 
* Theory headers: the new header syntax for Isar theories is 
1107 

1108 
theory <name> 

16234  1109 
imports <theory1> ... <theoryN> 
1110 
uses <file1> ... <fileM> 

15130  1111 
begin 
1112 

16234  1113 
where the 'uses' part is optional. The previous syntax 
1114 

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

1116 

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

17371  1119 
nonIsar theories now, but these will disappear soon. 
15130  1120 

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

1121 
* Theory loader: parent theories can now also be referred to via 
16234  1122 
relative and absolute paths. 
1123 

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

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

1125 
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

1126 
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

1127 
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

1128 
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

1129 
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

1130 
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

1131 
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

1132 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  1133 

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

1134 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  1135 

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

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

1138 
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

1139 

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

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

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

1142 

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

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

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

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

17385  1150 

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

1153 
faster. 

1154 

15703  1155 

1156 
*** Document preparation *** 

1157 

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

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

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

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

1163 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

1164 

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

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

1166 
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

1167 
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

1168 
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

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

1170 
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

1171 
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

1172 
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

1173 
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

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

1175 

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

1176 
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

1177 
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

1178 
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

1179 
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

1180 
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

1181 
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

1182 
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

1183 
specified above. 
16234  1184 

17402  1185 
* Several new antiquotations: 
15979  1186 

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

1188 

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

1190 

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

15979  1193 

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

16234  1195 
theorem applying a "style" to it 
1196 

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

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

1198 

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

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

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

1205 
typechecked ML expressions verbatim. 
16234  1206 

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

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

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

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

1211 

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

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

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

1215 

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

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

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

1218 

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

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

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

1221 

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

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

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

1224 

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

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

1226 
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

1227 
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

1228 

16234  1229 

1230 
*** Pure *** 

1231 

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

1233 
automatic typeinference of declared constants; additional support for 

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

1235 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

1236 
sequential dependencies of definitions within a single 'constdefs' 

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

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

1239 

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

1241 
indexed syntax provides a notational device for subscripted 

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

1243 
expressions. Secondly, in a local context with structure 

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

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

1246 
show_structs controls printing of implicit structures. Typical 

1247 
applications of these concepts involve record types and locales. 

1248 

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

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

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

1252 

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

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

1255 
parsing/printing, see also isarref manual. 

1256 

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

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

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

1261 
INCOMPATIBILITY. 

1262 

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

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

1264 
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

1265 
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

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

1267 

16234  1268 
* Improved internal renaming of symbolic identifiers  attach primes 
1269 
instead of base 26 numbers. 

1270 

1271 
* New flag show_question_marks controls printing of leading question 

1272 
marks in schematic variable names. 

1273 

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

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

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

1277 

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

1279 
by simp 

1280 

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

1282 

17548  1283 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  1284 
annotations as "(00...)". 
1285 

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

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

1288 
Before that distinction was only partially implemented via type class 

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

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

1291 
exotic syntax specifications may require further adaption 

17691  1292 
(e.g. Cube/Cube.thy). 
16234  1293 

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

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

1296 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

1297 
specifications. 

1298 

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

1301 

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

1304 
Limit. 

1305 

1306 
* Simplifier: simplification procedures may now take the current 

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

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

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

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

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

1312 
allow for use in a context of fixed variables. 

1313 

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

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

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

1317 

17597  1318 
* Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY. 
17590  1319 

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

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

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

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

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

1326 

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

1328 
selections of theorems in named facts via index ranges. 

1329 

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

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

1331 
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

1332 
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

1333 

17397  1334 
* 'hide': option '(open)' hides only base names. 
1335 

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

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

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

1338 

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

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

1342 
must be quoted when used as identifiers. 

1343 

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

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

1346 
quoted when used as identifier. 

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

1347 

16234  1348 

1349 
*** Locales *** 

17095  1350 

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

1353 
proof obligations from the expression specification. After the 

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

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

1356 
commands is a follows: 

1357 

17095  1358 
(1) interpretation expr inst 
1359 
(2) interpretation target < expr 

1360 
(3) interpret expr inst 

17385  1361 

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

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

1366 
locale expression. Interpretation is smart in that interpretations 

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

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

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

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

16234  1372 

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

1374 
'interpret' instead. 

1375 

17385  1376 
* New context element 'constrains' for adding type constraints to 
1377 
parameters. 

1378 

1379 
* Context expressions: renaming of parameters with syntax 

1380 
redeclaration. 

17095  1381 

1382 
* Locale declaration: 'includes' disallowed. 

1383 

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

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

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

1388 
to attribute arguments as expected. 

1389 

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

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

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

1393 
Attribute implementations need to cooperate properly with the static 

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

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

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

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

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

1399 
values to argument tokens explicitly. 

1400 

1401 
* Changed parameter management in theorem generation for long goal 

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

1403 
theorem statement in rare situations. 

1404 

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

1407 

16234  1408 

1409 
*** Provers *** 

1410 

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

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

1413 
'subst (asm)', for rewriting an assumption. INCOMPATIB 