author  wenzelm 
Tue, 24 Jul 2007 19:44:32 +0200  
changeset 23961  9e7e1e309ebd 
parent 23920  4288dc7dc248 
child 23971  e6d505d5b03d 
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 

23888
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

27 
* Theory loader: be more serious about observing the static theory 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

28 
header specifications (including optional directories), but not the 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

29 
accidental file locations of previously successful loads. Potential 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

30 
INCOMPATIBILITY, may need to refine theory headers. 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

31 

babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

32 
* Theory loader: optional support for contentbased file 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

33 
identification, instead of the traditional scheme of full physical 
23889  34 
path plus date stamp; configured by the ISABELLE_FILE_IDENT setting 
23888
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

35 
(cf. the system manual). The new scheme allows to work with 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

36 
nonfinished theories in persistent session images, such that source 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

37 
files may be moved later on without requiring reloads. 
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

38 

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

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

40 
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

41 
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

42 
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

43 
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

44 
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

45 
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

46 

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

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

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

49 
support a specific search form (see ProofGeneral/CHANGES). 
22965  50 

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

53 
suppressed from proof state output. Note that the ProofGeneral 

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

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

56 
limit is imposed. 

57 

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

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

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

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

61 
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

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

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

64 

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

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

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

67 

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

68 

17865  69 
*** Document preparation *** 
70 

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

73 
current context. 

21339  74 

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

17865  77 

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

21735  80 
arguments may be given on the LHS.) 
21717  81 

82 

17865  83 

17779  84 
*** Pure *** 
85 

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

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

87 
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

88 

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

90 
 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

91 
explicitly to the table of defining equations 
22754  92 
 primitive definitions are not used as defining equations by default any longer 
22735  93 
 defining equations are now definitly restricted to meta "==" and object 
94 
equality "=" 

95 
 HOL theories have been adopted accordingly 

96 

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

98 
achieve Haskelllike type classes in Isabelle. See 
20807  99 
HOL/ex/Classpackage.thy for examples. 
100 

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

102 
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

103 

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

104 
internal compilation: 
23850  105 
code_gen <list of constants (term syntax)> in SML 
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

106 
writing SML code to a file: 
23850  107 
code_gen <list of constants (term syntax)> in SML <filename> 
22735  108 
writing OCaml code to a file: 
23850  109 
code_gen <list of constants (term syntax)> in OCaml <filename> 
20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset

110 
writing Haskell code to a bunch of files: 
23850  111 
code_gen <list of constants (term syntax)> in Haskell <filename> 
20453
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

112 

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

113 
Reasonable default setup of framework in HOL/Main. 
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 
Theorem attributs for selecting and transforming function equations theorems: 
855f07fabd76
final syntax for some Isar code generator keywords
haftmann
parents:
20375
diff
changeset

116 

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

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

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

121 

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

123 

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

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

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

126 

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

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

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

129 

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

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

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

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

133 

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

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

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

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

137 

22735  138 
code_instance and code_class only apply to target Haskell. 
139 

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

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

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

142 

19254  143 
* Command 'no_translations' removes translation rules from theory 
144 
syntax. 

145 

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

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

149 
correspondence to type class and instance declarations. 

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

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

19711  152 

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

154 
instantiation that matches an instance against the most general 

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

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

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

158 
recursion over such type arguments. Incomplete specification patterns 

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

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

163 

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

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

165 
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

166 
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

167 
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

168 
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

169 
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

170 
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

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

172 

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

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

174 
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

175 
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

176 
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

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

178 

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

181 

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

183 
then guess x and y by clarify 

184 

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

186 
proof tools being involved here. 

187 

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

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

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

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

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

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

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

196 

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

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

18020  200 

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

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

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

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

205 

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

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

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

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

209 

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

212 

18308  213 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
214 

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

216 

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

219 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  220 
'unfolded' attribute may be replaced by firstclass proof text. 
221 

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

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

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

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

225 
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

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

227 

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

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

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

233 
originally first one. 

19220  234 

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

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

236 
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

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

238 

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

241 
(essentially a disjunction of cases with local parameters and 

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

18910  243 
adequately; in this notation common elimination rules look like this: 
18901  244 

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

246 
assumes "EX x. P x" 

247 
obtains x where "P x" 

248 

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

250 
assumes "A & B" 

251 
obtains A and B 

252 

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

254 
assumes "A  B" 

255 
obtains 

256 
A 

257 
 B 

258 

18910  259 
The subsequent classical rules even refer to the formal "thesis" 
18901  260 
explicitly: 
261 

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

263 
obtains "~ thesis" 

264 

18910  265 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
266 
obtains "thesis ==> something" 

18901  267 

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

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

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

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

273 
case_names). 

18901  274 

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

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

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

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

278 
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

279 

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

282 
toplevel lemma. 

283 

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

286 

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

289 
to occur. 

290 

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

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

292 
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

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

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

295 

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

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

297 
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

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

299 

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

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

301 
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

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

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

304 

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

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

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

309 

19665  310 
axiomatization 
21595  311 
eq (infix "===" 50) where 
312 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

313 

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

315 
definition g where "g x = f x x" 

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

316 

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

320 

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

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

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

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

328 

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

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

332 
'translations' in common applications. 

19084  333 

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

334 
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

335 
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

336 
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

337 
'translations' with explicit "CONST" markup to accommodate this. 
19665  338 

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

341 
abbreviations on output. 

342 

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

345 
 parameter renamings are no longer required to be injective. 

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

347 
locale endom = homom mult mult h. 

348 

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

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

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

353 
predicates, goals repesenting already interpreted fragments are not 

354 
removed automatically. Use methods `intro_locales' and 

355 
`unfold_locales'; see below. 

356 

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

358 
provide backward reasoning on locales predicates. The methods are 

359 
aware of interpretations and discharge corresponding goals. 

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

361 
unfold predicates to assumptions. 

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

362 

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

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

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

366 

23920  367 
* Isar/locales: interpretation in theories and proof contexts has been 
368 
extended. One may now specify (and prove) equations, which are 

369 
unfolded in interpreted theorems. This is useful for replacing 

370 
defined concepts (constants depending on locale parameters) by 

371 
concepts already existing in the target context. Example: 

372 

373 
interpretation partial_order ["op <= :: [int, int] => bool"] 

374 
where "partial_order.less (op <=) (x::int) y = (x < y)" 

375 

376 
Typically, the constant `partial_order.less' is created by the 

377 
specification element definition in the context of locale partial_order. 

378 

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

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

382 
(using objectlogic connectives for this purpose has been long 

383 
obsolete anyway). The subsequent proof patterns illustrate advanced 

384 
techniques of natural induction; general datatypes and inductive sets 

18267  385 
work analogously (see also src/HOL/Lambda for realistic examples). 
386 

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

18239  388 
parameters: 
18233  389 

390 
lemma 

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

392 
assumes a: "A n x" 

393 
shows "P n x" 

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

20503  395 
proof (induct n arbitrary: x)  {* generalize goal to "!!x. A n x ==> P n x" *} 
18248  396 
case 0 
18233  397 
show ?case sorry 
398 
next 

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

18233  402 
show ?case sorry 
403 
qed 

404 

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

410 
lemma 

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

412 
assumes a: "A (a x)" 

413 
shows "P (a x)" 

414 
using a 

20503  415 
proof (induct n == "a x" arbitrary: x) 
18233  416 
... 
417 

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

420 

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

423 
encodings: 

424 

425 
lemma 

426 
fixes n :: nat 

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

20503  428 
proof (induct n arbitrary: thesis) 
18267  429 
case 0 
430 
obtain x where "P 0 x" and "Q 0 x" sorry 

18399  431 
then show thesis by (rule 0) 
18267  432 
next 
433 
case (Suc n) 

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

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

436 
then show thesis by (rule Suc.prems) 

437 
qed 

438 

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

18267  441 
existence statement through the induction as expected. 
18233  442 

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

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

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

445 
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

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

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

448 

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

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

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

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

452 

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

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

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

455 

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

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

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

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

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

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

461 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

480 

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

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

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

483 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

511 

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

512 
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

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

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

515 

18507  516 
lemma 
517 
shows "a : A ==> P1 a" 

518 
"a : A ==> P2 a" 

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

520 
"b : B ==> Q2 b" 

521 
"b : B ==> Q3 b" 

522 
proof (induct set: A B) 

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

523 

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

526 

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

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

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

529 

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

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

533 
trace indicates where parts have been suppressed. 

18674  534 

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

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

536 
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

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

538 

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

541 
least one premise. 

542 

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

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

547 

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

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

549 
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

550 
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

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

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

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

554 

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

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

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

557 
for example "A > B" => "Pi A (%_. B)". 
17779  558 

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

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

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

561 

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

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

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

564 

17865  565 

17806  566 
*** HOL *** 
567 

23850  568 
* Code generator library theories: 
569 
* Pretty_Int represents HOL integers by big integer literals in target 

570 
languages. 

571 
* Pretty_Char represents HOL characters by character literals in target 

572 
languages. 

573 
* Pretty_Char_chr like Pretty_Char, but also offers treatment of character 

574 
codes; includes Pretty_Int. 

575 
* Executable_Set allows to generate code for finite sets using lists. 

576 
* Executable_Rat implements rational numbers as triples (sign, enumerator, 

577 
denominator). 

578 
* Executable_Real implements a subset of real numbers, namly those 

579 
representable by rational numbers. 

580 
* Efficient_Nat implements natural numbers by integers, which in general will 

581 
result in higher efficency; pattern matching with 0/Suc is eliminated; 

582 
includes Pretty_Int. 

583 
* ML_String provides an additional datatype ml_string; in the HOL default 

584 
setup, strings in HOL are mapped to lists of HOL characters in SML; values 

585 
of type ml_string are mapped to strings in SML. 

586 
* ML_Int provides an additional datatype ml_int which is mapped to to SML 

587 
builtin integers. 

588 

23783
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

589 
* New package for inductive predicates 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

590 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

591 
An nary predicate p with m parameters z_1, ..., z_m can now be defined via 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

592 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

593 
inductive 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

594 
p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

595 
for z_1 :: U_1 and ... and z_n :: U_m 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

596 
where 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

597 
rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

598 
 ... 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

599 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

600 
rather than 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

601 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

602 
consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

603 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

604 
abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

605 
where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

606 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

607 
inductive "s z_1 ... z_m" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

608 
intros 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

609 
rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

610 
... 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

611 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

612 
For backward compatibility, there is a wrapper allowing inductive 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

613 
sets to be defined with the new package via 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

614 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

615 
inductive_set 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

616 
s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

617 
for z_1 :: U_1 and ... and z_n :: U_m 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

618 
where 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

619 
rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

620 
 ... 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

621 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

622 
or 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

623 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

624 
inductive_set 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

625 
s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

626 
and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

627 
for z_1 :: U_1 and ... and z_n :: U_m 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

628 
where 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

629 
"p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

630 
 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

631 
 ... 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

632 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

633 
if the additional syntax "p ..." is required. 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

634 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

635 
Many examples can be found in the subdirectories Auth, Bali, Induct, 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

636 
or MicroJava. 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

637 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

638 
INCOMPATIBILITIES: 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

639 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

640 
 Since declaration and definition of inductive sets or predicates 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

641 
is no longer separated, abbreviations involving the newly introduced 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

642 
sets or predicates must be specified together with the introduction 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

643 
rules after the "where" keyword (see example above), rather than before 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

644 
the actual inductive definition. 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

645 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

646 
 The variables in induction and elimination rules are now quantified 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

647 
in the order of their occurrence in the introduction rules, rather than 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

648 
in alphabetical order. Since this may break some proofs, these proofs 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

649 
either have to be repaired, e.g. by reordering the variables 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

650 
a_i_1 ... a_i_{k_i} in Isar "case" statements of the form 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

651 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

652 
case (rule_i a_i_1 ... a_i_{k_i}) 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

653 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

654 
or the old order of quantification has to be restored by explicitly adding 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

655 
metalevel quantifiers in the introduction rules, i.e. 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

656 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

657 
 rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n" 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

658 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

659 
 The format of the elimination rules is now 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

660 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

661 
p z_1 ... z_m x_1 ... x_n ==> 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

662 
(!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P) 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

663 
==> ... ==> P 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

664 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

665 
for predicates and 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

666 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

667 
(x_1, ..., x_n) : s z_1 ... z_m ==> 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

668 
(!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P) 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

669 
==> ... ==> P 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

670 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

671 
for sets rather than 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

672 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

673 
x : s z_1 ... z_m ==> 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

674 
(!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P) 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

675 
==> ... ==> P 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

676 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

677 
This may require terms in goals to be expanded to ntuples (e.g. using case_tac 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

678 
or simplification with the split_paired_all rule) before the above elimination 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

679 
rule is applicable. 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

680 

e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

681 
 The elimination or case analysis rules for (mutually) inductive sets or 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

682 
predicates are now called "p_1.cases" ... "p_k.cases". The list of rules 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

683 
"p_1_..._p_k.elims" is no longer available. 
e4d514f81d95
Added entry for new inductive definition package.
berghofe
parents:
23565
diff
changeset

684 

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

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

23449  688 

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

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

692 
wait for the automatic provers to return. 

23449  693 

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

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

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

702 

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

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

706 
(potential INCOMPATIBILITY) 

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

708 
 of_nat_diff and of_nat_mult are no longer default simp rules 

23377  709 

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

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

711 
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

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

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

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

715 
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

716 
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

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

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

719 

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

722 
possible incompatibilities when working on ML level. 

723 

22997  724 
* Constant renames due to introduction of canonical name prefixing for 
725 
class package: 

726 

727 
HOL.abs ~> HOL.minus_class.abs 

728 
HOL.divide ~> HOL.divide_class.divide 

729 
Nat.power ~> Nat.power_class.power 

730 
Nat.size ~> Nat.size_class.size 

731 
Numeral.number_of ~> Numeral.number_class.number_of 

23129  732 
FixedPoint.Inf ~> FixedPoint.complete_lattice_class.Inf 
733 

23180  734 
* Rudimentary class target mechanism involves constant renames: 
23129  735 

736 
Orderings.min ~> Orderings.ord_class.min 

737 
Orderings.max ~> Orderings.ord_class.max 

738 
FixedPoint.Sup ~> FixedPoint.complete_lattice_class.Sup 

22997  739 

23564  740 
* primrec: missing cases mapped to "undefined" instead of "arbitrary" 
22845  741 

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

743 

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

745 

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

748 

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

751 
For details see List.thy. 

23102  752 

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

755 
and for uniformity. INCOMPATIBILITY 

756 

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

23481  759 
with all denominators that can be proved to be nonzero (in equations) 
23480  760 
or positive/negative (in inequations). 
761 

762 
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib 

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

766 
INCOMPATIBILITY. 

23478  767 

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

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

770 

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

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

773 

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

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

778 

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

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

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

781 

22450  782 
classes "meet_semilorder" and "join_semilorder" now named 
783 
"lower_semilattice" and "upper_semilattice" 

784 
class "lorder" now named "lattice" 

785 
class "comp_lat" now named "complete_lattice" 

786 

787 
Instantiation of lattice classes allows explicit definitions 

788 
for "inf" and "sup" operations. 

789 

23129  790 
INCOMPATIBILITY. Theorem renames: 
22450  791 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

827 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

845 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

874 

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

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

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

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

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

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

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

881 

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

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

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

884 

22450  885 
meet_min ~> inf_min 
886 
join_max ~> sup_max 

887 

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

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

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

891 

22845  892 
* Classes "order" and "linorder": 
22316  893 
potential INCOMPATIBILITY: order of proof goals in order/linorder instance 
894 
proofs changed. 

895 

22218  896 
* Dropped lemma duplicate def_imp_eq in favor of meta_eq_to_obj_eq. 
897 
INCOMPATIBILITY. 

898 

899 
* Dropped lemma duplicate if_def2 in favor of if_bool_eq_conj. 

900 
INCOMPATIBILITY. 

901 

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

904 

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

22997  906 
dvd" to "Divides.div_class.div", "Divides.div_class.mod" and "Divides.dvd". INCOMPATIBILITY. 
22126  907 

908 
* Added method "lexicographic_order" automatically synthesizes 

909 
termination relations as lexicographic combinations of size measures 

910 
 'function' package. 

911 

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

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

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

915 
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

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

917 

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

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

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

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

923 

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

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

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

927 

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

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

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

930 

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

934 

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

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

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

938 

22997  939 
* Renamed constants "0" to "HOL.zero_class.zero" and "1" to "HOL.one_class.one". 
22126  940 
INCOMPATIBILITY. 
941 

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

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

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

946 
significant changes for setting up numeral syntax for types: 

20485  947 

948 
 new constants Numeral.pred and Numeral.succ instead 

949 
of former Numeral.bin_pred and Numeral.bin_succ. 

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

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

952 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

953 

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

955 

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

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

959 
suitable for heavyduty computations because the functions are 

960 
compiled to ML first. 

19895  961 

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

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

965 

19279  966 
* Renamed constants in HOL.thy and Orderings.thy: 
22997  967 
op + ~> HOL.plus_class.plus 
968 
op  ~> HOL.minus_class.minus 

969 
uminus ~> HOL.minus_class.uminus 

23881  970 
abs ~> HOL.abs_class.abs 
22997  971 
op * ~> HOL.times_class.times 
23881  972 
op < ~> HOL.ord_class.less 
973 
op <= ~> HOL.ord_class.less_eq 

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

974 

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

975 
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

976 

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

979 
may go wrong. 

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

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

981 

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

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

984 

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

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

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

989 
distribution). 

990 
INCOMPATIBILITY: rewrite proofs 

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

991 

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

992 
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

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

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

996 

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

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

1000 

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

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

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

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

1005 

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

19377  1008 

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

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

17779  1012 

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

1015 

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

19211  1017 

19279  1018 
* Theorem setsum_mult renamed to setsum_right_distrib. 
1019 

19211  1020 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
22126  1021 
``rule'' method. 
1022 

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

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

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

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

1027 
speedup. 

1028 

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

1030 
zChaff is still supported as well. 

1031 

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

1033 
bundled as foo_bar.inducts; 

1034 

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

1036 
Library. 

21256  1037 

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

1039 

18446  1040 
* Library: added theory Coinductive_List of potentially infinite lists 
1041 
as greatest fixedpoint. 

18399  1042 

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

1045 

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

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

20807  1049 

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

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

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

1054 

22126  1055 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  1056 

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

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

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

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

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

1063 

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

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

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

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

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

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

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

1071 

23881  1072 
* Reflection: Automatic reification now handels binding, an example 
20807  1073 
is available in HOL/ex/ReflectionEx.thy 
1074 

1075 

20169  1076 
*** HOLAlgebra *** 
1077 

21170  1078 
* Formalisation of ideals and the quotient construction over rings. 
1079 

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

1081 
INCOMPATIBILITY. 

1082 

22126  1083 
* Renamed lemmas least_carrier > least_closed and greatest_carrier > 
1084 
greatest_closed. INCOMPATIBILITY. 

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

1085 

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

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

1089 

22126  1090 
* Renamed theory CRing to Ring. 
20169  1091 

20807  1092 

19653  1093 
*** HOLComplex *** 
1094 

1095 
* Theory Real: new method ferrack implements quantifier elimination 

1096 
for linear arithmetic over the reals. The quantifier elimination 

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

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

1099 

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

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

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

1104 
INCOMPATIBILITY. 

1105 

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

1108 
and norm :: 'a => real. 

1109 

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

1112 
is now defined as range of_real; potential INCOMPATIBILITY. 

1113 

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

1116 

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

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

1120 
INCOMPATIBILITY. 

21791  1121 

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

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

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

1124 
HInfinite :: ('a::real_normed_vector) star set 
21791  1125 
approx :: ('a::real_normed_vector) star => 'a star => bool 
1126 
monad :: ('a::real_normed_vector) star => 'a star set 

1127 
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

1128 
(NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool 
21791  1129 
(NS)convergent :: (nat => 'a::real_normed_vector) => bool 
1130 
(NS)Bseq :: (nat => 'a::real_normed_vector) => bool 

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

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

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

1134 
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

1135 
sgn :: 'a::real_normed_vector => 'a 
23116  1136 
exp :: 'a::{recpower,real_normed_field,banach} => 'a 
21791  1137 

1138 
* Complex: Some complexspecific constants are now abbreviations for 

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

1141 
polymorphic versions (INCOMPATIBILITY): 

21791  1142 

1143 
approx < capprox 

1144 
HFinite < CFinite 

1145 
HInfinite < CInfinite 

1146 
Infinitesimal < CInfinitesimal 

1147 
monad < cmonad 

1148 
galaxy < cgalaxy 

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

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

1151 
(ns)deriv < (ns)cderiv 

1152 

19653  1153 

17878  1154 
*** ML *** 
1155 

23251  1156 
* Generic arithmetic modules: Tools/integer.ML, Tools/rat.ML, Tools/float.ML 
1157 

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

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

22848  1162 

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

1165 
compiletime. For example: 

1166 

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

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

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

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

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

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

1173 
ML {* @{thm asm_rl} *} 

1174 
ML {* @{thms asm_rl} *} 

22376  1175 
ML {* @{const_name c} *} 
1176 
ML {* @{const_syntax c} *} 

22138  1177 
ML {* @{context} *} 
1178 
ML {* @{theory} *} 

1179 
ML {* @{theory Pure} *} 

1180 
ML {* @{simpset} *} 

1181 
ML {* @{claset} *} 

1182 
ML {* @{clasimpset} *} 

1183 

22151  1184 
The same works for sources being ``used'' within an Isar context. 
1185 

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

1188 

20348  1189 
* Pure/library: 
1190 

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

1191 
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

1192 
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

1193 

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

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

1199 

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

1202 

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

1203 
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

1204 
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

1205 

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

1208 
given more convenient names and signatures reminiscent of similar 

1209 
functions for alists, tables, etc: 

18051  1210 

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

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

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

1214 

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

1217 

22126  1218 
* Pure/library: added general ``divide_and_conquer'' combinator on 
1219 
lists. 

19032  1220 

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

1222 
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

1223 
admits slightly more efficient complex applications. 
18446  1224 

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

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

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

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

1231 

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

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

18738  1235 
minimizing code duplication. Thm.rule_attribute and 
1236 
Thm.declaration_attribute build canonical attributes; see also 

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

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

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

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

1240 

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

22126  1243 
logic, but only for type inference.) IMPORTANT INTERNAL CHANGE, 
1244 
potential INCOMPATIBILITY. 

19508  1245 

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

1247 
explicit proofs of class axioms and super class relations performed 

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

1249 
notably AxClass.define_class supercedes AxClass.add_axclass, and 

1250 
AxClass.axiomatize_class/classrel/arity supercede 

1251 
Sign.add_classes/classrel/arities. 

1252 

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

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

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

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

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

1257 
attributes, methods, etc. 
18642  1258 

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

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

1262 
fold_map combinators. 

18051  1263 

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

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

1265 
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

1266 
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

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

1268 

18020  1269 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  1270 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  1271 
achieve the old behaviour. 
1272 

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

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

1275 
statements. 

1276 

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

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

1278 
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

1279 
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

1280 

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

1283 
some popular functions from term.ML: 

1284 

1285 
Term.variant > Name.variant 

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

1287 
Term.invent_names > Name.invent_list 

1288 

1289 
Note that lowlevel renaming rarely occurs in new code  operations 

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

1291 

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

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

1293 
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

1294 
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

1295 
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

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

1297 

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

1299 
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

1300 
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

1301 
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

1302 
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

1303 
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

1304 
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

1305 
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

1306 

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

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

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

1310 
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

1311 
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

1312 

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

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

1314 

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

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

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

1318 

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

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

1320 

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

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

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

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

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

1325 

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

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

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

1328 

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

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

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

1331 

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

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

1333 
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

1334 
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

1335 
batch mode. 
18567  1336 

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

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

17890  1340 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  1341 
(solver, looper etc.) may depend on arbitrary proof data. 
1342 

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

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

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

1346 
former Simplifier.inherit_bounds, which is already included here  

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

17878  1349 

1350 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

1353 
INCOMPATIBILITY. 

1354 

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

1357 

17878  1358 

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

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

1360 

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

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

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

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

1364 

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

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

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

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

1368 

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

1369 

17720  1370 
New in Isabelle2005 (October 2005) 
1371 
 

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

1372 

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

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

1374 

15130  1375 
* Theory headers: the new header syntax for Isar theories is 
1376 

1377 
theory <name> 

16234  1378 
imports <theory1> ... <theoryN> 
1379 
uses <file1> ... <fileM> 

15130  1380 
begin 
1381 

16234  1382 
where the 'uses' part is optional. The previous syntax 
1383 

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

1385 

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

17371  1388 
nonIsar theories now, but these will disappear soon. 
15130  1389 

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

1390 
* Theory loader: parent theories can now also be referred to via 
16234  1391 
relative and absolute paths. 
1392 

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

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

1394 
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

1395 
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

1396 
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

1397 
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

1398 
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

1399 
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

1400 
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

1401 
'ProofGeneral > Find Theorems' or Cc Cf. Example: 
16234  1402 

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

1403 
Cc Cf (100) "(_::nat) + _ + _" intro name: "HOL." 
16234  1404 

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

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

1407 
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
