author  wenzelm 
Fri, 21 Sep 2007 22:51:08 +0200  
changeset 24669  4579eac2c997 
parent 24649  f7b68d12a91e 
child 24692  a5d89a87e8e3 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

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

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

6 

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

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

8 

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

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

22826  13 

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

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

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

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

17 

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

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

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

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

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

22 

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

25 
quotes. 

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

26 

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

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

28 
header specifications (including optional directories), but not the 
24172
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

29 
accidental file locations of previously successful loads. The strict 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

30 
update policy of former update_thy is now already performed by 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

31 
use_thy, so the former has been removed; use_thys updates several 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

32 
theories simultaneously, just as 'imports' within a theory header 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

33 
specification, but without merging the results. Potential 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

34 
INCOMPATIBILITY: may need to refine theory headers and commands 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

35 
ROOT.ML which depend on load order. 
23888
babe337cce2d
* Theory loader: be more serious about observing the static theory header specifications;
wenzelm
parents:
23881
diff
changeset

36 

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

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

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

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

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

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

43 

24187
8bdf5ca5871f
* Theory loader: oldstyle ML proof scripts are considered a legacy feature;
wenzelm
parents:
24172
diff
changeset

44 
* Theory loader: oldstyle ML proof scripts being *attached* to a thy 
8bdf5ca5871f
* Theory loader: oldstyle ML proof scripts are considered a legacy feature;
wenzelm
parents:
24172
diff
changeset

45 
file (with the same base name as the theory) are considered a legacy 
8bdf5ca5871f
* Theory loader: oldstyle ML proof scripts are considered a legacy feature;
wenzelm
parents:
24172
diff
changeset

46 
feature, which will disappear eventually. Even now, the theory loader no 
8bdf5ca5871f
* Theory loader: oldstyle ML proof scripts are considered a legacy feature;
wenzelm
parents:
24172
diff
changeset

47 
longer maintains dependencies on such files. 
8bdf5ca5871f
* Theory loader: oldstyle ML proof scripts are considered a legacy feature;
wenzelm
parents:
24172
diff
changeset

48 

24234
4714e04fb8e9
* Syntax: scope for resolving ambiguities via typeinference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset

49 
* Syntax: the scope for resolving ambiguities via typeinference is now 
4714e04fb8e9
* Syntax: scope for resolving ambiguities via typeinference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset

50 
limited to individual terms, instead of whole simultaneous 
4714e04fb8e9
* Syntax: scope for resolving ambiguities via typeinference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset

51 
specifications as before. This greatly reduces the complexity of the 
4714e04fb8e9
* Syntax: scope for resolving ambiguities via typeinference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset

52 
syntax module and improves flexibility by separating parsing and 
4714e04fb8e9
* Syntax: scope for resolving ambiguities via typeinference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset

53 
typechecking. INCOMPATIBILITY: additional typeconstraints (explicit 
4714e04fb8e9
* Syntax: scope for resolving ambiguities via typeinference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset

54 
'fixes' etc.) are required in rare situations. 
4714e04fb8e9
* Syntax: scope for resolving ambiguities via typeinference is now limited to individual terms;
wenzelm
parents:
24213
diff
changeset

55 

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

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

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

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

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

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

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

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

63 

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

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

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

66 
support a specific search form (see ProofGeneral/CHANGES). 
22965  67 

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

70 
suppressed from proof state output. Note that the ProofGeneral 

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

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

73 
limit is imposed. 

74 

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

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

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

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

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

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

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

81 

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

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

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

84 

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

85 

17865  86 
*** Document preparation *** 
87 

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

90 
current context. 

21339  91 

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

17865  94 

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

21735  97 
arguments may be given on the LHS.) 
21717  98 

99 

17865  100 

17779  101 
*** Pure *** 
102 

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

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

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

105 

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

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

108 
explicitly to the table of defining equations 
22754  109 
 primitive definitions are not used as defining equations by default any longer 
22735  110 
 defining equations are now definitly restricted to meta "==" and object 
111 
equality "=" 

112 
 HOL theories have been adopted accordingly 

113 

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

115 
achieve Haskelllike type classes in Isabelle. See 
20807  116 
HOL/ex/Classpackage.thy for examples. 
117 

118 
* Yet another code generator framework allows to generate executable 

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

119 
code for ML and Haskell (including "class"es). A short usage sketch: 
20188
8b22026445af
added notes on class_package.ML and codegen_package.ML
haftmann
parents:
20169
diff
changeset

120 

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

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

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

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

129 

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

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

131 

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

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

133 

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

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

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

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

138 

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

140 

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

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

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

143 

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

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

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

146 

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

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

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

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

150 

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

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

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

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

154 

22735  155 
code_instance and code_class only apply to target Haskell. 
156 

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

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

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

159 

19254  160 
* Command 'no_translations' removes translation rules from theory 
161 
syntax. 

162 

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

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

166 
correspondence to type class and instance declarations. 

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

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

19711  169 

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

171 
instantiation that matches an instance against the most general 

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

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

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

175 
recursion over such type arguments. Incomplete specification patterns 

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

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

180 

24086  181 
* Configuration options are maintained within the theory or proof 
182 
context (with name and type bool/int/string), providing a very simple 

183 
interface to a poorman's version of general context data. Tools may 

24110
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

184 
declare options in ML (e.g. using Attrib.config_int) and then refer to 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

185 
these values using Config.get etc. Users may change options via an 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

186 
associated attribute of the same name. This form of context 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

187 
declaration works particularly well with commands 'declare' or 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

188 
'using', for example ``declare [[foo = 42]]''. Thus it has become 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

189 
very easy to avoid global references, which would not observe Isar 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

190 
toplevel undo/redo and fail to work with multithreading. 
24086  191 

24172
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

192 
Various global ML references of Pure and HOL have been turned into 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

193 
configuration options: 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

194 

06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

195 
Unify.search_bound unify_search_bound 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

196 
Unify.trace_bound unify_trace_bound 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

197 
Unify.trace_simp unify_trace_simp 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

198 
Unify.trace_types unify_trace_types 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

199 
Simplifier.simp_depth_limit simp_depth_limit 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

200 
Blast.depth_limit blast_depth_limit 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

201 
DatatypeProp.dtK datatype_distinctness_limit 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

202 
fast_arith_neq_limit fast_arith_neq_limit 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

203 
fast_arith_split_limit fast_arith_split_limit 
06e42cf7df4e
theory loader: added use_thys, removed obsolete update_thy;
wenzelm
parents:
24110
diff
changeset

204 

24086  205 
* Named collections of theorems may be easily installed as context 
206 
data using the functor NamedThmsFun (see 

207 
src/Pure/Tools/named_thms.ML). The user may add or delete facts via 

24110
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

208 
attributes; there is also a toplevel print command. This facility is 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

209 
just a common case of general context data, which is the preferred way 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

210 
for anything more complex than just a list of facts in canonical 
4ab3084e311c
tuned config options: eliminated separate attribute "option";
wenzelm
parents:
24086
diff
changeset

211 
order. 
24086  212 

24032  213 
* Isar: command 'declaration' augments a local theory by generic 
214 
declaration functions written in ML. This enables arbitrary content 

215 
being added to the context, depending on a morphism that tells the 

216 
difference of the original declaration context wrt. the application 

217 
context encountered later on. 

218 

219 
* Isar: proper interfaces for simplification procedures. Command 

220 
'simproc_setup' declares named simprocs (with match patterns, and body 

221 
text in ML). Attribute "simproc" adds/deletes simprocs in the current 

222 
context. ML antiquotation @{simproc name} retrieves named simprocs. 

223 

224 
* Isar: an extra pair of brackets around attribute declarations 

225 
abbreviates a theorem reference involving an internal dummy fact, 

226 
which will be ignored later  only the effect of the attribute on 

227 
the background context will persist. This form of inplace 

228 
declarations is particularly useful with commands like 'declare' and 

229 
'using', for example ``have A using [[simproc a]] by simp''. 

230 

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

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

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

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

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

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

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

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

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

239 

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

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

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

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

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

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

245 

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

248 

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

250 
then guess x and y by clarify 

251 

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

253 
proof tools being involved here. 

254 

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

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

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

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

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

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

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

263 

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

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

18020  267 

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

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

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

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

272 

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

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

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

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

276 

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

279 

18308  280 
* Isar: 'def' now admits simultaneous definitions, e.g.: 
281 

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

283 

18540  284 
* Isar: added command 'unfolding', which is structurally similar to 
285 
'using', but affects both the goal state and facts by unfolding given 

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

286 
rewrite rules. Thus many occurrences of the 'unfold' method or 
18540  287 
'unfolded' attribute may be replaced by firstclass proof text. 
288 

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

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

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

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

292 
analogous to the 'rule_format' attribute, but *not* that of the 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

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

294 

24238  295 
* Isar: the new attribute [rotated n] (default n = 1) rotates the 
296 
premises of a theorem by n. Useful in conjunction with drule. 

297 

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

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

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

303 
originally first one. 

19220  304 

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

305 
* Isar: schematic goals are no longer restricted to higherorder 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

306 
patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as 
faa698d46686
* Theory syntax: some popular names (e.g. "class", "if") are now keywords.
wenzelm
parents:
19783
diff
changeset

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

308 

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

311 
(essentially a disjunction of cases with local parameters and 

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

18910  313 
adequately; in this notation common elimination rules look like this: 
18901  314 

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

316 
assumes "EX x. P x" 

317 
obtains x where "P x" 

318 

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

320 
assumes "A & B" 

321 
obtains A and B 

322 

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

324 
assumes "A  B" 

325 
obtains 

326 
A 

327 
 B 

328 

18910  329 
The subsequent classical rules even refer to the formal "thesis" 
18901  330 
explicitly: 
331 

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

333 
obtains "~ thesis" 

334 

18910  335 
lemma Peirce's_Law:  "((thesis ==> something) ==> thesis) ==> thesis" 
336 
obtains "thesis ==> something" 

18901  337 

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

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

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

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

343 
case_names). 

18901  344 

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

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

346 
"assms" fact in the proof context. This is more appropriate than the 
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset

347 
(historical) "prems", which refers to all assumptions of the current 
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset

348 
context, including those from the target locale, proof body etc. 
379f130843f7
* Isar: the assumptions of a long theorem statement are available as assms;
wenzelm
parents:
21406
diff
changeset

349 

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

352 
toplevel lemma. 

353 

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

356 

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

359 
to occur. 

360 

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

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

362 
according to the current context. This is particularly useful for 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

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

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

365 

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

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

367 
instead of "FOO ". This allows multiple binder declarations to coexist 
45b3a85ee548
* Pure: syntax constant for foo (binder) is called foo_binder;
wenzelm
parents:
21471
diff
changeset

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

369 

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

370 
* Isar/locales: 'notation' provides a robust interface to the 'syntax' 
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset

371 
primitive that also works in a locale context (both for constants and 
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset

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

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

374 

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

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

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

379 

19665  380 
axiomatization 
21595  381 
eq (infix "===" 50) where 
382 
eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y" 

383 

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

385 
definition g where "g x = f x x" 

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

386 

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

390 

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

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

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

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

398 

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

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

402 
'translations' in common applications. 

19084  403 

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

404 
Concrete syntax is attached to specified constants in internal form, 
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

405 
independently of name spaces. The parse tree representation is 
21209
dbb8decc36bc
'const_syntax' command: allow fixed variables, renamed to 'notation';
wenzelm
parents:
21200
diff
changeset

406 
slightly different  use 'notation' instead of raw 'syntax', and 
19682
c8c301eb965a
* Pure: syntax 'CONST name' produces a fully internalized constant;
wenzelm
parents:
19665
diff
changeset

407 
'translations' with explicit "CONST" markup to accommodate this. 
19665  408 

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

411 
abbreviations on output. 

412 

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

415 
 parameter renamings are no longer required to be injective. 

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

417 
locale endom = homom mult mult h. 

418 

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

419 
* Isar/locales: changed the way locales with predicates are defined. 
fb32b43e7f80
Restructured locales with predicates: import is now an interpretation.
ballarin
parents:
19895
diff
changeset

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

423 
predicates, goals repesenting already interpreted fragments are not 

424 
removed automatically. Use methods `intro_locales' and 

425 
`unfold_locales'; see below. 

426 

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

428 
provide backward reasoning on locales predicates. The methods are 

429 
aware of interpretations and discharge corresponding goals. 

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

431 
unfold predicates to assumptions. 

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

432 

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

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

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

436 

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

439 
unfolded in interpreted theorems. This is useful for replacing 

440 
defined concepts (constants depending on locale parameters) by 

441 
concepts already existing in the target context. Example: 

442 

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

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

445 

23977  446 
Typically, the constant `partial_order.less' is created by a definition 
447 
specification element in the context of locale partial_order. 

23920  448 

24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

449 
* Provers/induct: improved internal context management to support local 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

450 
fixes and defines onthefly. Thus explicit metalevel connectives !! 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

451 
and ==> are rarely required anymore in inductive goals (using 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

452 
objectlogic connectives for this purpose has been long obsolete 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

453 
anyway). Common proof patterns are explained in 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

454 
HOL/Induct/Common_Patterns.thy, see also HOL/Isar_examples/Puzzle.thy 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

455 
and src/HOL/Lambda for realistic examples. 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

456 

7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

457 
* Provers/induct: improved handling of simultaneous goals. Instead of 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

458 
introducing objectlevel conjunction, the statement is now split into 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

459 
several conclusions, while the corresponding symbolic cases are nested 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

460 
accordingly. INCOMPATIBILITY, proofs need to be structured explicitly, 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

461 
see HOL/Induct/Common_Patterns.thy, for example. 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

462 

7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

463 
* Provers/induct: mutual induction rules are now specified as a list of 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

464 
rule sharing the same induction cases. HOL packages usually provide 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

465 
foo_bar.inducts for mutually defined items foo and bar (e.g. inductive 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

466 
sets or datatypes). INCOMPATIBILITY, users need to specify mutual 
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

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

468 

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

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

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

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

472 

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

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

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

475 

24606
7acbb982fc77
moved induct patterns to HOL/Induct/Common_Patterns.thy;
wenzelm
parents:
24507
diff
changeset

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

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

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

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

481 

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

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

485 
trace indicates where parts have been suppressed. 

18674  486 

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

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

488 
attribute; classical elim/dest rules are now treated uniformly when 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

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

490 

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

493 
least one premise. 

494 

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

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

499 

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

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

501 
where the body does not mention the bound variable. Note that dummy 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

502 
patterns implicitly depend on their context of bounds, which makes 
ab3f32f86847
* Provers/classical: removed obsolete classical version of elim_format;
wenzelm
parents:
18507
diff
changeset

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

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

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

506 

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

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

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

509 
for example "A > B" => "Pi A (%_. B)". 
17779  510 

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

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

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

513 

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

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

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

516 

17865  517 

17806  518 
*** HOL *** 
519 

24636  520 
* The transitivity reasoner for partial and linear orders is set up for 
521 
locales `order' and `linorder' generated by the new class package. Previously 

522 
the reasoner was only set up for axiomatic type classes. Instances of the 

523 
reasoner are available in all contexts importing or interpreting these locales. 

524 
The following functionality is provided: 

525 
 method `order' to invoke the reasoner manually. 

526 
 diagnostic command `print_orders' shows which instances of the reasoner are 

527 
available in the current context. 

528 
As previously, the reasoner is integrated with the simplifier as a solver. 

529 

24422  530 
* Formulation of theorem "dense" changed slightly due to integration with new 
531 
class dense_linear_order. 

532 

24342  533 
* theory Finite_Set: "namespace" locales Lattice, Distrib_lattice, Linorder etc. 
534 
have disappeared; operations defined in terms of fold_set now are named 

535 
Inf_fin, Sup_fin. INCOMPATIBILITY. 

536 

24333  537 
* HOLWord: 
538 
New extensive library and type for generic, fixed size machine 

539 
words, with arithemtic, bitwise, shifting and rotating operations, 

540 
reflection into int, nat, and bool lists, automation for linear 

541 
arithmetic (by automatic reflection into nat or int), including 

542 
lemmas on overflow and monotonicity. Instantiated to all appropriate 

543 
arithmetic type classes, supporting automatic simplification of 

544 
numerals on all operations. Jointly developed by NICTA, Galois, and 

545 
PSU. 

546 

547 
* Library/Boolean_Algebra: locales for abstract boolean algebras. 

548 

549 
* Library/Numeral_Type: numbers as types, e.g. TYPE(32). 

550 

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

553 
languages. 

554 
* Pretty_Char represents HOL characters by character literals in target 

555 
languages. 

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

557 
codes; includes Pretty_Int. 

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

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

560 
denominator). 

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

562 
representable by rational numbers. 

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

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

565 
includes Pretty_Int. 

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

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

568 
of type ml_string are mapped to strings in SML. 

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

570 
builtin integers. 

571 

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

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

573 

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

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

575 

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

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

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

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

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

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

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

582 

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

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

584 

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

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

586 

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

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

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

589 

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

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

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

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

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

594 

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

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

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

597 

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

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

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

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

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

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

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

604 

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

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

606 

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

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

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

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

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

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

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

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

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

615 

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

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

617 

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

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

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

620 

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

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

622 

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

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

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

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

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

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

628 

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

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

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

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

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

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

634 

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

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

636 

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

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

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

639 

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

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

641 

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

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

643 

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

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

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

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

647 

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

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

649 

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

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

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

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

653 

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

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

655 

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

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

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

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

659 

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

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

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

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

663 

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

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

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

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

667 

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

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

23449  671 

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

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

675 
wait for the automatic provers to return. 

23449  676 

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

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

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

685 

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

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

689 
(potential INCOMPATIBILITY) 

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

691 
 of_nat_diff and of_nat_mult are no longer default simp rules 

23377  692 

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

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

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

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

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

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

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

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

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

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

702 

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

705 
possible incompatibilities when working on ML level. 

706 

22997  707 
* Constant renames due to introduction of canonical name prefixing for 
708 
class package: 

709 

710 
HOL.abs ~> HOL.minus_class.abs 

711 
HOL.divide ~> HOL.divide_class.divide 

712 
Nat.power ~> Nat.power_class.power 

713 
Nat.size ~> Nat.size_class.size 

714 
Numeral.number_of ~> Numeral.number_class.number_of 

23129  715 
FixedPoint.Inf ~> FixedPoint.complete_lattice_class.Inf 
24342  716 
FixedPoint.Sup ~> FixedPoint.complete_lattice_class.Sup 
23129  717 

23180  718 
* Rudimentary class target mechanism involves constant renames: 
23129  719 

720 
Orderings.min ~> Orderings.ord_class.min 

721 
Orderings.max ~> Orderings.ord_class.max 

22997  722 

23564  723 
* primrec: missing cases mapped to "undefined" instead of "arbitrary" 
22845  724 

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

726 

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

728 

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

731 

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

734 
For details see List.thy. 

23102  735 

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

738 
and for uniformity. INCOMPATIBILITY 

739 

24649  740 
* [a..b] is now defined for arbitrary linear orders. 
741 
It used to be defined on nat only, as an abbreviation for [a..<Suc b] 

742 
INCOMPATIBILITY 

743 

23971
e6d505d5b03d
renamed lemma "set_take_whileD" to "set_takeWhileD"
krauss
parents:
23920
diff
changeset

744 
* Lemma "set_take_whileD" renamed to "set_takeWhileD" 
e6d505d5b03d
renamed lemma "set_take_whileD" to "set_takeWhileD"
krauss
parents:
23920
diff
changeset

745 

24627  746 
* new functions sorted and sort in List. 
747 

24507  748 
* function "sgn" is now overloaded and available on int, real, complex 
749 
(and other numeric types). 

750 
The details: new class "sgn" with function "sgn"; 

751 
two possible defs of sgn in the classes sgn_if and sgn_div_norm 

752 
(as equational assumptions); 

753 
ordered_idom now also inherits from sgn_if  INCOMPATIBILITY. 

24492  754 

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

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

760 
* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib 

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

764 
INCOMPATIBILITY. 

23478  765 

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

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

768 

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

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

771 

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

22450  775 
* Some steps towards more uniform lattice theory development in HOL. 
22422
ee19cdb07528
stepping towards uniform lattice theory development in HOL
haftmann
parents:
22384
diff
changeset

776 

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

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

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

779 

22450  780 
classes "meet_semilorder" and "join_semilorder" now named 
781 
"lower_semilattice" and "upper_semilattice" 

782 
class "lorder" now named "lattice" 

783 
class "comp_lat" now named "complete_lattice" 

784 

785 
Instantiation of lattice classes allows explicit definitions 

24342  786 
for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices). 
22450  787 

23129  788 
INCOMPATIBILITY. Theorem renames: 
22450  789 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

825 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

843 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

872 

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

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

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

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

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

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

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

879 

24342  880 
Sup_def ~> Sup_Inf 
881 
Sup_bool_eq ~> Sup_bool_def 

882 
Sup_fun_eq ~> Sup_fun_def 

883 
Sup_set_eq ~> Sup_set_def 

884 

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

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

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

887 

22450  888 
meet_min ~> inf_min 
889 
join_max ~> sup_max 

890 

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

892 
"cases" renamed ro "order_refl", "order_trans" and "linorder_cases", to 
33a46e6c7f04
prefix of class interpretation not mandatory any longer
haftmann
parents:
22376
diff
changeset

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

894 

22845  895 
* Classes "order" and "linorder": 
22316  896 
potential INCOMPATIBILITY: order of proof goals in order/linorder instance 
897 
proofs changed. 

898 

22218  899 
* Dropped lemma duplicate def_imp_eq in favor of meta_eq_to_obj_eq. 
900 
INCOMPATIBILITY. 

901 

902 
* Dropped lemma duplicate if_def2 in favor of if_bool_eq_conj. 

903 
INCOMPATIBILITY. 

904 

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

907 

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

22997  909 
dvd" to "Divides.div_class.div", "Divides.div_class.mod" and "Divides.dvd". INCOMPATIBILITY. 
22126  910 

911 
* Added method "lexicographic_order" automatically synthesizes 

912 
termination relations as lexicographic combinations of size measures 

913 
 'function' package. 

914 

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

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

917 
(K x) r The Kcombinator that is internally used is called K_record. 

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

918 
INCOMPATIBILITY: Usage of the plain update functions has to be 
a607ae87ee81
fieldupdate in records is generalised to take a function on the field
schirmer
parents:
21215
diff
changeset

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

920 

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

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

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

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

926 

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

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

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

930 

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

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

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

933 

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

937 

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

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

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

941 

22997  942 
* Renamed constants "0" to "HOL.zero_class.zero" and "1" to "HOL.one_class.one". 
22126  943 
INCOMPATIBILITY. 
944 

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

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

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

949 
significant changes for setting up numeral syntax for types: 

20485  950 

951 
 new constants Numeral.pred and Numeral.succ instead 

952 
of former Numeral.bin_pred and Numeral.bin_succ. 

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

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

955 
 ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs. 

956 

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

958 

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

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

962 
suitable for heavyduty computations because the functions are 

963 
compiled to ML first. 

19895  964 

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

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

968 

19279  969 
* Renamed constants in HOL.thy and Orderings.thy: 
22997  970 
op + ~> HOL.plus_class.plus 
971 
op  ~> HOL.minus_class.minus 

972 
uminus ~> HOL.minus_class.uminus 

23881  973 
abs ~> HOL.abs_class.abs 
22997  974 
op * ~> HOL.times_class.times 
23881  975 
op < ~> HOL.ord_class.less 
976 
op <= ~> HOL.ord_class.less_eq 

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

977 

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

978 
Adaptions may be required in the following cases: 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

979 

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

982 
may go wrong. 

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

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

984 

19277  985 
b) Variables named "plus", "minus", "times", "less", "less_eq" 
19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

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

987 

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

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

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

992 
distribution). 

993 
INCOMPATIBILITY: rewrite proofs 

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

994 

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

995 
d) ML code directly refering to constant names 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19226
diff
changeset

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

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

999 

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

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

1003 

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

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

1006 
* Relation composition operator "op O" now has precedence 75 and binds 
a6686a8e1b68
Changed precedence of "op O" (relation composition) from 60 to 75.
krauss
parents:
20712
diff
changeset

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

1008 

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

19377  1011 

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

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

17779  1015 

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

1018 

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

19211  1020 

19279  1021 
* Theorem setsum_mult renamed to setsum_right_distrib. 
1022 

19211  1023 
* Prefer ex1I over ex_ex1I in singlestep reasoning, e.g. by the 
22126  1024 
``rule'' method. 
1025 

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

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

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

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

1030 
speedup. 

1031 

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

1033 
zChaff is still supported as well. 

1034 

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

1036 
bundled as foo_bar.inducts; 

1037 

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

1039 
Library. 

21256  1040 

1041 
* Library: moved theory Accessible_Part to main HOL. 

19572
a4b3176f19dd
* Library: theory Accessible_Part has been move to main HOL.
wenzelm
parents:
19508
diff
changeset

1042 

18446  1043 
* Library: added theory Coinductive_List of potentially infinite lists 
1044 
as greatest fixedpoint. 

18399  1045 

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

1048 

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

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

20807  1052 

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

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

21056  1055 
being more powerful on arithmetic goals. INCOMPATIBILITY. Set 
20807  1056 
fast_arith_split_limit to 0 to obtain the old behavior. 
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
20188
diff
changeset

1057 

22126  1058 
* Support for hex (0x20) and binary (0b1001) numerals. 
19254  1059 

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

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

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

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

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

1066 

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

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

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

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

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

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

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

1074 

23881  1075 
* Reflection: Automatic reification now handels binding, an example 
20807  1076 
is available in HOL/ex/ReflectionEx.thy 
1077 

1078 

20169  1079 
*** HOLAlgebra *** 
1080 

21170  1081 
* Formalisation of ideals and the quotient construction over rings. 
1082 

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

1084 
INCOMPATIBILITY. 

1085 

22126  1086 
* Renamed lemmas least_carrier > least_closed and greatest_carrier > 
1087 
greatest_closed. INCOMPATIBILITY. 

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

1088 

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

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

1092 

22126  1093 
* Renamed theory CRing to Ring. 
20169  1094 

20807  1095 

19653  1096 
*** HOLComplex *** 
1097 

1098 
* Theory Real: new method ferrack implements quantifier elimination 

1099 
for linear arithmetic over the reals. The quantifier elimination 

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

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

1102 

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

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

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

1107 
INCOMPATIBILITY. 

1108 

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

1111 
and norm :: 'a => real. 

1112 

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

1115 
is now defined as range of_real; potential INCOMPATIBILITY. 

1116 

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

1119 

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

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

1123 
INCOMPATIBILITY. 

21791  1124 

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

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

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

1127 
HInfinite :: ('a::real_normed_vector) star set 
21791  1128 
approx :: ('a::real_normed_vector) star => 'a star => bool 
1129 
monad :: ('a::real_normed_vector) star => 'a star set 

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

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

1131 
(NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool 
21791  1132 
(NS)convergent :: (nat => 'a::real_normed_vector) => bool 
1133 
(NS)Bseq :: (nat => 'a::real_normed_vector) => bool 

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

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

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

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

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

1138 
sgn :: 'a::real_normed_vector => 'a 
23116  1139 
exp :: 'a::{recpower,real_normed_field,banach} => 'a 
21791  1140 

1141 
* Complex: Some complexspecific constants are now abbreviations for 

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

1144 
polymorphic versions (INCOMPATIBILITY): 

21791  1145 

1146 
approx < capprox 

1147 
HFinite < CFinite 

1148 
HInfinite < CInfinite 

1149 
Infinitesimal < CInfinitesimal 

1150 
monad < cmonad 

1151 
galaxy < cgalaxy 

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

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

1154 
(ns)deriv < (ns)cderiv 

1155 

19653  1156 

17878  1157 
*** ML *** 
1158 

24643  1159 
* ML basics: just one true type int, which coincides with IntInf.int 
1160 
(even on SML/NJ). 

1161 

24633
0a3a02066244
moved Tools/integer.ML to Pure/General/integer.ML;
wenzelm
parents:
24627
diff
changeset

1162 
* Generic arithmetic modules: Tools/rat.ML, Tools/float.ML 
23251  1163 

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

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

22848  1168 

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

1171 
compiletime. For example: 

1172 

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

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

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

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

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

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

1179 
ML {* @{thm asm_rl} *} 

1180 
ML {* @{thms asm_rl} *} 

22376  1181 
ML {* @{const_name c} *} 
1182 
ML {* @{const_syntax c} *} 

22138  1183 
ML {* @{context} *} 
1184 
ML {* @{theory} *} 

1185 
ML {* @{theory Pure} *} 

1186 
ML {* @{simpset} *} 

1187 
ML {* @{claset} *} 

1188 
ML {* @{clasimpset} *} 

1189 

22151  1190 
The same works for sources being ``used'' within an Isar context. 
1191 

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

1194 

20348  1195 
* Pure/library: 
1196 

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

1197 
val burrow: ('a list > 'b list) > 'a list list > 'b list list 
18549
5308a6ea3b96
rearranged burrow_split to fold_burrow to allow composition with fold_map
haftmann
parents:
18540
diff
changeset

1198 
val fold_burrow: ('a list > 'c > 'b list * 'd) > 'a list list > 'c > 'b list list * 'd 
18450
e57731ba01dd
discontinued unflat in favour of burrow and burrow_split
haftmann
parents:
18446
diff
changeset

1199 

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

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

1205 

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

1208 

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

1209 
val map2: ('a > 'b > 'c) > 'a list > 'b list > 'c list 
875451c9d253
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18399
diff
changeset

1210 
val fold2: ('a > 'b > 'c > 'c) > 'a list > 'b list > 'c > 'c 
875451c9d253
rearranged tuples (theory * 'a) to ('a * theory) in Pure
haftmann
parents:
18399
diff
changeset

1211 

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

1214 
given more convenient names and signatures reminiscent of similar 

1215 
functions for alists, tables, etc: 

18051  1216 

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

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

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

1220 

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

1223 

22126  1224 
* Pure/library: added general ``divide_and_conquer'' combinator on 
1225 
lists. 

19032  1226 

1227 
* Pure/General/table.ML: the join operations now works via exceptions 

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

1228 
DUP/SAME instead of type option. This is simpler in simple cases, and 
085b5badb8de
* Isar/locales: new derived specification elements 'definition', 'abbreviation', 'axiomatization';
wenzelm
parents:
19034
diff
changeset

1229 
admits slightly more efficient complex applications. 
18446  1230 

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

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

1235 
* Pure: 'advanced' translation functions (parse_translation etc.) now 
bd83590be0f7
* Pure: 'advanced' translation functions use Context.generic instead of just theory;
wenzelm
parents:
18815
diff
changeset

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

1237 

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

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

18738  1241 
minimizing code duplication. Thm.rule_attribute and 
1242 
Thm.declaration_attribute build canonical attributes; see also 

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

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

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

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

1246 

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

22126  1249 
logic, but only for type inference.) IMPORTANT INTERNAL CHANGE, 
1250 
potential INCOMPATIBILITY. 

19508  1251 

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

1253 
explicit proofs of class axioms and super class relations performed 

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

1255 
notably AxClass.define_class supercedes AxClass.add_axclass, and 

1256 
AxClass.axiomatize_class/classrel/arity supercede 

1257 
Sign.add_classes/classrel/arities. 

1258 

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

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

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

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

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

1263 
attributes, methods, etc. 
18642  1264 

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

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

1268 
fold_map combinators. 

18051  1269 

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

1270 
* Pure: official theorem names (closed derivations) and additional 
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset

1271 
comments (tags) are now strictly separate. Name hints  which are 
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset

1272 
maintained as tags  may be attached any time without affecting the 
fccafa917a68
* Pure: official theorem names and additional comments are now strictly separate.
wenzelm
parents:
21595
diff
changeset

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

1274 

18020  1275 
* Pure: primitive rule lift_rule now takes goal cterm instead of an 
18145  1276 
actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to 
18020  1277 
achieve the old behaviour. 
1278 

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

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

1281 
statements. 

1282 

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

1283 
* Pure: Logic.(un)varify only works in a global context, which is now 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1284 
enforced instead of silently assumed. INCOMPATIBILITY, may use 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1285 
Logic.legacy_(un)varify as temporary workaround. 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1286 

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

1289 
some popular functions from term.ML: 

1290 

1291 
Term.variant > Name.variant 

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

1293 
Term.invent_names > Name.invent_list 

1294 

1295 
Note that lowlevel renaming rarely occurs in new code  operations 

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

1297 

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

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

1299 
treatment of fixed/schematic variables in a context. For example, 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1300 
Variable.import introduces fixes for schematics of given facts and 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1301 
Variable.export reverses the effect (up to renaming)  this replaces 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

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

1303 

18567  1304 
* Pure: structure Goal provides simple interfaces for 
17981
2602be0d99ae
* Legacy goal package: reduced interface to the bare minimum required to keep existing proof scripts running.
wenzelm
parents:
17918
diff
changeset

1305 
init/conclude/finish and tactical prove operations (replacing former 
20040
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1306 
Tactic.prove). Goal.prove is the canonical way to prove results 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1307 
within a given context; Goal.prove_global is a degraded version for 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1308 
theory level goals, including a global Drule.standard. Note that 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1309 
OldGoals.prove_goalw_cterm has long been obsolete, since it is 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

1310 
illbehaved in a local proof context (e.g. with local fixes/assumes or 
02c59ec2f2e1
* Pure: structure Variable provides operations for proper treatment of fixed/schematic variables;
wenzelm
parents:
20013
diff
changeset

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

1312 

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

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

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

1316 
care of proper display of ERROR exceptions. ML code may use plain 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1317 
handle/can/try; cat_error may be used to concatenate errors like this: 
cbbc71acf994
* ML/Isar: simplified treatment of userlevel errors;
wenzelm
parents:
18674
diff
changeset

1318 

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

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

1320 

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

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

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

1324 

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

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

1326 

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

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

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

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

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

1331 

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

1332 
* Isar: theory setup now has type (theory > theory), instead of a 
18722
0888eca0f1be
* ML/Isar: theory setup has type (theory > theory);
wenzelm
parents:
18696
diff
changeset

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

1334 

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

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

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

1337 

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

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

1339 
theory before entering a proof state. Transactions now always see a 
cb778c0ce1b5
Pure/Isar: (un)folded, (un)fold, unfolding support
wenzelm
parents:
18738
diff
changeset

1340 
quasifunctional intermediate checkpoint, both in interactive and 
18590
f6a553aa3d81
Pure/Isar: Toplevel.theory_to_proof admits transactions that modify the theory;
wenzelm
parents:
18568
diff
changeset

1341 
batch mode. 
18567  1342 

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

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

17890  1346 
simpset_of/local_simpset_of). Consequently, all plugin components 
17878  1347 
(solver, looper etc.) may depend on arbitrary proof data. 
1348 

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

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

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

1352 
former Simplifier.inherit_bounds, which is already included here  

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

17878  1355 

1356 
* Simplifier/Classical Reasoner: more abstract interfaces 

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

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

1359 
INCOMPATIBILITY. 

1360 

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

1363 

17878  1364 

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

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

1366 

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

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

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

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

1370 

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

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

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

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

1374 

24498
0a57b1b472b2
tuned multithreading entry  no longer experimental;
wenzelm
parents:
24492
diff
changeset

1375 
* Support for multithreading, using Poly/ML 5.1 (internal version from 
0a57b1b472b2
tuned multithreading entry  no longer experimental;
wenzelm
parents:
24492
diff
changeset

1376 
CVS). The theory loader exploits parallelism when processing independent 
0a57b1b472b2
tuned multithreading entry  no longer experimental;
wenzelm
parents:
24492
diff
changeset

1377 
theories, following the header specifications. The maximum number of 
0a57b1b472b2
tuned multithreading entry  no longer experimental;
wenzelm
parents:
24492
diff
changeset

1378 
worker threads is specified via usedir option M or the "maxthreads" 
0a57b1b472b2
tuned multithreading entry  no longer experimental;
wenzelm
parents:
24492
diff
changeset

1379 
setting in Proof General. A speedup factor of 1.53.5 can be expected 
0a57b1b472b2
tuned multithreading entry  no longer experimental;
wenzelm
parents:
24492
diff
changeset

1380 
on a 4core machine, and up to 6 on a 8core machine. Usercode needs to 
24213  1381 
observe certain guidelines for threadsafe programming, see appendix A 
1382 
in the Isar Implementation manual. 

24210
a865059c4fcb
* Experimental support for multithreading, using Poly/ML 5.1;
wenzelm
parents:
24187
diff
changeset

1383 

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

1384 

17720  1385 
New in Isabelle2005 (October 2005) 
1386 
 

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

1387 

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

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

1389 

15130  1390 
* Theory headers: the new header syntax for Isar theories is 
1391 

1392 
theory <name> 

16234  1393 
imports <theory1> ... <theoryN> 
1394 
uses <file1> ... <fileM> 

15130  1395 
begin 
1396 

16234  1397 
where the 'uses' part is optional. The previous syntax 
1398 

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

1400 

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

17371  1403 
nonIsar theories now, but these will disappear soon. 
15130  1404 

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

1405 
* Theory loader: parent theories can now also be referred to via 