author  wenzelm 
Sun, 08 Jul 2007 19:51:58 +0200  
changeset 23655  d2d1138e0ddc 
parent 23565  c00b12a4e245 
child 23783  e4d514f81d95 
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 

23379
d0e3f790bd73
updated 'find_theorems'  moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents:
23377
diff
changeset

35 
* Command 'find_theorems': supports "*" wildcard in "name:" 
d0e3f790bd73
updated 'find_theorems'  moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents:
23377
diff
changeset

36 
criterion; "with_dups" option. Certain ProofGeneral versions might 
d0e3f790bd73
updated 'find_theorems'  moved ProofGeneral specifics to ProofGeneral/CHANGES;
wenzelm
parents:
23377
diff
changeset

37 
support a specific search form (see ProofGeneral/CHANGES). 
22965  38 

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

41 
suppressed from proof state output. Note that the ProofGeneral 

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

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

44 
limit is imposed. 

45 

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

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

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

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

49 
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

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

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

52 

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

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

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

55 

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

56 

17865  57 
*** Document preparation *** 
58 

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

61 
current context. 

21339  62 

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

17865  65 

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

21735  68 
arguments may be given on the LHS.) 
21717  69 

70 

17865  71 

17779  72 
*** Pure *** 
73 

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

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

75 
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

76 

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

78 
 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

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

83 
 HOL theories have been adopted accordingly 

84 

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

86 
achieve Haskelllike type classes in Isabelle. See 
20807  87 
HOL/ex/Classpackage.thy for examples. 
88 

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

90 
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

91 

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

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

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

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

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

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

100 

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

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

102 

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

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

104 

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

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

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

109 

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

111 

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

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

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

114 

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

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

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

117 

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

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

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

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

121 

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

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

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

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

125 

22735  126 
code_instance and code_class only apply to target Haskell. 
127 

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

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

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

130 

19254  131 
* Command 'no_translations' removes translation rules from theory 
132 
syntax. 

133 

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

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

137 
correspondence to type class and instance declarations. 

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

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

19711  140 

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

142 
instantiation that matches an instance against the most general 

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

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

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

146 
recursion over such type arguments. Incomplete specification patterns 

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

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

151 

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

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

153 
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

154 
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

155 
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

156 
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

157 
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

158 
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

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

160 

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

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

162 
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

163 
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

164 
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

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

166 

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

169 

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

171 
then guess x and y by clarify 

172 

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

174 
proof tools being involved here. 

175 

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

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

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

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

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

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

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

184 

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

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

18020  188 

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

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

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

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

193 

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

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

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

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

197 

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

200 

18308  201 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
202 

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

204 

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

207 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  208 
'unfolded' attribute may be replaced by firstclass proof text. 
209 

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

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

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

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

213 
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

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

215 

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

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

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

221 
originally first one. 

19220  222 

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

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

224 
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

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

226 

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

229 
(essentially a disjunction of cases with local parameters and 

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

18910  231 
adequately; in this notation common elimination rules look like this: 
18901  232 

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

234 
assumes "EX x. P x" 

235 
obtains x where "P x" 

236 

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

238 
assumes "A & B" 

239 
obtains A and B 

240 

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

242 
assumes "A  B" 

243 
obtains 

244 
A 

245 
 B 

246 

18910  247 
The subsequent classical rules even refer to the formal "thesis" 
18901  248 
explicitly: 
249 

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

251 
obtains "~ thesis" 

252 

18910  253 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
254 
obtains "thesis ==> something" 

18901  255 

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

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

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

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

261 
case_names). 

18901  262 

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

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

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

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

266 
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

267 

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

270 
toplevel lemma. 

271 

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

274 

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

277 
to occur. 

278 

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

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

280 
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

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

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

283 

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

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

285 
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

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

287 

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

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

289 
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

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

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

292 

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

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

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

297 

19665  298 
axiomatization 
21595  299 
eq (infix "===" 50) where 
300 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

301 

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

303 
definition g where "g x = f x x" 

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

304 

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

308 

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

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

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

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

316 

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

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

320 
'translations' in common applications. 

19084  321 

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

322 
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

323 
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

324 
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

325 
'translations' with explicit "CONST" markup to accommodate this. 
19665  326 

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

329 
abbreviations on output. 

330 

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

333 
 parameter renamings are no longer required to be injective. 

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

335 
locale endom = homom mult mult h. 

336 

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

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

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

341 
predicates, goals repesenting already interpreted fragments are not 

342 
removed automatically. Use methods `intro_locales' and 

343 
`unfold_locales'; see below. 

344 

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

346 
provide backward reasoning on locales predicates. The methods are 

347 
aware of interpretations and discharge corresponding goals. 

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

349 
unfold predicates to assumptions. 

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

350 

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

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

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

354 

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

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

358 
(using objectlogic connectives for this purpose has been long 

359 
obsolete anyway). The subsequent proof patterns illustrate advanced 

360 
techniques of natural induction; general datatypes and inductive sets 

18267  361 
work analogously (see also src/HOL/Lambda for realistic examples). 
362 

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

18239  364 
parameters: 
18233  365 

366 
lemma 

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

368 
assumes a: "A n x" 

369 
shows "P n x" 

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

20503  371 
proof (induct n arbitrary: x)  {* generalize goal to "!!x. A n x ==> P n x" *} 
18248  372 
case 0 
18233  373 
show ?case sorry 
374 
next 

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

18233  378 
show ?case sorry 
379 
qed 

380 

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

386 
lemma 

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

388 
assumes a: "A (a x)" 

389 
shows "P (a x)" 

390 
using a 

20503  391 
proof (induct n == "a x" arbitrary: x) 
18233  392 
... 
393 

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

396 

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

399 
encodings: 

400 

401 
lemma 

402 
fixes n :: nat 

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

20503  404 
proof (induct n arbitrary: thesis) 
18267  405 
case 0 
406 
obtain x where "P 0 x" and "Q 0 x" sorry 

18399  407 
then show thesis by (rule 0) 
18267  408 
next 
409 
case (Suc n) 

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

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

412 
then show thesis by (rule Suc.prems) 

413 
qed 

414 

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

18267  417 
existence statement through the induction as expected. 
18233  418 

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

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

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

421 
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

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

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

424 

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

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

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

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

428 

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

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

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

431 

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

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

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

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

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

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

437 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

456 

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

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

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

459 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

473 
} 
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 (Suc n) 
b248754b60bc
* Provers/induct: improved simultaneous goals  nested cases;
wenzelm
parents:
18590
diff
changeset

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

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

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

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

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

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

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

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

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

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

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

487 

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

488 
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

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

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

491 

18507  492 
lemma 
493 
shows "a : A ==> P1 a" 

494 
"a : A ==> P2 a" 

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

496 
"b : B ==> Q2 b" 

497 
"b : B ==> Q3 b" 

498 
proof (induct set: A B) 

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

499 

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

502 

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

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

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

505 

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

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

509 
trace indicates where parts have been suppressed. 

18674  510 

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

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

512 
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

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

514 

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

517 
least one premise. 

518 

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

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

523 

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

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

525 
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

526 
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

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

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

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

530 

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

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

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

533 
for example "A > B" => "Pi A (%_. B)". 
17779  534 

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

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

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

537 

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

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

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

540 

17865  541 

17806  542 
*** HOL *** 
543 

23562  544 
* Method "metis" proves goals by applying the Metis generalpurpose 
545 
resolution prover. Examples are in the directory MetisExamples. See 

546 
also http://gilith.com/software/metis/ 

23449  547 

23562  548 
* Command 'sledgehammer' invokes external automatic theorem provers as 
549 
background processes. It generates calls to the "metis" method if 

550 
successful. These can be pasted into the proof. Users do not have to 

551 
wait for the automatic provers to return. 

23449  552 

23564  553 
* Caseexpressions allow arbitrary constructorpatterns (including "_") and 
23565  554 
take their order into account, like in functional programming. 
23564  555 
Internally, this is translated into nested caseexpressions; missing cases 
556 
are added and mapped to the predefined constant "undefined". In complicated 

557 
cases printing may no longer show the original input but the internal 

23565  558 
form. Lambdaabstractions allow the same form of pattern matching: 
23564  559 
"% pat1 => e1  ..." is an abbreviation for 
560 
"%x. case x of pat1 => e1  ..." where x is a new variable. 

561 

23468  562 
* IntDef: The constant "int :: nat => int" has been removed; now "int" 
563 
is an abbreviation for "of_nat :: nat => int". The simplification rules 

564 
for "of_nat" have been changed to work like "int" did previously. 

565 
(potential INCOMPATIBILITY) 

566 
 "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1" 

567 
 of_nat_diff and of_nat_mult are no longer default simp rules 

23377  568 

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

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

570 
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

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

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

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

574 
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

575 
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

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

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

578 

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

581 
possible incompatibilities when working on ML level. 

582 

22997  583 
* Constant renames due to introduction of canonical name prefixing for 
584 
class package: 

585 

586 
HOL.abs ~> HOL.minus_class.abs 

587 
HOL.divide ~> HOL.divide_class.divide 

588 
Nat.power ~> Nat.power_class.power 

589 
Nat.size ~> Nat.size_class.size 

590 
Numeral.number_of ~> Numeral.number_class.number_of 

23129  591 
FixedPoint.Inf ~> FixedPoint.complete_lattice_class.Inf 
592 

23180  593 
* Rudimentary class target mechanism involves constant renames: 
23129  594 

595 
Orderings.min ~> Orderings.ord_class.min 

596 
Orderings.max ~> Orderings.ord_class.max 

597 
FixedPoint.Sup ~> FixedPoint.complete_lattice_class.Sup 

22997  598 

23564  599 
* primrec: missing cases mapped to "undefined" instead of "arbitrary" 
22845  600 

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

602 

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

604 

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

607 

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

610 
For details see List.thy. 

23102  611 

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

614 
and for uniformity. INCOMPATIBILITY 

615 

23480  616 
* New lemma collection field_simps (an extension of ring_simps) 
617 
for manipulating (in)equations involving division. Multiplies 

23481  618 
with all denominators that can be proved to be nonzero (in equations) 
23480  619 
or positive/negative (in inequations). 
620 

621 
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib 

23478  622 
have been improved and renamed to ring_simps, group_simps and ring_distribs. 
23509  623 
Removed lemmas field_xyz in Ring_and_Field 
624 
because they were subsumed by lemmas xyz. 

625 
INCOMPATIBILITY. 

23478  626 

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

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

629 

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

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

632 

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

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

637 

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

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

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

640 

22450  641 
classes "meet_semilorder" and "join_semilorder" now named 
642 
"lower_semilattice" and "upper_semilattice" 

643 
class "lorder" now named "lattice" 

644 
class "comp_lat" now named "complete_lattice" 

645 

646 
Instantiation of lattice classes allows explicit definitions 

647 
for "inf" and "sup" operations. 

648 

23129  649 
INCOMPATIBILITY. Theorem renames: 
22450  650 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

686 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

704 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

733 

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

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

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

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

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

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

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

740 

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

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

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

743 

22450  744 
meet_min ~> inf_min 
745 
join_max ~> sup_max 

746 

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

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

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

750 

22845  751 
* Classes "order" and "linorder": 
22316  752 
potential INCOMPATIBILITY: order of proof goals in order/linorder instance 
753 
proofs changed. 

754 

22218  755 
* Dropped lemma duplicate def_imp_eq in favor of meta_eq_to_obj_eq. 
756 
INCOMPATIBILITY. 

757 

758 
* Dropped lemma duplicate if_def2 in favor of if_bool_eq_conj. 

759 
INCOMPATIBILITY. 

760 

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

763 

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

22997  765 
dvd" to "Divides.div_class.div", "Divides.div_class.mod" and "Divides.dvd". INCOMPATIBILITY. 
22126  766 

767 
* Added method "lexicographic_order" automatically synthesizes 

768 
termination relations as lexicographic combinations of size measures 

769 
 'function' package. 

770 

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

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

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

774 
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

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

776 

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

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

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

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

782 

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

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

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

786 

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

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

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

789 

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

793 

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

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

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

797 

22997  798 
* Renamed constants "0" to "HOL.zero_class.zero" and "1" to "HOL.one_class.one". 
22126  799 
INCOMPATIBILITY. 
800 

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

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

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

805 
significant changes for setting up numeral syntax for types: 

20485  806 

807 
 new constants Numeral.pred and Numeral.succ instead 

808 
of former Numeral.bin_pred and Numeral.bin_succ. 

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

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

811 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

812 

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

814 

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

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

818 
suitable for heavyduty computations because the functions are 

819 
compiled to ML first. 

19895  820 

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

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

824 

19279  825 
* Renamed constants in HOL.thy and Orderings.thy: 
22997  826 
op + ~> HOL.plus_class.plus 
827 
op  ~> HOL.minus_class.minus 

828 
uminus ~> HOL.minus_class.uminus 

829 
op * ~> HOL.times_class.times 

830 
op < ~> Orderings.ord_class.less 

831 
op <= ~> Orderings.ord_class.less_eq 

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

832 

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

833 
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

834 

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

837 
may go wrong. 

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

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

839 

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

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

842 

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

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

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

847 
distribution). 

848 
INCOMPATIBILITY: rewrite proofs 

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

849 

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

850 
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

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

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

854 

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

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

858 

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

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

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

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

863 

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

19377  866 

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

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

17779  870 

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

873 

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

19211  875 

19279  876 
* Theorem setsum_mult renamed to setsum_right_distrib. 
877 

19211  878 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
22126  879 
``rule'' method. 
880 

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

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

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

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

885 
speedup. 

886 

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

888 
zChaff is still supported as well. 

889 

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

891 
bundled as foo_bar.inducts; 

892 

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

894 
Library. 

21256  895 

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

897 

18446  898 
* Library: added theory Coinductive_List of potentially infinite lists 
899 
as greatest fixedpoint. 

18399  900 

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

903 

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

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

20807  907 

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

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

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

912 

22126  913 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  914 

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

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

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

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

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

921 

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

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

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

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

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

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

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

929 

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

931 
is available in HOL/ex/ReflectionEx.thy 

932 

933 

20169  934 
*** HOLAlgebra *** 
935 

21170  936 
* Formalisation of ideals and the quotient construction over rings. 
937 

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

939 
INCOMPATIBILITY. 

940 

22126  941 
* Renamed lemmas least_carrier > least_closed and greatest_carrier > 
942 
greatest_closed. INCOMPATIBILITY. 

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

943 

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

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

947 

22126  948 
* Renamed theory CRing to Ring. 
20169  949 

20807  950 

19653  951 
*** HOLComplex *** 
952 

953 
* Theory Real: new method ferrack implements quantifier elimination 

954 
for linear arithmetic over the reals. The quantifier elimination 

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

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

957 

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

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

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

962 
INCOMPATIBILITY. 

963 

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

966 
and norm :: 'a => real. 

967 

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

970 
is now defined as range of_real; potential INCOMPATIBILITY. 

971 

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

974 

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

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

978 
INCOMPATIBILITY. 

21791  979 

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

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

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

982 
HInfinite :: ('a::real_normed_vector) star set 
21791  983 
approx :: ('a::real_normed_vector) star => 'a star => bool 
984 
monad :: ('a::real_normed_vector) star => 'a star set 

985 
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

986 
(NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool 
21791  987 
(NS)convergent :: (nat => 'a::real_normed_vector) => bool 
988 
(NS)Bseq :: (nat => 'a::real_normed_vector) => bool 

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

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

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

992 
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

993 
sgn :: 'a::real_normed_vector => 'a 
23116  994 
exp :: 'a::{recpower,real_normed_field,banach} => 'a 
21791  995 

996 
* Complex: Some complexspecific constants are now abbreviations for 

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

999 
polymorphic versions (INCOMPATIBILITY): 

21791  1000 

1001 
approx < capprox 

1002 
HFinite < CFinite 

1003 
HInfinite < CInfinite 

1004 
Infinitesimal < CInfinitesimal 

1005 
monad < cmonad 

1006 
galaxy < cgalaxy 

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

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

1009 
(ns)deriv < (ns)cderiv 

1010 

19653  1011 

17878  1012 
*** ML *** 
1013 

23251  1014 
* Generic arithmetic modules: Tools/integer.ML, Tools/rat.ML, Tools/float.ML 
1015 

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

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

22848  1020 

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

1023 
compiletime. For example: 

1024 

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

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

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

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

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

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

1031 
ML {* @{thm asm_rl} *} 

1032 
ML {* @{thms asm_rl} *} 

22376  1033 
ML {* @{const_name c} *} 
1034 
ML {* @{const_syntax c} *} 

22138  1035 
ML {* @{context} *} 
1036 
ML {* @{theory} *} 

1037 
ML {* @{theory Pure} *} 

1038 
ML {* @{simpset} *} 

1039 
ML {* @{claset} *} 

1040 
ML {* @{clasimpset} *} 

1041 

22151  1042 
The same works for sources being ``used'' within an Isar context. 
1043 

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

1046 

20348  1047 
* Pure/library: 
1048 

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

1049 
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

1050 
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

1051 

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

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

1057 

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

1060 

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

1061 
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

1062 
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

1063 

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

1066 
given more convenient names and signatures reminiscent of similar 

1067 
functions for alists, tables, etc: 

18051  1068 

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

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

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

1072 

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

1075 

22126  1076 
* Pure/library: added general ``divide_and_conquer'' combinator on 
1077 
lists. 

19032  1078 

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

1080 
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

1081 
admits slightly more efficient complex applications. 
18446  1082 

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

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

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

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

1089 

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

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

18738  1093 
minimizing code duplication. Thm.rule_attribute and 
1094 
Thm.declaration_attribute build canonical attributes; see also 

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

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

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

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

1098 

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

22126  1101 
logic, but only for type inference.) IMPORTANT INTERNAL CHANGE, 
1102 
potential INCOMPATIBILITY. 

19508  1103 

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

1105 
explicit proofs of class axioms and super class relations performed 

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

1107 
notably AxClass.define_class supercedes AxClass.add_axclass, and 

1108 
AxClass.axiomatize_class/classrel/arity supercede 

1109 
Sign.add_classes/classrel/arities. 

1110 

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

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

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

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

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

1115 
attributes, methods, etc. 
18642  1116 

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

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

1120 
fold_map combinators. 

18051  1121 

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

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

1123 
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

1124 
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

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

1126 

18020  1127 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  1128 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  1129 
achieve the old behaviour. 
1130 

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

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

1133 
statements. 

1134 

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

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

1136 
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

1137 
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

1138 

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

1141 
some popular functions from term.ML: 

1142 

1143 
Term.variant > Name.variant 

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

1145 
Term.invent_names > Name.invent_list 

1146 

1147 
Note that lowlevel renaming rarely occurs in new code  operations 

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

1149 

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

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

1151 
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

1152 
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

1153 
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

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

1155 

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

1157 
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

1158 
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

1159 
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

1160 
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

1161 
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

1162 
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

1163 
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

1164 

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

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

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

1168 
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

1169 
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

1170 

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

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

1172 

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

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

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

1176 

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

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

1178 

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

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

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

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

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

1183 

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

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

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

1186 

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

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

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

1189 

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

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

1191 
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

1192 
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

1193 
batch mode. 
18567  1194 

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

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

17890  1198 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  1199 
(solver, looper etc.) may depend on arbitrary proof data. 
1200 

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

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

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

1204 
former Simplifier.inherit_bounds, which is already included here  

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

17878  1207 

1208 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

1211 
INCOMPATIBILITY. 

1212 

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

1215 

17878  1216 

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

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

1218 

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

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

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

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

1222 

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

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

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

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

1226 

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

1227 

17720  1228 
New in Isabelle2005 (October 2005) 
1229 
 

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

1230 

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

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

1232 

15130  1233 
* Theory headers: the new header syntax for Isar theories is 
1234 

1235 
theory <name> 

16234  1236 
imports <theory1> ... <theoryN> 
1237 
uses <file1> ... <fileM> 

15130  1238 
begin 
1239 

16234  1240 
where the 'uses' part is optional. The previous syntax 
1241 

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

1243 

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

17371  1246 
nonIsar theories now, but these will disappear soon. 
15130  1247 

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

1248 
* Theory loader: parent theories can now also be referred to via 
16234  1249 
relative and absolute paths. 
1250 

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

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

1252 
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

1253 
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

1254 
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

1255 
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

1256 
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

1257 
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

1258 
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

1259 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  1260 

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

1261 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  1262 

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

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

1265 
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

1266 

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

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

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

1269 

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

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

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

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

17385  1277 

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

1280 
faster. 

1281 

15703  1282 

1283 
*** Document preparation *** 

1284 

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

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

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

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

1290 
DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively). 

1291 

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

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

1293 
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

1294 
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

1295 
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

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

1297 
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

1298 
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

1299 
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

1300 
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

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

1302 

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

1303 
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

1304 
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

1305 
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

1306 
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

1307 
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

1308 
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

1309 
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

1310 
specified above. 
16234  1311 

17402  1312 
* Several new antiquotations: 
15979  1313 

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

1315 

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

1317 

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

15979  1320 

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

16234  1322 
theorem applying a "style" to it 
1323 

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

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

1325 

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

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

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

1332 
typechecked ML expressions verbatim. 
16234  1333 

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

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

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

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

1338 

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

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

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

1342 

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

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

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

1345 

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

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

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

1348 

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

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

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

1351 

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

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

1353 
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

1354 
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

1355 

16234  1356 

1357 
*** Pure *** 

1358 

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

1360 
automatic typeinference of declared constants; additional support for 

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

1362 
isarref manual. Potential INCOMPATIBILITY: need to observe strictly 

1363 
sequential dependencies of definitions within a single 'constdefs' 

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

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

1366 

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

1368 
indexed syntax provides a notational device for subscripted 

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

1370 
expressions. Secondly, in a local context with structure 

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

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

1373 
show_structs controls printing of implicit structures. Typical 

1374 
applications of these concepts involve record types and locales. 

1375 

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

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

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

1379 

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

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

1382 
parsing/printing, see also isarref manual. 

1383 

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

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

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

1388 
INCOMPATIBILITY. 

1389 

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

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

1391 
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

1392 
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

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

1394 

16234  1395 
* Improved internal renaming of symbolic identifiers  attach primes 
1396 
instead of base 26 numbers. 

1397 

1398 
* New flag show_question_marks controls printing of leading question 

1399 
marks in schematic variable names. 

1400 

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

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

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

1404 

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