author  huffman 
Sat, 21 Apr 2012 13:54:29 +0200  
changeset 47655  b9e132e54d25 
parent 47622  6d53f2ef4a97 
child 47659  e3c4d1b0b351 
permissions  rwrr 
5363  1 
Isabelle NEWS  history userrelevant changes 
2 
============================================== 

2553  3 

47462  4 
New in Isabelle2012 (May 2012) 
5 
 

45109  6 

45593  7 
*** General *** 
8 

45614  9 
* Prover IDE (PIDE) improvements: 
10 

47585  11 
 more robust Sledgehammer integration (as before the sledgehammer 
12 
command line needs to be typed into the source buffer) 

45614  13 
 markup for bound variables 
14 
 markup for types of term variables (e.g. displayed as tooltips) 

46956
9ff441f295c2
Isabelle/jEdit supports userdefined Isar commands within the running session;
wenzelm
parents:
46948
diff
changeset

15 
 support for userdefined Isar commands within the running session 
47158  16 
 improved support for Unicode outside original 16bit range 
17 
e.g. glyph for \<A> (thanks to jEdit 4.5.1) 

45614  18 

46485  19 
* Updated and extended reference manuals ("isarref" and 
20 
"implementation"); reduced remaining material in old "ref" manual. 

21 

45593  22 
* Rule attributes in local theory declarations (e.g. locale or class) 
23 
are now statically evaluated: the resulting theorem is stored instead 

24 
of the original expression. INCOMPATIBILITY in rare situations, where 

25 
the historic accident of dynamic reevaluation in interpretations 

26 
etc. was exploited. 

27 

45600
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset

28 
* Commands 'lemmas' and 'theorems' allow local variables using 'for' 
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset

29 
declaration, and results are standardized before being stored. Thus 
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset

30 
oldstyle "standard" after instantiation or composition of facts 
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset

31 
becomes obsolete. Minor INCOMPATIBILITY, due to potential change of 
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset

32 
indices of schematic variables. 
1bbbac9a0cb0
'lemmas' / 'theorems' commands allow 'for' fixes and standardize the result before storing;
wenzelm
parents:
45593
diff
changeset

33 

46483  34 
* Renamed some inner syntax categories: 
35 

36 
num ~> num_token 

37 
xnum ~> xnum_token 

38 
xstr ~> str_token 

39 

40 
Minor INCOMPATIBILITY. Note that in practice "num_const" or 

41 
"num_position" etc. are mainly used instead (which also include 

42 
position information via constraints). 

45703
c7a13ce60161
renamed inner syntax categories "num" to "num_token" and "xnum" to "xnum_token";
wenzelm
parents:
45625
diff
changeset

43 

46506
c7faa011bfa7
simplified configuration options for syntax ambiguity;
wenzelm
parents:
46497
diff
changeset

44 
* Simplified configuration options for syntax ambiguity: see 
46512
4f9f61f9b535
simplified configuration options for syntax ambiguity;
wenzelm
parents:
46506
diff
changeset

45 
"syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isarref 
4f9f61f9b535
simplified configuration options for syntax ambiguity;
wenzelm
parents:
46506
diff
changeset

46 
manual. Minor INCOMPATIBILITY. 
46506
c7faa011bfa7
simplified configuration options for syntax ambiguity;
wenzelm
parents:
46497
diff
changeset

47 

46959
cdc791910460
defer actual parsing of command spans and thus allow new commands to be used in the same theory where defined;
wenzelm
parents:
46956
diff
changeset

48 
* Forward declaration of outer syntax keywords within the theory 
cdc791910460
defer actual parsing of command spans and thus allow new commands to be used in the same theory where defined;
wenzelm
parents:
46956
diff
changeset

49 
header  minor INCOMPATIBILITY for userdefined commands. Allow new 
cdc791910460
defer actual parsing of command spans and thus allow new commands to be used in the same theory where defined;
wenzelm
parents:
46956
diff
changeset

50 
commands to be used in the same theory where defined. 
cdc791910460
defer actual parsing of command spans and thus allow new commands to be used in the same theory where defined;
wenzelm
parents:
46956
diff
changeset

51 

45593  52 

45134  53 
*** Pure *** 
54 

47482
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

55 
* Auxiliary contexts indicate block structure for specifications with 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

56 
additional parameters and assumptions. Such unnamed contexts may be 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

57 
nested within other targets, like 'theory', 'locale', 'class', 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

58 
'instantiation' etc. Results from the local context are generalized 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

59 
accordingly and applied to the enclosing target context. Example: 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

60 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

61 
context 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

62 
fixes x y z :: 'a 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

63 
assumes xy: "x = y" and yz: "y = z" 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

64 
begin 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

65 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

66 
lemma my_trans: "x = z" using xy yz by simp 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

67 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

68 
end 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

69 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

70 
thm my_trans 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

71 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

72 
The most basic application is to factorout context elements of 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

73 
several fixes/assumes/shows theorem statements, e.g. see 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

74 
~~/src/HOL/Isar_Examples/Group_Context.thy 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

75 

a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

76 
Any other local theory specification element works within the "context 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

77 
... begin ... end" block as well. 
a83b25e5bad3
some coverage of unnamed contexts, which can be nested within other targets;
wenzelm
parents:
47464
diff
changeset

78 

47484  79 
* Bundled declarations associate attributed fact expressions with a 
80 
given name in the context. These may be later included in other 

81 
contexts. This allows to manage context extensions casually, without 

82 
the logical dependencies of locales and locale interpretation. 

83 

84 
See commands 'bundle', 'include', 'including' etc. in the isarref 

85 
manual. 

86 

47427
0daa97ed1585
rule composition via attribute "OF" (or ML functions OF/MRS) is more tolerant against multiple unifiers;
wenzelm
parents:
47413
diff
changeset

87 
* Rule composition via attribute "OF" (or ML functions OF/MRS) is more 
0daa97ed1585
rule composition via attribute "OF" (or ML functions OF/MRS) is more tolerant against multiple unifiers;
wenzelm
parents:
47413
diff
changeset

88 
tolerant against multiple unifiers, as long as the final result is 
0daa97ed1585
rule composition via attribute "OF" (or ML functions OF/MRS) is more tolerant against multiple unifiers;
wenzelm
parents:
47413
diff
changeset

89 
unique. (As before, rules are composed in canonical righttoleft 
0daa97ed1585
rule composition via attribute "OF" (or ML functions OF/MRS) is more tolerant against multiple unifiers;
wenzelm
parents:
47413
diff
changeset

90 
order to accommodate newly introduced premises.) 
0daa97ed1585
rule composition via attribute "OF" (or ML functions OF/MRS) is more tolerant against multiple unifiers;
wenzelm
parents:
47413
diff
changeset

91 

46976
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset

92 
* Command 'definition' no longer exports the foundational "raw_def" 
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset

93 
into the user context. Minor INCOMPATIBILITY, may use the regular 
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset

94 
"def" result with attribute "abs_def" to imitate the old version. 
80123a220219
'definition' no longer exports the foundational "raw_def";
wenzelm
parents:
46966
diff
changeset

95 

46903
3d44892ac0d6
improved attribute "abs_def" to handle objectequality as well;
wenzelm
parents:
46888
diff
changeset

96 
* Attribute "abs_def" turns an equation of the form "f x y == t" into 
3d44892ac0d6
improved attribute "abs_def" to handle objectequality as well;
wenzelm
parents:
46888
diff
changeset

97 
"f == %x y. t", which ensures that "simp" or "unfold" steps always 
3d44892ac0d6
improved attribute "abs_def" to handle objectequality as well;
wenzelm
parents:
46888
diff
changeset

98 
expand it. This also works for objectlogic equality. (Formerly 
3d44892ac0d6
improved attribute "abs_def" to handle objectequality as well;
wenzelm
parents:
46888
diff
changeset

99 
undocumented feature.) 
3d44892ac0d6
improved attribute "abs_def" to handle objectequality as well;
wenzelm
parents:
46888
diff
changeset

100 

46493  101 
* Discontinued old "prems" fact, which used to refer to the accidental 
47464  102 
collection of foundational premises in the context (already marked as 
103 
legacy since Isabelle2011). 

46493  104 

45134  105 
* Obsolete command 'types' has been discontinued. Use 'type_synonym' 
106 
instead. INCOMPATIBILITY. 

107 

47464  108 
* Old code generator for SML and its commands 'code_module', 
45383  109 
'code_library', 'consts_code', 'types_code' have been discontinued. 
46028
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset

110 
Use commands of the generic code generator instead. INCOMPATIBILITY. 
45383  111 

47464  112 
* Redundant attribute "code_inline" has been discontinued. Use 
113 
"code_unfold" instead. INCOMPATIBILITY. 

114 

115 
* Dropped attribute "code_unfold_post" in favor of the its dual 

116 
"code_abbrev", which yields a common pattern in definitions like 

46028
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset

117 

9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset

118 
definition [code_abbrev]: "f = t" 
9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset

119 

9f113cdf3d66
attribute code_abbrev superseedes code_unfold_post
haftmann
parents:
46014
diff
changeset

120 
INCOMPATIBILITY. 
45383  121 

45427
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

122 
* Sort constraints are now propagated in simultaneous statements, just 
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

123 
like type constraints. INCOMPATIBILITY in rare situations, where 
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

124 
distinct sorts used to be assigned accidentally. For example: 
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

125 

fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

126 
lemma "P (x::'a::foo)" and "Q (y::'a::bar)"  "now illegal" 
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

127 

fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

128 
lemma "P (x::'a)" and "Q (y::'a::bar)" 
47462  129 
 "now uniform 'a::bar instead of default sort for first occurrence (!)" 
45427
fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

130 

fca432074fb2
sort assignment before simultaneous term_check, not isolated parse_term;
wenzelm
parents:
45398
diff
changeset

131 

45122  132 
*** HOL *** 
133 

47495  134 
* New tutorial "Programming and Proving in Isabelle/HOL" ("progprove"). 
47494  135 
It completely supercedes "A Tutorial Introduction to Structured Isar Proofs", 
136 
which has been removed. It supercedes "Isabelle/HOL, A Proof Assistant 

137 
for HigherOrder Logic" as the recommended beginners tutorial 

138 
but does not cover all of the material of that old tutorial. 

47464  139 

140 
* Discontinued old Tutorial on Isar ("isaroverview"); 

141 

142 
* Type 'a set is now a proper type constructor (just as before 

143 
Isabelle2008). Definitions mem_def and Collect_def have disappeared. 

144 
Nontrivial INCOMPATIBILITY. For developments keeping predicates and 

145 
sets separate, it is often sufficient to rephrase sets S accidentally 

146 
used as predicates by "%x. x : S" and predicates P accidentally used 

147 
as sets by "{x. P x}". Corresponding proofs in a first step should be 

148 
pruned from any tinkering with former theorems mem_def and Collect_def 

149 
as far as possible. 

150 

151 
For developments which deliberately mixed predicates and sets, a 

152 
planning step is necessary to determine what should become a predicate 

153 
and what a set. It can be helpful to carry out that step in 

154 
Isabelle20111 before jumping right into the current release. 

155 

156 
* The representation of numerals has changed. Datatype "num" 

157 
represents strictly positive binary numerals, along with functions 

158 
"numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent 

159 
positive and negated numeric literals, respectively. (See definitions 

160 
in ~~/src/HOL/Num.thy.) Potential INCOMPATIBILITY, some user theories 

161 
may require adaptations as follows: 

47108
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

162 

2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

163 
 Theorems with number_ring or number_semiring constraints: These 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

164 
classes are gone; use comm_ring_1 or comm_semiring_1 instead. 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

165 

2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

166 
 Theories defining numeric types: Remove number, number_semiring, 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

167 
and number_ring instances. Defer all theorems about numerals until 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

168 
after classes one and semigroup_add have been instantiated. 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

169 

2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

170 
 Numeralonly simp rules: Replace each rule having a "number_of v" 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

171 
pattern with two copies, one for numeral and one for neg_numeral. 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

172 

2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

173 
 Theorems about subclasses of semiring_1 or ring_1: These classes 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

174 
automatically support numerals now, so more simp rules and 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

175 
simprocs may now apply within the proof. 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

176 

2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

177 
 Definitions and theorems using old constructors Pls/Min/Bit0/Bit1: 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

178 
Redefine using other integer operations. 
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
47086
diff
changeset

179 

46834
a5fa1dc55945
less rigorous but more realistic migration recommendation; note on code generation of sets
haftmann
parents:
46752
diff
changeset

180 
* Code generation by default implements sets as container type rather 
a5fa1dc55945
less rigorous but more realistic migration recommendation; note on code generation of sets
haftmann
parents:
46752
diff
changeset

181 
than predicates. INCOMPATIBILITY. 
a5fa1dc55945
less rigorous but more realistic migration recommendation; note on code generation of sets
haftmann
parents:
46752
diff
changeset

182 

47265  183 
* New proof import from HOL Light: Faster, simpler, and more scalable. 
184 
Requires a proof bundle, which is available as an external component. 

47464  185 
Discontinued old (and mostly dead) Importer for HOL4 and HOL Light. 
47265  186 
INCOMPATIBILITY. 
47264
6488c5efec49
renamed import session back to Import, conforming to directory name; NEWS
krauss
parents:
47217
diff
changeset

187 

46373  188 
* New type synonym 'a rel = ('a * 'a) set 
189 

46752
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

190 
* More default pred/set conversions on a couple of relation operations 
47464  191 
and predicates. Added powers of predicate relations. Consolidation 
192 
of some relation theorems: 

46752
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

193 

e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

194 
converse_def ~> converse_unfold 
47549  195 
rel_comp_def ~> relcomp_unfold 
46752
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

196 
symp_def ~> (dropped, use symp_def and sym_def instead) 
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

197 
transp_def ~> transp_trans 
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

198 
Domain_def ~> Domain_unfold 
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

199 
Range_def ~> Domain_converse [symmetric] 
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

200 

46981  201 
Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2. 
202 

47464  203 
See theory "Relation" for examples for making use of pred/set 
204 
conversions by means of attributes "to_set" and "to_pred". 

47086  205 

46752
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

206 
INCOMPATIBILITY. 
e9e7209eb375
more fundamental predtoset conversions, particularly by means of inductive_set; associated consolidation of some theorem names (c.f. NEWS)
haftmann
parents:
46732
diff
changeset

207 

46363  208 
* Renamed facts about the power operation on relations, i.e., relpow 
47464  209 
to match the constant's name: 
47463  210 

46458  211 
rel_pow_1 ~> relpow_1 
46363  212 
rel_pow_0_I ~> relpow_0_I 
213 
rel_pow_Suc_I ~> relpow_Suc_I 

214 
rel_pow_Suc_I2 ~> relpow_Suc_I2 

215 
rel_pow_0_E ~> relpow_0_E 

216 
rel_pow_Suc_E ~> relpow_Suc_E 

217 
rel_pow_E ~> relpow_E 

46458  218 
rel_pow_Suc_D2 ~> relpow_Suc_D2 
47463  219 
rel_pow_Suc_E2 ~> relpow_Suc_E2 
46363  220 
rel_pow_Suc_D2' ~> relpow_Suc_D2' 
221 
rel_pow_E2 ~> relpow_E2 

222 
rel_pow_add ~> relpow_add 

223 
rel_pow_commute ~> relpow 

224 
rel_pow_empty ~> relpow_empty: 

225 
rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow 

226 
rel_pow_imp_rtrancl ~> relpow_imp_rtrancl 

227 
rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow 

228 
rtrancl_imp_rel_pow ~> rtrancl_imp_relpow 

229 
rel_pow_fun_conv ~> relpow_fun_conv 

230 
rel_pow_finite_bounded1 ~> relpow_finite_bounded1 

231 
rel_pow_finite_bounded ~> relpow_finite_bounded 

232 
rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow 

233 
trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow 

234 
single_valued_rel_pow ~> single_valued_relpow 

47463  235 

46363  236 
INCOMPATIBILITY. 
237 

47448  238 
* Theory Relation: Consolidated constant name for relation composition 
47464  239 
and corresponding theorem names: 
240 

47549  241 
 Renamed constant rel_comp to relcomp. 
47464  242 

47448  243 
 Dropped abbreviation pred_comp. Use relcompp instead. 
47464  244 

47448  245 
 Renamed theorems: 
47464  246 

47448  247 
rel_compI ~> relcompI 
248 
rel_compEpair ~> relcompEpair 

249 
rel_compE ~> relcompE 

250 
pred_comp_rel_comp_eq ~> relcompp_relcomp_eq 

251 
rel_comp_empty1 ~> relcomp_empty1 

252 
rel_comp_mono ~> relcomp_mono 

253 
rel_comp_subset_Sigma ~> relcomp_subset_Sigma 

254 
rel_comp_distrib ~> relcomp_distrib 

255 
rel_comp_distrib2 ~> relcomp_distrib2 

256 
rel_comp_UNION_distrib ~> relcomp_UNION_distrib 

257 
rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2 

258 
single_valued_rel_comp ~> single_valued_relcomp 

47549  259 
rel_comp_def ~> relcomp_unfold 
47448  260 
converse_rel_comp ~> converse_relcomp 
261 
pred_compI ~> relcomppI 

262 
pred_compE ~> relcomppE 

263 
pred_comp_bot1 ~> relcompp_bot1 

264 
pred_comp_bot2 ~> relcompp_bot2 

265 
transp_pred_comp_less_eq ~> transp_relcompp_less_eq 

266 
pred_comp_mono ~> relcompp_mono 

267 
pred_comp_distrib ~> relcompp_distrib 

268 
pred_comp_distrib2 ~> relcompp_distrib2 

269 
converse_pred_comp ~> converse_relcompp 

47464  270 

47448  271 
finite_rel_comp ~> finite_relcomp 
47464  272 

47448  273 
set_rel_comp ~> set_relcomp 
274 

275 
INCOMPATIBILITY. 

276 

47550  277 
* Theory Divides: Discontinued redundant theorems about div and mod. 
278 
INCOMPATIBILITY, use the corresponding generic theorems instead. 

279 

280 
DIVISION_BY_ZERO ~> div_by_0, mod_by_0 

281 
zdiv_self ~> div_self 

282 
zmod_self ~> mod_self 

283 
zdiv_zero ~> div_0 

284 
zmod_zero ~> mod_0 

285 
zdiv_zmod_equality ~> div_mod_equality2 

286 
zdiv_zmod_equality2 ~> div_mod_equality 

287 
zmod_zdiv_trivial ~> mod_div_trivial 

288 
zdiv_zminus_zminus ~> div_minus_minus 

289 
zmod_zminus_zminus ~> mod_minus_minus 

290 
zdiv_zminus2 ~> div_minus_right 

291 
zmod_zminus2 ~> mod_minus_right 

292 
zdiv_minus1_right ~> div_minus1_right 

293 
zmod_minus1_right ~> mod_minus1_right 

294 
zdvd_mult_div_cancel ~> dvd_mult_div_cancel 

295 
zmod_zmult1_eq ~> mod_mult_right_eq 

296 
zpower_zmod ~> power_mod 

297 
zdvd_zmod ~> dvd_mod 

298 
zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd 

299 
mod_mult_distrib ~> mult_mod_left 

300 
mod_mult_distrib2 ~> mult_mod_right 

301 

302 
* Removed redundant theorems nat_mult_2 and nat_mult_2_right; use 

303 
generic mult_2 and mult_2_right instead. INCOMPATIBILITY. 

304 

47551  305 
* Finite_Set.fold now qualified. INCOMPATIBILITY. 
306 

47552  307 
* Consolidated theorem names concerning fold combinators: 
47550  308 

309 
inf_INFI_fold_inf ~> inf_INF_fold_inf 

310 
sup_SUPR_fold_sup ~> sup_SUP_fold_sup 

311 
INFI_fold_inf ~> INF_fold_inf 

312 
SUPR_fold_sup ~> SUP_fold_sup 

313 
union_set ~> union_set_fold 

314 
minus_set ~> minus_set_fold 

315 
INFI_set_fold ~> INF_set_fold 

316 
SUPR_set_fold ~> SUP_set_fold 

317 
INF_code ~> INF_set_foldr 

318 
SUP_code ~> SUP_set_foldr 

319 
foldr.simps ~> foldr.simps (in pointfree formulation) 

320 
foldr_fold_rev ~> foldr_conv_fold 

321 
foldl_fold ~> foldl_conv_fold 

322 
foldr_foldr ~> foldr_conv_foldl 

323 
foldl_foldr ~> foldl_conv_foldr 

47552  324 
fold_set_remdups ~> fold_set_fold_remdups 
325 
fold_set ~> fold_set_fold 

326 
fold1_set ~> fold1_set_fold 

47550  327 

328 
INCOMPATIBILITY. 

329 

330 
* Dropped rarely useful theorems concerning fold combinators: 

331 
foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant, 

332 
rev_foldl_cons, fold_set_remdups, fold_set, fold_set1, 

333 
concat_conv_foldl, foldl_weak_invariant, foldl_invariant, 

334 
foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1, 

335 
listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc, 

336 
foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv. 

337 
INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0" 

338 
and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be 

339 
useful to boil down "List.foldr" and "List.foldl" to "List.fold" by 

340 
unfolding "foldr_conv_fold" and "foldl_conv_fold". 

341 

342 
* Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr, 

343 
inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr, 

344 
Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr, 

345 
INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding 

346 
lemmas over fold rather than foldr, or make use of lemmas 

347 
fold_conv_foldr and fold_rev. 

348 

349 
* Congruence rules Option.map_cong and Option.bind_cong for recursion 

350 
through option types. 

351 

352 
* Concrete syntax for case expressions includes constraints for source 

353 
positions, and thus produces Prover IDE markup for its bindings. 

354 
INCOMPATIBILITY for oldstyle syntax translations that augment the 

355 
pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of 

356 
one_case. 

357 

358 
* Discontinued configuration option "syntax_positions": atomic terms 

359 
in parse trees are always annotated by position constraints. 

360 

47464  361 
* New theory HOL/Library/DAList provides an abstract type for 
362 
association lists with distinct keys. 

45874  363 

45839
43a5b86bc102
'datatype' specifications allow explicit sort constraints;
wenzelm
parents:
45810
diff
changeset

364 
* 'datatype' specifications allow explicit sort constraints. 
43a5b86bc102
'datatype' specifications allow explicit sort constraints;
wenzelm
parents:
45810
diff
changeset

365 

46160  366 
* Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY, 
367 
use theory HOL/Library/Nat_Bijection instead. 

368 

47464  369 
* Theory HOL/Library/RBT_Impl: Backing implementation of redblack 
370 
trees is now inside a type class context. Names of affected 

371 
operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for 

372 
theories working directly with raw redblack trees, adapt the names as 

373 
follows: 

47452  374 

375 
Operations: 

376 
bulkload > rbt_bulkload 

377 
del_from_left > rbt_del_from_left 

378 
del_from_right > rbt_del_from_right 

379 
del > rbt_del 

380 
delete > rbt_delete 

381 
ins > rbt_ins 

382 
insert > rbt_insert 

383 
insertw > rbt_insert_with 

384 
insert_with_key > rbt_insert_with_key 

385 
map_entry > rbt_map_entry 

386 
lookup > rbt_lookup 

387 
sorted > rbt_sorted 

388 
tree_greater > rbt_greater 

389 
tree_less > rbt_less 

390 
tree_less_symbol > rbt_less_symbol 

391 
union > rbt_union 

392 
union_with > rbt_union_with 

393 
union_with_key > rbt_union_with_key 

394 

395 
Lemmas: 

396 
balance_left_sorted > balance_left_rbt_sorted 

397 
balance_left_tree_greater > balance_left_rbt_greater 

398 
balance_left_tree_less > balance_left_rbt_less 

399 
balance_right_sorted > balance_right_rbt_sorted 

400 
balance_right_tree_greater > balance_right_rbt_greater 

401 
balance_right_tree_less > balance_right_rbt_less 

402 
balance_sorted > balance_rbt_sorted 

403 
balance_tree_greater > balance_rbt_greater 

404 
balance_tree_less > balance_rbt_less 

405 
bulkload_is_rbt > rbt_bulkload_is_rbt 

406 
combine_sorted > combine_rbt_sorted 

407 
combine_tree_greater > combine_rbt_greater 

408 
combine_tree_less > combine_rbt_less 

409 
delete_in_tree > rbt_delete_in_tree 

410 
delete_is_rbt > rbt_delete_is_rbt 

411 
del_from_left_tree_greater > rbt_del_from_left_rbt_greater 

412 
del_from_left_tree_less > rbt_del_from_left_rbt_less 

413 
del_from_right_tree_greater > rbt_del_from_right_rbt_greater 

414 
del_from_right_tree_less > rbt_del_from_right_rbt_less 

415 
del_in_tree > rbt_del_in_tree 

416 
del_inv1_inv2 > rbt_del_inv1_inv2 

417 
del_sorted > rbt_del_rbt_sorted 

418 
del_tree_greater > rbt_del_rbt_greater 

419 
del_tree_less > rbt_del_rbt_less 

420 
dom_lookup_Branch > dom_rbt_lookup_Branch 

421 
entries_lookup > entries_rbt_lookup 

422 
finite_dom_lookup > finite_dom_rbt_lookup 

423 
insert_sorted > rbt_insert_rbt_sorted 

424 
insertw_is_rbt > rbt_insertw_is_rbt 

425 
insertwk_is_rbt > rbt_insertwk_is_rbt 

426 
insertwk_sorted > rbt_insertwk_rbt_sorted 

427 
insertw_sorted > rbt_insertw_rbt_sorted 

428 
ins_sorted > ins_rbt_sorted 

429 
ins_tree_greater > ins_rbt_greater 

430 
ins_tree_less > ins_rbt_less 

431 
is_rbt_sorted > is_rbt_rbt_sorted 

432 
lookup_balance > rbt_lookup_balance 

433 
lookup_bulkload > rbt_lookup_rbt_bulkload 

434 
lookup_delete > rbt_lookup_rbt_delete 

435 
lookup_Empty > rbt_lookup_Empty 

436 
lookup_from_in_tree > rbt_lookup_from_in_tree 

437 
lookup_in_tree > rbt_lookup_in_tree 

438 
lookup_ins > rbt_lookup_ins 

439 
lookup_insert > rbt_lookup_rbt_insert 

440 
lookup_insertw > rbt_lookup_rbt_insertw 

441 
lookup_insertwk > rbt_lookup_rbt_insertwk 

442 
lookup_keys > rbt_lookup_keys 

443 
lookup_map > rbt_lookup_map 

444 
lookup_map_entry > rbt_lookup_rbt_map_entry 

445 
lookup_tree_greater > rbt_lookup_rbt_greater 

446 
lookup_tree_less > rbt_lookup_rbt_less 

447 
lookup_union > rbt_lookup_rbt_union 

448 
map_entry_color_of > rbt_map_entry_color_of 

449 
map_entry_inv1 > rbt_map_entry_inv1 

450 
map_entry_inv2 > rbt_map_entry_inv2 

451 
map_entry_is_rbt > rbt_map_entry_is_rbt 

452 
map_entry_sorted > rbt_map_entry_rbt_sorted 

453 
map_entry_tree_greater > rbt_map_entry_rbt_greater 

454 
map_entry_tree_less > rbt_map_entry_rbt_less 

455 
map_tree_greater > map_rbt_greater 

456 
map_tree_less > map_rbt_less 

457 
map_sorted > map_rbt_sorted 

458 
paint_sorted > paint_rbt_sorted 

459 
paint_lookup > paint_rbt_lookup 

460 
paint_tree_greater > paint_rbt_greater 

461 
paint_tree_less > paint_rbt_less 

462 
sorted_entries > rbt_sorted_entries 

463 
tree_greater_eq_trans > rbt_greater_eq_trans 

464 
tree_greater_nit > rbt_greater_nit 

465 
tree_greater_prop > rbt_greater_prop 

466 
tree_greater_simps > rbt_greater_simps 

467 
tree_greater_trans > rbt_greater_trans 

468 
tree_less_eq_trans > rbt_less_eq_trans 

469 
tree_less_nit > rbt_less_nit 

470 
tree_less_prop > rbt_less_prop 

471 
tree_less_simps > rbt_less_simps 

472 
tree_less_trans > rbt_less_trans 

473 
tree_ord_props > rbt_ord_props 

474 
union_Branch > rbt_union_Branch 

475 
union_is_rbt > rbt_union_is_rbt 

476 
unionw_is_rbt > rbt_unionw_is_rbt 

477 
unionwk_is_rbt > rbt_unionwk_is_rbt 

478 
unionwk_sorted > rbt_unionwk_rbt_sorted 

479 

47616  480 
* Theory HOL/Library/Float: Floating point numbers are now defined as a 
481 
subset of the real numbers. All operations are defined using the 

47622  482 
lifingframework and proofs use the transfer method. 
47616  483 
INCOMPATIBILITY. 
484 

485 
Changed Operations: 

47622  486 
float_abs > abs 
487 
float_nprt > nprt 

488 
float_pprt > pprt 

489 
pow2 > use powr 

490 
round_down > float_round_down 

491 
round_up > float_round_up 

492 
scale > exponent 

493 

494 
Removed Operations: 

495 
ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod 

496 

497 
Renamed Lemmas: 

498 
abs_float_def > Float.compute_float_abs 

499 
bitlen_ge0 > bitlen_nonneg 

500 
bitlen.simps > Float.compute_bitlen 

501 
float_components > Float_mantissa_exponent 

502 
float_divl.simps > Float.compute_float_divl 

503 
float_divr.simps > Float.compute_float_divr 

504 
float_eq_odd > mult_powr_eq_mult_powr_iff 

505 
float_power > real_of_float_power 

506 
lapprox_posrat_def > Float.compute_lapprox_posrat 

507 
lapprox_rat.simps > Float.compute_lapprox_rat 

508 
le_float_def' > Float.compute_float_le 

509 
le_float_def > less_eq_float.rep_eq 

510 
less_float_def' > Float.compute_float_less 

511 
less_float_def > less_float.rep_eq 

512 
normfloat_def > Float.compute_normfloat 

513 
normfloat_imp_odd_or_zero > mantissa_not_dvd and mantissa_noteq_0 

514 
normfloat > normfloat_def 

515 
normfloat_unique > use normfloat_def 

516 
number_of_float_Float > Float.compute_float_numeral, Float.compute_float_neg_numeral 

517 
one_float_def > Float.compute_float_one 

518 
plus_float_def > Float.compute_float_plus 

519 
rapprox_posrat_def > Float.compute_rapprox_posrat 

520 
rapprox_rat.simps > Float.compute_rapprox_rat 

521 
real_of_float_0 > zero_float.rep_eq 

522 
real_of_float_1 > one_float.rep_eq 

523 
real_of_float_abs > abs_float.rep_eq 

524 
real_of_float_add > plus_float.rep_eq 

525 
real_of_float_minus > uminus_float.rep_eq 

526 
real_of_float_mult > times_float.rep_eq 

527 
real_of_float_simp > Float.rep_eq 

528 
real_of_float_sub > minus_float.rep_eq 

529 
round_down.simps > Float.compute_float_round_down 

530 
round_up.simps > Float.compute_float_round_up 

531 
times_float_def > Float.compute_float_times 

532 
uminus_float_def > Float.compute_float_uminus 

533 
zero_float_def > Float.compute_float_zero 

534 

535 
Lemmas not necessary anymore, use the transfer method: 

536 
bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl, 

537 
float_divr, float_le_simp, float_less1_mantissa_bound, 

538 
float_less_simp, float_less_zero, float_le_zero, 

539 
float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2, 

540 
floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat, 

541 
lapprox_rat_bottom, normalized_float, rapprox_posrat, 

542 
rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp, 

543 
real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl, 

544 
round_up, zero_le_float, zero_less_float 

47616  545 

46160  546 
* Session HOLWord: Discontinued many redundant theorems specific to 
547 
type 'a word. INCOMPATIBILITY, use the corresponding generic theorems 

548 
instead. 

45546
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

549 

6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

550 
word_sub_alt ~> word_sub_wi 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

551 
word_add_alt ~> word_add_def 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

552 
word_mult_alt ~> word_mult_def 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

553 
word_minus_alt ~> word_minus_def 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

554 
word_0_alt ~> word_0_wi 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

555 
word_1_alt ~> word_1_wi 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

556 
word_add_0 ~> add_0_left 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

557 
word_add_0_right ~> add_0_right 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

558 
word_mult_1 ~> mult_1_left 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

559 
word_mult_1_right ~> mult_1_right 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

560 
word_add_commute ~> add_commute 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

561 
word_add_assoc ~> add_assoc 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

562 
word_add_left_commute ~> add_left_commute 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

563 
word_mult_commute ~> mult_commute 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

564 
word_mult_assoc ~> mult_assoc 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

565 
word_mult_left_commute ~> mult_left_commute 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

566 
word_left_distrib ~> left_distrib 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

567 
word_right_distrib ~> right_distrib 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

568 
word_left_minus ~> left_minus 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

569 
word_diff_0_right ~> diff_0_right 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

570 
word_diff_self ~> diff_self 
45957  571 
word_sub_def ~> diff_minus 
45804  572 
word_diff_minus ~> diff_minus 
45546
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

573 
word_add_ac ~> add_ac 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

574 
word_mult_ac ~> mult_ac 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

575 
word_plus_ac0 ~> add_0_left add_0_right add_ac 
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

576 
word_times_ac1 ~> mult_1_left mult_1_right mult_ac 
45547  577 
word_order_trans ~> order_trans 
578 
word_order_refl ~> order_refl 

579 
word_order_antisym ~> order_antisym 

580 
word_order_linear ~> linorder_linear 

45810  581 
lenw1_zero_neq_one ~> zero_neq_one 
582 
word_number_of_eq ~> number_of_eq 

46013  583 
word_of_int_add_hom ~> wi_hom_add 
584 
word_of_int_sub_hom ~> wi_hom_sub 

585 
word_of_int_mult_hom ~> wi_hom_mult 

586 
word_of_int_minus_hom ~> wi_hom_neg 

587 
word_of_int_succ_hom ~> wi_hom_succ 

588 
word_of_int_pred_hom ~> wi_hom_pred 

589 
word_of_int_0_hom ~> word_0_wi 

590 
word_of_int_1_hom ~> word_1_wi 

45546
6dd3e88de4c2
HOLWord: removed many duplicate theorems (see NEWS)
huffman
parents:
45516
diff
changeset

591 

47567
407cabf66f21
New tactic "word_bitwise" expands word equalities/inequalities into logic.
Thomas Sewell <thomas.sewell@nicta.com.au>
parents:
47563
diff
changeset

592 
* New tactic "word_bitwise" for splitting machine word equalities and 
407cabf66f21
New tactic "word_bitwise" expands word equalities/inequalities into logic.
Thomas Sewell <thomas.sewell@nicta.com.au>
parents:
47563
diff
changeset

593 
inequalities into logical circuits. Requires theory "WordBitwise" from HOLWord 
407cabf66f21
New tactic "word_bitwise" expands word equalities/inequalities into logic.
Thomas Sewell <thomas.sewell@nicta.com.au>
parents:
47563
diff
changeset

594 
session. Supports addition, subtraction, multiplication, shifting by 
407cabf66f21
New tactic "word_bitwise" expands word equalities/inequalities into logic.
Thomas Sewell <thomas.sewell@nicta.com.au>
parents:
47563
diff
changeset

595 
constants, bitwise operators and numeric constants. Requires fixedlength word 
407cabf66f21
New tactic "word_bitwise" expands word equalities/inequalities into logic.
Thomas Sewell <thomas.sewell@nicta.com.au>
parents:
47563
diff
changeset

596 
types, cannot operate on 'a word. Solves many standard word identies outright 
407cabf66f21
New tactic "word_bitwise" expands word equalities/inequalities into logic.
Thomas Sewell <thomas.sewell@nicta.com.au>
parents:
47563
diff
changeset

597 
and converts more into first order problems amenable to blast or similar. See 
407cabf66f21
New tactic "word_bitwise" expands word equalities/inequalities into logic.
Thomas Sewell <thomas.sewell@nicta.com.au>
parents:
47563
diff
changeset

598 
HOL/Word/WordBitwise.thy and examples in HOL/Word/Examples/WordExamples.thy. 
407cabf66f21
New tactic "word_bitwise" expands word equalities/inequalities into logic.
Thomas Sewell <thomas.sewell@nicta.com.au>
parents:
47563
diff
changeset

599 

46014  600 
* Clarified attribute "mono_set": pure declaration without modifying 
45384
dffa657f0aa2
clarified attribute "mono_set": pure declaration, proper export in ML;
wenzelm
parents:
45383
diff
changeset

601 
the result of the fact expression. 
dffa657f0aa2
clarified attribute "mono_set": pure declaration, proper export in ML;
wenzelm
parents:
45383
diff
changeset

602 

45383  603 
* "Transitive_Closure.ntrancl": bounded transitive closure on 
604 
relations. 

605 

46014  606 
* Constant "Set.not_member" now qualified. INCOMPATIBILITY. 
45383  607 

45122  608 
* Theory Int: Discontinued many legacy theorems specific to type int. 
45383  609 
INCOMPATIBILITY, use the corresponding generic theorems instead. 
45122  610 

611 
zminus_zminus ~> minus_minus 

612 
zminus_0 ~> minus_zero 

613 
zminus_zadd_distrib ~> minus_add_distrib 

614 
zadd_commute ~> add_commute 

615 
zadd_assoc ~> add_assoc 

616 
zadd_left_commute ~> add_left_commute 

45196
78478d938cb8
inlined @{thms} (ML compiletime) allows to get rid of legacy zadd_ac as well (cf. 49e305100097);
wenzelm
parents:
45191
diff
changeset

617 
zadd_ac ~> add_ac 
45122  618 
zmult_ac ~> mult_ac 
619 
zadd_0 ~> add_0_left 

620 
zadd_0_right ~> add_0_right 

621 
zadd_zminus_inverse2 ~> left_minus 

622 
zmult_zminus ~> mult_minus_left 

623 
zmult_commute ~> mult_commute 

624 
zmult_assoc ~> mult_assoc 

625 
zadd_zmult_distrib ~> left_distrib 

626 
zadd_zmult_distrib2 ~> right_distrib 

627 
zdiff_zmult_distrib ~> left_diff_distrib 

628 
zdiff_zmult_distrib2 ~> right_diff_distrib 

629 
zmult_1 ~> mult_1_left 

630 
zmult_1_right ~> mult_1_right 

631 
zle_refl ~> order_refl 

632 
zle_trans ~> order_trans 

633 
zle_antisym ~> order_antisym 

634 
zle_linear ~> linorder_linear 

635 
zless_linear ~> linorder_less_linear 

636 
zadd_left_mono ~> add_left_mono 

637 
zadd_strict_right_mono ~> add_strict_right_mono 

638 
zadd_zless_mono ~> add_less_le_mono 

639 
int_0_less_1 ~> zero_less_one 

640 
int_0_neq_1 ~> zero_neq_one 

641 
zless_le ~> less_le 

642 
zpower_zadd_distrib ~> power_add 

643 
zero_less_zpower_abs_iff ~> zero_less_power_abs_iff 

644 
zero_le_zpower_abs ~> zero_le_power_abs 

645 

45791  646 
* Theory Deriv: Renamed 
647 

648 
DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing 

649 

45383  650 
* New "case_product" attribute to generate a case rule doing multiple 
651 
case distinctions at the same time. E.g. 

652 

653 
list.exhaust [case_product nat.exhaust] 

654 

655 
produces a rule which can be used to perform case distinction on both 

656 
a list and a nat. 

657 

47464  658 
* Theory Library/Multiset: Improved code generation of multisets. 
659 

47655  660 
* New Transfer package: 
661 

662 
 transfer_rule attribute: Maintains a collection of transfer rules, 

663 
which relate constants at two different types. Transfer rules may 

664 
relate different type instances of the same polymorphic constant, 

665 
or they may relate an operation on a raw type to a corresponding 

666 
operation on an abstract type (quotient or subtype). For example: 

667 

668 
((A ===> B) ===> list_all2 A ===> list_all2 B) map map 

669 
(cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int 

670 

671 
 transfer method: Replaces a subgoal on abstract types with an 

672 
equivalent subgoal on the corresponding raw types. Constants are 

673 
replaced with corresponding ones according to the transfer rules. 

674 
Goals are generalized over all free variables by default; this is 

675 
necessary for variables whose types changes, but can be overridden 

676 
for specific variables with e.g. 'transfer fixing: x y z'. 

677 

678 
 relator_eq attribute: Collects identity laws for relators of 

679 
various type constructors, e.g. "list_all2 (op =) = (op =)". The 

680 
transfer method uses these lemmas to infer transfer rules for 

681 
nonpolymorphic constants on the fly. 

682 

683 
 transfer_prover method: Assists with proving a transfer rule for a 

684 
new constant, provided the constant is defined in terms of other 

685 
constants that already have transfer rules. It should be applied 

686 
after unfolding the constant definitions. 

687 

688 
 HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer 

689 
from type nat to type int. 

690 

691 
* New Lifting package: 

692 

693 
 lift_definition command: Defines operations on an abstract type in 

694 
terms of a corresponding operation on a representation type. Example 

695 
syntax: 

696 

697 
lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist" 

698 
is List.insert 

699 

700 
Users must discharge a respectfulness proof obligation when each 

701 
constant is defined. (For a type copy, i.e. a typedef with UNIV, 

702 
the proof is discharged automatically.) The obligation is 

703 
presented in a userfriendly, readable form; a respectfulness 

704 
theorem in the standard format and a transfer rule are generated 

705 
by the package. 

706 

707 
 Integration with code_abstype: For typedefs (e.g. subtypes 

708 
corresponding to a datatype invariant, such as dlist), 

709 
lift_definition generates a code certificate theorem and sets up 

710 
code generation for each constant. 

711 

712 
 setup_lifting command: Sets up the Lifting package to work with 

713 
a userdefined type. The user must provide either a quotient 

714 
theorem or a type_definition theorem. The package configures 

715 
transfer rules for equality and quantifiers on the type, and sets 

716 
up the lift_definition command to work with the type. 

717 

718 
 Usage examples: See Quotient_Examples/Lift_DList.thy, 

719 
Quotient_Examples/Lift_RBT.thy, Word/Word.thy and 

720 
Library/Float.thy. 

721 

722 
* Quotient package: 

723 

724 
 The 'quotient_type' command now supports a 'morphisms' option with 

725 
rep and abs functions, similar to typedef. 

726 

727 
 'quotient_type' sets up new types to work with the Lifting and 

728 
Transfer packages, as with 'setup_lifting'. 

729 

730 
 The 'quotient_definition' command now requires the user to prove a 

731 
respectfulness property at the point where the constant is 

732 
defined, similar to lift_definition; INCOMPATIBILITY. Users are 

733 
encouraged to use lift_definition + transfer instead of 

734 
quotient_definition + descending, which will eventually be 

735 
deprecated. 

736 

737 
 Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems 

738 
accordingly, INCOMPATIBILITY. 

739 

47464  740 
* New diagnostic command 'find_unused_assms' to find potentially 
741 
superfluous assumptions in theorems using Quickcheck. 

46591  742 

45759  743 
* Quickcheck: 
47464  744 

45759  745 
 Quickcheck returns variable assignments as counterexamples, which 
746 
allows to reveal the underspecification of functions under test. 

747 
For example, refuting "hd xs = x", it presents the variable 

748 
assignment xs = [] and x = a1 as a counterexample, assuming that 

749 
any property is false whenever "hd []" occurs in it. 

47464  750 

45759  751 
These counterexample are marked as potentially spurious, as 
752 
Quickcheck also returns "xs = []" as a counterexample to the 

753 
obvious theorem "hd xs = hd xs". 

47464  754 

45759  755 
After finding a potentially spurious counterexample, Quickcheck 
756 
continues searching for genuine ones. 

47464  757 

45759  758 
By default, Quickcheck shows potentially spurious and genuine 
47464  759 
counterexamples. The option "genuine_only" sets quickcheck to only 
760 
show genuine counterexamples. 

45941  761 

762 
 The command 'quickcheck_generator' creates random and exhaustive 

763 
value generators for a given type and operations. 

47464  764 

45941  765 
It generates values by using the operations as if they were 
47463  766 
constructors of that type. 
46170  767 

768 
 Support for multisets. 

769 

46591  770 
 Added "use_subtype" options. 
47464  771 

47349
803729c9fd4d
documenting options quickcheck_locale; adjusting IsarRef documentation of Quotient predicate; NEWS
bulwahn
parents:
47270
diff
changeset

772 
 Added "quickcheck_locale" configuration to specify how to process 
803729c9fd4d
documenting options quickcheck_locale; adjusting IsarRef documentation of Quotient predicate; NEWS
bulwahn
parents:
47270
diff
changeset

773 
conjectures in a locale context. 
803729c9fd4d
documenting options quickcheck_locale; adjusting IsarRef documentation of Quotient predicate; NEWS
bulwahn
parents:
47270
diff
changeset

774 

45398
7dbb7b044a11
avoid infinite recursion in peephole optimizer function  this had a debilitating effect on rationals and reals
blanchet
parents:
45384
diff
changeset

775 
* Nitpick: 
45516  776 
 Fixed infinite loop caused by the 'peephole_optim' option and 
777 
affecting 'rat' and 'real'. 

778 

779 
* Sledgehammer: 

47563  780 
 Integrated more tightly with SPASS, as described in the ITP 2012 paper "More 
781 
SPASS with Isabelle". 

782 
 Made it try "smt" as a fallback if "metis" fails or times out. 

783 
 Added support for the following provers: AltErgo (via Why3 and TFF1), 

784 
iProver, iProverEq. 

785 
 Replaced remote ESInE with remote Satallax in the default setup. 

786 
 Sped up the minimizer. 

46409
d4754183ccce
made option available to users (mostly for experiments)
blanchet
parents:
46373
diff
changeset

787 
 Added "lam_trans", "uncurry_aliases", and "minimize" options. 
45706  788 
 Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice"). 
46301  789 
 Renamed "sound" option to "strict". 
45516  790 

791 
* Metis: 

792 
 Added possibility to specify lambda translations scheme as a 

46366  793 
parenthesized argument (e.g., "by (metis (lifting) ...)"). 
45398
7dbb7b044a11
avoid infinite recursion in peephole optimizer function  this had a debilitating effect on rationals and reals
blanchet
parents:
45384
diff
changeset

794 

47197  795 
* SMT: 
47563  796 
 Renamed "smt_fixed" option to "smt_read_only_certificates". 
47463  797 

46641  798 
* Command 'try0': 
799 
 Renamed from 'try_methods'. INCOMPATIBILITY. 

800 

46888  801 
* New "eventually_elim" method as a generalized variant of the 
47464  802 
eventually_elim* rules. Supports structured proofs. 
46888  803 

47413  804 
* HOL/TPTP: support to parse and import TPTP problems (all languages) 
47464  805 
into Isabelle/HOL. 
47413  806 

45398
7dbb7b044a11
avoid infinite recursion in peephole optimizer function  this had a debilitating effect on rationals and reals
blanchet
parents:
45384
diff
changeset

807 

45160  808 
*** FOL *** 
809 

45383  810 
* New "case_product" attribute (see HOL). 
45160  811 

45109  812 

47463  813 
*** ZF *** 
814 

815 
* Greater support for structured proofs involving induction or case 

816 
analysis. 

817 

818 
* Much greater use of mathematical symbols. 

819 

820 
* Removal of many ML theorem bindings. INCOMPATIBILITY. 

821 

822 

45128
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

823 
*** ML *** 
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

824 

46948  825 
* Antiquotation @{keyword "name"} produces a parser for outer syntax 
826 
from a minor keyword introduced via theory header declaration. 

827 

46961
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46959
diff
changeset

828 
* Antiquotation @{command_spec "name"} produces the 
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46959
diff
changeset

829 
Outer_Syntax.command_spec from a major keyword introduced via theory 
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46959
diff
changeset

830 
header declaration; it can be passed to Outer_Syntax.command etc. 
5c6955f487e5
outer syntax command definitions based on formal command_spec derived from theory header declarations;
wenzelm
parents:
46959
diff
changeset

831 

46916
e7ea35b41e2d
Local_Theory.define no longer hardwires default theorem name  targets/packages need to take care of it;
wenzelm
parents:
46903
diff
changeset

832 
* Local_Theory.define no longer hardwires default theorem name 
46992
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

833 
"foo_def", but retains the binding as given. If that is Binding.empty 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

834 
/ Attrib.empty_binding, the result is not registered as userlevel 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

835 
fact. The Local_Theory.define_internal variant allows to specify a 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

836 
nonempty name (used for the foundation in the background theory), 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

837 
while omitting the fact binding in the usercontext. Potential 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

838 
INCOMPATIBILITY for derived definitional packages: need to specify 
eeea81b86b70
refined Local_Theory.define vs. Local_Theory.define_internal, which allows to pass alternative name to the foundational axiom  expecially important for 'instantiation' or 'overloading', which loose name information due to Long_Name.base_name cooking etc.;
wenzelm
parents:
46983
diff
changeset

839 
naming policy for primitive definitions more explicitly. 
46916
e7ea35b41e2d
Local_Theory.define no longer hardwires default theorem name  targets/packages need to take care of it;
wenzelm
parents:
46903
diff
changeset

840 

46497
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46493
diff
changeset

841 
* Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in 
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46493
diff
changeset

842 
conformance with similar operations in structure Term and Logic. 
89ccf66aa73d
renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in conformance with similar operations in structure Term and Logic;
wenzelm
parents:
46493
diff
changeset

843 

45592  844 
* Antiquotation @{attributes [...]} embeds attribute source 
845 
representation into the ML text, which is particularly useful with 

846 
declarations like Local_Theory.note. 

847 

45128
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

848 
* Structure Proof_Context follows standard naming scheme. Old 
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

849 
ProofContext has been discontinued. INCOMPATIBILITY. 
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

850 

45293
57def0b39696
refined Local_Theory.declaration {syntax = false, pervasive} semantics: update is applied to auxiliary context as well;
wenzelm
parents:
45233
diff
changeset

851 
* Refined Local_Theory.declaration {syntax, pervasive}, with subtle 
45298
aa35859c8741
uniform treatment of syntax declaration wrt. aux. context (NB: notation avoids duplicate mixfix internally);
wenzelm
parents:
45293
diff
changeset

852 
change of semantics: update is applied to auxiliary local theory 
45293
57def0b39696
refined Local_Theory.declaration {syntax = false, pervasive} semantics: update is applied to auxiliary context as well;
wenzelm
parents:
45233
diff
changeset

853 
context as well. 
57def0b39696
refined Local_Theory.declaration {syntax = false, pervasive} semantics: update is applied to auxiliary context as well;
wenzelm
parents:
45233
diff
changeset

854 

45620
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

855 
* Modernized some oldstyle infix operations: 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

856 

f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

857 
addeqcongs ~> Simplifier.add_eqcong 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

858 
deleqcongs ~> Simplifier.del_eqcong 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

859 
addcongs ~> Simplifier.add_cong 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

860 
delcongs ~> Simplifier.del_cong 
45625
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

861 
setmksimps ~> Simplifier.set_mksimps 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

862 
setmkcong ~> Simplifier.set_mkcong 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

863 
setmksym ~> Simplifier.set_mksym 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

864 
setmkeqTrue ~> Simplifier.set_mkeqTrue 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

865 
settermless ~> Simplifier.set_termless 
750c5a47400b
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45620
diff
changeset

866 
setsubgoaler ~> Simplifier.set_subgoaler 
45620
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

867 
addsplits ~> Splitter.add_split 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

868 
delsplits ~> Splitter.del_split 
f2a587696afb
modernized some oldstyle infix operations, which were left over from the time of ML proof scripts;
wenzelm
parents:
45614
diff
changeset

869 

45128
5af3a3203a76
discontinued obsolete alias structure ProofContext;
wenzelm
parents:
45122
diff
changeset

870 

47461
5a7903ba2dac
more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
wenzelm
parents:
47453
diff
changeset

871 
*** System *** 
5a7903ba2dac
more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
wenzelm
parents:
47453
diff
changeset

872 

47464  873 
* ISABELLE_JDK_HOME settings variable points to JDK with javac and jar 
874 
(not just JRE). 

875 

47461
5a7903ba2dac
more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
wenzelm
parents:
47453
diff
changeset

876 
* ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name 
5a7903ba2dac
more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
wenzelm
parents:
47453
diff
changeset

877 
notation, which is useful for the jEdit file browser, for example. 
5a7903ba2dac
more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
wenzelm
parents:
47453
diff
changeset

878 

5a7903ba2dac
more robust treatment of ISABELLE_HOME on windows: eliminate spaces and funny unicode characters in directory name via DOS~1 notation;
wenzelm
parents:
47453
diff
changeset

879 

45109  880 

44801  881 
New in Isabelle20111 (October 2011) 
882 
 

41651  883 

41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

884 
*** General *** 
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

885 

44760  886 
* Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as 
44968  887 
"isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line. 
44760  888 

44777  889 
 Management of multiple theory files directly from the editor 
44760  890 
buffer store  bypassing the filesystem (no requirement to save 
891 
files for checking). 

892 

44777  893 
 Markup of formal entities within the text buffer, with semantic 
44760  894 
highlighting, tooltips and hyperlinks to jump to defining source 
895 
positions. 

896 

44777  897 
 Improved text rendering, with sub/superscripts in the source 
898 
buffer (including support for copy/paste wrt. output panel, HTML 

899 
theory output and other nonIsabelle text boxes). 

900 

901 
 Refined scheduling of proof checking and printing of results, 

44760  902 
based on interactive editor view. (Note: jEdit folding and 
903 
narrowing allows to restrict buffer perspectives explicitly.) 

904 

44777  905 
 Reduced CPU performance requirements, usable on machines with few 
44760  906 
cores. 
907 

44777  908 
 Reduced memory requirements due to pruning of unused document 
44760  909 
versions (garbage collection). 
910 

911 
See also ~~/src/Tools/jEdit/README.html for further information, 

912 
including some remaining limitations. 

913 

44800  914 
* Theory loader: source files are exclusively located via the master 
915 
directory of each theory node (where the .thy file itself resides). 

916 
The global load path (such as src/HOL/Library) has been discontinued. 

917 
Note that the path element ~~ may be used to reference theories in the 

918 
Isabelle home folder  for instance, "~~/src/HOL/Library/FuncSet". 

919 
INCOMPATIBILITY. 

920 

41955
703ea96b13c6
files are identified via SHA1 digests  discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset

921 
* Theory loader: source files are identified by content via SHA1 
703ea96b13c6
files are identified via SHA1 digests  discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset

922 
digests. Discontinued former path/modtime identification and optional 
703ea96b13c6
files are identified via SHA1 digests  discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset

923 
ISABELLE_FILE_IDENT plugin scripts. 
703ea96b13c6
files are identified via SHA1 digests  discontinued ISABELLE_FILE_IDENT;
wenzelm
parents:
41952
diff
changeset

924 

41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

925 
* Parallelization of nested Isar proofs is subject to 
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

926 
Goal.parallel_proofs_threshold (default 100). See also isabelle 
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

927 
usedir option Q. 
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

928 

42669
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

929 
* Name space: former unsynchronized references are now proper 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

930 
configuration options, with more conventional names: 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

931 

04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

932 
long_names ~> names_long 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

933 
short_names ~> names_short 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

934 
unique_names ~> names_unique 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

935 

04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

936 
Minor INCOMPATIBILITY, need to declare options in context like this: 
04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

937 

04dfffda5671
more conventional naming scheme: names_long, names_short, names_unique;
wenzelm
parents:
42658
diff
changeset

938 
declare [[names_unique = false]] 
42358
b47d41d9f4b5
Name_Space: proper configuration options long_names, short_names, unique_names instead of former unsynchronized references;
wenzelm
parents:
42290
diff
changeset

939 

42502  940 
* Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note 
941 
that the result needs to be unique, which means fact specifications 

942 
may have to be refined after enriching a proof context. 

943 

44800  944 
* Attribute "case_names" has been refined: the assumptions in each case 
945 
can be named now by following the case name with [name1 name2 ...]. 

946 

44968  947 
* Isabelle/Isar reference manual has been updated and extended: 
948 
 "Synopsis" provides a catalog of main Isar language concepts. 

949 
 Formal references in syntax diagrams, via @{rail} antiquotation. 

950 
 Updated material from classic "ref" manual, notably about 

951 
"Classical Reasoner". 

42633  952 

41703
d27950860514
parallelization of nested Isar proofs is subject to Goal.parallel_proofs_threshold;
wenzelm
parents:
41685
diff
changeset

953 

41727
ab3f6d76fb23
available_provers ~> supported_provers (for clarity)
blanchet
parents:
41703
diff
changeset

954 
*** HOL *** 
ab3f6d76fb23
available_provers ~> supported_provers (for clarity)
blanchet
parents:
41703
diff
changeset

955 

44968  956 
* Class bot and top require underlying partial order rather than 
44800  957 
preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY. 
43815
4f6e2965d821
adjusted to tightened specification of classes bot and top
haftmann
parents:
43752
diff
changeset

958 

43940  959 
* Class complete_lattice: generalized a couple of lemmas from sets; 
44800  960 
generalized theorems INF_cong and SUP_cong. New type classes for 
961 
complete boolean algebras and complete linear orders. Lemmas 

962 
Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in 

963 
class complete_linorder. 

964 

965 
Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def, 

966 
Sup_fun_def, Inf_apply, Sup_apply. 

967 

45088  968 
Removed redundant lemmas (the right hand side gives hints how to 
969 
replace them for (metis ...), or (simp only: ...) proofs): 

45041
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

970 

0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

971 
Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right] 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

972 
Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right] 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

973 
Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

974 
Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

975 
Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

976 
Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

977 
Inter_def ~> INF_def, image_def 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

978 
Union_def ~> SUP_def, image_def 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

979 
INT_eq ~> INF_def, and image_def 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

980 
UN_eq ~> SUP_def, and image_def 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

981 
INF_subset ~> INF_superset_mono [OF _ order_refl] 
44800  982 

983 
More consistent and comprehensive names: 

984 

45041
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

985 
INTER_eq_Inter_image ~> INF_def 
0523a6be8ade
NEWS: mention replacement lemmas for the removed ones in Complete_Lattices
hoelzl
parents:
45016
diff
changeset

986 
UNION_eq_Union_image ~> SUP_def 
43872  987 
INFI_def ~> INF_def 
988 
SUPR_def ~> SUP_def 

44103
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

989 
INF_leI ~> INF_lower 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

990 
INF_leI2 ~> INF_lower2 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

991 
le_INFI ~> INF_greatest 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

992 
le_SUPI ~> SUP_upper 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

993 
le_SUPI2 ~> SUP_upper2 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

994 
SUP_leI ~> SUP_least 
43873  995 
INFI_bool_eq ~> INF_bool_eq 
996 
SUPR_bool_eq ~> SUP_bool_eq 

997 
INFI_apply ~> INF_apply 

998 
SUPR_apply ~> SUP_apply 

44103
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

999 
INTER_def ~> INTER_eq 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1000 
UNION_def ~> UNION_eq 
cedaca00789f
more uniform naming scheme for Inf/INF and Sup/SUP lemmas
haftmann
parents:
44086
diff
changeset

1001 

43865
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43816
diff
changeset

1002 
INCOMPATIBILITY. 
db18f4d0cc7d
further generalization from sets to complete lattices
haftmann
parents:
43816
diff
changeset

1003 

44973
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1004 
* Renamed theory Complete_Lattice to Complete_Lattices. 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1005 
INCOMPATIBILITY. 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1006 

dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1007 
* Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff, 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1008 
INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot, 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1009 
Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image, 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1010 
Sup_insert are now declared as [simp]. INCOMPATIBILITY. 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1011 

dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1012 
* Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff, 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1013 
compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem, 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1014 
sup_inf_absob, sup_left_idem are now declared as [simp]. Minor 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1015 
INCOMPATIBILITY. 
dfe923d5308d
separated NEWS for Isabelle2011 from Isabelle20111 (cf. e1139e612b55);
wenzelm
parents:
44968
diff
changeset

1016 

44845  1017 
* Added syntactic classes "inf" and "sup" for the respective 
1018 
constants. INCOMPATIBILITY: Changes in the argument order of the 

1019 
(mostly internal) locale predicates for some derived classes. 

1020 

44800  1021 
* Theorem collections ball_simps and bex_simps do not contain theorems 
1022 
referring to UNION any longer; these have been moved to collection 

1023 
UN_ball_bex_simps. INCOMPATIBILITY. 

1024 

1025 
* Theory Archimedean_Field: floor now is defined as parameter of a 

1026 
separate type class floor_ceiling. 

1027 

1028 
* Theory Finite_Set: more coherent development of fold_set locales: 

42874  1029 

1030 
locale fun_left_comm ~> locale comp_fun_commute 

1031 
locale fun_left_comm_idem ~> locale comp_fun_idem 

44800  1032 

1033 
Both use pointfree characterization; interpretation proofs may need 

1034 
adjustment. INCOMPATIBILITY. 

42874  1035 

44800  1036 
* Theory Limits: Type "'a net" has been renamed to "'a filter", in 
44081
730f7cced3a6
rename type 'a net to 'a filter, following standard mathematical terminology
huffman
parents:
44027
diff
changeset

1037 
accordance with standard mathematical terminology. INCOMPATIBILITY. 
730f7cced3a6
rename type 'a net to 'a filter, following standard mathematical terminology
huffman
parents:
44027
diff
changeset

1038 

44800  1039 
* Theory Complex_Main: The locale interpretations for the 
1040 
bounded_linear and bounded_bilinear locales have been removed, in 

1041 
order to reduce the number of duplicate lemmas. Users must use the 

1042 
original names for distributivity theorems, potential INCOMPATIBILITY. 

44282
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1043 

f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1044 
divide.add ~> add_divide_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1045 
divide.diff ~> diff_divide_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1046 
divide.setsum ~> setsum_divide_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1047 
mult.add_right ~> right_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1048 
mult.diff_right ~> right_diff_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1049 
mult_right.setsum ~> setsum_right_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1050 
mult_left.diff ~> left_diff_distrib 
f0de18b62d63
remove bounded_(bi)linear locale interpretations, to avoid duplicating so many lemmas
huffman
parents:
44274
diff
changeset

1051 

44800  1052 
* Theory Complex_Main: Several redundant theorems have been removed or 
44568
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1053 
replaced by more general versions. INCOMPATIBILITY. 
44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1054 

45051
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1055 
real_diff_def ~> minus_real_def 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1056 
real_divide_def ~> divide_real_def 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1057 
real_less_def ~> less_le 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1058 
real_abs_def ~> abs_real_def 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1059 
real_sgn_def ~> sgn_real_def 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1060 
real_mult_commute ~> mult_commute 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1061 
real_mult_assoc ~> mult_assoc 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1062 
real_mult_1 ~> mult_1_left 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1063 
real_add_mult_distrib ~> left_distrib 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1064 
real_zero_not_eq_one ~> zero_neq_one 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1065 
real_mult_inverse_left ~> left_inverse 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1066 
INVERSE_ZERO ~> inverse_zero 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1067 
real_le_refl ~> order_refl 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1068 
real_le_antisym ~> order_antisym 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1069 
real_le_trans ~> order_trans 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1070 
real_le_linear ~> linear 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1071 
real_le_eq_diff ~> le_iff_diff_le_0 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1072 
real_add_left_mono ~> add_left_mono 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1073 
real_mult_order ~> mult_pos_pos 
c478d1876371
discontinued legacy theorem names from RealDef.thy
huffman
parents:
45049
diff
changeset

1074 
real_mult_less_mono2 ~> mult_strict_left_mono 
44822
2690b6de5021
remove duplicate lemma real_of_int_real_of_nat in favor of real_of_int_of_nat_eq
huffman
parents:
44777
diff
changeset

1075 
real_of_int_real_of_nat ~> real_of_int_of_nat_eq 
44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1076 
real_0_le_divide_iff ~> zero_le_divide_iff 
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1077 
realpow_two_disj ~> power2_eq_iff 
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1078 
real_squared_diff_one_factored ~> square_diff_one_factored 
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1079 
realpow_two_diff ~> square_diff_square_factored 
44669
8e6cdb9c00a7
remove redundant lemma reals_complete2 in favor of complete_real
huffman
parents:
44666
diff
changeset

1080 
reals_complete2 ~> complete_real 
44749
5b1e1432c320
remove redundant lemma real_sum_squared_expand in favor of power2_sum
huffman
parents:
44748
diff
changeset

1081 
real_sum_squared_expand ~> power2_sum 
44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1082 
exp_ln_eq ~> ln_unique 
44711  1083 
expi_add ~> exp_add 
1084 
expi_zero ~> exp_zero 

44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1085 
lemma_DERIV_subst ~> DERIV_cong 
44568
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1086 
LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1087 
LIMSEQ_const ~> tendsto_const 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1088 
LIMSEQ_norm ~> tendsto_norm 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1089 
LIMSEQ_add ~> tendsto_add 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1090 
LIMSEQ_minus ~> tendsto_minus 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1091 
LIMSEQ_minus_cancel ~> tendsto_minus_cancel 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1092 
LIMSEQ_diff ~> tendsto_diff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1093 
bounded_linear.LIMSEQ ~> bounded_linear.tendsto 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1094 
bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1095 
LIMSEQ_mult ~> tendsto_mult 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1096 
LIMSEQ_inverse ~> tendsto_inverse 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1097 
LIMSEQ_divide ~> tendsto_divide 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1098 
LIMSEQ_pow ~> tendsto_power 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1099 
LIMSEQ_setsum ~> tendsto_setsum 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1100 
LIMSEQ_setprod ~> tendsto_setprod 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1101 
LIMSEQ_norm_zero ~> tendsto_norm_zero_iff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1102 
LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1103 
LIMSEQ_imp_rabs ~> tendsto_rabs 
44710  1104 
LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus] 
1105 
LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const] 

1106 
LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const] 

44748
7f6838b3474a
remove redundant lemma LIMSEQ_Complex in favor of tendsto_Complex
huffman
parents:
44711
diff
changeset

1107 
LIMSEQ_Complex ~> tendsto_Complex 
44568
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1108 
LIM_ident ~> tendsto_ident_at 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1109 
LIM_const ~> tendsto_const 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1110 
LIM_add ~> tendsto_add 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1111 
LIM_add_zero ~> tendsto_add_zero 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1112 
LIM_minus ~> tendsto_minus 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1113 
LIM_diff ~> tendsto_diff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1114 
LIM_norm ~> tendsto_norm 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1115 
LIM_norm_zero ~> tendsto_norm_zero 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1116 
LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1117 
LIM_norm_zero_iff ~> tendsto_norm_zero_iff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1118 
LIM_rabs ~> tendsto_rabs 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1119 
LIM_rabs_zero ~> tendsto_rabs_zero 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1120 
LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1121 
LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1122 
LIM_compose ~> tendsto_compose 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1123 
LIM_mult ~> tendsto_mult 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1124 
LIM_scaleR ~> tendsto_scaleR 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1125 
LIM_of_real ~> tendsto_of_real 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1126 
LIM_power ~> tendsto_power 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1127 
LIM_inverse ~> tendsto_inverse 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1128 
LIM_sgn ~> tendsto_sgn 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1129 
isCont_LIM_compose ~> isCont_tendsto_compose 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1130 
bounded_linear.LIM ~> bounded_linear.tendsto 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1131 
bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1132 
bounded_bilinear.LIM ~> bounded_bilinear.tendsto 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1133 
bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1134 
bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1135 
bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero 
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44538
diff
changeset

1136 
LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at] 
44522
2f7e9d890efe
rename subset_{interior,closure} to {interior,closure}_mono;
huffman
parents:
44322
diff
changeset

1137 

44967  1138 
* Theory Complex_Main: The definition of infinite series was 
1139 
generalized. Now it is defined on the type class {topological_space, 

1140 
comm_monoid_add}. Hence it is useable also for extended real numbers. 

42484  1141 

44908  1142 
* Theory Complex_Main: The complex exponential function "expi" is now 
1143 
a typeconstrained abbreviation for "exp :: complex => complex"; thus 

1144 
several polymorphic lemmas about "exp" are now applicable to "expi". 

1145 

44968  1146 
* Code generation: 
1147 

1148 
 Theory Library/Code_Char_ord provides native ordering of 

1149 
characters in the target language. 

1150 

1151 
 Commands code_module and code_library are legacy, use export_code 

1152 
instead. 

1153 

1154 
 Method "evaluation" is legacy, use method "eval" instead. 

1155 

1156 
 Legacy evaluator "SML" is deactivated by default. May be 

1157 
reactivated by the following theory command: 

1158 

1159 
setup {* Value.add_evaluator ("SML", Codegen.eval_term) *} 

1160 

1161 
* Declare ext [intro] by default. Rare INCOMPATIBILITY. 

1162 

45088  1163 
* New proof method "induction" that gives induction hypotheses the 
1164 
name "IH", thus distinguishing them from further hypotheses that come 

1165 
from rule induction. The latter are still called "hyps". Method 

1166 
"induction" is a thin wrapper around "induct" and follows the same 

1167 
syntax. 

1168 

44968  1169 
* Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is 
1170 
still available as a legacy feature for some time. 

1171 

1172 
* Nitpick: 

1173 
 Added "need" and "total_consts" options. 

1174 
 Reintroduced "show_skolems" option by popular demand. 

1175 
 Renamed attribute: nitpick_def ~> nitpick_unfold. 

1176 
INCOMPATIBILITY. 

1177 

1178 
* Sledgehammer: 

1179 
 Use quasisound (and efficient) translations by default. 

1180 
 Added support for the following provers: EToFoF, LEOII, 

1181 
Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax. 

1182 
 Automatically preplay and minimize proofs before showing them if 

1183 
this can be done within reasonable time. 

1184 
 sledgehammer available_provers ~> sledgehammer supported_provers. 

1185 
INCOMPATIBILITY. 

1186 
 Added "preplay_timeout", "slicing", "type_enc", "sound", 

1187 
"max_mono_iters", and "max_new_mono_instances" options. 

1188 
 Removed "explicit_apply" and "full_types" options as well as "Full 

1189 
Types" Proof General menu item. INCOMPATIBILITY. 

1190 

1191 
* Metis: 

1192 
 Removed "metisF"  use "metis" instead. INCOMPATIBILITY. 

1193 
 Obsoleted "metisFT"  use "metis (full_types)" instead. 

1194 
INCOMPATIBILITY. 

1195 

1196 
* Command 'try': 

1197 
 Renamed 'try_methods' and added "simp:", "intro:", "dest:", and 

1198 
"elim:" options. INCOMPATIBILITY. 

1199 
 Introduced 'try' that not only runs 'try_methods' but also 

1200 
'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'. 

1201 

1202 
* Quickcheck: 

1203 
 Added "eval" option to evaluate terms for the found counterexample 

1204 
(currently only supported by the default (exhaustive) tester). 

1205 
 Added postprocessing of terms to obtain readable counterexamples 

1206 
(currently only supported by the default (exhaustive) tester). 

1207 
 New counterexample generator quickcheck[narrowing] enables 

1208 
narrowingbased testing. Requires the Glasgow Haskell compiler 

1209 
with its installation location defined in the Isabelle settings 

1210 
environment as ISABELLE_GHC. 

1211 
 Removed quickcheck tester "SML" based on the SML code generator 

1212 
(formly in HOL/Library). 

1213 

1214 
* Function package: discontinued option "tailrec". INCOMPATIBILITY, 

1215 
use 'partial_function' instead. 

1216 

1217 
* Theory Library/Extended_Reals replaces now the positive extended 

1218 
reals found in probability theory. This file is extended by 

1219 
Multivariate_Analysis/Extended_Real_Limits. 

1220 

44974  1221 
* Theory Library/Old_Recdef: old 'recdef' package has been moved here, 
1222 
from where it must be imported explicitly if it is really required. 

1223 
INCOMPATIBILITY. 

44968  1224 

1225 
* Theory Library/Wfrec: wellfounded recursion combinator "wfrec" has 

1226 
been moved here. INCOMPATIBILITY. 

1227 

1228 
* Theory Library/Saturated provides type of numbers with saturated 

1229 
arithmetic. 

1230 

1231 
* Theory Library/Product_Lattice defines a pointwise ordering for the 

1232 
product type 'a * 'b, and provides instance proofs for various order 

1233 
and lattice type classes. 

1234 

1235 
* Theory Library/Countable now provides the "countable_datatype" proof 

1236 
method for proving "countable" class instances for datatypes. 

1237 

1238 
* Theory Library/Cset_Monad allows do notation for computable sets 

1239 
(cset) via the generic monad adhoc overloading facility. 

1240 

1241 
* Library: Theories of common data structures are split into theories 

1242 
for implementation, an invariantensuring type, and connection to an 

1243 
abstract type. INCOMPATIBILITY. 

1244 

1245 
 RBT is split into RBT and RBT_Mapping. 

1246 
 AssocList is split and renamed into AList and AList_Mapping. 

1247 
 DList is split into DList_Impl, DList, and DList_Cset. 

1248 
 Cset is split into Cset and List_Cset. 

1249 

1250 
* Theory Library/Nat_Infinity has been renamed to 

1251 
Library/Extended_Nat, with name changes of the following types and 

1252 
constants: 

1253 

1254 
type inat ~> type enat 

1255 
Fin ~> enat 

1256 
Infty ~> infinity (overloaded) 

1257 
iSuc ~> eSuc 

1258 
the_Fin ~> the_enat 

1259 

1260 
Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has 

1261 
been renamed accordingly. INCOMPATIBILITY. 

1262 

1263 
* Session Multivariate_Analysis: The euclidean_space type class now 

1264 
fixes a constant "Basis :: 'a set" consisting of the standard 

1265 
orthonormal basis for the type. Users now have the option of 

1266 
quantifying over this set instead of using the "basis" function, e.g. 

1267 
"ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)". 

1268 

1269 
* Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed 

1270 
to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants 

1271 
"Cart_nth" and "Cart_lambda" have been respectively renamed to 

1272 
"vec_nth" and "vec_lambda"; theorems mentioning those names have 

1273 
changed to match. Definition theorems for overloaded constants now use 

1274 
the standard "foo_vec_def" naming scheme. A few other theorems have 

1275 
been renamed as follows (INCOMPATIBILITY): 

1276 

1277 
Cart_eq ~> vec_eq_iff 

1278 
dist_nth_le_cart ~> dist_vec_nth_le 

1279 
tendsto_vector ~> vec_tendstoI 

1280 
Cauchy_vector ~> vec_CauchyI 

1281 

1282 
* Session Multivariate_Analysis: Several duplicate theorems have been 

1283 
removed, and other theorems have been renamed or replaced with more 

1284 
general versions. INCOMPATIBILITY. 

1285 

1286 
finite_choice ~> finite_set_choice 

1287 
eventually_conjI ~> eventually_conj 

1288 
eventually_and ~> eventually_conj_iff 

1289 
eventually_false ~> eventually_False 

1290 
setsum_norm ~> norm_setsum 

1291 
Lim_sequentially ~> LIMSEQ_def 

1292 
Lim_ident_at ~> LIM_ident 

1293 
Lim_const ~> tendsto_const 

1294 
Lim_cmul ~> tendsto_scaleR [OF tendsto_const] 

1295 
Lim_neg ~> tendsto_minus 

1296 
Lim_add ~> tendsto_add 

1297 
Lim_sub ~> tendsto_diff 

1298 
Lim_mul ~> tendsto_scaleR 

1299 
Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const] 

1300 
Lim_null_norm ~> tendsto_norm_zero_iff [symmetric] 

1301 
Lim_linear ~> bounded_linear.tendsto 

1302 
Lim_component ~> tendsto_euclidean_component 

1303 
Lim_component_cart ~> tendsto_vec_nth 

1304 
Lim_inner ~> tendsto_inner [OF tendsto_const] 

1305 
dot_lsum ~> inner_setsum_left 

1306 
dot_rsum ~> inner_setsum_right 

1307 
continuous_cmul ~> continuous_scaleR [OF continuous_const] 

1308 
continuous_neg ~> continuous_minus 

1309 
continuous_sub ~> continuous_diff 

1310 
continuous_vmul ~> continuous_scaleR [OF _ continuous_const] 

1311 
continuous_mul ~> continuous_scaleR 

1312 
continuous_inv ~> continuous_inverse 

1313 
continuous_at_within_inv ~> continuous_at_within_inverse 

1314 
continuous_at_inv ~> continuous_at_inverse 

1315 
continuous_at_norm ~> continuous_norm [OF continuous_at_id] 

1316 
continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id] 

1317 
continuous_at_component ~> continuous_component [OF continuous_at_id] 

1318 
continuous_on_neg ~> continuous_on_minus 

1319 
continuous_on_sub ~> continuous_on_diff 

1320 
continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const] 

1321 
continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const] 

1322 
continuous_on_mul ~> continuous_on_scaleR 

1323 
continuous_on_mul_real ~> continuous_on_mult 

1324 
continuous_on_inner ~> continuous_on_inner [OF continuous_on_const] 

1325 
continuous_on_norm ~> continuous_on_norm [OF continuous_on_id] 

1326 
continuous_on_inverse ~> continuous_on_inv 

1327 
uniformly_continuous_on_neg ~> uniformly_continuous_on_minus 

1328 
uniformly_continuous_on_sub ~> uniformly_continuous_on_diff 

1329 
subset_interior ~> interior_mono 

1330 
subset_closure ~> closure_mono 

1331 
closure_univ ~> closure_UNIV 

1332 
real_arch_lt ~> reals_Archimedean2 

1333 
real_arch ~> reals_Archimedean3 

1334 
real_abs_norm ~> abs_norm_cancel 

1335 
real_abs_sub_norm ~> norm_triangle_ineq3 

1336 
norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2 

1337 

1338 
* Session HOLProbability: 

1339 
 Caratheodory's extension lemma is now proved for ring_of_sets. 

1340 
 Infinite products of probability measures are now available. 

1341 
 Sigma closure is independent, if the generator is independent 

1342 
 Use extended reals instead of positive extended 

1343 
reals. INCOMPATIBILITY. 

1344 

45049  1345 
* Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY. 
1346 

1347 
expand_fun_below ~> fun_below_iff 

1348 
below_fun_ext ~> fun_belowI 

1349 
expand_cfun_eq ~> cfun_eq_iff 

1350 
ext_cfun ~> cfun_eqI 

1351 
expand_cfun_below ~> cfun_below_iff 

1352 
below_cfun_ext ~> cfun_belowI 

1353 
monofun_fun_fun ~> fun_belowD 

1354 
monofun_fun_arg ~> monofunE 

1355 
monofun_lub_fun ~> adm_monofun [THEN admD] 

1356 
cont_lub_fun ~> adm_cont [THEN admD] 

1357 
cont2cont_Rep_CFun ~> cont2cont_APP 

1358 
cont_Rep_CFun_app ~> cont_APP_app 

1359 
cont_Rep_CFun_app_app ~> cont_APP_app_app 

1360 
cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE] 

1361 
cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE] 

1362 
contlub_cfun ~> lub_APP [symmetric] 

1363 
contlub_LAM ~> lub_LAM [symmetric] 

1364 
thelubI ~> lub_eqI 

1365 
UU_I ~> bottomI 

1366 
lift_distinct1 ~> lift.distinct(1) 

1367 
lift_distinct2 ~> lift.distinct(2) 

1368 
Def_not_UU ~> lift.distinct(2) 

1369 
Def_inject ~> lift.inject 

1370 
below_UU_iff ~> below_bottom_iff 

1371 
eq_UU_iff ~> eq_bottom_iff 

1372 

44903  1373 

41685
e29ea98a76ce
term style 'isub': adhoc subscripting of variables that end with digits (x1, x23, ...)
krauss
parents:
41667
diff
changeset

1374 
*** Document preparation *** 
e29ea98a76ce
term style 'isub': adhoc subscripting of variables that end with digits (x1, x23, ...)
krauss
parents:
41667
diff
changeset

1375 

44800  1376 
* Antiquotation @{rail} layouts railroad syntax diagrams, see also 
1377 
isarref manual, both for description and actual application of the 

1378 
same. 

1379 

1380 
* Antiquotation @{value} evaluates the given term and presents its 

1381 
result. 

1382 

1383 
* Antiquotations: term style "isub" provides adhoc conversion of 

1384 
variables x1, y23 into subscripted form x\<^isub>1, 

1385 
y\<^isub>2\<^isub>3. 

41651  1386 

42484  1387 
* Predefined LaTeX macros for Isabelle symbols \<bind> and \<then> 
1388 
(e.g. see ~~/src/HOL/Library/Monad_Syntax.thy). 

1389 

44967  1390 
* Localized \isabellestyle switch can be used within blocks or groups 
1391 
like this: 

1392 

1393 
\isabellestyle{it} %preferred default 

1394 
{\isabellestylett @{text "typewriter stuff"}} 

1395 

1396 
* Discontinued special treatment of hard tabulators. Implicit 

1397 
tabwidth is now defined as 1. Potential INCOMPATIBILITY for visual 

1398 
layouts. 

44800  1399 

41651  1400 

41944
b97091ae583a
Path.print is the official way to show filesystem paths to users  note that Path.implode often indicates violation of the abstract datatype;
wenzelm
parents:
41886
diff
changeset

1401 
*** ML *** 
b97091ae583a
Path.print is the official way to show filesystem paths to users  note that Path.implode often indicates violation of the abstract datatype;
wenzelm
parents:
41886
diff
changeset

1402 

43731
70072780e095
inner syntax supports inlined YXML according to Term_XML (particularly useful for producing text under program control);
wenzelm
parents:
43709
diff
changeset

1403 
* The inner syntax of sort/type/term/prop supports inlined YXML 
70072780e095
inner syntax supports inlined YXML according to Term_XML (particularly useful for producing text under program control);
wenzelm
parents:
43709
diff
changeset

1404 
representations within quoted string tokens. By encoding logical 
