author  huffman 
Thu, 26 May 2005 02:23:27 +0200  
changeset 16081  81a4b4a245b0 
parent 16051  b6a945f205b7 
child 16102  c5f6726d9bb1 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

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

4 
New in this Isabelle release 
8a95abf87dd3
Pure: considerably improved version of 'constdefs' command;
wenzelm
parents:
14624
diff
changeset

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

6 

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

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

8 

15130  9 
* Theory headers: the new header syntax for Isar theories is 
10 

11 
theory <name> 

15148  12 
imports <theory1> ... <theoryn> 
15130  13 
begin 
14 

15148  15 
optionally also with a "files" section. The syntax 
15130  16 

17 
theory <name> = <theory1> + ... + <theoryn>: 

18 

19 
will still be supported for some time but will eventually disappear. 

20 
The syntax of oldstyle theories has not changed. 

21 

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

22 
* Theory loader: parent theories can now also be referred to via 
fdf9434b04ea
 Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset

23 
relative and absolute paths. 
fdf9434b04ea
 Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset

24 

16013
3010430d894d
removed find_rewrites (superceded by improved thms_containing);
wenzelm
parents:
16000
diff
changeset

25 
* Provers/quasi.ML: new transitivity reasoners for transitivity only 
15103
79846e8792eb
New transitivity reasoners for transitivity only and quasi orders.
ballarin
parents:
15089
diff
changeset

26 
and quasi orders. 
79846e8792eb
New transitivity reasoners for transitivity only and quasi orders.
ballarin
parents:
15089
diff
changeset

27 

16013
3010430d894d
removed find_rewrites (superceded by improved thms_containing);
wenzelm
parents:
16000
diff
changeset

28 
* Provers/trancl.ML: new transitivity reasoner for transitive and 
15076
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
15073
diff
changeset

29 
reflexivetransitive closure of relations. 
4b3d280ef06a
New prover for transitive and reflexivetransitive closure of relations.
ballarin
parents:
15073
diff
changeset

30 

16013
3010430d894d
removed find_rewrites (superceded by improved thms_containing);
wenzelm
parents:
16000
diff
changeset

31 
* Provers/blast.ML: new reference depth_limit to make blast's depth 
15163  32 
limit (previously hardcoded with a value of 20) userdefinable. 
33 

15481  34 
* Provers: new version of the subst method, for singlestep rewriting: it now 
35 
works in bound variable contexts. New is subst (asm), for rewriting an 

36 
assumption. Thanks to Lucas Dixon! INCOMPATIBILITY: may rewrite a different 

37 
subterm than the original subst method, which is still available under the 

38 
name simplesubst. 

39 

15454  40 
* Pure: thin_tac now works even if the assumption being deleted contains !! or ==>. 
41 
More generally, erule now works even if the major premise of the elimination rule 

42 
contains !! or ==>. 

43 

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

44 
* Pure: considerably improved version of 'constdefs' command. Now 
14731  45 
performs automatic typeinference of declared constants; additional 
46 
support for local structure declarations (cf. locales and HOL 

47 
records), see also isarref manual. Potential INCOMPATIBILITY: need 

48 
to observe strictly sequential dependencies of definitions within a 

49 
single 'constdefs' section; moreover, the declared name needs to be 

50 
an identifier. If all fails, consider to fall back on 'consts' and 

51 
'defs' separately. 

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

52 

14698
7e4dec3fd515
improvd indexed syntax and implicit structures; tuned renaming of symbolic identifiers
wenzelm
parents:
14682
diff
changeset

53 
* Pure: improved indexed syntax and implicit structures. First of 
14731  54 
all, indexed syntax provides a notational device for subscripted 
55 
application, using the new syntax \<^bsub>term\<^esub> for arbitrary 

56 
expressions. Secondly, in a local context with structure 

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

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

59 
show_structs controls printing of implicit structures. Typical 

60 
applications of these concepts involve record types and locales. 

61 

14795
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

62 
* Pure: clear separation of logical types and nonterminals, where the 
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

63 
latter may only occur in 'syntax' specifications or type 
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

64 
abbreviations. Before that distinction was only partially 
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

65 
implemented via type class "logic" vs. "{}". Potential 
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

66 
INCOMPATIBILITY in rare cases of improper use of 'types'/'consts' 
b702848de41f
Pure: clear separation of logical types and nonterminals;
wenzelm
parents:
14731
diff
changeset

67 
instead of 'nonterminals'/'syntax'. Some very exotic syntax 
14816
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

68 
specifications may require further adaption (e.g. Cube/Base.thy). 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

69 

14854  70 
* Pure: removed obsolete type class "logic", use the top sort {} 
71 
instead. Note that nonlogical types should be declared as 

72 
'nonterminals' rather than 'types'. INCOMPATIBILITY for new 

73 
objectlogic specifications. 

74 

15744
daa84ebbdf94
Pure: command 'no_syntax' removes grammar declarations;
wenzelm
parents:
15727
diff
changeset

75 
* Pure: command 'no_syntax' removes grammar declarations (and 
daa84ebbdf94
Pure: command 'no_syntax' removes grammar declarations;
wenzelm
parents:
15727
diff
changeset

76 
translations) resulting from the given syntax specification, which 
daa84ebbdf94
Pure: command 'no_syntax' removes grammar declarations;
wenzelm
parents:
15727
diff
changeset

77 
is interpreted in the same manner as for the 'syntax' command. 
daa84ebbdf94
Pure: command 'no_syntax' removes grammar declarations;
wenzelm
parents:
15727
diff
changeset

78 

15022  79 
* Pure: print_tac now outputs the goal through the trace channel. 
80 

81 
* Pure: reference Namespace.unique_names included. If true the 

82 
(shortest) namespaceprefix is printed to disambiguate conflicts (as 

83 
yet). If false the first entry wins (as during parsing). Default 

84 
value is true. 

15018  85 

15033
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

86 
* Pure: tuned internal renaming of symbolic identifiers  attach 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

87 
primes instead of base 26 numbers. 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

88 

15979  89 
* Pure: new flag show_question_marks controls printing of leading 
90 
question marks in schematic variable names. 

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

91 

16000
786c5f838b0c
searching for combination of criteria (intro, elim, dest, name, pattern)
kleing
parents:
15979
diff
changeset

92 
* Pure: new version of thms_containing that searches for a list of 
786c5f838b0c
searching for combination of criteria (intro, elim, dest, name, pattern)
kleing
parents:
15979
diff
changeset

93 
criteria instead of a list of constants. Known criteria are: intro, 
786c5f838b0c
searching for combination of criteria (intro, elim, dest, name, pattern)
kleing
parents:
15979
diff
changeset

94 
elim, dest, name:string, and any term. Criteria can be preceded by 
786c5f838b0c
searching for combination of criteria (intro, elim, dest, name, pattern)
kleing
parents:
15979
diff
changeset

95 
'' to select theorems that do not match. Intro, elim, dest select 
786c5f838b0c
searching for combination of criteria (intro, elim, dest, name, pattern)
kleing
parents:
15979
diff
changeset

96 
theorems that match the current goal, name:s selects theorems whose 
786c5f838b0c
searching for combination of criteria (intro, elim, dest, name, pattern)
kleing
parents:
15979
diff
changeset

97 
fully qualified name contain s. Any other term is interpreted as 
786c5f838b0c
searching for combination of criteria (intro, elim, dest, name, pattern)
kleing
parents:
15979
diff
changeset

98 
pattern and selects all theorem matching the pattern. Available in 
786c5f838b0c
searching for combination of criteria (intro, elim, dest, name, pattern)
kleing
parents:
15979
diff
changeset

99 
ProofGeneral under ProofGeneral > Find Theorems or Cc Cf. 
786c5f838b0c
searching for combination of criteria (intro, elim, dest, name, pattern)
kleing
parents:
15979
diff
changeset

100 

786c5f838b0c
searching for combination of criteria (intro, elim, dest, name, pattern)
kleing
parents:
15979
diff
changeset

101 
Example: Cc Cf (100) "(_::nat) + _ + _" intro name:"HOL." 
786c5f838b0c
searching for combination of criteria (intro, elim, dest, name, pattern)
kleing
parents:
15979
diff
changeset

102 

786c5f838b0c
searching for combination of criteria (intro, elim, dest, name, pattern)
kleing
parents:
15979
diff
changeset

103 
prints the last 100 theorems matching the pattern "(_::nat) + _ + _", 
786c5f838b0c
searching for combination of criteria (intro, elim, dest, name, pattern)
kleing
parents:
15979
diff
changeset

104 
matching the current goal as introduction rule and not having "HOL." 
786c5f838b0c
searching for combination of criteria (intro, elim, dest, name, pattern)
kleing
parents:
15979
diff
changeset

105 
in their name (i.e. not being defined in theory HOL). 
15883
abff581e1d83
new thms_containing that searches for patterns instead of constants
kleing
parents:
15852
diff
changeset

106 

16051
b6a945f205b7
* Pure/Syntax: In schematic variable names, *any* symbol following
wenzelm
parents:
16042
diff
changeset

107 
* Pure/Syntax: In schematic variable names, *any* symbol following 
b6a945f205b7
* Pure/Syntax: In schematic variable names, *any* symbol following
wenzelm
parents:
16042
diff
changeset

108 
\<^isub> or \<^isup> is now treated as part of the base name. For 
b6a945f205b7
* Pure/Syntax: In schematic variable names, *any* symbol following
wenzelm
parents:
16042
diff
changeset

109 
example, the following works without printing of ugly ".0" indexes: 
b6a945f205b7
* Pure/Syntax: In schematic variable names, *any* symbol following
wenzelm
parents:
16042
diff
changeset

110 

b6a945f205b7
* Pure/Syntax: In schematic variable names, *any* symbol following
wenzelm
parents:
16042
diff
changeset

111 
lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1" 
b6a945f205b7
* Pure/Syntax: In schematic variable names, *any* symbol following
wenzelm
parents:
16042
diff
changeset

112 
by simp 
b6a945f205b7
* Pure/Syntax: In schematic variable names, *any* symbol following
wenzelm
parents:
16042
diff
changeset

113 

14816
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

114 
* Pure/Syntax: inner syntax includes (*(*nested*) comments*). 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

115 

b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

116 
* Pure/Syntax: pretty pinter now supports unbreakable blocks, 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

117 
specified in mixfix annotations as "(00...)". 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

118 

b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

119 
* Pure/Syntax: 'advanced' translation functions (parse_translation 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

120 
etc.) may depend on the signature of the theory context being 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

121 
presently used for parsing/printing, see also isarref manual. 
b77cebcd7e6e
* ML: all output via channels of writeln etc. passed through Output.output;
wenzelm
parents:
14795
diff
changeset

122 

16042  123 
* Pure/Simplifier: you can control the depth to which conditional rewriting 
124 
is traced via the PG menu Isabelle > Settings > Trace Simp Depth Limit. 

125 

15033
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

126 
* Pure/Simplifier: simplification procedures may now take the current 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

127 
simpset into account (cf. Simplifier.simproc(_i) / mk_simproc 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

128 
interface), which is very useful for calling the Simplifier 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

129 
recursively. Minor INCOMPATIBILITY: the 'prems' argument of 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

130 
simprocs is gone  use prems_of_ss on the simpset instead. 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

131 
Moreover, the lowlevel mk_simproc no longer applies Logic.varify 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

132 
internally, to allow for use in a context of fixed variables. 
255bc508a756
Simplifier and Classical Reasoner now support proof context dependent plugins;
wenzelm
parents:
15022
diff
changeset

133 

16013
3010430d894d
removed find_rewrites (superceded by improved thms_containing);
wenzelm
parents:
16000
diff
changeset

134 
* Isar debugging: new reference Toplevel.debug; default false. Set to 
3010430d894d
removed find_rewrites (superceded by improved thms_containing);
wenzelm
parents:
16000
diff
changeset

135 
make printing of exceptions THM, TERM, TYPE and THEORY more verbose. 
15528
1b12557f720d
New reference Toplevel.debug for verbose printing of exns.
ballarin
parents:
15481
diff
changeset

136 

15127  137 
* Locales: 
138 
 "includes" disallowed in declaration of named locales (command "locale"). 

15206
09d78ec709c7
Modified locales: improved implementation of "includes".
ballarin
parents:
15200
diff
changeset

139 
 Fixed parameter management in theorem generation for goals with "includes". 
09d78ec709c7
Modified locales: improved implementation of "includes".
ballarin
parents:
15200
diff
changeset

140 
INCOMPATIBILITY: rarely, the generated theorem statement is different. 
15475
fdf9434b04ea
 Proofs are now hidden by default when generating documents
berghofe
parents:
15454
diff
changeset

141 

15696  142 
* Locales: new commands for the interpretation of locale expressions 
143 
in theories (interpretation) and proof contexts (interpret). These take an 

144 
instantiation of the locale parameters and compute proof obligations from 

145 
the instantiated specification. After the obligations have been discharged, 

146 
the instantiated theorems of the locale are added to the theory or proof 

147 
context. Interpretation is smart in that already active interpretations 

148 
do not occur in proof obligations, neither are instantiated theorems stored 

149 
in duplicate. 

150 
Use print_interps to inspect active interpretations of a particular locale. 

15763
b901a127ac73
Interpretation supports statically scoped attributes; documentation.
ballarin
parents:
15744
diff
changeset

151 
For details, see the Isar Reference manual. 
15696  152 

15727
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

153 
* Locales: proper static binding of attribute syntax  i.e. types / 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

154 
terms / facts mentioned as arguments are always those of the locale 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

155 
definition context, independently of the context of later 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

156 
invocations. Moreover, locale operations (renaming and type / term 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

157 
instantiation) are applied to attribute arguments as expected. 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

158 

b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

159 
INCOMPATIBILITY of the ML interface: always pass Attrib.src instead 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

160 
of actual attributes; rare situations may require Attrib.attribute 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

161 
to embed those attributes into Attrib.src that lack concrete syntax. 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

162 

b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

163 
Attribute implementations need to cooperate properly with the static 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

164 
binding mechanism. Basic parsers Args.XXX_typ/term/prop and 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

165 
Attrib.XXX_thm etc. already do the right thing without further 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

166 
intervention. Only unusual applications  such as "where" or "of" 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

167 
(cf. src/Pure/Isar/attrib.ML), which process arguments depending 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

168 
both on the context and the facts involved  may have to assign 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

169 
parsed values to argument tokens explicitly. 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

170 

b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

171 
* Attributes 'induct' and 'cases': type or set names may now be 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

172 
locally fixed variables as well. 
b43d82139a6c
Locales: proper static binding of attribute syntax;
wenzelm
parents:
15724
diff
changeset

173 

15703  174 
* Isar: new syntax 'name(ij, i, i, ...)' for referring to specific 
175 
selections of theorems in named facts via indices. 

176 

15801  177 
* Pure: reorganized bootstrapping of the Pure theories; CPure is now 
178 
derived from Pure, which contains all common declarations already. 

179 
Both theories are defined via plain Isabelle/Isar .thy files. 

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

181 
CPure.elim / CPure.dest attributes) now appear in the Pure name 

182 
space; use isatool fixcpure to adapt your theory and ML sources. 

183 

16013
3010430d894d
removed find_rewrites (superceded by improved thms_containing);
wenzelm
parents:
16000
diff
changeset

184 
* Provers/simplifier.ML has been moved to Pure, where Simplifier.setup 
3010430d894d
removed find_rewrites (superceded by improved thms_containing);
wenzelm
parents:
16000
diff
changeset

185 
is peformed already. Objectlogics merely need to finish their 
3010430d894d
removed find_rewrites (superceded by improved thms_containing);
wenzelm
parents:
16000
diff
changeset

186 
initial simpset configuration as before. 
3010430d894d
removed find_rewrites (superceded by improved thms_containing);
wenzelm
parents:
16000
diff
changeset

187 

15703  188 

189 
*** Document preparation *** 

190 

15979  191 
* Several new antiquotation: 
192 

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

194 

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

196 

197 
@{const const} is the same as @{term const}, but checks 

198 
that the argument is a known logical constant; 

199 

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

201 
theorem applying a "style" to it 

202 

203 
Predefined styles are "lhs" and "rhs" printing the lhs/rhs of 

204 
definitions, equations, inequations etc. and "conclusion" printing 

205 
only the conclusion of a metalogical statement theorem. Styles may 

206 
be defined via TermStyle.add_style in ML. See the "LaTeX Sugar" 

207 
document for more information. 

15703  208 

209 
* Antiquotations now provide the option 'locale=NAME' to specify an 

210 
alternative context used for evaluating and printing the subsequent 

211 
argument, as in @{thm [locale=LC] fold_commute}, for example. 

212 

213 
* Commands 'display_drafts' and 'print_drafts' perform simple output 

214 
of raw sources. Only those symbols that do not require additional 

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

216 
displayed properly, everything else is left verbatim. We use 

217 
isatool display and isatool print as front ends; these are subject 

218 
to the DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively. 

219 

220 
* Proof scripts as well as some other commands such as ML or 

221 
parse/print_translation can now be hidden in the document. Hiding 

222 
is enabled by default, and can be disabled either via the option 'H 

223 
false' of isatool usedir or by resetting the reference variable 

224 
IsarOutput.hide_commands. Additional commands to be hidden may be 

225 
declared using IsarOutput.add_hidden_commands. 

226 

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

227 

14700
2f885b7e5ba7
reimplementation of HOL records; only one type is created for
schirmer
parents:
14699
diff
changeset

228 
*** HOL *** 
2f885b7e5ba7
reimplementation of HOL records; only one type is created for
schirmer
parents:
14699
diff
changeset

229 

15242  230 
* Datatype induction via method `induct' now preserves the name of the 
231 
induction variable. For example, when proving P(xs::'a list) by induction 

232 
on xs, the induction step is now P(xs) ==> P(a#xs) rather than 

233 
P(list) ==> P(a#list) as previously. 

234 

14731  235 
* HOL/record: reimplementation of records. Improved scalability for 
236 
records with many fields, avoiding performance problems for type 

237 
inference. Records are no longer composed of nested field types, but 

238 
of nested extension types. Therefore the record type only grows 

239 
linear in the number of extensions and not in the number of fields. 

240 
The toplevel (users) view on records is preserved. Potential 

241 
INCOMPATIBILITY only in strange cases, where the theory depends on 

242 
the old record representation. The type generated for a record is 

243 
called <record_name>_ext_type. 

244 

15022  245 
* HOL/record: Reference record_quick_and_dirty_sensitive can be 
246 
enabled to skip the proofs triggered by a record definition or a 

247 
simproc (if quick_and_dirty is enabled). Definitions of large 

248 
records can take quite long. 

249 

250 
* HOL/record: "record_upd_simproc" for simplification of multiple 

251 
record updates enabled by default. Moreover, trivial updates are 

252 
also removed: r(x := x r) = r. INCOMPATIBILITY: old proofs break 

253 
occasionally, since simplification is more powerful by default. 

15012
28fa57b57209
Added reference record_definition_quick_and_dirty_sensitive, to
schirmer
parents:
15011
diff
changeset

254 

14878  255 
* HOL: symbolic syntax of Hilbert Choice Operator is now as follows: 
256 

257 
syntax (epsilon) 

258 
"_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10) 

259 

260 
The symbol \<some> is displayed as the alternative epsilon of LaTeX 

261 
and xsymbol; use option 'm epsilon' to get it actually printed. 

262 
Moreover, the mathematically important symbolic identifier 

263 
\<epsilon> becomes available as variable, constant etc. 

264 

15361  265 
* HOL: "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x". 
15979  266 
Similarly for all quantifiers: "ALL x > y" etc. The xsymbol for >= 
267 
is \<ge>. 

268 

269 
* HOL/Set: "{x:A. P}" abbreviates "{x. x:A & P}" (and similarly for 

270 
"\<in>" instead of ":"). 

15534  271 

15046  272 
* HOL/SetInterval: The syntax for open intervals has changed: 
273 

274 
Old New 

275 
{..n(} > {..<n} 

276 
{)n..} > {n<..} 

277 
{m..n(} > {m..<n} 

278 
{)m..n} > {m<..n} 

279 
{)m..n(} > {m<..<n} 

280 

281 
The old syntax is still supported but will disappear in the future. 

282 
For conversion use the following emacs search and replace patterns: 

283 

284 
{)\([^\.]*\)\.\. > {\1<\.\.} 

285 
\.\.\([^(}]*\)(} > \.\.<\1} 

286 

287 
They are not perfect but work quite well. 

288 

15073  289 
* HOL: The syntax for 'setsum', summation over finite sets, has changed: 
290 

291 
The syntax for 'setsum (%x. e) A' used to be '\<Sum>x:A. e' 

292 
and is now either 'SUM x:A. e' or '\<Sum>x\<in>A. e'. 

293 

294 
There is new syntax for summation over finite sets: 

15046  295 

15050  296 
'\<Sum>x  P. e' is the same as 'setsum (%x. e) {x. P}' 
297 
'\<Sum>x=a..b. e' is the same as 'setsum (%x. e) {a..b}' 

298 
'\<Sum>x=a..<b. e' is the same as 'setsum (%x. e) {a..<b}' 

299 
'\<Sum>x<k. e' is the same as 'setsum (%x. e) {..<k}' 

15046  300 

301 
Function 'Summation' over nat is gone, its syntax '\<Sum>i<k. e' 

302 
now translates into 'setsum' as above. 

303 

15319  304 
* HOL: Finite set induction: In Isar proofs, the insert case is now 
305 
"case (insert x F)" instead of the old counterintuitive "case (insert F x)". 

306 

15200  307 
* HOL/Simplifier: 
308 

309 
 Is now set up to reason about transitivity chains involving "trancl" 

310 
(r^+) and "rtrancl" (r^*) by setting up tactics provided by 

311 
Provers/trancl.ML as additional solvers. INCOMPATIBILITY: old proofs break 

312 
occasionally as simplification may now solve more goals than previously. 

313 

314 
 Converts x <= y into x = y if assumption y <= x is present. Works for 

315 
all partial orders (class "order"), in particular numbers and sets. For 

316 
linear orders (e.g. numbers) it treats ~ x < y just like y <= x. 

15089
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

317 

15423  318 
 Simproc for "let x = a in f x" 
319 
If a is a free or bound variable or a constant then the let is unfolded. 

320 
Otherwise first a is simplified to a', and then f a' is simplified to 

321 
g. If possible we abstract a' from g arriving at "let x = a' in g' x", 

322 
otherwise we unfold the let and arrive at g. The simproc can be 

323 
enabled/disabled by the reference use_let_simproc. Potential 

324 
INCOMPATIBILITY since simplification is more powerful by default. 

15776  325 

326 
* HOL: The 'refute' command has been extended to support a much larger 

327 
fragment of HOL, including axiomatic type classes, constdefs and typedefs, 

328 
inductive datatypes and recursion. 

329 

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

330 

14682
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset

331 
*** HOLCF *** 
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset

332 

a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset

333 
* HOLCF: discontinued special version of 'constdefs' (which used to 
14731  334 
support continuous functions) in favor of the general Pure one with 
335 
full typeinference. 

14682
a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset

336 

a5072752114c
HOLCF: discontinued special version of 'constdefs';
wenzelm
parents:
14655
diff
changeset

337 

14885  338 
*** ZF *** 
339 

15089
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

340 
* ZF/ex/{Group,Ring}: examples in abstract algebra, including the 
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

341 
First Isomorphism Theorem (on quotienting by the kernel of a 
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

342 
homomorphism). 
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

343 

430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

344 
* ZF/Simplifier: install second copy of type solver that actually 
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

345 
makes use of TC rules declared to Isar proof contexts (or locales); 
430264838064
ZF/Simplifier: second copy of context type solver;
wenzelm
parents:
15076
diff
changeset

346 
the old version is still required for ML proof scripts. 
14885  347 

348 

15703  349 
*** System *** 
350 

15852
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

351 
* Allow symlinks to all proper Isabelle executables (Isabelle, 
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

352 
isabelle, isatool etc.). 
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

353 

4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

354 
* isabelleprocess: Poly/ML no longer needs Perl to run an interactive 
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

355 
session. 
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

356 

4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

357 
* ISABELLE_DOC_FORMAT setting specifies preferred document format (for 
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

358 
isatool doc, isatool mkdir, display_drafts etc.). 
15703  359 

360 
* isatool usedir: option f allows specification of the ML file to be 

361 
used by Isabelle; default is ROOT.ML. 

362 

15852
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

363 
* HOL: isatool dimacs2hol converts files in DIMACS CNF format 
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

364 
(containing Boolean satisfiability problems) into Isabelle/HOL 
4f1a78454452
allow symlinks to all proper Isabelle executables;
wenzelm
parents:
15801
diff
changeset

365 
theories. 
15703  366 

367 

368 
*** ML *** 

369 

15973  370 
* Pure/library.ML no longer defines its own option datatype, but uses 
371 
that of the SML basis, which has constructors NONE and SOME instead 

372 
of None and Some, as well as exception Option.Option instead of 

373 
OPTION. The functions the, if_none, is_some, is_none have been 

374 
adapted accordingly, while Option.map replaces apsome. 

375 

376 
* The exception LIST is no more, the standard exceptions Empty and 

377 
Subscript, as well as Library.UnequalLengths are used instead. This 

378 
means that function like Library.hd and Library.tl are gone, as the 

379 
standard hd and tl functions suffice. 

380 

381 
A number of basic functions are now no longer exported to the ML 

382 
toplevel, as they are variants of standard functions. The following 

383 
suggests how one can translate existing code: 

384 

385 
rev_append xs ys = List.revAppend (xs, ys) 

386 
nth_elem (i, xs) = List.nth (xs, i) 

387 
last_elem xs = List.last xs 

388 
flat xss = List.concat xss 

389 
seq fs = app fs 

390 
partition P xs = List.partition P xs 

391 
filter P xs = List.filter P xs 

392 
mapfilter f xs = List.mapPartial f xs 

393 

15703  394 
* Pure: output via the Isabelle channels of writeln/warning/error 
395 
etc. is now passed through Output.output, with a hook for arbitrary 

396 
transformations depending on the print_mode (cf. Output.add_mode  

397 
the first active mode that provides a output function wins). 

398 
Already formatted output may be embedded into further text via 

399 
Output.raw; the result of Pretty.string_of/str_of and derived 

400 
functions (string_of_term/cterm/thm etc.) is already marked raw to 

401 
accommodate easy composition of diagnostic messages etc. 

402 
Programmers rarely need to care about Output.output or Output.raw at 

403 
all, with some notable exceptions: Output.output is required when 

404 
bypassing the standard channels (writeln etc.), or in token 

405 
translations to produce properly formatted results; Output.raw is 

406 
required when capturing already output material that will eventually 

407 
be presented to the user a second time. For the default print mode, 

408 
both Output.output and Output.raw have no effect. 

409 

410 
* Provers: Simplifier and Classical Reasoner now support proof context 

411 
dependent plugins (simprocs, solvers, wrappers etc.). These extra 

412 
components are stored in the theory and patched into the 

413 
simpset/claset when used in an Isar proof context. Context 

414 
dependent components are maintained by the following theory 

415 
operations: 

416 

417 
Simplifier.add_context_simprocs 

418 
Simplifier.del_context_simprocs 

419 
Simplifier.set_context_subgoaler 

420 
Simplifier.reset_context_subgoaler 

421 
Simplifier.add_context_looper 

422 
Simplifier.del_context_looper 

423 
Simplifier.add_context_unsafe_solver 

424 
Simplifier.add_context_safe_solver 

425 

426 
Classical.add_context_safe_wrapper 

427 
Classical.del_context_safe_wrapper 

428 
Classical.add_context_unsafe_wrapper 

429 
Classical.del_context_unsafe_wrapper 

430 

431 
IMPORTANT NOTE: proof tools (methods etc.) need to use 

432 
local_simpset_of and local_claset_of to instead of the primitive 

433 
Simplifier.get_local_simpset and Classical.get_local_claset, 

434 
respectively, in order to see the context dependent fields! 

435 

436 

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

437 

14606  438 
New in Isabelle2004 (April 2004) 
439 
 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

440 

14171
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset

441 
*** General *** 
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset

442 

14398
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

443 
* Provers/order.ML: new efficient reasoner for partial and linear orders. 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

444 
Replaces linorder.ML. 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

445 

14606  446 
* Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic 
447 
(\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler 

14173  448 
(\<a>...\<z>), are now considered normal letters, and can therefore 
449 
be used anywhere where an ASCII letter (a...zA...Z) has until 

450 
now. COMPATIBILITY: This obviously changes the parsing of some 

451 
terms, especially where a symbol has been used as a binder, say 

452 
'\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed 

453 
as an identifier. Fix it by inserting a space around former 

454 
symbols. Call 'isatool fixgreek' to try to fix parsing errors in 

455 
existing theory and ML files. 

14171
0cab06e3bbd0
Extended the notion of letter and digit, such that now one may use greek,
skalberg
parents:
14136
diff
changeset

456 

14237  457 
* Pure: Macintosh and Windows linebreaks are now allowed in theory files. 
458 

14731  459 
* Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now 
460 
allowed in identifiers. Similar to Greek letters \<^isub> is now considered 

461 
a normal (but invisible) letter. For multiple letter subscripts repeat 

462 
\<^isub> like this: x\<^isub>1\<^isub>2. 

14233  463 

14333  464 
* Pure: There are now sub/superscripts that can span more than one 
465 
character. Text between \<^bsub> and \<^esub> is set in subscript in 

14606  466 
ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in 
467 
superscript. The new control characters are not identifier parts. 

14333  468 

14561
c53396af770e
* raw control symbols are of the form \<^raw:...> now.
schirmer
parents:
14556
diff
changeset

469 
* Pure: Controlsymbols of the form \<^raw:...> will literally print the 
14606  470 
content of "..." to the latex file instead of \isacntrl... . The "..." 
471 
may consist of any printable characters excluding the end bracket >. 

14361
ad2f5da643b4
* Support for raw latex output in control symbols: \<^raw...>
schirmer
parents:
14333
diff
changeset

472 

14237  473 
* Pure: Using new Isar command "finalconsts" (or the ML functions 
474 
Theory.add_finals or Theory.add_finals_i) it is now possible to 

475 
declare constants "final", which prevents their being given a definition 

476 
later. It is useful for constants whose behaviour is fixed axiomatically 

14224  477 
rather than definitionally, such as the metalogic connectives. 
478 

14606  479 
* Pure: 'instance' now handles general arities with general sorts 
480 
(i.e. intersections of classes), 

14503
255ad604e08e
Added check that Theory.ML does not occur in the files section of the theory
skalberg
parents:
14480
diff
changeset

481 

14547  482 
* Presentation: generated HTML now uses a CSS style sheet to make layout 
14731  483 
(somewhat) independent of content. It is copied from lib/html/isabelle.css. 
14547  484 
It can be changed to alter the colors/layout of generated pages. 
485 

14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset

486 

14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

487 
*** Isar *** 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

488 

14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset

489 
* Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac, 
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset

490 
cut_tac, subgoal_tac and thin_tac: 
14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

491 
 Now understand static (Isar) contexts. As a consequence, users of Isar 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

492 
locales are no longer forced to write Isar proof scripts. 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

493 
For details see Isar Reference Manual, paragraph 4.3.2: Further tactic 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

494 
emulations. 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

495 
 INCOMPATIBILITY: names of variables to be instantiated may no 
14211
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

496 
longer be enclosed in quotes. Instead, precede variable name with `?'. 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

497 
This is consistent with the instantiation attribute "where". 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

498 

14257
a7ef3f7588c5
Type inference bug in Isar attributes "where" and "of" fixed.
ballarin
parents:
14255
diff
changeset

499 
* Attributes "where" and "of": 
14285
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

500 
 Now take type variables of instantiated theorem into account when reading 
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

501 
the instantiation string. This fixes a bug that caused instantiated 
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

502 
theorems to have too special types in some circumstances. 
92ed032e83a1
Isar: where attribute supports instantiation of type vars.
ballarin
parents:
14283
diff
changeset

503 
 "where" permits explicit instantiations of type variables. 
14257
a7ef3f7588c5
Type inference bug in Isar attributes "where" and "of" fixed.
ballarin
parents:
14255
diff
changeset

504 

14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset

505 
* Calculation commands "moreover" and "also" no longer interfere with 
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset

506 
current facts ("this"), admitting arbitrary combinations with "then" 
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset

507 
and derived forms. 
14283  508 

14211
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

509 
* Locales: 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

510 
 Goal statements involving the context element "includes" no longer 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

511 
generate theorems with internal delta predicates (those ending on 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

512 
"_axioms") in the premise. 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

513 
Resolve particular premise with <locale>.intro to obtain old form. 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

514 
 Fixed bug in type inference ("unify_frozen") that prevented mix of target 
7286c187596d
Improvements to Isar/Locales: premises generated by "includes" elements
ballarin
parents:
14199
diff
changeset

515 
specification and "includes" elements in goal statement. 
14254
342634f38451
Isar/Locales: <loc>.intro and <loc>.axioms no longer intro? and elim? by
ballarin
parents:
14243
diff
changeset

516 
 Rule sets <locale>.intro and <locale>.axioms no longer declared as 
342634f38451
Isar/Locales: <loc>.intro and <loc>.axioms no longer intro? and elim? by
ballarin
parents:
14243
diff
changeset

517 
[intro?] and [elim?] (respectively) by default. 
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset

518 
 Experimental command for instantiation of locales in proof contexts: 
14551  519 
instantiate <label>[<attrs>]: <loc> 
14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset

520 
Instantiates locale <loc> and adds all its theorems to the current context 
14551  521 
taking into account their attributes. Label and attrs are optional 
522 
modifiers, like in theorem declarations. If present, names of 

523 
instantiated theorems are qualified with <label>, and the attributes 

524 
<attrs> are applied after any attributes these theorems might have already. 

525 
If the locale has assumptions, a chained fact of the form 

14508
859b11514537
Experimental command for instantiation of locales in proof contexts:
ballarin
parents:
14503
diff
changeset

526 
"<loc> t1 ... tn" is expected from which instantiations of the parameters 
14551  527 
are derived. The command does not support oldstyle locales declared 
528 
with "locale (open)". 

529 
A few (very simple) examples can be found in FOL/ex/LocaleInst.thy. 

14175
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

530 

dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

531 
* HOL: Tactic emulation methods induct_tac and case_tac understand static 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

532 
(Isar) contexts. 
dbd16ebaf907
Method rule_tac understands Isar contexts: documentation.
ballarin
parents:
14173
diff
changeset

533 

14556
c5078f6c99a9
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm
parents:
14551
diff
changeset

534 

14136  535 
*** HOL *** 
536 

14624  537 
* Proof import: new image HOL4 contains the imported library from 
538 
the HOL4 system with about 2500 theorems. It is imported by 

539 
replaying proof terms produced by HOL4 in Isabelle. The HOL4 image 

540 
can be used like any other Isabelle image. See 

541 
HOL/Import/HOL/README for more information. 

542 

14398
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

543 
* Simplifier: 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

544 
 Much improved handling of linear and partial orders. 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

545 
Reasoners for linear and partial orders are set up for type classes 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

546 
"linorder" and "order" respectively, and are added to the default simpset 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

547 
as solvers. This means that the simplifier can build transitivity chains 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

548 
to solve goals from the assumptions. 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

549 
 INCOMPATIBILITY: old proofs break occasionally. Typically, applications 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

550 
of blast or auto after simplification become unnecessary because the goal 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

551 
is solved by simplification already. 
c5c47703f763
Efficient, graphbased reasoner for linear and partial orders.
ballarin
parents:
14389
diff
changeset

552 

14731  553 
* Numerics: new theory Ring_and_Field contains over 250 basic numerical laws, 
14389  554 
all proved in axiomatic type classes for semirings, rings and fields. 
555 

556 
* Numerics: 

557 
 Numeric types (nat, int, and in HOLComplex rat, real, complex, etc.) are 

14731  558 
now formalized using the Ring_and_Field theory mentioned above. 
14389  559 
 INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently 
560 
than before, because now they are set up once in a generic manner. 

14731  561 
 INCOMPATIBILITY: many typespecific arithmetic laws have gone. 
14480  562 
Look for the general versions in Ring_and_Field (and Power if they concern 
563 
exponentiation). 

14389  564 

14401  565 
* Type "rat" of the rational numbers is now available in HOLComplex. 
14389  566 

14255  567 
* Records: 
568 
 Record types are now by default printed with their type abbreviation 

569 
instead of the list of all field types. This can be configured via 

570 
the reference "print_record_type_abbr". 

14731  571 
 Simproc "record_upd_simproc" for simplification of multiple updates added 
14255  572 
(not enabled by default). 
14427  573 
 Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp. 
574 
EX x. x = sel r to True (not enabled by default). 

14255  575 
 Tactic "record_split_simp_tac" to split and simplify records added. 
14731  576 

14136  577 
* 'specification' command added, allowing for definition by 
14224  578 
specification. There is also an 'ax_specification' command that 
579 
introduces the new constants axiomatically. 

14136  580 

14375  581 
* arith(_tac) is now able to generate counterexamples for reals as well. 
582 

14399
dc677b35e54f
New lemmas about inversion of restricted functions.
ballarin
parents:
14398
diff
changeset

583 
* HOLAlgebra: new locale "ring" for noncommutative rings. 
dc677b35e54f
New lemmas about inversion of restricted functions.
ballarin
parents:
14398
diff
changeset

584 

14243  585 
* HOLex: InductiveInvariant_examples illustrates advanced recursive function 
14610  586 
definitions, thanks to Sava Krsti\'{c} and John Matthews. 
587 

14731  588 
* HOLMatrix: a first theory for matrices in HOL with an application of 
14610  589 
matrix theory to linear programming. 
14136  590 

14380  591 
* Unions and Intersections: 
15119  592 
The latex output syntax of UN and INT has been changed 
593 
from "\Union x \in A. B" to "\Union_{x \in A} B" 

594 
i.e. the index formulae has become a subscript. 

595 
Similarly for "\Union x. B", and for \Inter instead of \Union. 

14380  596 

14418  597 
* Unions and Intersections over Intervals: 
14731  598 
There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is 
599 
also an xsymbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A" 

14418  600 
like in normal math, and corresponding versions for < and for intersection. 
601 

15677  602 
* HOL/List: Ordering "lexico" is renamed "lenlex" and the standard 
603 
lexicographic dictonary ordering has been added as "lexord". 

604 

14401  605 
* ML: the legacy theory structures Int and List have been removed. They had 
606 
conflicted with ML Basis Library structures having the same names. 

14380  607 

14464  608 
* 'refute' command added to search for (finite) countermodels. Only works 
609 
for a fragment of HOL. The installation of an external SAT solver is 

610 
highly recommended. See "HOL/Refute.thy" for details. 

611 

14602  612 
* 'quickcheck' command: Allows to find counterexamples by evaluating 
613 
formulae under an assignment of free variables to random values. 

614 
In contrast to 'refute', it can deal with inductive datatypes, 

615 
but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy" 

616 
for examples. 

14464  617 

14606  618 

14536  619 
*** HOLCF *** 
620 

621 
* Streams now come with concatenation and are part of the HOLCF image 

622 

14572  623 

624 

14136  625 
New in Isabelle2003 (May 2003) 
14606  626 
 
14136  627 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

628 
*** General *** 
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

629 

13618  630 
* Provers/simplifier: 
631 

13781  632 
 Completely reimplemented method simp (ML: Asm_full_simp_tac): 
13618  633 
Assumptions are now subject to complete mutual simplification, 
634 
not just from left to right. The simplifier now preserves 

635 
the order of assumptions. 

636 

637 
Potential INCOMPATIBILITY: 

638 

13781  639 
 simp sometimes diverges where the old version did 
640 
not, e.g. invoking simp on the goal 

13618  641 

642 
[ P (f x); y = x; f x = f y ] ==> Q 

643 

13781  644 
now gives rise to the infinite reduction sequence 
645 

646 
P(f x) (f x = f y)> P(f y) (y = x)> P(f x) (f x = f y)> ... 

647 

648 
Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this 

649 
kind of problem. 

650 

651 
 Tactics combining classical reasoner and simplification (such as auto) 

652 
are also affected by this change, because many of them rely on 

653 
simp. They may sometimes diverge as well or yield a different numbers 

654 
of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto 

655 
in case of problems. Sometimes subsequent calls to the classical 

656 
reasoner will fail because a preceeding call to the simplifier too 

657 
eagerly simplified the goal, e.g. deleted redundant premises. 

13618  658 

659 
 The simplifier trace now shows the names of the applied rewrite rules 

660 

13829  661 
 You can limit the number of recursive invocations of the simplifier 
662 
during conditional rewriting (where the simplifie tries to solve the 

663 
conditions before applying the rewrite rule): 

664 
ML "simp_depth_limit := n" 

665 
where n is an integer. Thus you can force termination where previously 

666 
the simplifier would diverge. 

667 

13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13829
diff
changeset

668 
 Accepts free variables as head terms in congruence rules. Useful in Isar. 
13829  669 

13938  670 
 No longer aborts on failed congruence proof. Instead, the 
671 
congruence is ignored. 

672 

14008  673 
* Pure: New generic framework for extracting programs from constructive 
674 
proofs. See HOL/Extraction.thy for an example instantiation, as well 

675 
as HOL/Extraction for some case studies. 

676 

13868  677 
* Pure: The main goal of the proof state is no longer shown by default, only 
678 
the subgoals. This behaviour is controlled by a new flag. 

13835
12b2ffbe543a
Change to meta simplifier: congruence rules may now have frees as head of term.
ballarin
parents:
13829
diff
changeset

679 
PG menu: Isabelle/Isar > Settings > Show Main Goal 
13815  680 
(ML: Proof.show_main_goal). 
681 

682 
* Pure: You can find all matching introduction rules for subgoal 1, i.e. all 

683 
rules whose conclusion matches subgoal 1: 

684 
PG menu: Isabelle/Isar > Show me > matching rules 

685 
The rules are ordered by how closely they match the subgoal. 

686 
In particular, rules that solve a subgoal outright are displayed first 

687 
(or rather last, the way they are printed). 

688 
(ML: ProofGeneral.print_intros()) 

689 

690 
* Pure: New flag trace_unify_fail causes unification to print 

13781  691 
diagnostic information (PG: in trace buffer) when it fails. This is 
692 
useful for figuring out why single step proofs like rule, erule or 

693 
assumption failed. 

694 

13815  695 
* Pure: Locale specifications now produce predicate definitions 
13410
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

696 
according to the body of text (covering assumptions modulo local 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

697 
definitions); predicate "loc_axioms" covers newly introduced text, 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

698 
while "loc" is cumulative wrt. all included locale expressions; the 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

699 
latter view is presented only on export into the global theory 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

700 
context; potential INCOMPATIBILITY, use "(open)" option to fall back 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

701 
on the old view without predicates; 
f2cd09766864
* Pure: locale specifications now produce predicate definitions;
wenzelm
parents:
13344
diff
changeset

702 

13459
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset

703 
* Pure: predefined locales "var" and "struct" are useful for sharing 
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset

704 
parameters (as in CASL, for example); just specify something like 
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset

705 
``var x + var y + struct M'' as import; 
83f41b047a39
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm
parents:
13443
diff
changeset

706 

13463
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

707 
* Pure: improved thms_containing: proper indexing of facts instead of 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

708 
raw theorems; check validity of results wrt. current name space; 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

709 
include local facts of proof configuration (also covers active 
13541  710 
locales), cover fixed variables in index; may use "_" in term 
711 
specification; an optional limit for the number of printed facts may 

712 
be given (the default is 40); 

713 

714 
* Pure: disallow duplicate fact bindings within newstyle theory files 

715 
(batchmode only); 

13540
aede0306e214
* Pure: disallow duplicate fact bindings within newstyle theory files;
wenzelm
parents:
13522
diff
changeset

716 

13463
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

717 
* Provers: improved induct method: assumptions introduced by case 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

718 
"foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

719 
the goal statement); "foo" still refers to all facts collectively; 
07747943c626
* Provers: Simplifier.simproc(_i) now provide sane interface for
wenzelm
parents:
13459
diff
changeset

720 

13550  721 
* Provers: the function blast.overloaded has been removed: all constants 
722 
are regarded as potentially overloaded, which improves robustness in exchange 

723 
for slight decrease in efficiency; 

724 

13781  725 
* Provers/linorder: New generic prover for transitivity reasoning over 
726 
linear orders. Note: this prover is not efficient! 

727 

13522
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

728 
* Isar: preview of problems to finish 'show' now produce an error 
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

729 
rather than just a warning (in interactive mode); 
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

730 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

731 

13158  732 
*** HOL *** 
733 

13899  734 
* arith(_tac) 
735 

736 
 Produces a counter example if it cannot prove a goal. 

737 
Note that the counter example may be spurious if the goal is not a formula 

738 
of quantifierfree linear arithmetic. 

739 
In ProofGeneral the counter example appears in the trace buffer. 

740 

741 
 Knows about div k and mod k where k is a numeral of type nat or int. 

742 

743 
 Calls full Presburger arithmetic (by Amine Chaieb) if quantifierfree 

744 
linear arithmetic fails. This takes account of quantifiers and divisibility. 

14731  745 
Presburger arithmetic can also be called explicitly via presburger(_tac). 
13899  746 

747 
* simp's arithmetic capabilities have been enhanced a bit: it now 

748 
takes ~= in premises into account (by performing a case split); 

749 

750 
* simp reduces "m*(n div m) + n mod m" to n, even if the two summands 

751 
are distributed over a sum of terms; 

752 

13735  753 
* New tactic "trans_tac" and method "trans" instantiate 
754 
Provers/linorder.ML for axclasses "order" and "linorder" (predicates 

14731  755 
"<=", "<" and "="). 
756 

757 
* function INCOMPATIBILITIES: Pisets have been redefined and moved from main 

13587  758 
HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp"; 
759 

13443  760 
* 'typedef' command has new option "open" to suppress the set 
761 
definition; 

762 

13522
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

763 
* functions Min and Max on finite sets have been introduced (theory 
934fffeb6f38
* Isar: preview of problems to finish 'show' now produce an error
wenzelm
parents:
13518
diff
changeset

764 
Finite_Set); 
13492  765 

13443  766 
* attribute [symmetric] now works for relations as well; it turns 
767 
(x,y) : R^1 into (y,x) : R, and vice versa; 

768 

13613  769 
* induct over a !!quantified statement (say !!x1..xn): 
770 
each "case" automatically performs "fix x1 .. xn" with exactly those names. 

771 

13899  772 
* Map: `empty' is no longer a constant but a syntactic abbreviation for 
773 
%x. None. Warning: empty_def now refers to the previously hidden definition 

774 
of the empty set. 

775 

14018  776 
* Algebra: formalization of classical algebra. Intended as base for 
777 
any algebraic development in Isabelle. Currently covers group theory 

778 
(up to Sylow's theorem) and ring theory (Universal Property of 

779 
Univariate Polynomials). Contributions welcome; 

13960  780 

781 
* GroupTheory: deleted, since its material has been moved to Algebra; 

782 

14731  783 
* Complex: new directory of the complex numbers with numeric constants, 
784 
nonstandard complex numbers, and some complex analysis, standard and 

13966
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

785 
nonstandard (Jacques Fleuriot); 
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

786 

2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

787 
* HOLComplex: new image for analysis, replacing HOLReal and HOLHyperreal; 
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

788 

14731  789 
* Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques 
13966
2160abf7cfe7
removal of the image HOLReal and merging of HOLRealex with HOLComplexex
paulson
parents:
13960
diff
changeset

790 
Fleuriot); 
13960  791 

13549  792 
* Real/HahnBanach: updated and adapted to locales; 
793 

13995  794 
* NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad, 
795 
Gray and Kramer); 

13872  796 

797 
* UNITY: added the MeierSanders theory of progress sets; 

798 

14011  799 
* MicroJava: bytecode verifier and lightweight bytecode verifier 
800 
as abstract algorithms, instantiated to the JVM; 

801 

14010  802 
* Bali: Java source language formalization. Type system, operational 
803 
semantics, axiomatic semantics. Supported language features: 

804 
classes, interfaces, objects,virtual methods, static methods, 

805 
static/instance fields, arrays, access modifiers, definite 

806 
assignment, exceptions. 

13549  807 

14011  808 

13549  809 
*** ZF *** 
810 

15154  811 
* ZF/Constructible: consistency proof for AC (Gdel's constructible 
13549  812 
universe, etc.); 
813 

13872  814 
* Main ZF: virtually all theories converted to newstyle format; 
13518  815 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

816 

13478  817 
*** ML *** 
818 

819 
* Pure: Tactic.prove provides sane interface for internal proofs; 

820 
omits the infamous "standard" operation, so this is more appropriate 

821 
than prove_goalw_cterm in many situations (e.g. in simprocs); 

822 

823 
* Pure: improved error reporting of simprocs; 

824 

825 
* Provers: Simplifier.simproc(_i) provides sane interface for setting 

826 
up simprocs; 

827 

828 

13953  829 
*** Document preparation *** 
830 

831 
* uses \par instead of \\ for line breaks in theory text. This may 

832 
shift some page breaks in large documents. To get the old behaviour 

833 
use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex. 

834 

14731  835 
* minimized dependencies of isabelle.sty and isabellesym.sty on 
13953  836 
other packages 
837 

838 
* \<euro> now needs package babel/greek instead of marvosym (which 

839 
broke \Rightarrow) 

840 

14731  841 
* normal size for \<zero>...\<nine> (uses \mathbf instead of 
13954  842 
textcomp package) 
13953  843 

13280
306ef3aef61b
* improved thms_containing: proper indexing of facts instead of raw
wenzelm
parents:
13190
diff
changeset

844 

14572  845 

12984  846 
New in Isabelle2002 (March 2002) 
847 
 

11474  848 

11572  849 
*** Document preparation *** 
850 

11842
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

851 
* greatly simplified document preparation setup, including more 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

852 
graceful interpretation of isatool usedir i/d/D options, and more 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

853 
instructive isatool mkdir; users should basically be able to get 
12899
7d5b690253ee
"isatool usedir D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset

854 
started with "isatool mkdir HOL Test && isatool make"; alternatively, 
7d5b690253ee
"isatool usedir D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset

855 
users may run a separate document processing stage manually like this: 
7d5b690253ee
"isatool usedir D output HOL Test && isatool document Test/output";
wenzelm
parents:
12889
diff
changeset

856 
"isatool usedir D output HOL Test && isatool document Test/output"; 
11842
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

857 

b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

858 
* theory dependency graph may now be incorporated into documents; 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

859 
isatool usedir g true will produce session_graph.eps/.pdf for use 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

860 
with \includegraphics of LaTeX; 
b903d3dabbe2
* greatly simplified document preparation setup, including more
wenzelm
parents:
11817
diff
changeset

861 

11864
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset

862 
* proper spacing of consecutive markup elements, especially text 
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset

863 
blocks after section headings; 
371ce685b0ec
* proper spacing of consecutive markup elements, especially text
wenzelm
parents:
11842
diff
changeset

864 

11572  865 
* support bold style (for single symbols only), input syntax is like 
866 
this: "\<^bold>\<alpha>" or "\<^bold>A"; 

867 

11814  868 
* \<bullet> is now output as bold \cdot by default, which looks much 
11572  869 
better in printed text; 
870 

11712
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset

871 
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>; 
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset

872 
note that these symbols are currently unavailable in Proof General / 
12769  873 
XSymbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>; 
12690  874 

875 
* isatool latex no longer depends on changed TEXINPUTS, instead 

876 
isatool document copies the Isabelle style files to the target 

877 
location; 

11712
deb8cac87063
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm
parents:
11702
diff
changeset

878 

11572  879 

11633  880 
*** Isar *** 
881 

12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

882 
* Pure/Provers: improved proof by cases and induction; 
12280  883 
 'case' command admits impromptu naming of parameters (such as 
884 
"case (Suc n)"); 

885 
 'induct' method divinates rule instantiation from the inductive 

886 
claim; no longer requires excessive ?P bindings for proper 

887 
instantiation of cases; 

888 
 'induct' method properly enumerates all possibilities of set/type 

889 
rules; as a consequence facts may be also passed through *type* 

890 
rules without further ado; 

891 
 'induct' method now derives symbolic cases from the *rulified* 

892 
rule (before it used to rulify cases stemming from the internal 

893 
atomized version); this means that the context of a nonatomic 

894 
statement becomes is included in the hypothesis, avoiding the 

895 
slightly cumbersome show "PROP ?case" form; 

896 
 'induct' may now use elimstyle induction rules without chaining 

897 
facts, using ``missing'' premises from the goal state; this allows 

898 
rules stemming from inductive sets to be applied in unstructured 

899 
scripts, while still benefitting from proper handling of nonatomic 

900 
statements; NB: major inductive premises need to be put first, all 

901 
the rest of the goal is passed through the induction; 

902 
 'induct' proper support for mutual induction involving nonatomic 

903 
rule statements (uses the new concept of simultaneous goals, see 

904 
below); 

12853  905 
 append all possible rule selections, but only use the first 
906 
success (no backtracking); 

11995
4a622f5fb164
 'induct' may now use elimstyle induction rules without chaining
wenzelm
parents:
11986
diff
changeset

907 
 removed obsolete "(simplified)" and "(stripped)" options of methods; 
12754
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset

908 
 undeclared rule case names default to numbers 1, 2, 3, ...; 
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset

909 
 added 'print_induct_rules' (covered by help item in recent Proof 
044a59921f3b
Isar: undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm
parents:
12753
diff
changeset

910 
General versions); 
11995
4a622f5fb164
 'induct' may now use elimstyle induction rules without chaining
wenzelm
parents:
11986
diff
changeset

911 
 moved induct/cases attributes to Pure, methods to Provers; 
4a622f5fb164
 'induct' may now use elimstyle induction rules without chaining
wenzelm
parents:
11986
diff
changeset

912 
 generic method setup instantiated for FOL and HOL; 
11986
26b95a6f3f79
 'induct' method now derives symbolic cases from the *rulified* rule
wenzelm
parents:
11965
diff
changeset

913 

12163
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

914 
* Pure: support multiple simultaneous goal statements, for example 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

915 
"have a: A and b: B" (same for 'theorem' etc.); being a pure 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

916 
metalevel mechanism, this acts as if several individual goals had 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

917 
been stated separately; in particular common proof methods need to be 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

918 
repeated in order to cover all claims; note that a single elimination 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

919 
step is *not* sufficient to establish the two conjunctions, so this 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

920 
fails: 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

921 

04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

922 
assume "A & B" then have A and B .. (*".." fails*) 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

923 

04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

924 
better use "obtain" in situations as above; alternative refer to 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

925 
multistep methods like 'auto', 'simp_all', 'blast+' etc.; 
04c98351f9af
Isar: 'induct' proper support for mutual induction involving
wenzelm
parents:
12159
diff
changeset

926 

12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

927 
* Pure: proper integration with ``locales''; unlike the original 
15154  928 
version by Florian Kammller, Isar locales package highlevel proof 
12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

929 
contexts rather than raw logical ones (e.g. we admit to include 
12280  930 
attributes everywhere); operations on locales include merge and 
12964  931 
rename; support for implicit arguments (``structures''); simultaneous 
932 
typeinference over imports and text; see also HOL/ex/Locales.thy for 

933 
some examples; 

12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

934 

12707
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

935 
* Pure: the following commands have been ``localized'', supporting a 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

936 
target locale specification "(in name)": 'lemma', 'theorem', 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

937 
'corollary', 'lemmas', 'theorems', 'declare'; the results will be 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

938 
stored both within the locale and at the theory level (exported and 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

939 
qualified by the locale name); 
4013be8572c5
* Pure: localized 'lemmas', 'theorems', 'declare';
wenzelm
parents:
12690
diff
changeset

940 

12964  941 
* Pure: theory goals may now be specified in ``long'' form, with 
942 
adhoc contexts consisting of arbitrary locale elements. for example 

943 
``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and 

944 
definitions may be given, too); the result is a metalevel rule with 

945 
the context elements being discharged in the obvious way; 

946 

947 
* Pure: new proof command 'using' allows to augment currently used 

948 
facts after a goal statement ('using' is syntactically analogous to 

949 
'apply', but acts on the goal's facts only); this allows chained facts 

950 
to be separated into parts given before and after a claim, as in 

951 
``from a and b have C using d and e <proof>''; 

12078
4eb8061286e5
* Isar/Pure: proper integration with ``locales''; unlike the original
wenzelm
parents:
12034
diff
changeset

952 

11722  953 
* Pure: renamed "antecedent" case to "rule_context"; 
954 

12964  955 
* Pure: new 'judgment' command records explicit information about the 
956 
objectlogic embedding (used by several tools internally); no longer 

957 
use hardwired "Trueprop"; 

958 

11738  959 
* Pure: added 'corollary' command; 
960 

11722  961 
* Pure: fixed 'token_translation' command; 
962 

11899  963 
* Pure: removed obsolete 'exported' attribute; 
964 

11933  965 
* Pure: dummy pattern "_" in is/let is now automatically lifted over 
966 
bound variables: "ALL x. P x > Q x" (is "ALL x. _ > ?C x") 

11899  967 
supersedes more cumbersome ... (is "ALL x. _ x > ?C x"); 
968 

11952
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

969 
* Pure: method 'atomize' presents local goal premises as objectlevel 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

970 
statements (atomic metalevel propositions); setup controlled via 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

971 
rewrite rules declarations of 'atomize' attribute; example 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

972 
application: 'induct' method with proper rule statements in improper 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

973 
proof *scripts*; 
b10f1e8862f4
* Pure: method 'atomize' presents local goal premises as objectlevel
wenzelm
parents:
11937
diff
changeset

974 

12106
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

975 
* Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.) 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

976 
now consider the syntactic context of assumptions, giving a better 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

977 
chance to get typeinference of the arguments right (this is 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

978 
especially important for locales); 
4a8558dbb6a0
* Isar/Pure: emulation of instantiation tactics (rule_tac, cut_tac,
wenzelm
parents:
12078
diff
changeset

979 

12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

980 
* Pure: "sorry" no longer requires quick_and_dirty in interactive 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

981 
mode; 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

982 

12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

983 
* Pure/obtain: the formal conclusion "thesis", being marked as 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

984 
``internal'', may no longer be reference directly in the text; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

985 
potential INCOMPATIBILITY, may need to use "?thesis" in rare 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

986 
situations; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

987 

9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

988 
* Pure: generic 'sym' attribute which declares a rule both as pure 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

989 
'elim?' and for the 'symmetric' operation; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

990 

12877
b9635eb8a448
* Isar/Pure: marginal comments ``'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset

991 
* Pure: marginal comments ``'' may now occur just anywhere in the 
b9635eb8a448
* Isar/Pure: marginal comments ``'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset

992 
text; the fixed correlation with particular command syntax has been 
b9635eb8a448
* Isar/Pure: marginal comments ``'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset

993 
discontinued; 
b9635eb8a448
* Isar/Pure: marginal comments ``'' may now occur just anywhere in the text;
wenzelm
parents:
12853
diff
changeset

994 

13023
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

995 
* Pure: new method 'rules' is particularly wellsuited for proof 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

996 
search in intuitionistic logic; a bit slower than 'blast' or 'fast', 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

997 
but often produces more compact proof terms with less detours; 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

998 

12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

999 
* Pure/Provers/classical: simplified integration with pure rule 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

1000 
attributes and methods; the classical "intro?/elim?/dest?" 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

1001 
declarations coincide with the pure ones; the "rule" method no longer 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

1002 
includes classically swapped intros; "intro" and "elim" methods no 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

1003 
longer pick rules from the context; also got rid of ML declarations 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

1004 
AddXIs/AddXEs/AddXDs; all of this has some potential for 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

1005 
INCOMPATIBILITY; 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

1006 

12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

1007 
* Provers/classical: attribute 'swapped' produces classical inversions 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

1008 
of introduction rules; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

1009 

12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

1010 
* Provers/simplifier: 'simplified' attribute may refer to explicit 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

1011 
rules instead of full simplifier context; 'iff' attribute handles 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

1012 
conditional rules; 
11936
fef099613354
* Provers: 'simplified' attribute may refer to explicit rules instead
wenzelm
parents:
11933
diff
changeset

1013 

11745
06cd8c3b5487
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm
parents:
11738
diff
changeset

1014 
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms; 
06cd8c3b5487
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm
parents:
11738
diff
changeset

1015 

11690  1016 
* HOL: 'recdef' now fails on unfinished automated proofs, use 
11633  1017 
"(permissive)" option to recover old behavior; 
1018 

11933  1019 
* HOL: 'inductive' no longer features separate (collective) attributes 
1020 
for 'intros' (was found too confusing); 

1021 

12405
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

1022 
* HOL: properly declared induction rules less_induct and 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

1023 
wf_induct_rule; 
9b16f99fd7b9
* Pure/obtain: "thesis" now internal (use ?thesis);
wenzelm
parents:
12364
diff
changeset

1024 

11788
60054fee3c16
canonical 'cases'/'induct' rules for ntuples (n=3..7)
kleing
parents:
11745
diff
changeset

1025 

11474  1026 
*** HOL *** 
1027 

11702  1028 
* HOL: moved over to sane numeral syntax; the new policy is as 
1029 
follows: 

1030 

1031 
 0 and 1 are polymorphic constants, which are defined on any 

1032 
numeric type (nat, int, real etc.); 

1033 

1034 
 2, 3, 4, ... and 1, 2, 3, ... are polymorphic numerals, based 

1035 
binary representation internally; 

1036 

1037 
 type nat has special constructor Suc, and generally prefers Suc 0 

1038 
over 1::nat and Suc (Suc 0) over 2::nat; 

1039 

12364
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

1040 
This change may cause significant problems of INCOMPATIBILITY; here 
108cdda23ab3
* Pure/Provers/classical: simplified integration with pure rule
wenzelm
parents:
12335
diff
changeset

1041 
are some hints on converting existing sources: 
11702  1042 

1043 
 due to the new "num" token, "0" and "1" etc. are now atomic 

1044 
entities, so expressions involving "" (unary or binary minus) need 

1045 
to be spaced properly; 

1046 

1047 
 existing occurrences of "1" may need to be constraint "1::nat" or 

1048 
even replaced by Suc 0; similar for old "2"; 

1049 

1050 
 replace "#nnn" by "nnn", and "#nnn" by "nnn"; 

1051 

1052 
 remove all special provisions on numerals in proofs; 

1053 

13042  1054 
* HOL: simp rules nat_number expand numerals on nat to Suc/0 
12837  1055 
representation (depends on bin_arith_simps in the default context); 
1056 

12736  1057 
* HOL: symbolic syntax for x^2 (numeral 2); 
1058 

12335
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

1059 
* HOL: the class of all HOL types is now called "type" rather than 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

1060 
"term"; INCOMPATIBILITY, need to adapt references to this type class 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

1061 
in axclass/classes, instance/arities, and (usually rare) occurrences 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

1062 
in typings (of consts etc.); internally the class is called 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

1063 
"HOL.type", ML programs should refer to HOLogic.typeS; 
db4d5f498742
* HOL: the class of all HOL types is now called "type" rather than
wenzelm
parents:
12312
diff
changeset

1064 

12280  1065 
* HOL/record package improvements: 
1066 
 new derived operations "fields" to build a partial record section, 

1067 
"extend" to promote a fixed record to a record scheme, and 

1068 
"truncate" for the reverse; cf. theorems "xxx.defs", which are *not* 

1069 
declared as simp by default; 

12587
3f3d2ffb5df5
HOL/record: shared operations ("more", "fields", etc.) now need to be
wenzelm
parents:
12564
diff
changeset

1070 
 shared operations ("more", "fields", etc.) now need to be always 
3f3d2ffb5df5
HOL/record: shared operations ("more", "fields", etc.) now need to be
wenzelm
parents:
12564
diff
changeset

1071 
qualified)  potential INCOMPATIBILITY; 
12280  1072 
 removed "make_scheme" operations (use "make" with "extend")  
1073 
INCOMPATIBILITY; 

11937  1074 
 removed "more" class (simply use "term")  INCOMPATIBILITY; 
12253  1075 
 provides cases/induct rules for use with corresponding Isar 
1076 
methods (for concrete records, record schemes, concrete more 

12280  1077 
parts, and schematic more parts  in that order); 
11930  1078 
 internal definitions directly based on a lightweight abstract 
1079 
theory of product types over typedef rather than datatype; 

1080 

13023
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

1081 
* HOL: generic code generator for generating executable ML code from 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

1082 
specifications; specific support for HOL constructs such as inductive 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

1083 
datatypes and sets, as well as recursive functions; can be invoked 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

1084 
via 'generate_code' theory section; 
f869b6822006
Added two paragraphs on "rules" method and code generator.
berghofe
parents:
12984
diff
changeset

1085 

11933  1086 
* HOL: canonical cases/induct rules for ntuples (n = 3..7); 
1087 

13824  1088 
* HOL: consolidated and renamed several theories. In particular: 
14731  1089 
Ord.thy has been absorbed into HOL.thy 
1090 
String.thy has been absorbed into List.thy 

1091 

11802
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset

1092 
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A" 
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset

1093 
(beware of argument permutation!); 
1d5f5d2427d2
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm
parents:
11797
diff
changeset

1094 

11657  1095 
* HOL: linorder_less_split superseded by linorder_cases; 
1096 

12917  1097 
* HOL/List: "nodups" renamed to "distinct"; 
12889  1098 

11633  1099 
* HOL: added "The" definite description operator; move Hilbert's "Eps" 
13824  1100 
to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES: 
1101 
 Ex_def has changed, now need to use some_eq_ex 

11437  1102 

11572  1103 
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so 
1104 
in this (rare) case use: 

1105 

1106 
delSWrapper "split_all_tac" 

1107 
addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac) 

1108 

1109 
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS 

11474  1110 
MAY FAIL; 
11361  1111 

11572  1112 
* HOL: introduced f^n = f o ... o f; warning: due to the limits of 
1113 
Isabelle's type classes, ^ on functions and relations has too general 

1114 
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be 

1115 
necessary to attach explicit type constraints; 

11307  1116 

12917  1117 
* HOL/Relation: the prefix name of the infix "O" has been changed from 
1118 
"comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been 

1119 
renamed accordingly (eg "compI" > "rel_compI"). 

12489  1120 

11487
95071c9e85a3
* HOL: syntax translations now work properly with numerals and records
wenzelm
parents:
11475
diff
changeset

1121 
* HOL: syntax translations now work properly with numerals and records 
95071c9e85a3
* HOL: syntax translations now work properly with numerals and records
wenzelm
parents:
11475
diff
changeset

1122 
expressions; 
11474  1123 

12457
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset

1124 
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead 
cbfc53e45476
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm
parents:
12405
diff
changeset

1125 
of "lam"  INCOMPATIBILITY; 
11474  1126 

11933  1127 
* HOL: got rid of some global declarations (potential INCOMPATIBILITY 
1128 
for ML tools): const "()" renamed "Product_Type.Unity", type "unit" 

1129 
renamed "Product_Type.unit"; 

11611  1130 

12564  1131 
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl 
1132 

12924  1133 
* HOL: removed obsolete theorem "optionE" (use "option.exhaust", or 
1134 
the "cases" method); 

1135 

12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

1136 
* HOL/GroupTheory: group theory examples including Sylow's theorem (by 
15154  1137 
Florian Kammller); 
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

1138 

12608
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

1139 
* HOL/IMP: updated and converted to newstyle theory format; several 
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

1140 
parts turned into readable document, with proper Isar proof texts and 
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

1141 
some explanations (by Gerwin Klein); 
12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

1142 

12734  1143 
* HOLReal: added Complex_Numbers (by Gertrud Bauer); 
1144 

12690  1145 
* HOLHyperreal is now a logic image; 
1146 

11611  1147 

12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset

1148 
*** HOLCF *** 
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset

1149 

12622  1150 
* Isar: consts/constdefs supports mixfix syntax for continuous 
1151 
operations; 

1152 

1153 
* Isar: domain package adapted to newstyle theory format, e.g. see 

1154 
HOLCF/ex/Dnat.thy; 

1155 

1156 
* theory Lift: proper use of rep_datatype lift instead of ML hacks  

12280  1157 
potential INCOMPATIBILITY; now use plain induct_tac instead of former 
1158 
lift.induct_tac, always use UU instead of Undef; 

12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset

1159 

12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

1160 
* HOLCF/IMP: updated and converted to newstyle theory; 
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

1161 

12022
9c3377b133c0
HOLCF: proper rep_datatype lift (see theory Lift); use plain induct_tac
wenzelm
parents:
11995
diff
changeset

1162 

11474  1163 
*** ZF *** 
1164 

12622  1165 
* Isar: proper integration of logicspecific tools and packages, 
1166 
including theory commands '(co)inductive', '(co)datatype', 

1167 
'rep_datatype', 'inductive_cases', as well as methods 'ind_cases', 

1168 
'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC'); 

1169 

1170 
* theory Main no longer includes AC; for the Axiom of Choice, base 

1171 
your theory on Main_ZFC; 

1172 

1173 
* the integer library now covers quotients and remainders, with many 

1174 
laws relating division to addition, multiplication, etc.; 

12563  1175 

12280  1176 
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a 
1177 
typeless version of the formalism; 

1178 

13025  1179 
* ZF/AC, Coind, IMP, Resid: updated and converted to newstyle theory 
1180 
format; 

12608
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

1181 

12280  1182 
* ZF/Induct: new directory for examples of inductive definitions, 
12608
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

1183 
including theory Multiset for multiset orderings; converted to 
2df381faa787
* ZF/IMP: updated and converted to newstyle theory format;
wenzelm
parents:
12597
diff
changeset

1184 
newstyle theory format; 
12177
b1c16d685a99
* ZF: newstyle theory commands 'inductive', 'inductive_cases', and
wenzelm
parents:
12163
diff
changeset

1185 

13025  1186 
* ZF: many new theorems about lists, ordinals, etc.; 
12850  1187 

11474  1188 

1189 
*** General *** 

1190 

12280  1191 
* Pure/kernel: metalevel proof terms (by Stefan Berghofer); reference 
1192 
variable proof controls level of detail: 0 = no proofs (only oracle 

1193 
dependencies), 1 = lemma dependencies, 2 = compact proof terms; see 

1194 
also ref manual for further ML interfaces; 

1195 

1196 
* Pure/axclass: removed obsolete ML interface 

1197 
goal_subclass/goal_arity; 

1198 

1199 
* Pure/syntax: new token syntax "num" for plain numerals (without "#" 

1200 
of "xnum"); potential INCOMPATIBILITY, since 0, 1 etc. are now 

1201 
separate tokens, so expressions involving minus need to be spaced 

1202 
properly; 

1203 

12312
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

1204 
* Pure/syntax: support nonoriented infixes, using keyword "infix" 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

1205 
rather than "infixl" or "infixr"; 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

1206 

f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

1207 
* Pure/syntax: concrete syntax for dummy type variables admits genuine 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

1208 
sort constraint specifications in type inference; e.g. "x::_::foo" 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

1209 
ensures that the type of "x" is of sort "foo" (but not necessarily a 
f0f06950820d
* Isar/Pure: "sorry" no longer requires quick_and_dirty in interactive mode;
wenzelm
parents:
12280
diff
changeset

1210 
type variable); 
12280  1211 

1212 
* Pure/syntax: print modes "type_brackets" and "no_type_brackets" 

1213 
control output of nested => (types); the default behavior is 

1214 
"type_brackets"; 

1215 

1216 
* Pure/syntax: builtin parse translation for "_constify" turns valued 

11817  1217 
tokens into AST constants; 
11474  1218 

12280  1219 
* Pure/syntax: prefer later declarations of translations and print 
1220 
translation functions; potential INCOMPATIBILITY: need to reverse 

1221 
multiple declarations for same syntax element constant; 

1222 

12832
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset

1223 
* Pure/show_hyps reset by default (in accordance to existing Isar 
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset

1224 
practice); 
c31b44286a8a
* Pure/show_hyps reset by default (in accordance to existing Isar practice);
wenzelm
parents:
12777
diff
changeset

1225 

12280  1226 
* Provers/classical: renamed addaltern to addafter, addSaltern to 
1227 
addSafter; 

1228 

1229 
* Provers/clasimp: ``iff'' declarations now handle conditional rules 

1230 
as well; 

12253  1231 

12538  1232 
* system: tested support for MacOS X; should be able to get Isabelle + 
1233 
Proof General to work in a plain Terminal after installing Poly/ML 

1234 
(e.g. from the Isabelle distribution area) and GNU bash alone 

1235 
(e.g. from http://www.apple.com); full X11, XEmacs and XSymbol 

1236 
support requires further installations, e.g. from 

1237 
http://fink.sourceforge.net/); 

1238 

12280  1239 
* system: support Poly/ML 4.1.1 (able to manage larger heaps); 
11551  1240 

12753
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset

1241 
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead 
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset

1242 
of 40 MB), cf. ML_OPTIONS; 
3a62df7ae926
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm
parents:
12736
diff
changeset

1243 

11633  1244 
* system: Proof General keywords specification is now part of the 
1245 
Isabelle distribution (see etc/isarkeywords.el); 

1246 

12728  1247 
* system: support for persistent Proof General sessions (refrain from 
1248 
outdating all loaded theories on startup); user may create writable 

1249 
logic images like this: ``isabelle q HOL Test''; 

12597
14822e4436bf
HOL/IMP and HOLCF/IMP updated and converted (Gerwin Klein);
wenzelm
parents:
12587
diff
changeset

1250 

11551  1251 
* system: smart selection of Isabelle process versus Isabelle 
11572  1252 
interface, accommodates caseinsensitive file systems (e.g. HFS+); may 
1253 
run both "isabelle" and "Isabelle" even if file names are badly 

1254 
damaged (executable inspects the case of the first letter of its own 

1255 
name); added separate "isabelleprocess" and "isabelleinterface"; 

11551  1256 

12472  1257 
* system: refrain from any attempt at filtering input streams; no 
1258 
longer support ``8bit'' encoding of old isabelle font, instead proper 

1259 
isolatin characters may now be used; the related isatools 

1260 
"symbolinput" and "nonascii" have disappeared as well; 

1261 

1262 
* system: removed old "xterm" interface (the print modes "xterm" and 

1263 
"xterm_color" are still available for direct use in a suitable 

1264 
terminal); 

1265 

11314  1266 

11169
98c2f741e32b
made split_all_tac safe introducing safe_full_simp_tac, EXISTING PROOFS MAY FAIL
oheimb
parents:
11130
diff
changeset

1267 

11062  1268 
New in Isabelle992 (February 2001) 
1269 
 

1270 

10224  1271 
*** Overview of INCOMPATIBILITIES *** 
1272 

11241  1273 
* HOL: please note that theories in the Library and elsewhere often use the 
1274 
newstyle (Isar) format; to refer to their theorems in an ML script you must 

12622  1275 
bind them to ML identifers by e.g. val thm_name = thm "thm_name"; 
11241  1276 

11043
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

1277 
* HOL: inductive package no longer splits induction rule aggressively, 
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

1278 
but only as far as specified by the introductions given; the old 
11130  1279 
format may be recovered via ML function complete_split_rule or attribute 
11043
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

1280 
'split_rule (complete)'; 
2e3bbac8763b
HOL: inductive package no longer splits induction rule aggressively,
wenzelm
parents:
11016
diff
changeset

1281 

10998  1282 
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold, 
1283 
gfp_Tarski to gfp_unfold; 

10224  1284 

10288  1285 
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp; 
1286 

10858  1287 
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a 
1288 
relation); infix "^^" has been renamed "``"; infix "``" has been 

1289 
renamed "`"; "univalent" has been renamed "single_valued"; 

10793  1290 

10998  1291 
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse" 
1292 
operation; 

1293 

10868  1294 
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>; 
10856  1295 

10391  1296 
* Isar: 'obtain' no longer declares "that" fact as simp/intro; 
1297 

10401
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

1298 
* Isar/HOL: method 'induct' now handles nonatomic goals; as a 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

1299 
consequence, it is no longer monotonic wrt. the local goal context 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

1300 
(which is now passed through the inductive cases); 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

1301 

10976
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset

1302 
* Document preparation: renamed standard symbols \<ll> to \<lless> and 
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset

1303 
\<gg> to \<ggreater>; 
0e7cf6f9fa29
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm
parents:
10966
diff
changeset

1304 

10224  1305 

10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1306 
*** Document preparation *** 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1307 

10858  1308 
* \isabellestyle{NAME} selects version of Isabelle output (currently 
1309 
available: are "it" for near mathmode beststyle output, "sl" for 

1310 
slanted text style, and "tt" for plain typewriter; if no 

1311 
\isabellestyle command is given, output is according to slanted 

1312 
typewriter); 

1313 

10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

1314 
* support sub/super scripts (for single symbols only), input syntax is 
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

1315 
like this: "A\<^sup>*" or "A\<^sup>\<star>"; 
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

1316 

10858  1317 
* some more standard symbols; see Appendix A of the system manual for 
11062  1318 
the complete list of symbols defined in isabellesym.sty; 
10858  1319 

10998  1320 
* improved isabelle style files; more abstract symbol implementation 
1321 
(should now use \isamath{...} and \isatext{...} in custom symbol 

1322 
definitions); 

1323 

10634  1324 
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals 
1325 
state; Note that presentation of goal states does not conform to 

1326 
actual humanreadable proof documents. Please do not include goal 

1327 
states into document output unless you really know what you are doing! 

10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

1328 

11062  1329 
* proper indentation of antiquoted output with proportional LaTeX 
1330 
fonts; 

10862  1331 

11050
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset

1332 
* no_document ML operator temporarily disables LaTeX document 
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset

1333 
generation; 
ac5709ac50b9
* no_document ML operator temporarily disables LaTeX document
wenzelm
parents:
11043
diff
changeset

1334 

11062  1335 
* isatool unsymbolize tunes sources for plain ASCII communication; 
1336 

10322
df38c61bf541
* support sub/super scripts (for single symbols only), input syntax is
wenzelm
parents:
10306
diff
changeset

1337 

10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

1338 
*** Isar *** 
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

1339 

10547  1340 
* Pure: Isar now suffers initial goal statements to contain unbound 
1341 
schematic variables (this does not conform to actual readable proof 

1342 
documents, due to unpredictable outcome and noncompositional proof 

1343 
checking); users who know what they are doing may use schematic goals 

1344 
for Prologstyle synthesis of proven results; 

1345 

10391  1346 
* Pure: assumption method (an implicit finishing) now handles actual 
1347 
rules as well; 

1348 

1349 
* Pure: improved 'obtain'  moved to Pure, insert "that" into 

1350 
initial goal, declare "that" only as Pure intro (only for single 

1351 
steps); the "that" rule assumption may now be involved in implicit 

1352 
finishing, thus ".." becomes a feasible for trivial obtains; 

1353 

1354 
* Pure: default proof step now includes 'intro_classes'; thus trivial 

1355 
instance proofs may be performed by ".."; 

1356 

1357 
* Pure: ?thesis / ?this / "..." now work for pure metalevel 

1358 
statements as well; 

10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

1359 

11097  1360 
* Pure: more robust selection of calculational rules; 
1361 

10858  1362 
* Pure: the builtin notion of 'finished' goal now includes the ==refl 
1363 
rule (as well as the assumption rule); 

1364 

1365 
* Pure: 'thm_deps' command visualizes dependencies of theorems and 

1366 
lemmas, using the graph browser tool; 

1367 

10944  1368 
* Pure: predict failure of "show" in interactive mode; 
1369 

11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset

1370 
* Pure: 'thms_containing' now takes actual terms as arguments; 
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset

1371 

10401
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

1372 
* HOL: improved method 'induct'  now handles nonatomic goals 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

1373 
(potential INCOMPATIBILITY); tuned error handling; 
58bb50f69497
* Isar/HOL: method 'induct' now handles nonatomic goals; as a
wenzelm
parents:
10391
diff
changeset

1374 

10557  1375 
* HOL: cases and induct rules now provide explicit hints about the 
10547  1376 
number of facts to be consumed (0 for "type" and 1 for "set" rules); 
1377 
any remaining facts are inserted into the goal verbatim; 

1378 

10858  1379 
* HOL: local contexts (aka cases) may now contain term bindings as 
1380 
well; the 'cases' and 'induct' methods new provide a ?case binding for 

1381 
the result to be shown in each case; 

1382 

10770  1383 
* HOL: added 'recdef_tc' command; 
1384 

11016
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset

1385 
* isatool convert assists in eliminating legacy ML scripts; 
8f8ba41a5e7a
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm
parents:
10998
diff
changeset

1386 

10306
b0ab988a27a9
* HOL: default proof step now includes 'intro_classes';
wenzelm
parents:
10288
diff
changeset

1387 

10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1388 
*** HOL *** 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1389 

87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1390 
* HOL/Library: a collection of generic theories to be used together 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1391 
with main HOL; the theory loader path already includes this directory 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1392 
by default; the following existing theories have been moved here: 
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1393 
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While 
10337  1394 
(as While_Combinator), HOL/Lex/Prefix (as List_Prefix); 
10245
87771e2f49fe
* HOL/Library: a collection of generic theories to be used together
wenzelm
parents:
10224
diff
changeset

1395 

10966  1396 
* HOL/Unix: "Some aspects of Unix filesystem security", a typical 
1397 
modelling and verification task performed in Isabelle/HOL + 

1398 
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel). 

1399 

11094  1400 
* HOL/Algebra: special summation operator SUM no longer exists, it has 
1401 
been replaced by setsum; infix 'assoc' now has priority 50 (like 

1402 
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to 

1403 
'domain', this makes the theory consistent with mathematical 

1404 
literature; 

1405 

10514  1406 
* HOL basics: added overloaded operations "inverse" and "divide" 
10726  1407 
(infix "/"), syntax for generic "abs" operation, generic summation 
11094  1408 
operator \<Sum>; 
10452
abeefb0a79ae
* added overloaded operations "inverse" and "divide" (infix "/");
wenzelm
parents:
10428
diff
changeset

1409 

10391  1410 
* HOL/typedef: simplified package, provide more useful rules (see also 
1411 
HOL/subset.thy); 

1412 

10915
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
diff
changeset

1413 
* HOL/datatype: induction rule for arbitrarily branching datatypes is 
6b66a8a530ce
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm
parents:
10868
