author  wenzelm 
Wed, 13 Jun 2007 11:54:03 +0200  
changeset 23369  227c51012cdb 
parent 23367  05f399115ba5 
child 23377  197b6a39592c 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

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

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

6 

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

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

8 

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

23367  11 
tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY: 
12 
legacy features will disappear eventually. 

22826  13 

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

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

15 
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

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

17 

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

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

19 
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

20 
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

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

22 

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

25 
quotes. 

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

26 

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

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

28 
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

29 
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

30 
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

31 
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

32 
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

33 
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

34 

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

36 

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

39 
via Cc Ca Cm. Variable prooffindtheoremscommand (customizable via 

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

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

42 
isarfindtheoremsform or isarfindtheoremsminibuffer. 

43 

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

46 
suppressed from proof state output. Note that the ProofGeneral 

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

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

49 
limit is imposed. 

50 

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

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

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

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

54 
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

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

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

57 

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

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

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

60 

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

61 

17865  62 
*** Document preparation *** 
63 

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

66 
current context. 

21339  67 

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

17865  70 

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

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

75 

17865  76 

17779  77 
*** Pure *** 
78 

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

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

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

81 

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

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

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

88 
 HOL theories have been adopted accordingly 

89 

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

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

94 
* Yet another code generator framework allows to generate executable 

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

95 
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

96 

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

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

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

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

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

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

105 

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

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

107 

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

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

109 

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

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

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

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

114 

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

116 

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

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

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

119 

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

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

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

122 

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

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

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

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

126 

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

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

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

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

130 

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

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

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

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

135 

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

138 

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

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

142 
correspondence to type class and instance declarations. 

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

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

19711  145 

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

147 
instantiation that matches an instance against the most general 

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

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

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

151 
recursion over such type arguments. Incomplete specification patterns 

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

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

156 

23369
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

157 
* Isar: method "assumption" (and implicit closing of subproofs) now 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

158 
takes simple nonatomic goal assumptions into account: after applying 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

159 
an assumption as a rule the resulting subgoals are solved by atomic 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

160 
assumption steps. This is particularly useful to finish 'obtain' 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

161 
goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis", 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

162 
without referring to the original premise "!!x. P x ==> thesis" in the 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

163 
Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

164 
more permissive. 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

165 

227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

166 
* Isar: implicit use of prems from the Isar proof context is 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

167 
considered a legacy feature. Common applications like ``have A .'' 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

168 
may be replaced by ``have A by fact'' or ``note `A`''. In general, 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

169 
referencing facts explicitly here improves readability and 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

170 
maintainability of proof texts. 
227c51012cdb
* Isar: method "assumption" (implicit closing of subproofs) takes nonatomic goal assumptions into account;
wenzelm
parents:
23367
diff
changeset

171 

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

174 

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

176 
then guess x and y by clarify 

177 

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

179 
proof tools being involved here. 

180 

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

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

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

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

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

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

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

189 

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

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

18020  193 

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

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

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

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

198 

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

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

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

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

202 

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

205 

18308  206 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
207 

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

209 

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

212 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  213 
'unfolded' attribute may be replaced by firstclass proof text. 
214 

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

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

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

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

218 
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

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

220 

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

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

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

226 
originally first one. 

19220  227 

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

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

229 
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

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

231 

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

234 
(essentially a disjunction of cases with local parameters and 

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

18910  236 
adequately; in this notation common elimination rules look like this: 
18901  237 

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

239 
assumes "EX x. P x" 

240 
obtains x where "P x" 

241 

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

243 
assumes "A & B" 

244 
obtains A and B 

245 

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

247 
assumes "A  B" 

248 
obtains 

249 
A 

250 
 B 

251 

18910  252 
The subsequent classical rules even refer to the formal "thesis" 
18901  253 
explicitly: 
254 

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

256 
obtains "~ thesis" 

257 

18910  258 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
259 
obtains "thesis ==> something" 

18901  260 

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

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

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

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

266 
case_names). 

18901  267 

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

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

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

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

271 
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

272 

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

275 
toplevel lemma. 

276 

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

279 

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

282 
to occur. 

283 

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

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

285 
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

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

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

288 

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

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

290 
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

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

292 

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

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

294 
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

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

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

297 

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

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

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

302 

19665  303 
axiomatization 
21595  304 
eq (infix "===" 50) where 
305 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

306 

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

308 
definition g where "g x = f x x" 

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

309 

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

313 

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

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

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

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

321 

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

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

325 
'translations' in common applications. 

19084  326 

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

327 
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

328 
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

329 
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

330 
'translations' with explicit "CONST" markup to accommodate this. 
19665  331 

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

334 
abbreviations on output. 

335 

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

338 
 parameter renamings are no longer required to be injective. 

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

340 
locale endom = homom mult mult h. 

341 

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

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

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

346 
predicates, goals repesenting already interpreted fragments are not 

347 
removed automatically. Use methods `intro_locales' and 

348 
`unfold_locales'; see below. 

349 

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

351 
provide backward reasoning on locales predicates. The methods are 

352 
aware of interpretations and discharge corresponding goals. 

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

354 
unfold predicates to assumptions. 

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

355 

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

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

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

359 

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

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

363 
(using objectlogic connectives for this purpose has been long 

364 
obsolete anyway). The subsequent proof patterns illustrate advanced 

365 
techniques of natural induction; general datatypes and inductive sets 

18267  366 
work analogously (see also src/HOL/Lambda for realistic examples). 
367 

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

18239  369 
parameters: 
18233  370 

371 
lemma 

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

373 
assumes a: "A n x" 

374 
shows "P n x" 

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

20503  376 
proof (induct n arbitrary: x)  {* generalize goal to "!!x. A n x ==> P n x" *} 
18248  377 
case 0 
18233  378 
show ?case sorry 
379 
next 

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

18233  383 
show ?case sorry 
384 
qed 

385 

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

391 
lemma 

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

393 
assumes a: "A (a x)" 

394 
shows "P (a x)" 

395 
using a 

20503  396 
proof (induct n == "a x" arbitrary: x) 
18233  397 
... 
398 

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

401 

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

404 
encodings: 

405 

406 
lemma 

407 
fixes n :: nat 

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

20503  409 
proof (induct n arbitrary: thesis) 
18267  410 
case 0 
411 
obtain x where "P 0 x" and "Q 0 x" sorry 

18399  412 
then show thesis by (rule 0) 
18267  413 
next 
414 
case (Suc n) 

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

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

417 
then show thesis by (rule Suc.prems) 

418 
qed 

419 

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

18267  422 
existence statement through the induction as expected. 
18233  423 

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

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

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

426 
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

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

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

429 

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

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

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

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

433 

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

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

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

436 

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

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

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

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

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

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

442 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

461 

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

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

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

464 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

492 

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

493 
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

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

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

496 

18507  497 
lemma 
498 
shows "a : A ==> P1 a" 

499 
"a : A ==> P2 a" 

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

501 
"b : B ==> Q2 b" 

502 
"b : B ==> Q3 b" 

503 
proof (induct set: A B) 

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

504 

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

507 

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

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

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

510 

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

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

514 
trace indicates where parts have been suppressed. 

18674  515 

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

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

517 
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

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

519 

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

522 
least one premise. 

523 

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

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

528 

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

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

530 
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

531 
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

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

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

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

535 

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

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

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

538 
for example "A > B" => "Pi A (%_. B)". 
17779  539 

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

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

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

542 

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

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

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

545 

17865  546 

17806  547 
*** HOL *** 
548 

23295
86e225406859
Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents:
23251
diff
changeset

549 
* Method "algebra" solves polynomial equations over (semi)rings using 
86e225406859
Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents:
23251
diff
changeset

550 
Groebner bases. The (semi)ring structure is defined by locales and 
86e225406859
Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents:
23251
diff
changeset

551 
the tool setup depends on that generic context. Installing the 
86e225406859
Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents:
23251
diff
changeset

552 
method for a specific type involves instantiating the locale and 
86e225406859
Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents:
23251
diff
changeset

553 
possibly adding declarations for computation on the coefficients. 
86e225406859
Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents:
23251
diff
changeset

554 
The method is already instantiated for natural numbers and for the 
86e225406859
Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents:
23251
diff
changeset

555 
axiomatic class of idoms with numerals. See also the paper by 
86e225406859
Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents:
23251
diff
changeset

556 
Chaieb and Wenzel at CALCULEMUS 2007 for the general principles 
86e225406859
Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents:
23251
diff
changeset

557 
underlying this architecture of contextaware prooftools. 
86e225406859
Method "algebra" solves polynomial equations over (semi)rings
chaieb
parents:
23251
diff
changeset

558 

23029  559 
* constant "List.op @" now named "List.append". Use ML antiquotations 
560 
@{const_name List.append} or @{term " ... @ ... "} to circumvent 

561 
possible incompatibilities when working on ML level. 

562 

22997  563 
* Constant renames due to introduction of canonical name prefixing for 
564 
class package: 

565 

566 
HOL.abs ~> HOL.minus_class.abs 

567 
HOL.divide ~> HOL.divide_class.divide 

568 
Nat.power ~> Nat.power_class.power 

569 
Nat.size ~> Nat.size_class.size 

570 
Numeral.number_of ~> Numeral.number_class.number_of 

23129  571 
FixedPoint.Inf ~> FixedPoint.complete_lattice_class.Inf 
572 

23180  573 
* Rudimentary class target mechanism involves constant renames: 
23129  574 

575 
Orderings.min ~> Orderings.ord_class.min 

576 
Orderings.max ~> Orderings.ord_class.max 

577 
FixedPoint.Sup ~> FixedPoint.complete_lattice_class.Sup 

22997  578 

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

581 

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

583 

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

585 

23104  586 
* new function listsum :: 'a list => 'a for arbitrary monoids. 
587 
Special syntax: "SUM x < xs. f x" (and latex variants) 

588 

23210  589 
* new (input only) syntax for Haskelllike list comprehension, eg 
590 
[(x,y). x < xs, y < ys, x ~= y] 

591 
For details see List.thy. 

23102  592 

23300  593 
* The special syntax for function "filter" has changed from [x : xs. P] to 
594 
[x < xs. P] to avoid an ambiguity caused by list comprehension syntax, 

595 
and for uniformity. INCOMPATIBILITY 

596 

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

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

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

599 

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

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

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

602 

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

605 

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

607 

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

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

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

610 

22450  611 
classes "meet_semilorder" and "join_semilorder" now named 
612 
"lower_semilattice" and "upper_semilattice" 

613 
class "lorder" now named "lattice" 

614 
class "comp_lat" now named "complete_lattice" 

615 

616 
Instantiation of lattice classes allows explicit definitions 

617 
for "inf" and "sup" operations. 

618 

23129  619 
INCOMPATIBILITY. Theorem renames: 
22450  620 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

656 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

674 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

703 

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

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

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

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

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

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

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

710 

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

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

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

713 

22450  714 
meet_min ~> inf_min 
715 
join_max ~> sup_max 

716 

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

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

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

720 

22845  721 
* Classes "order" and "linorder": 
22316  722 
potential INCOMPATIBILITY: order of proof goals in order/linorder instance 
723 
proofs changed. 

724 

22218  725 
* Dropped lemma duplicate def_imp_eq in favor of meta_eq_to_obj_eq. 
726 
INCOMPATIBILITY. 

727 

728 
* Dropped lemma duplicate if_def2 in favor of if_bool_eq_conj. 

729 
INCOMPATIBILITY. 

730 

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

733 

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

22997  735 
dvd" to "Divides.div_class.div", "Divides.div_class.mod" and "Divides.dvd". INCOMPATIBILITY. 
22126  736 

737 
* Added method "lexicographic_order" automatically synthesizes 

738 
termination relations as lexicographic combinations of size measures 

739 
 'function' package. 

740 

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

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

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

744 
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

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

746 

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

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

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

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

752 

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

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

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

756 

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

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

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

759 

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

763 

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

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

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

767 

22997  768 
* Renamed constants "0" to "HOL.zero_class.zero" and "1" to "HOL.one_class.one". 
22126  769 
INCOMPATIBILITY. 
770 

23251  771 
* Added class "HOL.eq", allowing for code generation with polymorphic equality. 
22126  772 

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

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

775 
significant changes for setting up numeral syntax for types: 

20485  776 

777 
 new constants Numeral.pred and Numeral.succ instead 

778 
of former Numeral.bin_pred and Numeral.bin_succ. 

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

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

781 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

782 

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

784 

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

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

788 
suitable for heavyduty computations because the functions are 

789 
compiled to ML first. 

19895  790 

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

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

794 

19279  795 
* Renamed constants in HOL.thy and Orderings.thy: 
22997  796 
op + ~> HOL.plus_class.plus 
797 
op  ~> HOL.minus_class.minus 

798 
uminus ~> HOL.minus_class.uminus 

799 
op * ~> HOL.times_class.times 

800 
op < ~> Orderings.ord_class.less 

801 
op <= ~> Orderings.ord_class.less_eq 

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

802 

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

803 
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

804 

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

807 
may go wrong. 

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

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

809 

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

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

812 

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

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

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

817 
distribution). 

818 
INCOMPATIBILITY: rewrite proofs 

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

819 

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

820 
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

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

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

824 

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

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

828 

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

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

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

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

833 

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

19377  836 

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

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

17779  840 

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

843 

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

19211  845 

19279  846 
* Theorem setsum_mult renamed to setsum_right_distrib. 
847 

19211  848 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
22126  849 
``rule'' method. 
850 

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

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

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

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

855 
speedup. 

856 

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

858 
zChaff is still supported as well. 

859 

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

861 
bundled as foo_bar.inducts; 

862 

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

864 
Library. 

21256  865 

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

867 

18446  868 
* Library: added theory Coinductive_List of potentially infinite lists 
869 
as greatest fixedpoint. 

18399  870 

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

873 

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

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

20807  877 

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

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

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

882 

22126  883 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  884 

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

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

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

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

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

891 

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

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

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

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

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

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

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

899 

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

901 
is available in HOL/ex/ReflectionEx.thy 

902 

903 

20169  904 
*** HOLAlgebra *** 
905 

21170  906 
* Formalisation of ideals and the quotient construction over rings. 
907 

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

909 
INCOMPATIBILITY. 

910 

22126  911 
* Renamed lemmas least_carrier > least_closed and greatest_carrier > 
912 
greatest_closed. INCOMPATIBILITY. 

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

913 

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

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

917 

22126  918 
* Renamed theory CRing to Ring. 
20169  919 

20807  920 

19653  921 
*** HOLComplex *** 
922 

923 
* Theory Real: new method ferrack implements quantifier elimination 

924 
for linear arithmetic over the reals. The quantifier elimination 

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

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

927 

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

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

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

932 
INCOMPATIBILITY. 

933 

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

936 
and norm :: 'a => real. 

937 

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

940 
is now defined as range of_real; potential INCOMPATIBILITY. 

941 

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

944 

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

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

948 
INCOMPATIBILITY. 

21791  949 

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

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

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

952 
HInfinite :: ('a::real_normed_vector) star set 
21791  953 
approx :: ('a::real_normed_vector) star => 'a star => bool 
954 
monad :: ('a::real_normed_vector) star => 'a star set 

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

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

956 
(NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool 
21791  957 
(NS)convergent :: (nat => 'a::real_normed_vector) => bool 
958 
(NS)Bseq :: (nat => 'a::real_normed_vector) => bool 

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

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

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

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

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

963 
sgn :: 'a::real_normed_vector => 'a 
23116  964 
exp :: 'a::{recpower,real_normed_field,banach} => 'a 
21791  965 

966 
* Complex: Some complexspecific constants are now abbreviations for 

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

969 
polymorphic versions (INCOMPATIBILITY): 

21791  970 

971 
approx < capprox 

972 
HFinite < CFinite 

973 
HInfinite < CInfinite 

974 
Infinitesimal < CInfinitesimal 

975 
monad < cmonad 

976 
galaxy < cgalaxy 

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

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

979 
(ns)deriv < (ns)cderiv 

980 

19653  981 

17878  982 
*** ML *** 
983 

23251  984 
* Generic arithmetic modules: Tools/integer.ML, Tools/rat.ML, Tools/float.ML 
985 

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

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

22848  990 

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

993 
compiletime. For example: 

994 

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

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

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

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

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

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

1001 
ML {* @{thm asm_rl} *} 

1002 
ML {* @{thms asm_rl} *} 

22376  1003 
ML {* @{const_name c} *} 
1004 
ML {* @{const_syntax c} *} 

22138  1005 
ML {* @{context} *} 
1006 
ML {* @{theory} *} 

1007 
ML {* @{theory Pure} *} 

1008 
ML {* @{simpset} *} 

1009 
ML {* @{claset} *} 

1010 
ML {* @{clasimpset} *} 

1011 

22151  1012 
The same works for sources being ``used'' within an Isar context. 
1013 

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

1016 

20348  1017 
* Pure/library: 
1018 

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

1019 
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

1020 
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

1021 

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

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

1027 

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

1030 

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

1031 
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

1032 
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

1033 

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

1036 
given more convenient names and signatures reminiscent of similar 

1037 
functions for alists, tables, etc: 

18051  1038 

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

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

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

1042 

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

1045 

22126  1046 
* Pure/library: added general ``divide_and_conquer'' combinator on 
1047 
lists. 

19032  1048 

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

1050 
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

1051 
admits slightly more efficient complex applications. 
18446  1052 

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

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

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

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

1059 

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

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

18738  1063 
minimizing code duplication. Thm.rule_attribute and 
1064 
Thm.declaration_attribute build canonical attributes; see also 

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

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

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

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

1068 

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

22126  1071 
logic, but only for type inference.) IMPORTANT INTERNAL CHANGE, 
1072 
potential INCOMPATIBILITY. 

19508  1073 

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

1075 
explicit proofs of class axioms and super class relations performed 

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

1077 
notably AxClass.define_class supercedes AxClass.add_axclass, and 

1078 
AxClass.axiomatize_class/classrel/arity supercede 

1079 
Sign.add_classes/classrel/arities. 

1080 

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

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

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

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

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

1085 
attributes, methods, etc. 
18642  1086 

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

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

1090 
fold_map combinators. 

18051  1091 

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

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

1093 
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

1094 
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

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

1096 

18020  1097 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  1098 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  1099 
achieve the old behaviour. 
1100 

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

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

1103 
statements. 

1104 

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

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

1106 
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

1107 
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

1108 

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

1111 
some popular functions from term.ML: 

1112 

1113 
Term.variant > Name.variant 

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

1115 
Term.invent_names > Name.invent_list 

1116 

1117 
Note that lowlevel renaming rarely occurs in new code  operations 

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

1119 

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

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

1121 
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

1122 
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

1123 
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

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

1125 

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

1127 
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

1128 
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

1129 
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

1130 
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

1131 
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

1132 
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

1133 
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

1134 

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

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

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

1138 
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

1139 
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

1140 

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

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

1142 

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

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

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

1146 

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

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

1148 

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

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

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

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

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

1153 

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

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

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

1156 

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

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

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

1159 

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

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

1161 
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

1162 
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

1163 
batch mode. 
18567  1164 

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

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

17890  1168 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  1169 
(solver, looper etc.) may depend on arbitrary proof data. 
1170 

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

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

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

1174 
former Simplifier.inherit_bounds, which is already included here  

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

17878  1177 

1178 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

1181 
INCOMPATIBILITY. 

1182 

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

1185 

17878  1186 

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

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

1188 

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

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

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

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

1192 

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

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

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

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

1196 

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

1197 

17720  1198 
New in Isabelle2005 (October 2005) 
1199 
 

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

1200 

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

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

1202 

15130  1203 
* Theory headers: the new header syntax for Isar theories is 
1204 

1205 
theory <name> 

16234  1206 
imports <theory1> ... <theoryN> 
1207 
uses <file1> ... <fileM> 

15130  1208 
begin 
1209 

16234  1210 
where the 'uses' part is optional. The previous syntax 
1211 

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

1213 

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

17371  1216 
nonIsar theories now, but these will disappear soon. 
15130  1217 

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

1218 
* Theory loader: parent theories can now also be referred to via 
16234  1219 
relative and absolute paths. 
1220 

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

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

1222 
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

1223 
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

1224 
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

1225 
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

1226 
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

1227 
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

1228 
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

1229 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  1230 

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

1231 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  1232 

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

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

1235 
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

1236 

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

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

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

1239 

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

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

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

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

17385  1247 

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

1250 
faster. 

1251 

15703  1252 

1253 
*** Document preparation *** 

1254 

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

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

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

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

1260 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

1261 

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

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

1263 
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

1264 
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

1265 
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

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

1267 
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

1268 
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

1269 
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

1270 
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

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

1272 

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

1273 
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

1274 
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

1275 
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

1276 
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

1277 
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

1278 
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

1279 
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

1280 
specified above. 
16234  1281 

17402  1282 
* Several new antiquotations: 
15979  1283 

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

1285 

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

1287 

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

15979  1290 

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

16234  1292 
theorem applying a "style" to it 
1293 

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

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

1295 

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

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

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

1302 
typechecked ML expressions verbatim. 
16234  1303 

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

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

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

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

1308 

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

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

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

1312 

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

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

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

1315 

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

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

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

1318 

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

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

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

1321 

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

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

1323 
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

1324 
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

1325 

16234  1326 

1327 
*** Pure *** 

1328 

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

1330 
automatic typeinference of declared constants; additional support for 

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

1332 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

1333 
sequential dependencies of definitions within a single 'constdefs' 

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

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

1336 

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

1338 
indexed syntax provides a notational device for subscripted 

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

1340 
expressions. Secondly, in a local context with structure 

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

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

1343 
show_structs controls printing of implicit structures. Typical 

1344 
applications of these concepts involve record types and locales. 

1345 

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

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

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

1349 

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

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

1352 
parsing/printing, see also isarref manual. 

1353 

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

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

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

1358 
INCOMPATIBILITY. 

1359 

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

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

1361 
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

1362 
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

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

1364 

16234  1365 
* Improved internal renaming of symbolic identifiers  attach primes 
1366 
instead of base 26 numbers. 

1367 

1368 
* New flag show_question_marks controls printing of leading question 

1369 
marks in schematic variable names. 

1370 

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

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

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

1374 

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

1376 
by simp 

1377 

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

1379 

17548  1380 
* Pretty printer now supports unbreakable blocks, specified in mixfix 
16234  1381 
annotations as "(00...)". 
1382 

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

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

1385 
Before that distinction was only partially implemented via type class 

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

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

1388 
exotic syntax specifications may require further adaption 

17691  1389 
(e.g. Cube/Cube.thy). 
16234  1390 

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

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

1393 
rather than 'types'. INCOMPATIBILITY for new objectlogic 

1394 
specifications. 

1395 

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

1398 

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

1401 
Limit. 

1402 

1403 
* Simplifier: simplification procedures may now take the current 

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

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

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