summary |
shortlog |
changelog |
graph |
tags |
branches |
files |
changeset |
file |
revisions |
annotate |
diff |
raw

NEWS

author | wenzelm |

Wed Jun 22 10:09:20 2016 +0200 (2016-06-22) | |

changeset 63343 | fb5d8a50c641 |

parent 63310 | caaacf37943f |

child 63350 | 705229ed856e |

child 63352 | 4eaf35781b23 |

permissions | -rw-r--r-- |

bundle lifting_syntax;

1 Isabelle NEWS -- history of user-relevant changes

2 =================================================

4 (Note: Isabelle/jEdit shows a tree-view of the NEWS file in Sidekick.)

7 New in this Isabelle version

8 ----------------------------

10 *** General ***

12 * Embedded content (e.g. the inner syntax of types, terms, props) may be

13 delimited uniformly via cartouches. This works better than old-fashioned

14 quotes when sub-languages are nested.

16 * Type-inference improves sorts of newly introduced type variables for

17 the object-logic, using its base sort (i.e. HOL.type for Isabelle/HOL).

18 Thus terms like "f x" or "\<And>x. P x" without any further syntactic context

19 produce x::'a::type in HOL instead of x::'a::{} in Pure. Rare

20 INCOMPATIBILITY, need to provide explicit type constraints for Pure

21 types where this is really intended.

23 * Simplified outer syntax: uniform category "name" includes long

24 identifiers. Former "xname" / "nameref" / "name reference" has been

25 discontinued.

27 * Mixfix annotations support general block properties, with syntax

28 "(\<open>x=a y=b z \<dots>\<close>". Notable property names are "indent", "consistent",

29 "unbreakable", "markup". The existing notation "(DIGITS" is equivalent

30 to "(\<open>indent=DIGITS\<close>". The former notation "(00" for unbreakable blocks

31 is superseded by "(\<open>unbreabable\<close>" --- rare INCOMPATIBILITY.

33 * New symbol \<circle>, e.g. for temporal operator.

35 * Old 'header' command is no longer supported (legacy since

36 Isabelle2015).

38 * Command 'bundle' provides a local theory target to define a bundle

39 from the body of specification commands (such as 'declare',

40 'declaration', 'notation', 'lemmas', 'lemma'). For example:

42 bundle foo

43 begin

44 declare a [simp]

45 declare b [intro]

46 end

48 * Command 'unbundle' is like 'include', but works within a local theory

49 context. Unlike "context includes ... begin", the effect of 'unbundle'

50 on the target context persists, until different declarations are given.

53 *** Prover IDE -- Isabelle/Scala/jEdit ***

55 * Cartouche abbreviations work both for " and ` to accomodate typical

56 situations where old ASCII notation may be updated.

58 * IDE support for the Isabelle/Pure bootstrap process, with the

59 following independent stages:

61 src/Pure/ROOT0.ML

62 src/Pure/ROOT.ML

63 src/Pure/Pure.thy

64 src/Pure/ML_Bootstrap.thy

66 The ML ROOT files act like quasi-theories in the context of theory

67 ML_Bootstrap: this allows continuous checking of all loaded ML files.

68 The theory files are presented with a modified header to import Pure

69 from the running Isabelle instance. Results from changed versions of

70 each stage are *not* propagated to the next stage, and isolated from the

71 actual Isabelle/Pure that runs the IDE itself. The sequential

72 dependencies of the above files are only observed for batch build.

74 * Highlighting of entity def/ref positions wrt. cursor.

76 * Action "isabelle.select-entity" (shortcut CS+ENTER) selects all

77 occurences of the formal entity at the caret position. This facilitates

78 systematic renaming.

80 * Document markup works across multiple Isar commands, e.g. the results

81 established at the end of a proof are properly identified in the theorem

82 statement.

85 *** Isar ***

87 * Command 'axiomatization' has become more restrictive to correspond

88 better to internal axioms as singleton facts with mandatory name. Minor

89 INCOMPATIBILITY.

91 * Many specification elements support structured statements with 'if' /

92 'for' eigen-context, e.g. 'axiomatization', 'abbreviation',

93 'definition', 'inductive', 'function'.

95 * Toplevel theorem statements support eigen-context notation with 'if' /

96 'for' (in postfix), which corresponds to 'assumes' / 'fixes' in the

97 traditional long statement form (in prefix). Local premises are called

98 "that" or "assms", respectively. Empty premises are *not* bound in the

99 context: INCOMPATIBILITY.

101 * Command 'define' introduces a local (non-polymorphic) definition, with

102 optional abstraction over local parameters. The syntax resembles

103 'definition' and 'obtain'. It fits better into the Isar language than

104 old 'def', which is now a legacy feature.

106 * Command 'obtain' supports structured statements with 'if' / 'for'

107 context.

109 * Command '\<proof>' is an alias for 'sorry', with different

110 typesetting. E.g. to produce proof holes in examples and documentation.

112 * The old proof method "default" has been removed (legacy since

113 Isabelle2016). INCOMPATIBILITY, use "standard" instead.

115 * Proof methods may refer to the main facts via the dynamic fact

116 "method_facts". This is particularly useful for Eisbach method

117 definitions.

119 * Eisbach provides method "use" to modify the main facts of a given

120 method expression, e.g.

122 (use facts in simp)

123 (use facts in \<open>simp add: ...\<close>)

126 *** Pure ***

128 * Code generator: config option "code_timing" triggers measurements of

129 different phases of code generation. See src/HOL/ex/Code_Timing.thy for

130 examples.

133 *** HOL ***

135 * Former locale lifting_syntax is now a bundle, which is easier to

136 include in a local context or theorem statement, e.g. "context includes

137 lifting_syntax begin ... end". Minor INCOMPATIBILITY.

139 * Code generation for scala: ambiguous implicts in class diagrams

140 are spelt out explicitly.

142 * Abstract locales semigroup, abel_semigroup, semilattice,

143 semilattice_neutr, ordering, ordering_top, semilattice_order,

144 semilattice_neutr_order, comm_monoid_set, semilattice_set,

145 semilattice_neutr_set, semilattice_order_set, semilattice_order_neutr_set

146 monoid_list, comm_monoid_list, comm_monoid_list_set, comm_monoid_mset,

147 comm_monoid_fun use boldified syntax uniformly that does not clash

148 with corresponding global syntax. INCOMPATIBILITY.

150 * Conventional syntax "%(). t" for unit abstractions. Slight syntactic

151 INCOMPATIBILITY.

153 * Command 'code_reflect' accepts empty constructor lists for datatypes,

154 which renders those abstract effectively.

156 * Command 'export_code' checks given constants for abstraction violations:

157 a small guarantee that given constants specify a safe interface for the

158 generated code.

160 * Probability/Random_Permutations.thy contains some theory about

161 choosing a permutation of a set uniformly at random and folding over a

162 list in random order.

164 * Probability/SPMF formalises discrete subprobability distributions.

166 * Library/FinFun.thy: bundles "finfun_syntax" and "no_finfun_syntax"

167 allow to control optional syntax in local contexts; this supersedes

168 former Library/FinFun_Syntax.thy. INCOMPATIBILITY, e.g. use "unbundle

169 finfun_syntax" to imitate import of "~~/src/HOL/Library/FinFun_Syntax".

171 * Library/Set_Permutations.thy (executably) defines the set of

172 permutations of a set, i.e. the set of all lists that contain every

173 element of the carrier set exactly once.

175 * Static evaluators (Code_Evaluation.static_* in Isabelle/ML) rely on

176 explicitly provided auxiliary definitions for required type class

177 dictionaries rather than half-working magic. INCOMPATIBILITY, see

178 the tutorial on code generation for details.

180 * New abbreviations for negated existence (but not bounded existence):

182 \<nexists>x. P x \<equiv> \<not> (\<exists>x. P x)

183 \<nexists>!x. P x \<equiv> \<not> (\<exists>!x. P x)

185 * The print mode "HOL" for ASCII syntax of binders "!", "?", "?!", "@"

186 has been removed for output. It is retained for input only, until it is

187 eliminated altogether.

189 * Sledgehammer:

190 - Produce syntactically correct Vampire 4.0 problem files.

192 * (Co)datatype package:

193 - New commands for defining corecursive functions and reasoning about

194 them in "~~/src/HOL/Library/BNF_Corec.thy": 'corec', 'corecursive',

195 'friend_of_corec', and 'corecursion_upto'; and 'corec_unique' proof

196 method. See 'isabelle doc corec'.

197 - The predicator :: ('a => bool) => 'a F => bool is now a first-class

198 citizen in bounded natural functors

199 - 'primrec' now allows nested calls through the predicator in addition

200 to the map function.

201 - 'bnf' automatically discharges reflexive proof obligations

202 - 'bnf' outputs a slightly modified proof obligation expressing rel in

203 terms of map and set

204 (not giving a specification for rel makes this one reflexive)

205 - 'bnf' outputs a new proof obligation expressing pred in terms of set

206 (not giving a specification for pred makes this one reflexive)

207 INCOMPATIBILITY: manual 'bnf' declarations may need adjustment

208 - Renamed lemmas:

209 rel_prod_apply ~> rel_prod_inject

210 pred_prod_apply ~> pred_prod_inject

211 INCOMPATIBILITY.

212 - The "size" plugin has been made compatible again with locales.

214 * Removed obsolete theorem nat_less_cases. INCOMPATIBILITY, use

215 linorder_cases instead.

217 * Renamed split_if -> if_split and split_if_asm -> if_split_asm to

218 resemble the f.split naming convention, INCOMPATIBILITY.

220 * Characters (type char) are modelled as finite algebraic type

221 corresponding to {0..255}.

223 - Logical representation:

224 * 0 is instantiated to the ASCII zero character.

225 * All other characters are represented as "Char n"

226 with n being a raw numeral expression less than 256.

227 * Expressions of the form "Char n" with n greater than 255

228 are non-canonical.

229 - Printing and parsing:

230 * Printable characters are printed and parsed as "CHR ''\<dots>''"

231 (as before).

232 * The ASCII zero character is printed and parsed as "0".

233 * All other canonical characters are printed as "CHR 0xXX"

234 with XX being the hexadecimal character code. "CHR n"

235 is parsable for every numeral expression n.

236 * Non-canonical characters have no special syntax and are

237 printed as their logical representation.

238 - Explicit conversions from and to the natural numbers are

239 provided as char_of_nat, nat_of_char (as before).

240 - The auxiliary nibble type has been discontinued.

242 INCOMPATIBILITY.

244 * Multiset membership is now expressed using set_mset rather than count.

246 - Expressions "count M a > 0" and similar simplify to membership

247 by default.

249 - Converting between "count M a = 0" and non-membership happens using

250 equations count_eq_zero_iff and not_in_iff.

252 - Rules count_inI and in_countE obtain facts of the form

253 "count M a = n" from membership.

255 - Rules count_in_diffI and in_diff_countE obtain facts of the form

256 "count M a = n + count N a" from membership on difference sets.

258 INCOMPATIBILITY.

260 * The names of multiset theorems have been normalised to distinguish which

261 ordering the theorems are about

262 mset_less_eqI ~> mset_subset_eqI

263 mset_less_insertD ~> mset_subset_insertD

264 mset_less_eq_count ~> mset_subset_eq_count

265 mset_less_diff_self ~> mset_subset_diff_self

266 mset_le_exists_conv ~> mset_subset_eq_exists_conv

267 mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel

268 mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel

269 mset_le_mono_add ~> mset_subset_eq_mono_add

270 mset_le_add_left ~> mset_subset_eq_add_left

271 mset_le_add_right ~> mset_subset_eq_add_right

272 mset_le_single ~> mset_subset_eq_single

273 mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute

274 diff_le_self ~> diff_subset_eq_self

275 mset_leD ~> mset_subset_eqD

276 mset_lessD ~> mset_subsetD

277 mset_le_insertD ~> mset_subset_eq_insertD

278 mset_less_of_empty ~> mset_subset_of_empty

279 le_empty ~> subset_eq_empty

280 mset_less_add_bothsides ~> mset_subset_add_bothsides

281 mset_less_empty_nonempty ~> mset_subset_empty_nonempty

282 mset_less_size ~> mset_subset_size

283 wf_less_mset_rel ~> wf_subset_mset_rel

284 count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq

285 mset_remdups_le ~> mset_remdups_subset_eq

286 ms_lesseq_impl ~> subset_eq_mset_impl

288 Some functions have been renamed:

289 ms_lesseq_impl -> subset_eq_mset_impl

291 * Compound constants INFIMUM and SUPREMUM are mere abbreviations now.

292 INCOMPATIBILITY.

294 * More complex analysis including Cauchy's inequality, Liouville theorem,

295 open mapping theorem, maximum modulus principle, Residue theorem, Schwarz Lemma.

297 * Theory of polyhedra: faces, extreme points, polytopes, and the Krein–Milman

298 Minkowski theorem.

300 * "Gcd (f ` A)" and "Lcm (f ` A)" are printed with optional

301 comprehension-like syntax analogously to "Inf (f ` A)" and "Sup (f ` A)".

303 * Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY.

305 * The type class ordered_comm_monoid_add is now called

306 ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add is

307 introduced as the combination of ordered_ab_semigroup_add + comm_monoid_add.

308 INCOMPATIBILITY.

310 * Introduced the type classes canonically_ordered_comm_monoid_add and dioid.

312 * Added topological_monoid

314 * Library/Complete_Partial_Order2.thy provides reasoning support for

315 proofs about monotonicity and continuity in chain-complete partial

316 orders and about admissibility conditions for fixpoint inductions.

318 * Library/Polynomial.thy contains also derivation of polynomials

319 but not gcd/lcm on polynomials over fields. This has been moved

320 to a separate theory Library/Polynomial_GCD_euclidean.thy, to

321 pave way for a possible future different type class instantiation

322 for polynomials over factorial rings. INCOMPATIBILITY.

324 * Library/Sublist.thy: added function "prefixes" and renamed

325 prefixeq -> prefix

326 prefix -> strict_prefix

327 suffixeq -> suffix

328 suffix -> strict_suffix

329 Added theory of longest common prefixes.

331 * Dropped various legacy fact bindings, whose replacements are often

332 of a more general type also:

333 lcm_left_commute_nat ~> lcm.left_commute

334 lcm_left_commute_int ~> lcm.left_commute

335 gcd_left_commute_nat ~> gcd.left_commute

336 gcd_left_commute_int ~> gcd.left_commute

337 gcd_greatest_iff_nat ~> gcd_greatest_iff

338 gcd_greatest_iff_int ~> gcd_greatest_iff

339 coprime_dvd_mult_nat ~> coprime_dvd_mult

340 coprime_dvd_mult_int ~> coprime_dvd_mult

341 zpower_numeral_even ~> power_numeral_even

342 gcd_mult_cancel_nat ~> gcd_mult_cancel

343 gcd_mult_cancel_int ~> gcd_mult_cancel

344 div_gcd_coprime_nat ~> div_gcd_coprime

345 div_gcd_coprime_int ~> div_gcd_coprime

346 zpower_numeral_odd ~> power_numeral_odd

347 zero_less_int_conv ~> of_nat_0_less_iff

348 gcd_greatest_nat ~> gcd_greatest

349 gcd_greatest_int ~> gcd_greatest

350 coprime_mult_nat ~> coprime_mult

351 coprime_mult_int ~> coprime_mult

352 lcm_commute_nat ~> lcm.commute

353 lcm_commute_int ~> lcm.commute

354 int_less_0_conv ~> of_nat_less_0_iff

355 gcd_commute_nat ~> gcd.commute

356 gcd_commute_int ~> gcd.commute

357 Gcd_insert_nat ~> Gcd_insert

358 Gcd_insert_int ~> Gcd_insert

359 of_int_int_eq ~> of_int_of_nat_eq

360 lcm_least_nat ~> lcm_least

361 lcm_least_int ~> lcm_least

362 lcm_assoc_nat ~> lcm.assoc

363 lcm_assoc_int ~> lcm.assoc

364 int_le_0_conv ~> of_nat_le_0_iff

365 int_eq_0_conv ~> of_nat_eq_0_iff

366 Gcd_empty_nat ~> Gcd_empty

367 Gcd_empty_int ~> Gcd_empty

368 gcd_assoc_nat ~> gcd.assoc

369 gcd_assoc_int ~> gcd.assoc

370 zero_zle_int ~> of_nat_0_le_iff

371 lcm_dvd2_nat ~> dvd_lcm2

372 lcm_dvd2_int ~> dvd_lcm2

373 lcm_dvd1_nat ~> dvd_lcm1

374 lcm_dvd1_int ~> dvd_lcm1

375 gcd_zero_nat ~> gcd_eq_0_iff

376 gcd_zero_int ~> gcd_eq_0_iff

377 gcd_dvd2_nat ~> gcd_dvd2

378 gcd_dvd2_int ~> gcd_dvd2

379 gcd_dvd1_nat ~> gcd_dvd1

380 gcd_dvd1_int ~> gcd_dvd1

381 int_numeral ~> of_nat_numeral

382 lcm_ac_nat ~> ac_simps

383 lcm_ac_int ~> ac_simps

384 gcd_ac_nat ~> ac_simps

385 gcd_ac_int ~> ac_simps

386 abs_int_eq ~> abs_of_nat

387 zless_int ~> of_nat_less_iff

388 zdiff_int ~> of_nat_diff

389 zadd_int ~> of_nat_add

390 int_mult ~> of_nat_mult

391 int_Suc ~> of_nat_Suc

392 inj_int ~> inj_of_nat

393 int_1 ~> of_nat_1

394 int_0 ~> of_nat_0

395 Lcm_empty_nat ~> Lcm_empty

396 Lcm_empty_int ~> Lcm_empty

397 Lcm_insert_nat ~> Lcm_insert

398 Lcm_insert_int ~> Lcm_insert

399 comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd

400 comp_fun_idem_gcd_int ~> comp_fun_idem_gcd

401 comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm

402 comp_fun_idem_lcm_int ~> comp_fun_idem_lcm

403 Lcm_eq_0 ~> Lcm_eq_0_I

404 Lcm0_iff ~> Lcm_0_iff

405 Lcm_dvd_int ~> Lcm_least

406 divides_mult_nat ~> divides_mult

407 divides_mult_int ~> divides_mult

408 lcm_0_nat ~> lcm_0_right

409 lcm_0_int ~> lcm_0_right

410 lcm_0_left_nat ~> lcm_0_left

411 lcm_0_left_int ~> lcm_0_left

412 dvd_gcd_D1_nat ~> dvd_gcdD1

413 dvd_gcd_D1_int ~> dvd_gcdD1

414 dvd_gcd_D2_nat ~> dvd_gcdD2

415 dvd_gcd_D2_int ~> dvd_gcdD2

416 coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff

417 coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff

418 realpow_minus_mult ~> power_minus_mult

419 realpow_Suc_le_self ~> power_Suc_le_self

420 dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest

421 INCOMPATIBILITY.

423 * Session HOL-NSA has been renamed to HOL-Nonstandard_Analysis.

425 * In HOL-Probability the type of emeasure and nn_integral was changed

426 from ereal to ennreal:

427 emeasure :: 'a measure => 'a set => ennreal

428 nn_integral :: 'a measure => ('a => ennreal) => ennreal

429 INCOMPATIBILITY.

432 *** ML ***

434 * Integer.gcd and Integer.lcm use efficient operations from the Poly/ML

435 library (notably for big integers). Subtle change of semantics:

436 Integer.gcd and Integer.lcm both normalize the sign, results are never

437 negative. This coincides with the definitions in HOL/GCD.thy.

438 INCOMPATIBILITY.

440 * Structure Rat for rational numbers is now an integral part of

441 Isabelle/ML, with special notation @int/nat or @int for numerals (an

442 abbreviation for antiquotation @{Pure.rat argument}) and ML pretty

443 printing. Standard operations on type Rat.rat are provided via ad-hoc

444 overloading of + - * / < <= > >= ~ abs. INCOMPATIBILITY, need to

445 use + instead of +/ etc. Moreover, exception Rat.DIVZERO has been

446 superseded by General.Div.

448 * The ML function "ML" provides easy access to run-time compilation.

449 This is particularly useful for conditional compilation, without

450 requiring separate files.

452 * Low-level ML system structures (like PolyML and RunCall) are no longer

453 exposed to Isabelle/ML user-space. Potential INCOMPATIBILITY.

455 * Antiquotation @{make_string} is available during Pure bootstrap --

456 with approximative output quality.

458 * Option ML_exception_debugger controls detailed exception trace via the

459 Poly/ML debugger. Relevant ML modules need to be compiled beforehand

460 with ML_file_debug, or with ML_file and option ML_debugger enabled. Note

461 debugger information requires consirable time and space: main

462 Isabelle/HOL with full debugger support may need ML_system_64.

464 * Local_Theory.restore has been renamed to Local_Theory.reset to

465 emphasize its disruptive impact on the cumulative context, notably the

466 scope of 'private' or 'qualified' names. Note that Local_Theory.reset is

467 only appropriate when targets are managed, e.g. starting from a global

468 theory and returning to it. Regular definitional packages should use

469 balanced blocks of Local_Theory.open_target versus

470 Local_Theory.close_target instead. Rare INCOMPATIBILITY.

472 * Structure TimeLimit (originally from the SML/NJ library) has been

473 replaced by structure Timeout, with slightly different signature.

474 INCOMPATIBILITY.

476 * Discontinued cd and pwd operations, which are not well-defined in a

477 multi-threaded environment. Note that files are usually located

478 relatively to the master directory of a theory (see also

479 File.full_path). Potential INCOMPATIBILITY.

482 *** System ***

484 * Many Isabelle tools that require a Java runtime system refer to the

485 settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64,

486 depending on the underlying platform. The settings for "isabelle build"

487 ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been

488 discontinued. Potential INCOMPATIBILITY.

490 * The Isabelle system environment always ensures that the main

491 executables are found within the shell search $PATH: "isabelle" and

492 "isabelle_scala_script".

494 * Isabelle tools may consist of .scala files: the Scala compiler is

495 invoked on the spot. The source needs to define some object that extends

496 Isabelle_Tool.Body.

498 * The Isabelle ML process is now managed directly by Isabelle/Scala, and

499 shell scripts merely provide optional command-line access. In

500 particular:

502 . Scala module ML_Process to connect to the raw ML process,

503 with interaction via stdin/stdout/stderr or in batch mode;

504 . command-line tool "isabelle console" as interactive wrapper;

505 . command-line tool "isabelle process" as batch mode wrapper.

507 * The executable "isabelle_process" has been discontinued. Tools and

508 prover front-ends should use ML_Process or Isabelle_Process in

509 Isabelle/Scala. INCOMPATIBILITY.

511 * New command-line tool "isabelle process" supports ML evaluation of

512 literal expressions (option -e) or files (option -f) in the context of a

513 given heap image. Errors lead to premature exit of the ML process with

514 return code 1.

516 * Command-line tool "isabelle console" provides option -r to help to

517 bootstrapping Isabelle/Pure interactively.

519 * Command-line tool "isabelle yxml" has been discontinued.

520 INCOMPATIBILITY, use operations from the modules "XML" and "YXML" in

521 Isabelle/ML or Isabelle/Scala.

523 * File.bash_string, File.bash_path etc. represent Isabelle/ML and

524 Isabelle/Scala strings authentically within GNU bash. This is useful to

525 produce robust shell scripts under program control, without worrying

526 about spaces or special characters. Note that user output works via

527 Path.print (ML) or Path.toString (Scala). INCOMPATIBILITY, the old (and

528 less versatile) operations File.shell_quote, File.shell_path etc. have

529 been discontinued.

531 * SML/NJ and old versions of Poly/ML are no longer supported.

533 * Poly/ML heaps now follow the hierarchy of sessions, and thus require

534 much less disk space.

538 New in Isabelle2016 (February 2016)

539 -----------------------------------

541 *** General ***

543 * Eisbach is now based on Pure instead of HOL. Objects-logics may import

544 either the theory ~~/src/HOL/Eisbach/Eisbach (for HOL etc.) or

545 ~~/src/HOL/Eisbach/Eisbach_Old_Appl_Syntax (for FOL, ZF etc.). Note that

546 the HOL-Eisbach session located in ~~/src/HOL/Eisbach/ contains further

547 examples that do require HOL.

549 * Better resource usage on all platforms (Linux, Windows, Mac OS X) for

550 both Isabelle/ML and Isabelle/Scala. Slightly reduced heap space usage.

552 * Former "xsymbols" syntax with Isabelle symbols is used by default,

553 without any special print mode. Important ASCII replacement syntax

554 remains available under print mode "ASCII", but less important syntax

555 has been removed (see below).

557 * Support for more arrow symbols, with rendering in LaTeX and Isabelle

558 fonts: \<Lleftarrow> \<Rrightarrow> \<longlongleftarrow> \<longlongrightarrow> \<longlonglongleftarrow> \<longlonglongrightarrow>.

560 * Special notation \<struct> for the first implicit 'structure' in the

561 context has been discontinued. Rare INCOMPATIBILITY, use explicit

562 structure name instead, notably in indexed notation with block-subscript

563 (e.g. \<odot>\<^bsub>A\<^esub>).

565 * The glyph for \<diamond> in the IsabelleText font now corresponds better to its

566 counterpart \<box> as quantifier-like symbol. A small diamond is available as

567 \<diamondop>; the old symbol \<struct> loses this rendering and any special

568 meaning.

570 * Syntax for formal comments "-- text" now also supports the symbolic

571 form "\<comment> text". Command-line tool "isabelle update_cartouches -c" helps

572 to update old sources.

574 * Toplevel theorem statements have been simplified as follows:

576 theorems ~> lemmas

577 schematic_lemma ~> schematic_goal

578 schematic_theorem ~> schematic_goal

579 schematic_corollary ~> schematic_goal

581 Command-line tool "isabelle update_theorems" updates theory sources

582 accordingly.

584 * Toplevel theorem statement 'proposition' is another alias for

585 'theorem'.

587 * The old 'defs' command has been removed (legacy since Isabelle2014).

588 INCOMPATIBILITY, use regular 'definition' instead. Overloaded and/or

589 deferred definitions require a surrounding 'overloading' block.

592 *** Prover IDE -- Isabelle/Scala/jEdit ***

594 * IDE support for the source-level debugger of Poly/ML, to work with

595 Isabelle/ML and official Standard ML. Option "ML_debugger" and commands

596 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',

597 'SML_file_no_debug' control compilation of sources with or without

598 debugging information. The Debugger panel allows to set breakpoints (via

599 context menu), step through stopped threads, evaluate local ML

600 expressions etc. At least one Debugger view needs to be active to have

601 any effect on the running ML program.

603 * The State panel manages explicit proof state output, with dynamic

604 auto-update according to cursor movement. Alternatively, the jEdit

605 action "isabelle.update-state" (shortcut S+ENTER) triggers manual

606 update.

608 * The Output panel no longer shows proof state output by default, to

609 avoid GUI overcrowding. INCOMPATIBILITY, use the State panel instead or

610 enable option "editor_output_state".

612 * The text overview column (status of errors, warnings etc.) is updated

613 asynchronously, leading to much better editor reactivity. Moreover, the

614 full document node content is taken into account. The width of the

615 column is scaled according to the main text area font, for improved

616 visibility.

618 * The main text area no longer changes its color hue in outdated

619 situations. The text overview column takes over the role to indicate

620 unfinished edits in the PIDE pipeline. This avoids flashing text display

621 due to ad-hoc updates by auxiliary GUI components, such as the State

622 panel.

624 * Slightly improved scheduling for urgent print tasks (e.g. command

625 state output, interactive queries) wrt. long-running background tasks.

627 * Completion of symbols via prefix of \<name> or \<^name> or \name is

628 always possible, independently of the language context. It is never

629 implicit: a popup will show up unconditionally.

631 * Additional abbreviations for syntactic completion may be specified in

632 $ISABELLE_HOME/etc/abbrevs and $ISABELLE_HOME_USER/etc/abbrevs, with

633 support for simple templates using ASCII 007 (bell) as placeholder.

635 * Symbols \<oplus>, \<Oplus>, \<otimes>, \<Otimes>, \<odot>, \<Odot>, \<ominus>, \<oslash> no longer provide abbreviations for

636 completion like "+o", "*o", ".o" etc. -- due to conflicts with other

637 ASCII syntax. INCOMPATIBILITY, use plain backslash-completion or define

638 suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.

640 * Action "isabelle-emph" (with keyboard shortcut C+e LEFT) controls

641 emphasized text style; the effect is visible in document output, not in

642 the editor.

644 * Action "isabelle-reset" now uses keyboard shortcut C+e BACK_SPACE,

645 instead of former C+e LEFT.

647 * The command-line tool "isabelle jedit" and the isabelle.Main

648 application wrapper treat the default $USER_HOME/Scratch.thy more

649 uniformly, and allow the dummy file argument ":" to open an empty buffer

650 instead.

652 * New command-line tool "isabelle jedit_client" allows to connect to an

653 already running Isabelle/jEdit process. This achieves the effect of

654 single-instance applications seen on common GUI desktops.

656 * The default look-and-feel for Linux is the traditional "Metal", which

657 works better with GUI scaling for very high-resolution displays (e.g.

658 4K). Moreover, it is generally more robust than "Nimbus".

660 * Update to jedit-5.3.0, with improved GUI scaling and support of

661 high-resolution displays (e.g. 4K).

663 * The main Isabelle executable is managed as single-instance Desktop

664 application uniformly on all platforms: Linux, Windows, Mac OS X.

667 *** Document preparation ***

669 * Commands 'paragraph' and 'subparagraph' provide additional section

670 headings. Thus there are 6 levels of standard headings, as in HTML.

672 * Command 'text_raw' has been clarified: input text is processed as in

673 'text' (with antiquotations and control symbols). The key difference is

674 the lack of the surrounding isabelle markup environment in output.

676 * Text is structured in paragraphs and nested lists, using notation that

677 is similar to Markdown. The control symbols for list items are as

678 follows:

680 \<^item> itemize

681 \<^enum> enumerate

682 \<^descr> description

684 * There is a new short form for antiquotations with a single argument

685 that is a cartouche: \<^name>\<open>...\<close> is equivalent to @{name \<open>...\<close>} and

686 \<open>...\<close> without control symbol is equivalent to @{cartouche \<open>...\<close>}.

687 \<^name> without following cartouche is equivalent to @{name}. The

688 standard Isabelle fonts provide glyphs to render important control

689 symbols, e.g. "\<^verbatim>", "\<^emph>", "\<^bold>".

691 * Antiquotations @{noindent}, @{smallskip}, @{medskip}, @{bigskip} with

692 corresponding control symbols \<^noindent>, \<^smallskip>, \<^medskip>, \<^bigskip> specify spacing formally, using

693 standard LaTeX macros of the same names.

695 * Antiquotation @{cartouche} in Isabelle/Pure is the same as @{text}.

696 Consequently, \<open>...\<close> without any decoration prints literal quasi-formal

697 text. Command-line tool "isabelle update_cartouches -t" helps to update

698 old sources, by approximative patching of the content of string and

699 cartouche tokens seen in theory sources.

701 * The @{text} antiquotation now ignores the antiquotation option

702 "source". The given text content is output unconditionally, without any

703 surrounding quotes etc. Subtle INCOMPATIBILITY, put quotes into the

704 argument where they are really intended, e.g. @{text \<open>"foo"\<close>}. Initial

705 or terminal spaces are ignored.

707 * Antiquotations @{emph} and @{bold} output LaTeX source recursively,

708 adding appropriate text style markup. These may be used in the short

709 form \<^emph>\<open>...\<close> and \<^bold>\<open>...\<close>.

711 * Document antiquotation @{footnote} outputs LaTeX source recursively,

712 marked as \footnote{}. This may be used in the short form \<^footnote>\<open>...\<close>.

714 * Antiquotation @{verbatim [display]} supports option "indent".

716 * Antiquotation @{theory_text} prints uninterpreted theory source text

717 (Isar outer syntax with command keywords etc.). This may be used in the

718 short form \<^theory_text>\<open>...\<close>. @{theory_text [display]} supports option "indent".

720 * Antiquotation @{doc ENTRY} provides a reference to the given

721 documentation, with a hyperlink in the Prover IDE.

723 * Antiquotations @{command}, @{method}, @{attribute} print checked

724 entities of the Isar language.

726 * HTML presentation uses the standard IsabelleText font and Unicode

727 rendering of Isabelle symbols like Isabelle/Scala/jEdit. The former

728 print mode "HTML" loses its special meaning.

731 *** Isar ***

733 * Local goals ('have', 'show', 'hence', 'thus') allow structured rule

734 statements like fixes/assumes/shows in theorem specifications, but the

735 notation is postfix with keywords 'if' (or 'when') and 'for'. For

736 example:

738 have result: "C x y"

739 if "A x" and "B y"

740 for x :: 'a and y :: 'a

741 <proof>

743 The local assumptions are bound to the name "that". The result is

744 exported from context of the statement as usual. The above roughly

745 corresponds to a raw proof block like this:

747 {

748 fix x :: 'a and y :: 'a

749 assume that: "A x" "B y"

750 have "C x y" <proof>

751 }

752 note result = this

754 The keyword 'when' may be used instead of 'if', to indicate 'presume'

755 instead of 'assume' above.

757 * Assumptions ('assume', 'presume') allow structured rule statements

758 using 'if' and 'for', similar to 'have' etc. above. For example:

760 assume result: "C x y"

761 if "A x" and "B y"

762 for x :: 'a and y :: 'a

764 This assumes "\<And>x y::'a. A x \<Longrightarrow> B y \<Longrightarrow> C x y" and produces a general

765 result as usual: "A ?x \<Longrightarrow> B ?y \<Longrightarrow> C ?x ?y".

767 Vacuous quantification in assumptions is omitted, i.e. a for-context

768 only effects propositions according to actual use of variables. For

769 example:

771 assume "A x" and "B y" for x and y

773 is equivalent to:

775 assume "\<And>x. A x" and "\<And>y. B y"

777 * The meaning of 'show' with Pure rule statements has changed: premises

778 are treated in the sense of 'assume', instead of 'presume'. This means,

779 a goal like "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" can be solved completely as

780 follows:

782 show "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"

784 or:

786 show "C x" if "A x" "B x" for x

788 Rare INCOMPATIBILITY, the old behaviour may be recovered as follows:

790 show "C x" when "A x" "B x" for x

792 * New command 'consider' states rules for generalized elimination and

793 case splitting. This is like a toplevel statement "theorem obtains" used

794 within a proof body; or like a multi-branch 'obtain' without activation

795 of the local context elements yet.

797 * Proof method "cases" allows to specify the rule as first entry of

798 chained facts. This is particularly useful with 'consider':

800 consider (a) A | (b) B | (c) C <proof>

801 then have something

802 proof cases

803 case a

804 then show ?thesis <proof>

805 next

806 case b

807 then show ?thesis <proof>

808 next

809 case c

810 then show ?thesis <proof>

811 qed

813 * Command 'case' allows fact name and attribute specification like this:

815 case a: (c xs)

816 case a [attributes]: (c xs)

818 Facts that are introduced by invoking the case context are uniformly

819 qualified by "a"; the same name is used for the cumulative fact. The old

820 form "case (c xs) [attributes]" is no longer supported. Rare

821 INCOMPATIBILITY, need to adapt uses of case facts in exotic situations,

822 and always put attributes in front.

824 * The standard proof method of commands 'proof' and '..' is now called

825 "standard" to make semantically clear what it is; the old name "default"

826 is still available as legacy for some time. Documentation now explains

827 '..' more accurately as "by standard" instead of "by rule".

829 * Nesting of Isar goal structure has been clarified: the context after

830 the initial backwards refinement is retained for the whole proof, within

831 all its context sections (as indicated via 'next'). This is e.g.

832 relevant for 'using', 'including', 'supply':

834 have "A \<and> A" if a: A for A

835 supply [simp] = a

836 proof

837 show A by simp

838 next

839 show A by simp

840 qed

842 * Command 'obtain' binds term abbreviations (via 'is' patterns) in the

843 proof body as well, abstracted over relevant parameters.

845 * Improved type-inference for theorem statement 'obtains': separate

846 parameter scope for of each clause.

848 * Term abbreviations via 'is' patterns also work for schematic

849 statements: result is abstracted over unknowns.

851 * Command 'subgoal' allows to impose some structure on backward

852 refinements, to avoid proof scripts degenerating into long of 'apply'

853 sequences. Further explanations and examples are given in the isar-ref

854 manual.

856 * Command 'supply' supports fact definitions during goal refinement

857 ('apply' scripts).

859 * Proof method "goal_cases" turns the current subgoals into cases within

860 the context; the conclusion is bound to variable ?case in each case. For

861 example:

863 lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"

864 and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"

865 proof goal_cases

866 case (1 x)

867 then show ?case using \<open>A x\<close> \<open>B x\<close> sorry

868 next

869 case (2 y z)

870 then show ?case using \<open>U y\<close> \<open>V z\<close> sorry

871 qed

873 lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"

874 and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"

875 proof goal_cases

876 case prems: 1

877 then show ?case using prems sorry

878 next

879 case prems: 2

880 then show ?case using prems sorry

881 qed

883 * The undocumented feature of implicit cases goal1, goal2, goal3, etc.

884 is marked as legacy, and will be removed eventually. The proof method

885 "goals" achieves a similar effect within regular Isar; often it can be

886 done more adequately by other means (e.g. 'consider').

888 * The vacuous fact "TERM x" may be established "by fact" or as `TERM x`

889 as well, not just "by this" or "." as before.

891 * Method "sleep" succeeds after a real-time delay (in seconds). This is

892 occasionally useful for demonstration and testing purposes.

895 *** Pure ***

897 * Qualifiers in locale expressions default to mandatory ('!') regardless

898 of the command. Previously, for 'locale' and 'sublocale' the default was

899 optional ('?'). The old synatx '!' has been discontinued.

900 INCOMPATIBILITY, remove '!' and add '?' as required.

902 * Keyword 'rewrites' identifies rewrite morphisms in interpretation

903 commands. Previously, the keyword was 'where'. INCOMPATIBILITY.

905 * More gentle suppression of syntax along locale morphisms while

906 printing terms. Previously 'abbreviation' and 'notation' declarations

907 would be suppressed for morphisms except term identity. Now

908 'abbreviation' is also kept for morphims that only change the involved

909 parameters, and only 'notation' is suppressed. This can be of great help

910 when working with complex locale hierarchies, because proof states are

911 displayed much more succinctly. It also means that only notation needs

912 to be redeclared if desired, as illustrated by this example:

914 locale struct = fixes composition :: "'a => 'a => 'a" (infixl "\<cdot>" 65)

915 begin

916 definition derived (infixl "\<odot>" 65) where ...

917 end

919 locale morphism =

920 left: struct composition + right: struct composition'

921 for composition (infix "\<cdot>" 65) and composition' (infix "\<cdot>''" 65)

922 begin

923 notation right.derived ("\<odot>''")

924 end

926 * Command 'global_interpretation' issues interpretations into global

927 theories, with optional rewrite definitions following keyword 'defines'.

929 * Command 'sublocale' accepts optional rewrite definitions after keyword

930 'defines'.

932 * Command 'permanent_interpretation' has been discontinued. Use

933 'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.

935 * Command 'print_definitions' prints dependencies of definitional

936 specifications. This functionality used to be part of 'print_theory'.

938 * Configuration option rule_insts_schematic has been discontinued

939 (intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.

941 * Abbreviations in type classes now carry proper sort constraint. Rare

942 INCOMPATIBILITY in situations where the previous misbehaviour has been

943 exploited.

945 * Refinement of user-space type system in type classes: pseudo-local

946 operations behave more similar to abbreviations. Potential

947 INCOMPATIBILITY in exotic situations.

950 *** HOL ***

952 * The 'typedef' command has been upgraded from a partially checked

953 "axiomatization", to a full definitional specification that takes the

954 global collection of overloaded constant / type definitions into

955 account. Type definitions with open dependencies on overloaded

956 definitions need to be specified as "typedef (overloaded)". This

957 provides extra robustness in theory construction. Rare INCOMPATIBILITY.

959 * Qualification of various formal entities in the libraries is done more

960 uniformly via "context begin qualified definition ... end" instead of

961 old-style "hide_const (open) ...". Consequently, both the defined

962 constant and its defining fact become qualified, e.g. Option.is_none and

963 Option.is_none_def. Occasional INCOMPATIBILITY in applications.

965 * Some old and rarely used ASCII replacement syntax has been removed.

966 INCOMPATIBILITY, standard syntax with symbols should be used instead.

967 The subsequent commands help to reproduce the old forms, e.g. to

968 simplify porting old theories:

970 notation iff (infixr "<->" 25)

972 notation Times (infixr "<*>" 80)

974 type_notation Map.map (infixr "~=>" 0)

975 notation Map.map_comp (infixl "o'_m" 55)

977 type_notation FinFun.finfun ("(_ =>f /_)" [22, 21] 21)

979 notation FuncSet.funcset (infixr "->" 60)

980 notation FuncSet.extensional_funcset (infixr "->\<^sub>E" 60)

982 notation Omega_Words_Fun.conc (infixr "conc" 65)

984 notation Preorder.equiv ("op ~~")

985 and Preorder.equiv ("(_/ ~~ _)" [51, 51] 50)

987 notation (in topological_space) tendsto (infixr "--->" 55)

988 notation (in topological_space) LIMSEQ ("((_)/ ----> (_))" [60, 60] 60)

989 notation LIM ("((_)/ -- (_)/ --> (_))" [60, 0, 60] 60)

991 notation NSA.approx (infixl "@=" 50)

992 notation NSLIMSEQ ("((_)/ ----NS> (_))" [60, 60] 60)

993 notation NSLIM ("((_)/ -- (_)/ --NS> (_))" [60, 0, 60] 60)

995 * The alternative notation "\<Colon>" for type and sort constraints has been

996 removed: in LaTeX document output it looks the same as "::".

997 INCOMPATIBILITY, use plain "::" instead.

999 * Commands 'inductive' and 'inductive_set' work better when names for

1000 intro rules are omitted: the "cases" and "induct" rules no longer

1001 declare empty case_names, but no case_names at all. This allows to use

1002 numbered cases in proofs, without requiring method "goal_cases".

1004 * Inductive definitions ('inductive', 'coinductive', etc.) expose

1005 low-level facts of the internal construction only if the option

1006 "inductive_internals" is enabled. This refers to the internal predicate

1007 definition and its monotonicity result. Rare INCOMPATIBILITY.

1009 * Recursive function definitions ('fun', 'function', 'partial_function')

1010 expose low-level facts of the internal construction only if the option

1011 "function_internals" is enabled. Its internal inductive definition is

1012 also subject to "inductive_internals". Rare INCOMPATIBILITY.

1014 * BNF datatypes ('datatype', 'codatatype', etc.) expose low-level facts

1015 of the internal construction only if the option "bnf_internals" is

1016 enabled. This supersedes the former option "bnf_note_all". Rare

1017 INCOMPATIBILITY.

1019 * Combinator to represent case distinction on products is named

1020 "case_prod", uniformly, discontinuing any input aliasses. Very popular

1021 theorem aliasses have been retained.

1023 Consolidated facts:

1024 PairE ~> prod.exhaust

1025 Pair_eq ~> prod.inject

1026 pair_collapse ~> prod.collapse

1027 Pair_fst_snd_eq ~> prod_eq_iff

1028 split_twice ~> prod.case_distrib

1029 split_weak_cong ~> prod.case_cong_weak

1030 split_split ~> prod.split

1031 split_split_asm ~> prod.split_asm

1032 splitI ~> case_prodI

1033 splitD ~> case_prodD

1034 splitI2 ~> case_prodI2

1035 splitI2' ~> case_prodI2'

1036 splitE ~> case_prodE

1037 splitE' ~> case_prodE'

1038 split_pair ~> case_prod_Pair

1039 split_eta ~> case_prod_eta

1040 split_comp ~> case_prod_comp

1041 mem_splitI ~> mem_case_prodI

1042 mem_splitI2 ~> mem_case_prodI2

1043 mem_splitE ~> mem_case_prodE

1044 The_split ~> The_case_prod

1045 cond_split_eta ~> cond_case_prod_eta

1046 Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE

1047 Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI

1048 in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq

1049 Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD

1050 Collect_split_Grp_inD ~> Collect_case_prod_Grp_in

1051 Domain_Collect_split ~> Domain_Collect_case_prod

1052 Image_Collect_split ~> Image_Collect_case_prod

1053 Range_Collect_split ~> Range_Collect_case_prod

1054 Eps_split ~> Eps_case_prod

1055 Eps_split_eq ~> Eps_case_prod_eq

1056 split_rsp ~> case_prod_rsp

1057 curry_split ~> curry_case_prod

1058 split_curry ~> case_prod_curry

1060 Changes in structure HOLogic:

1061 split_const ~> case_prod_const

1062 mk_split ~> mk_case_prod

1063 mk_psplits ~> mk_ptupleabs

1064 strip_psplits ~> strip_ptupleabs

1066 INCOMPATIBILITY.

1068 * The coercions to type 'real' have been reorganised. The function

1069 'real' is no longer overloaded, but has type 'nat => real' and

1070 abbreviates of_nat for that type. Also 'real_of_int :: int => real'

1071 abbreviates of_int for that type. Other overloaded instances of 'real'

1072 have been replaced by 'real_of_ereal' and 'real_of_float'.

1074 Consolidated facts (among others):

1075 real_of_nat_le_iff -> of_nat_le_iff

1076 real_of_nat_numeral of_nat_numeral

1077 real_of_int_zero of_int_0

1078 real_of_nat_zero of_nat_0

1079 real_of_one of_int_1

1080 real_of_int_add of_int_add

1081 real_of_nat_add of_nat_add

1082 real_of_int_diff of_int_diff

1083 real_of_nat_diff of_nat_diff

1084 floor_subtract floor_diff_of_int

1085 real_of_int_inject of_int_eq_iff

1086 real_of_int_gt_zero_cancel_iff of_int_0_less_iff

1087 real_of_int_ge_zero_cancel_iff of_int_0_le_iff

1088 real_of_nat_ge_zero of_nat_0_le_iff

1089 real_of_int_ceiling_ge le_of_int_ceiling

1090 ceiling_less_eq ceiling_less_iff

1091 ceiling_le_eq ceiling_le_iff

1092 less_floor_eq less_floor_iff

1093 floor_less_eq floor_less_iff

1094 floor_divide_eq_div floor_divide_of_int_eq

1095 real_of_int_zero_cancel of_nat_eq_0_iff

1096 ceiling_real_of_int ceiling_of_int

1098 INCOMPATIBILITY.

1100 * Theory Map: lemma map_of_is_SomeD was a clone of map_of_SomeD and has

1101 been removed. INCOMPATIBILITY.

1103 * Quickcheck setup for finite sets.

1105 * Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.

1107 * Sledgehammer:

1108 - The MaSh relevance filter has been sped up.

1109 - Proof reconstruction has been improved, to minimize the incidence of

1110 cases where Sledgehammer gives a proof that does not work.

1111 - Auto Sledgehammer now minimizes and preplays the results.

1112 - Handle Vampire 4.0 proof output without raising exception.

1113 - Eliminated "MASH" environment variable. Use the "MaSh" option in

1114 Isabelle/jEdit instead. INCOMPATIBILITY.

1115 - Eliminated obsolete "blocking" option and related subcommands.

1117 * Nitpick:

1118 - Fixed soundness bug in translation of "finite" predicate.

1119 - Fixed soundness bug in "destroy_constrs" optimization.

1120 - Fixed soundness bug in translation of "rat" type.

1121 - Removed "check_potential" and "check_genuine" options.

1122 - Eliminated obsolete "blocking" option.

1124 * (Co)datatype package:

1125 - New commands "lift_bnf" and "copy_bnf" for lifting (copying) a BNF

1126 structure on the raw type to an abstract type defined using typedef.

1127 - Always generate "case_transfer" theorem.

1128 - For mutual types, generate slightly stronger "rel_induct",

1129 "rel_coinduct", and "coinduct" theorems. INCOMPATIBLITY.

1130 - Allow discriminators and selectors with the same name as the type

1131 being defined.

1132 - Avoid various internal name clashes (e.g., 'datatype f = f').

1134 * Transfer: new methods for interactive debugging of 'transfer' and

1135 'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',

1136 'transfer_prover_start' and 'transfer_prover_end'.

1138 * New diagnostic command print_record for displaying record definitions.

1140 * Division on integers is bootstrapped directly from division on

1141 naturals and uses generic numeral algorithm for computations. Slight

1142 INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former

1143 simprocs binary_int_div and binary_int_mod

1145 * Tightened specification of class semiring_no_zero_divisors. Minor

1146 INCOMPATIBILITY.

1148 * Class algebraic_semidom introduces common algebraic notions of

1149 integral (semi)domains, particularly units. Although logically subsumed

1150 by fields, is is not a super class of these in order not to burden

1151 fields with notions that are trivial there.

1153 * Class normalization_semidom specifies canonical representants for

1154 equivalence classes of associated elements in an integral (semi)domain.

1155 This formalizes associated elements as well.

1157 * Abstract specification of gcd/lcm operations in classes semiring_gcd,

1158 semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute

1159 and gcd_int.commute are subsumed by gcd.commute, as well as

1160 gcd_nat.assoc and gcd_int.assoc by gcd.assoc.

1162 * Former constants Fields.divide (_ / _) and Divides.div (_ div _) are

1163 logically unified to Rings.divide in syntactic type class Rings.divide,

1164 with infix syntax (_ div _). Infix syntax (_ / _) for field division is

1165 added later as abbreviation in class Fields.inverse. INCOMPATIBILITY,

1166 instantiations must refer to Rings.divide rather than the former

1167 separate constants, hence infix syntax (_ / _) is usually not available

1168 during instantiation.

1170 * New cancellation simprocs for boolean algebras to cancel complementary

1171 terms for sup and inf. For example, "sup x (sup y (- x))" simplifies to

1172 "top". INCOMPATIBILITY.

1174 * Class uniform_space introduces uniform spaces btw topological spaces

1175 and metric spaces. Minor INCOMPATIBILITY: open_<type>_def needs to be

1176 introduced in the form of an uniformity. Some constants are more general

1177 now, it may be necessary to add type class constraints.

1179 open_real_def \<leadsto> open_dist

1180 open_complex_def \<leadsto> open_dist

1182 * Library/Monad_Syntax: notation uses symbols \<bind> and \<then>. INCOMPATIBILITY.

1184 * Library/Multiset:

1185 - Renamed multiset inclusion operators:

1186 < ~> <#

1187 > ~> >#

1188 <= ~> <=#

1189 >= ~> >=#

1190 \<le> ~> \<le>#

1191 \<ge> ~> \<ge>#

1192 INCOMPATIBILITY.

1193 - Added multiset inclusion operator syntax:

1194 \<subset>#

1195 \<subseteq>#

1196 \<supset>#

1197 \<supseteq>#

1198 - "'a multiset" is no longer an instance of the "order",

1199 "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",

1200 "semilattice_inf", and "semilattice_sup" type classes. The theorems

1201 previously provided by these type classes (directly or indirectly)

1202 are now available through the "subset_mset" interpretation

1203 (e.g. add_mono ~> subset_mset.add_mono).

1204 INCOMPATIBILITY.

1205 - Renamed conversions:

1206 multiset_of ~> mset

1207 multiset_of_set ~> mset_set

1208 set_of ~> set_mset

1209 INCOMPATIBILITY

1210 - Renamed lemmas:

1211 mset_le_def ~> subseteq_mset_def

1212 mset_less_def ~> subset_mset_def

1213 less_eq_multiset.rep_eq ~> subseteq_mset_def

1214 INCOMPATIBILITY

1215 - Removed lemmas generated by lift_definition:

1216 less_eq_multiset.abs_eq, less_eq_multiset.rsp,

1217 less_eq_multiset.transfer, less_eq_multiset_def

1218 INCOMPATIBILITY

1220 * Library/Omega_Words_Fun: Infinite words modeled as functions nat \<Rightarrow> 'a.

1222 * Library/Bourbaki_Witt_Fixpoint: Added formalisation of the

1223 Bourbaki-Witt fixpoint theorem for increasing functions in

1224 chain-complete partial orders.

1226 * Library/Old_Recdef: discontinued obsolete 'defer_recdef' command.

1227 Minor INCOMPATIBILITY, use 'function' instead.

1229 * Library/Periodic_Fun: a locale that provides convenient lemmas for

1230 periodic functions.

1232 * Library/Formal_Power_Series: proper definition of division (with

1233 remainder) for formal power series; instances for Euclidean Ring and

1234 GCD.

1236 * HOL-Imperative_HOL: obsolete theory Legacy_Mrec has been removed.

1238 * HOL-Statespace: command 'statespace' uses mandatory qualifier for

1239 import of parent, as for general 'locale' expressions. INCOMPATIBILITY,

1240 remove '!' and add '?' as required.

1242 * HOL-Decision_Procs: The "approximation" method works with "powr"

1243 (exponentiation on real numbers) again.

1245 * HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour

1246 integrals (= complex path integrals), Cauchy's integral theorem, winding

1247 numbers and Cauchy's integral formula, Liouville theorem, Fundamental

1248 Theorem of Algebra. Ported from HOL Light.

1250 * HOL-Multivariate_Analysis: topological concepts such as connected

1251 components, homotopic paths and the inside or outside of a set.

1253 * HOL-Multivariate_Analysis: radius of convergence of power series and

1254 various summability tests; Harmonic numbers and the Euler–Mascheroni

1255 constant; the Generalised Binomial Theorem; the complex and real

1256 Gamma/log-Gamma/Digamma/ Polygamma functions and their most important

1257 properties.

1259 * HOL-Probability: The central limit theorem based on Levy's uniqueness

1260 and continuity theorems, weak convergence, and characterisitc functions.

1262 * HOL-Data_Structures: new and growing session of standard data

1263 structures.

1266 *** ML ***

1268 * The following combinators for low-level profiling of the ML runtime

1269 system are available:

1271 profile_time (*CPU time*)

1272 profile_time_thread (*CPU time on this thread*)

1273 profile_allocations (*overall heap allocations*)

1275 * Antiquotation @{undefined} or \<^undefined> inlines (raise Match).

1277 * Antiquotation @{method NAME} inlines the (checked) name of the given

1278 Isar proof method.

1280 * Pretty printing of Poly/ML compiler output in Isabelle has been

1281 improved: proper treatment of break offsets and blocks with consistent

1282 breaks.

1284 * The auxiliary module Pure/display.ML has been eliminated. Its

1285 elementary thm print operations are now in Pure/more_thm.ML and thus

1286 called Thm.pretty_thm, Thm.string_of_thm etc. INCOMPATIBILITY.

1288 * Simproc programming interfaces have been simplified:

1289 Simplifier.make_simproc and Simplifier.define_simproc supersede various

1290 forms of Simplifier.mk_simproc, Simplifier.simproc_global etc. Note that

1291 term patterns for the left-hand sides are specified with implicitly

1292 fixed variables, like top-level theorem statements. INCOMPATIBILITY.

1294 * Instantiation rules have been re-organized as follows:

1296 Thm.instantiate (*low-level instantiation with named arguments*)

1297 Thm.instantiate' (*version with positional arguments*)

1299 Drule.infer_instantiate (*instantiation with type inference*)

1300 Drule.infer_instantiate' (*version with positional arguments*)

1302 The LHS only requires variable specifications, instead of full terms.

1303 Old cterm_instantiate is superseded by infer_instantiate.

1304 INCOMPATIBILITY, need to re-adjust some ML names and types accordingly.

1306 * Old tactic shorthands atac, rtac, etac, dtac, ftac have been

1307 discontinued. INCOMPATIBILITY, use regular assume_tac, resolve_tac etc.

1308 instead (with proper context).

1310 * Thm.instantiate (and derivatives) no longer require the LHS of the

1311 instantiation to be certified: plain variables are given directly.

1313 * Subgoal.SUBPROOF and Subgoal.FOCUS combinators use anonymous

1314 quasi-bound variables (like the Simplifier), instead of accidentally

1315 named local fixes. This has the potential to improve stability of proof

1316 tools, but can also cause INCOMPATIBILITY for tools that don't observe

1317 the proof context discipline.

1319 * Isar proof methods are based on a slightly more general type

1320 context_tactic, which allows to change the proof context dynamically

1321 (e.g. to update cases) and indicate explicit Seq.Error results. Former

1322 METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are

1323 provided in src/Pure/Isar/method.ML for convenience. INCOMPATIBILITY.

1326 *** System ***

1328 * Command-line tool "isabelle console" enables print mode "ASCII".

1330 * Command-line tool "isabelle update_then" expands old Isar command

1331 conflations:

1333 hence ~> then have

1334 thus ~> then show

1336 This syntax is more orthogonal and improves readability and

1337 maintainability of proofs.

1339 * Global session timeout is multiplied by timeout_scale factor. This

1340 allows to adjust large-scale tests (e.g. AFP) to overall hardware

1341 performance.

1343 * Property values in etc/symbols may contain spaces, if written with the

1344 replacement character "␣" (Unicode point 0x2324). For example:

1346 \<star> code: 0x0022c6 group: operator font: Deja␣Vu␣Sans␣Mono

1348 * Java runtime environment for x86_64-windows allows to use larger heap

1349 space.

1351 * Java runtime options are determined separately for 32bit vs. 64bit

1352 platforms as follows.

1354 - Isabelle desktop application: platform-specific files that are

1355 associated with the main app bundle

1357 - isabelle jedit: settings

1358 JEDIT_JAVA_SYSTEM_OPTIONS

1359 JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64

1361 - isabelle build: settings

1362 ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64

1364 * Bash shell function "jvmpath" has been renamed to "platform_path": it

1365 is relevant both for Poly/ML and JVM processes.

1367 * Poly/ML default platform architecture may be changed from 32bit to

1368 64bit via system option ML_system_64. A system restart (and rebuild) is

1369 required after change.

1371 * Poly/ML 5.6 runs natively on x86-windows and x86_64-windows, which

1372 both allow larger heap space than former x86-cygwin.

1374 * Heap images are 10-15% smaller due to less wasteful persistent theory

1375 content (using ML type theory_id instead of theory);

1379 New in Isabelle2015 (May 2015)

1380 ------------------------------

1382 *** General ***

1384 * Local theory specification commands may have a 'private' or

1385 'qualified' modifier to restrict name space accesses to the local scope,

1386 as provided by some "context begin ... end" block. For example:

1388 context

1389 begin

1391 private definition ...

1392 private lemma ...

1394 qualified definition ...

1395 qualified lemma ...

1397 lemma ...

1398 theorem ...

1400 end

1402 * Command 'experiment' opens an anonymous locale context with private

1403 naming policy.

1405 * Command 'notepad' requires proper nesting of begin/end and its proof

1406 structure in the body: 'oops' is no longer supported here. Minor

1407 INCOMPATIBILITY, use 'sorry' instead.

1409 * Command 'named_theorems' declares a dynamic fact within the context,

1410 together with an attribute to maintain the content incrementally. This

1411 supersedes functor Named_Thms in Isabelle/ML, but with a subtle change

1412 of semantics due to external visual order vs. internal reverse order.

1414 * 'find_theorems': search patterns which are abstractions are

1415 schematically expanded before search. Search results match the naive

1416 expectation more closely, particularly wrt. abbreviations.

1417 INCOMPATIBILITY.

1419 * Commands 'method_setup' and 'attribute_setup' now work within a local

1420 theory context.

1422 * Outer syntax commands are managed authentically within the theory

1423 context, without implicit global state. Potential for accidental

1424 INCOMPATIBILITY, make sure that required theories are really imported.

1426 * Historical command-line terminator ";" is no longer accepted (and

1427 already used differently in Isar). Minor INCOMPATIBILITY, use "isabelle

1428 update_semicolons" to remove obsolete semicolons from old theory

1429 sources.

1431 * Structural composition of proof methods (meth1; meth2) in Isar

1432 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.

1434 * The Eisbach proof method language allows to define new proof methods

1435 by combining existing ones with their usual syntax. The "match" proof

1436 method provides basic fact/term matching in addition to

1437 premise/conclusion matching through Subgoal.focus, and binds fact names

1438 from matches as well as term patterns within matches. The Isabelle

1439 documentation provides an entry "eisbach" for the Eisbach User Manual.

1440 Sources and various examples are in ~~/src/HOL/Eisbach/.

1443 *** Prover IDE -- Isabelle/Scala/jEdit ***

1445 * Improved folding mode "isabelle" based on Isar syntax. Alternatively,

1446 the "sidekick" mode may be used for document structure.

1448 * Extended bracket matching based on Isar language structure. System

1449 option jedit_structure_limit determines maximum number of lines to scan

1450 in the buffer.

1452 * Support for BibTeX files: context menu, context-sensitive token

1453 marker, SideKick parser.

1455 * Document antiquotation @{cite} provides formal markup, which is

1456 interpreted semi-formally based on .bib files that happen to be open in

1457 the editor (hyperlinks, completion etc.).

1459 * Less waste of vertical space via negative line spacing (see Global

1460 Options / Text Area).

1462 * Improved graphview panel with optional output of PNG or PDF, for

1463 display of 'thy_deps', 'class_deps' etc.

1465 * The commands 'thy_deps' and 'class_deps' allow optional bounds to

1466 restrict the visualized hierarchy.

1468 * Improved scheduling for asynchronous print commands (e.g. provers

1469 managed by the Sledgehammer panel) wrt. ongoing document processing.

1472 *** Document preparation ***

1474 * Document markup commands 'chapter', 'section', 'subsection',

1475 'subsubsection', 'text', 'txt', 'text_raw' work uniformly in any

1476 context, even before the initial 'theory' command. Obsolete proof

1477 commands 'sect', 'subsect', 'subsubsect', 'txt_raw' have been

1478 discontinued, use 'section', 'subsection', 'subsubsection', 'text_raw'

1479 instead. The old 'header' command is still retained for some time, but

1480 should be replaced by 'chapter', 'section' etc. (using "isabelle

1481 update_header"). Minor INCOMPATIBILITY.

1483 * Official support for "tt" style variants, via \isatt{...} or

1484 \begin{isabellett}...\end{isabellett}. The somewhat fragile \verb or

1485 verbatim environment of LaTeX is no longer used. This allows @{ML} etc.

1486 as argument to other macros (such as footnotes).

1488 * Document antiquotation @{verbatim} prints ASCII text literally in "tt"

1489 style.

1491 * Discontinued obsolete option "document_graph": session_graph.pdf is

1492 produced unconditionally for HTML browser_info and PDF-LaTeX document.

1494 * Diagnostic commands and document markup commands within a proof do not

1495 affect the command tag for output. Thus commands like 'thm' are subject

1496 to proof document structure, and no longer "stick out" accidentally.

1497 Commands 'text' and 'txt' merely differ in the LaTeX style, not their

1498 tags. Potential INCOMPATIBILITY in exotic situations.

1500 * System option "pretty_margin" is superseded by "thy_output_margin",

1501 which is also accessible via document antiquotation option "margin".

1502 Only the margin for document output may be changed, but not the global

1503 pretty printing: that is 76 for plain console output, and adapted

1504 dynamically in GUI front-ends. Implementations of document

1505 antiquotations need to observe the margin explicitly according to

1506 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.

1508 * Specification of 'document_files' in the session ROOT file is

1509 mandatory for document preparation. The legacy mode with implicit

1510 copying of the document/ directory is no longer supported. Minor

1511 INCOMPATIBILITY.

1514 *** Pure ***

1516 * Proof methods with explicit instantiation ("rule_tac", "subgoal_tac"

1517 etc.) allow an optional context of local variables ('for' declaration):

1518 these variables become schematic in the instantiated theorem; this

1519 behaviour is analogous to 'for' in attributes "where" and "of".

1520 Configuration option rule_insts_schematic (default false) controls use

1521 of schematic variables outside the context. Minor INCOMPATIBILITY,

1522 declare rule_insts_schematic = true temporarily and update to use local

1523 variable declarations or dummy patterns instead.

1525 * Explicit instantiation via attributes "where", "of", and proof methods

1526 "rule_tac" with derivatives like "subgoal_tac" etc. admit dummy patterns

1527 ("_") that stand for anonymous local variables.

1529 * Generated schematic variables in standard format of exported facts are

1530 incremented to avoid material in the proof context. Rare

1531 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to

1532 different index.

1534 * Lexical separation of signed and unsigned numerals: categories "num"

1535 and "float" are unsigned. INCOMPATIBILITY: subtle change in precedence

1536 of numeral signs, particularly in expressions involving infix syntax

1537 like "(- 1) ^ n".

1539 * Old inner token category "xnum" has been discontinued. Potential

1540 INCOMPATIBILITY for exotic syntax: may use mixfix grammar with "num"

1541 token category instead.

1544 *** HOL ***

1546 * New (co)datatype package:

1547 - The 'datatype_new' command has been renamed 'datatype'. The old

1548 command of that name is now called 'old_datatype' and is provided

1549 by "~~/src/HOL/Library/Old_Datatype.thy". See

1550 'isabelle doc datatypes' for information on porting.

1551 INCOMPATIBILITY.

1552 - Renamed theorems:

1553 disc_corec ~> corec_disc

1554 disc_corec_iff ~> corec_disc_iff

1555 disc_exclude ~> distinct_disc

1556 disc_exhaust ~> exhaust_disc

1557 disc_map_iff ~> map_disc_iff

1558 sel_corec ~> corec_sel

1559 sel_exhaust ~> exhaust_sel

1560 sel_map ~> map_sel

1561 sel_set ~> set_sel

1562 sel_split ~> split_sel

1563 sel_split_asm ~> split_sel_asm

1564 strong_coinduct ~> coinduct_strong

1565 weak_case_cong ~> case_cong_weak

1566 INCOMPATIBILITY.

1567 - The "no_code" option to "free_constructors", "datatype_new", and

1568 "codatatype" has been renamed "plugins del: code".

1569 INCOMPATIBILITY.

1570 - The rules "set_empty" have been removed. They are easy

1571 consequences of other set rules "by auto".

1572 INCOMPATIBILITY.

1573 - The rule "set_cases" is now registered with the "[cases set]"

1574 attribute. This can influence the behavior of the "cases" proof

1575 method when more than one case rule is applicable (e.g., an

1576 assumption is of the form "w : set ws" and the method "cases w"

1577 is invoked). The solution is to specify the case rule explicitly

1578 (e.g. "cases w rule: widget.exhaust").

1579 INCOMPATIBILITY.

1580 - Renamed theories:

1581 BNF_Comp ~> BNF_Composition

1582 BNF_FP_Base ~> BNF_Fixpoint_Base

1583 BNF_GFP ~> BNF_Greatest_Fixpoint

1584 BNF_LFP ~> BNF_Least_Fixpoint

1585 BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions

1586 Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions

1587 INCOMPATIBILITY.

1588 - Lifting and Transfer setup for basic HOL types sum and prod (also

1589 option) is now performed by the BNF package. Theories Lifting_Sum,

1590 Lifting_Product and Lifting_Option from Main became obsolete and

1591 were removed. Changed definitions of the relators rel_prod and

1592 rel_sum (using inductive).

1593 INCOMPATIBILITY: use rel_prod.simps and rel_sum.simps instead

1594 of rel_prod_def and rel_sum_def.

1595 Minor INCOMPATIBILITY: (rarely used by name) transfer theorem names

1596 changed (e.g. map_prod_transfer ~> prod.map_transfer).

1597 - Parametricity theorems for map functions, relators, set functions,

1598 constructors, case combinators, discriminators, selectors and

1599 (co)recursors are automatically proved and registered as transfer

1600 rules.

1602 * Old datatype package:

1603 - The old 'datatype' command has been renamed 'old_datatype', and

1604 'rep_datatype' has been renamed 'old_rep_datatype'. They are

1605 provided by "~~/src/HOL/Library/Old_Datatype.thy". See

1606 'isabelle doc datatypes' for information on porting.

1607 INCOMPATIBILITY.

1608 - Renamed theorems:

1609 weak_case_cong ~> case_cong_weak

1610 INCOMPATIBILITY.

1611 - Renamed theory:

1612 ~~/src/HOL/Datatype.thy ~> ~~/src/HOL/Library/Old_Datatype.thy

1613 INCOMPATIBILITY.

1615 * Nitpick:

1616 - Fixed soundness bug related to the strict and non-strict subset

1617 operations.

1619 * Sledgehammer:

1620 - CVC4 is now included with Isabelle instead of CVC3 and run by

1621 default.

1622 - Z3 is now always enabled by default, now that it is fully open

1623 source. The "z3_non_commercial" option is discontinued.

1624 - Minimization is now always enabled by default.

1625 Removed sub-command:

1626 min

1627 - Proof reconstruction, both one-liners and Isar, has been

1628 dramatically improved.

1629 - Improved support for CVC4 and veriT.

1631 * Old and new SMT modules:

1632 - The old 'smt' method has been renamed 'old_smt' and moved to

1633 'src/HOL/Library/Old_SMT.thy'. It is provided for compatibility,

1634 until applications have been ported to use the new 'smt' method. For

1635 the method to work, an older version of Z3 (e.g. Z3 3.2 or 4.0) must

1636 be installed, and the environment variable "OLD_Z3_SOLVER" must

1637 point to it.

1638 INCOMPATIBILITY.

1639 - The 'smt2' method has been renamed 'smt'.

1640 INCOMPATIBILITY.

1641 - New option 'smt_reconstruction_step_timeout' to limit the

1642 reconstruction time of Z3 proof steps in the new 'smt' method.

1643 - New option 'smt_statistics' to display statistics of the new 'smt'

1644 method, especially runtime statistics of Z3 proof reconstruction.

1646 * Lifting: command 'lift_definition' allows to execute lifted constants

1647 that have as a return type a datatype containing a subtype. This

1648 overcomes long-time limitations in the area of code generation and

1649 lifting, and avoids tedious workarounds.

1651 * Command and antiquotation "value" provide different evaluation slots

1652 (again), where the previous strategy (NBE after ML) serves as default.

1653 Minor INCOMPATIBILITY.

1655 * Add NO_MATCH-simproc, allows to check for syntactic non-equality.

1657 * field_simps: Use NO_MATCH-simproc for distribution rules, to avoid

1658 non-termination in case of distributing a division. With this change

1659 field_simps is in some cases slightly less powerful, if it fails try to

1660 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.

1662 * Separate class no_zero_divisors has been given up in favour of fully

1663 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.

1665 * Class linordered_semidom really requires no zero divisors.

1666 INCOMPATIBILITY.

1668 * Classes division_ring, field and linordered_field always demand

1669 "inverse 0 = 0". Given up separate classes division_ring_inverse_zero,

1670 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.

1672 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit

1673 additive inverse operation. INCOMPATIBILITY.

1675 * Complex powers and square roots. The functions "ln" and "powr" are now

1676 overloaded for types real and complex, and 0 powr y = 0 by definition.

1677 INCOMPATIBILITY: type constraints may be necessary.

1679 * The functions "sin" and "cos" are now defined for any type of sort

1680 "{real_normed_algebra_1,banach}" type, so in particular on "real" and

1681 "complex" uniformly. Minor INCOMPATIBILITY: type constraints may be

1682 needed.

1684 * New library of properties of the complex transcendental functions sin,

1685 cos, tan, exp, Ln, Arctan, Arcsin, Arccos. Ported from HOL Light.

1687 * The factorial function, "fact", now has type "nat => 'a" (of a sort

1688 that admits numeric types including nat, int, real and complex.

1689 INCOMPATIBILITY: an expression such as "fact 3 = 6" may require a type

1690 constraint, and the combination "real (fact k)" is likely to be

1691 unsatisfactory. If a type conversion is still necessary, then use

1692 "of_nat (fact k)" or "real_of_nat (fact k)".

1694 * Removed functions "natfloor" and "natceiling", use "nat o floor" and

1695 "nat o ceiling" instead. A few of the lemmas have been retained and

1696 adapted: in their names "natfloor"/"natceiling" has been replaced by

1697 "nat_floor"/"nat_ceiling".

1699 * Qualified some duplicated fact names required for boostrapping the

1700 type class hierarchy:

1701 ab_add_uminus_conv_diff ~> diff_conv_add_uminus

1702 field_inverse_zero ~> inverse_zero

1703 field_divide_inverse ~> divide_inverse

1704 field_inverse ~> left_inverse

1705 Minor INCOMPATIBILITY.

1707 * Eliminated fact duplicates:

1708 mult_less_imp_less_right ~> mult_right_less_imp_less

1709 mult_less_imp_less_left ~> mult_left_less_imp_less

1710 Minor INCOMPATIBILITY.

1712 * Fact consolidation: even_less_0_iff is subsumed by

1713 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).

1715 * Generalized and consolidated some theorems concerning divsibility:

1716 dvd_reduce ~> dvd_add_triv_right_iff

1717 dvd_plus_eq_right ~> dvd_add_right_iff

1718 dvd_plus_eq_left ~> dvd_add_left_iff

1719 Minor INCOMPATIBILITY.

1721 * "even" and "odd" are mere abbreviations for "2 dvd _" and "~ 2 dvd _"

1722 and part of theory Main.

1723 even_def ~> even_iff_mod_2_eq_zero

1724 INCOMPATIBILITY.

1726 * Lemma name consolidation: divide_Numeral1 ~> divide_numeral_1. Minor

1727 INCOMPATIBILITY.

1729 * Bootstrap of listsum as special case of abstract product over lists.

1730 Fact rename:

1731 listsum_def ~> listsum.eq_foldr

1732 INCOMPATIBILITY.

1734 * Product over lists via constant "listprod".

1736 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to

1737 Cons_nth_drop_Suc.

1739 * New infrastructure for compiling, running, evaluating and testing

1740 generated code in target languages in HOL/Library/Code_Test. See

1741 HOL/Codegenerator_Test/Code_Test* for examples.

1743 * Library/Multiset:

1744 - Introduced "replicate_mset" operation.

1745 - Introduced alternative characterizations of the multiset ordering in

1746 "Library/Multiset_Order".

1747 - Renamed multiset ordering:

1748 <# ~> #<#

1749 <=# ~> #<=#

1750 \<subset># ~> #\<subset>#

1751 \<subseteq># ~> #\<subseteq>#

1752 INCOMPATIBILITY.

1753 - Introduced abbreviations for ill-named multiset operations:

1754 <#, \<subset># abbreviate < (strict subset)

1755 <=#, \<le>#, \<subseteq># abbreviate <= (subset or equal)

1756 INCOMPATIBILITY.

1757 - Renamed

1758 in_multiset_of ~> in_multiset_in_set

1759 Multiset.fold ~> fold_mset

1760 Multiset.filter ~> filter_mset

1761 INCOMPATIBILITY.

1762 - Removed mcard, is equal to size.

1763 - Added attributes:

1764 image_mset.id [simp]

1765 image_mset_id [simp]

1766 elem_multiset_of_set [simp, intro]

1767 comp_fun_commute_plus_mset [simp]

1768 comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]

1769 in_mset_fold_plus_iff [iff]

1770 set_of_Union_mset [simp]

1771 in_Union_mset_iff [iff]

1772 INCOMPATIBILITY.

1774 * Library/Sum_of_Squares: simplified and improved "sos" method. Always

1775 use local CSDP executable, which is much faster than the NEOS server.

1776 The "sos_cert" functionality is invoked as "sos" with additional

1777 argument. Minor INCOMPATIBILITY.

1779 * HOL-Decision_Procs: New counterexample generator quickcheck

1780 [approximation] for inequalities of transcendental functions. Uses

1781 hardware floating point arithmetic to randomly discover potential

1782 counterexamples. Counterexamples are certified with the "approximation"

1783 method. See HOL/Decision_Procs/ex/Approximation_Quickcheck_Ex.thy for

1784 examples.

1786 * HOL-Probability: Reworked measurability prover

1787 - applies destructor rules repeatedly

1788 - removed application splitting (replaced by destructor rule)

1789 - added congruence rules to rewrite measure spaces under the sets

1790 projection

1792 * New proof method "rewrite" (in theory ~~/src/HOL/Library/Rewrite) for

1793 single-step rewriting with subterm selection based on patterns.

1796 *** ML ***

1798 * Subtle change of name space policy: undeclared entries are now

1799 considered inaccessible, instead of accessible via the fully-qualified

1800 internal name. This mainly affects Name_Space.intern (and derivatives),

1801 which may produce an unexpected Long_Name.hidden prefix. Note that

1802 contemporary applications use the strict Name_Space.check (and

1803 derivatives) instead, which is not affected by the change. Potential

1804 INCOMPATIBILITY in rare applications of Name_Space.intern.

1806 * Subtle change of error semantics of Toplevel.proof_of: regular user

1807 ERROR instead of internal Toplevel.UNDEF.

1809 * Basic combinators map, fold, fold_map, split_list, apply are available

1810 as parameterized antiquotations, e.g. @{map 4} for lists of quadruples.

1812 * Renamed "pairself" to "apply2", in accordance to @{apply 2}.

1813 INCOMPATIBILITY.

1815 * Former combinators NAMED_CRITICAL and CRITICAL for central critical

1816 sections have been discontinued, in favour of the more elementary

1817 Multithreading.synchronized and its high-level derivative

1818 Synchronized.var (which is usually sufficient in applications). Subtle

1819 INCOMPATIBILITY: synchronized access needs to be atomic and cannot be

1820 nested.

1822 * Synchronized.value (ML) is actually synchronized (as in Scala): subtle

1823 change of semantics with minimal potential for INCOMPATIBILITY.

1825 * The main operations to certify logical entities are Thm.ctyp_of and

1826 Thm.cterm_of with a local context; old-style global theory variants are

1827 available as Thm.global_ctyp_of and Thm.global_cterm_of.

1828 INCOMPATIBILITY.

1830 * Elementary operations in module Thm are no longer pervasive.

1831 INCOMPATIBILITY, need to use qualified Thm.prop_of, Thm.cterm_of,

1832 Thm.term_of etc.

1834 * Proper context for various elementary tactics: assume_tac,

1835 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,

1836 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.

1838 * Tactical PARALLEL_ALLGOALS is the most common way to refer to

1839 PARALLEL_GOALS.

1841 * Goal.prove_multi is superseded by the fully general Goal.prove_common,

1842 which also allows to specify a fork priority.

1844 * Antiquotation @{command_spec "COMMAND"} is superseded by

1845 @{command_keyword COMMAND} (usually without quotes and with PIDE

1846 markup). Minor INCOMPATIBILITY.

1848 * Cartouches within ML sources are turned into values of type

1849 Input.source (with formal position information).

1852 *** System ***

1854 * The Isabelle tool "update_cartouches" changes theory files to use

1855 cartouches instead of old-style {* verbatim *} or `alt_string` tokens.

1857 * The Isabelle tool "build" provides new options -X, -k, -x.

1859 * Discontinued old-fashioned "codegen" tool. Code generation can always

1860 be externally triggered using an appropriate ROOT file plus a

1861 corresponding theory. Parametrization is possible using environment

1862 variables, or ML snippets in the most extreme cases. Minor

1863 INCOMPATIBILITY.

1865 * JVM system property "isabelle.threads" determines size of Scala thread

1866 pool, like Isabelle system option "threads" for ML.

1868 * JVM system property "isabelle.laf" determines the default Swing

1869 look-and-feel, via internal class name or symbolic name as in the jEdit

1870 menu Global Options / Appearance.

1872 * Support for Proof General and Isar TTY loop has been discontinued.

1873 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.

1877 New in Isabelle2014 (August 2014)

1878 ---------------------------------

1880 *** General ***

1882 * Support for official Standard ML within the Isabelle context.

1883 Command 'SML_file' reads and evaluates the given Standard ML file.

1884 Toplevel bindings are stored within the theory context; the initial

1885 environment is restricted to the Standard ML implementation of

1886 Poly/ML, without the add-ons of Isabelle/ML. Commands 'SML_import'

1887 and 'SML_export' allow to exchange toplevel bindings between the two

1888 separate environments. See also ~~/src/Tools/SML/Examples.thy for

1889 some examples.

1891 * Standard tactics and proof methods such as "clarsimp", "auto" and

1892 "safe" now preserve equality hypotheses "x = expr" where x is a free

1893 variable. Locale assumptions and chained facts containing "x"

1894 continue to be useful. The new method "hypsubst_thin" and the

1895 configuration option "hypsubst_thin" (within the attribute name space)

1896 restore the previous behavior. INCOMPATIBILITY, especially where

1897 induction is done after these methods or when the names of free and

1898 bound variables clash. As first approximation, old proofs may be

1899 repaired by "using [[hypsubst_thin = true]]" in the critical spot.

1901 * More static checking of proof methods, which allows the system to

1902 form a closure over the concrete syntax. Method arguments should be

1903 processed in the original proof context as far as possible, before

1904 operating on the goal state. In any case, the standard discipline for

1905 subgoal-addressing needs to be observed: no subgoals or a subgoal

1906 number that is out of range produces an empty result sequence, not an

1907 exception. Potential INCOMPATIBILITY for non-conformant tactical

1908 proof tools.

1910 * Lexical syntax (inner and outer) supports text cartouches with

1911 arbitrary nesting, and without escapes of quotes etc. The Prover IDE

1912 supports input via ` (backquote).

1914 * The outer syntax categories "text" (for formal comments and document

1915 markup commands) and "altstring" (for literal fact references) allow

1916 cartouches as well, in addition to the traditional mix of quotations.

1918 * Syntax of document antiquotation @{rail} now uses \<newline> instead

1919 of "\\", to avoid the optical illusion of escaped backslash within

1920 string token. General renovation of its syntax using text cartouches.

1921 Minor INCOMPATIBILITY.

1923 * Discontinued legacy_isub_isup, which was a temporary workaround for

1924 Isabelle/ML in Isabelle2013-1. The prover process no longer accepts

1925 old identifier syntax with \<^isub> or \<^isup>. Potential

1926 INCOMPATIBILITY.

1928 * Document antiquotation @{url} produces markup for the given URL,

1929 which results in an active hyperlink within the text.

1931 * Document antiquotation @{file_unchecked} is like @{file}, but does

1932 not check existence within the file-system.

1934 * Updated and extended manuals: codegen, datatypes, implementation,

1935 isar-ref, jedit, system.

1938 *** Prover IDE -- Isabelle/Scala/jEdit ***

1940 * Improved Document panel: simplified interaction where every single

1941 mouse click (re)opens document via desktop environment or as jEdit

1942 buffer.

1944 * Support for Navigator plugin (with toolbar buttons), with connection

1945 to PIDE hyperlinks.

1947 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.

1948 Open text buffers take precedence over copies within the file-system.

1950 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for

1951 auxiliary ML files.

1953 * Improved syntactic and semantic completion mechanism, with simple

1954 templates, completion language context, name-space completion,

1955 file-name completion, spell-checker completion.

1957 * Refined GUI popup for completion: more robust key/mouse event

1958 handling and propagation to enclosing text area -- avoid loosing

1959 keystrokes with slow / remote graphics displays.

1961 * Completion popup supports both ENTER and TAB (default) to select an

1962 item, depending on Isabelle options.

1964 * Refined insertion of completion items wrt. jEdit text: multiple

1965 selections, rectangular selections, rectangular selection as "tall

1966 caret".

1968 * Integrated spell-checker for document text, comments etc. with

1969 completion popup and context-menu.

1971 * More general "Query" panel supersedes "Find" panel, with GUI access

1972 to commands 'find_theorems' and 'find_consts', as well as print

1973 operations for the context. Minor incompatibility in keyboard

1974 shortcuts etc.: replace action isabelle-find by isabelle-query.

1976 * Search field for all output panels ("Output", "Query", "Info" etc.)

1977 to highlight text via regular expression.

1979 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /

1980 General") allows to specify additional print modes for the prover

1981 process, without requiring old-fashioned command-line invocation of

1982 "isabelle jedit -m MODE".

1984 * More support for remote files (e.g. http) using standard Java

1985 networking operations instead of jEdit virtual file-systems.

1987 * Empty editors buffers that are no longer required (e.g.\ via theory

1988 imports) are automatically removed from the document model.

1990 * Improved monitor panel.

1992 * Improved Console/Scala plugin: more uniform scala.Console output,

1993 more robust treatment of threads and interrupts.

1995 * Improved management of dockable windows: clarified keyboard focus

1996 and window placement wrt. main editor view; optional menu item to

1997 "Detach" a copy where this makes sense.

1999 * New Simplifier Trace panel provides an interactive view of the

2000 simplification process, enabled by the "simp_trace_new" attribute

2001 within the context.

2004 *** Pure ***

2006 * Low-level type-class commands 'classes', 'classrel', 'arities' have

2007 been discontinued to avoid the danger of non-trivial axiomatization

2008 that is not immediately visible. INCOMPATIBILITY, use regular

2009 'instance' command with proof. The required OFCLASS(...) theorem

2010 might be postulated via 'axiomatization' beforehand, or the proof

2011 finished trivially if the underlying class definition is made vacuous

2012 (without any assumptions). See also Isabelle/ML operations

2013 Axclass.class_axiomatization, Axclass.classrel_axiomatization,

2014 Axclass.arity_axiomatization.

2016 * Basic constants of Pure use more conventional names and are always

2017 qualified. Rare INCOMPATIBILITY, but with potentially serious

2018 consequences, notably for tools in Isabelle/ML. The following

2019 renaming needs to be applied:

2021 == ~> Pure.eq

2022 ==> ~> Pure.imp

2023 all ~> Pure.all

2024 TYPE ~> Pure.type

2025 dummy_pattern ~> Pure.dummy_pattern

2027 Systematic porting works by using the following theory setup on a

2028 *previous* Isabelle version to introduce the new name accesses for the

2029 old constants:

2031 setup {*

2032 fn thy => thy

2033 |> Sign.root_path

2034 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="

2035 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"

2036 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"

2037 |> Sign.restore_naming thy

2038 *}

2040 Thus ML antiquotations like @{const_name Pure.eq} may be used already.

2041 Later the application is moved to the current Isabelle version, and

2042 the auxiliary aliases are deleted.

2044 * Attributes "where" and "of" allow an optional context of local

2045 variables ('for' declaration): these variables become schematic in the

2046 instantiated theorem.

2048 * Obsolete attribute "standard" has been discontinued (legacy since

2049 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context

2050 where instantiations with schematic variables are intended (for

2051 declaration commands like 'lemmas' or attributes like "of"). The

2052 following temporary definition may help to port old applications:

2054 attribute_setup standard =

2055 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"

2057 * More thorough check of proof context for goal statements and

2058 attributed fact expressions (concerning background theory, declared

2059 hyps). Potential INCOMPATIBILITY, tools need to observe standard

2060 context discipline. See also Assumption.add_assumes and the more

2061 primitive Thm.assume_hyps.

2063 * Inner syntax token language allows regular quoted strings "..."

2064 (only makes sense in practice, if outer syntax is delimited

2065 differently, e.g. via cartouches).

2067 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,

2068 but the latter is retained some time as Proof General legacy.

2070 * Code generator preprocessor: explicit control of simp tracing on a

2071 per-constant basis. See attribute "code_preproc".

2074 *** HOL ***

2076 * Code generator: enforce case of identifiers only for strict target

2077 language requirements. INCOMPATIBILITY.

2079 * Code generator: explicit proof contexts in many ML interfaces.

2080 INCOMPATIBILITY.

2082 * Code generator: minimize exported identifiers by default. Minor

2083 INCOMPATIBILITY.

2085 * Code generation for SML and OCaml: dropped arcane "no_signatures"

2086 option. Minor INCOMPATIBILITY.

2088 * "declare [[code abort: ...]]" replaces "code_abort ...".

2089 INCOMPATIBILITY.

2091 * "declare [[code drop: ...]]" drops all code equations associated

2092 with the given constants.

2094 * Code generations are provided for make, fields, extend and truncate

2095 operations on records.

2097 * Command and antiquotation "value" are now hardcoded against nbe and

2098 ML. Minor INCOMPATIBILITY.

2100 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.

2102 * The symbol "\<newline>" may be used within char or string literals

2103 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.

2105 * Qualified String.implode and String.explode. INCOMPATIBILITY.

2107 * Simplifier: Enhanced solver of preconditions of rewrite rules can

2108 now deal with conjunctions. For help with converting proofs, the old

2109 behaviour of the simplifier can be restored like this: declare/using

2110 [[simp_legacy_precond]]. This configuration option will disappear

2111 again in the future. INCOMPATIBILITY.

2113 * Simproc "finite_Collect" is no longer enabled by default, due to

2114 spurious crashes and other surprises. Potential INCOMPATIBILITY.

2116 * Moved new (co)datatype package and its dependencies from session

2117 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',

2118 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now

2119 part of theory "Main".

2121 Theory renamings:

2122 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)

2123 Library/Wfrec.thy ~> Wfrec.thy

2124 Library/Zorn.thy ~> Zorn.thy

2125 Cardinals/Order_Relation.thy ~> Order_Relation.thy

2126 Library/Order_Union.thy ~> Cardinals/Order_Union.thy

2127 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy

2128 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy

2129 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy

2130 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy

2131 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy

2132 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy

2133 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy

2134 BNF/BNF_Comp.thy ~> BNF_Comp.thy

2135 BNF/BNF_Def.thy ~> BNF_Def.thy

2136 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy

2137 BNF/BNF_GFP.thy ~> BNF_GFP.thy

2138 BNF/BNF_LFP.thy ~> BNF_LFP.thy

2139 BNF/BNF_Util.thy ~> BNF_Util.thy

2140 BNF/Coinduction.thy ~> Coinduction.thy

2141 BNF/More_BNFs.thy ~> Library/More_BNFs.thy

2142 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy

2143 BNF/Examples/* ~> BNF_Examples/*

2145 New theories:

2146 Wellorder_Extension.thy (split from Zorn.thy)

2147 Library/Cardinal_Notations.thy

2148 Library/BNF_Axomatization.thy

2149 BNF_Examples/Misc_Primcorec.thy

2150 BNF_Examples/Stream_Processor.thy

2152 Discontinued theories:

2153 BNF/BNF.thy

2154 BNF/Equiv_Relations_More.thy

2156 INCOMPATIBILITY.

2158 * New (co)datatype package:

2159 - Command 'primcorec' is fully implemented.

2160 - Command 'datatype_new' generates size functions ("size_xxx" and

2161 "size") as required by 'fun'.

2162 - BNFs are integrated with the Lifting tool and new-style

2163 (co)datatypes with Transfer.

2164 - Renamed commands:

2165 datatype_new_compat ~> datatype_compat

2166 primrec_new ~> primrec

2167 wrap_free_constructors ~> free_constructors

2168 INCOMPATIBILITY.

2169 - The generated constants "xxx_case" and "xxx_rec" have been renamed

2170 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").

2171 INCOMPATIBILITY.

2172 - The constant "xxx_(un)fold" and related theorems are no longer

2173 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually

2174 using "prim(co)rec".

2175 INCOMPATIBILITY.

2176 - No discriminators are generated for nullary constructors by

2177 default, eliminating the need for the odd "=:" syntax.

2178 INCOMPATIBILITY.

2179 - No discriminators or selectors are generated by default by

2180 "datatype_new", unless custom names are specified or the new

2181 "discs_sels" option is passed.

2182 INCOMPATIBILITY.

2184 * Old datatype package:

2185 - The generated theorems "xxx.cases" and "xxx.recs" have been

2186 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->

2187 "sum.case"). INCOMPATIBILITY.

2188 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have

2189 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,

2190 "prod_case" ~> "case_prod"). INCOMPATIBILITY.

2192 * The types "'a list" and "'a option", their set and map functions,

2193 their relators, and their selectors are now produced using the new

2194 BNF-based datatype package.

2196 Renamed constants:

2197 Option.set ~> set_option

2198 Option.map ~> map_option

2199 option_rel ~> rel_option

2201 Renamed theorems:

2202 set_def ~> set_rec[abs_def]

2203 map_def ~> map_rec[abs_def]

2204 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")

2205 option.recs ~> option.rec

2206 list_all2_def ~> list_all2_iff

2207 set.simps ~> set_simps (or the slightly different "list.set")

2208 map.simps ~> list.map

2209 hd.simps ~> list.sel(1)

2210 tl.simps ~> list.sel(2-3)

2211 the.simps ~> option.sel

2213 INCOMPATIBILITY.

2215 * The following map functions and relators have been renamed:

2216 sum_map ~> map_sum

2217 map_pair ~> map_prod

2218 prod_rel ~> rel_prod

2219 sum_rel ~> rel_sum

2220 fun_rel ~> rel_fun

2221 set_rel ~> rel_set

2222 filter_rel ~> rel_filter

2223 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")

2224 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")

2225 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")

2227 INCOMPATIBILITY.

2229 * Lifting and Transfer:

2230 - a type variable as a raw type is supported

2231 - stronger reflexivity prover

2232 - rep_eq is always generated by lift_definition

2233 - setup for Lifting/Transfer is now automated for BNFs

2234 + holds for BNFs that do not contain a dead variable

2235 + relator_eq, relator_mono, relator_distr, relator_domain,

2236 relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,

2237 right_unique, right_total, left_unique, left_total are proved

2238 automatically

2239 + definition of a predicator is generated automatically

2240 + simplification rules for a predicator definition are proved

2241 automatically for datatypes

2242 - consolidation of the setup of Lifting/Transfer

2243 + property that a relator preservers reflexivity is not needed any

2244 more

2245 Minor INCOMPATIBILITY.

2246 + left_total and left_unique rules are now transfer rules

2247 (reflexivity_rule attribute not needed anymore)

2248 INCOMPATIBILITY.

2249 + Domainp does not have to be a separate assumption in

2250 relator_domain theorems (=> more natural statement)

2251 INCOMPATIBILITY.

2252 - registration of code equations is more robust

2253 Potential INCOMPATIBILITY.

2254 - respectfulness proof obligation is preprocessed to a more readable

2255 form

2256 Potential INCOMPATIBILITY.

2257 - eq_onp is always unfolded in respectfulness proof obligation

2258 Potential INCOMPATIBILITY.

2259 - unregister lifting setup for Code_Numeral.integer and

2260 Code_Numeral.natural

2261 Potential INCOMPATIBILITY.

2262 - Lifting.invariant -> eq_onp

2263 INCOMPATIBILITY.

2265 * New internal SAT solver "cdclite" that produces models and proof

2266 traces. This solver replaces the internal SAT solvers "enumerate" and

2267 "dpll". Applications that explicitly used one of these two SAT

2268 solvers should use "cdclite" instead. In addition, "cdclite" is now

2269 the default SAT solver for the "sat" and "satx" proof methods and

2270 corresponding tactics; the old default can be restored using "declare

2271 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.

2273 * SMT module: A new version of the SMT module, temporarily called

2274 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,

2275 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also

2276 supported as oracles. Yices is no longer supported, because no version

2277 of the solver can handle both SMT-LIB 2 and quantifiers.

2279 * Activation of Z3 now works via "z3_non_commercial" system option

2280 (without requiring restart), instead of former settings variable

2281 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu

2282 Plugin Options / Isabelle / General.

2284 * Sledgehammer:

2285 - Z3 can now produce Isar proofs.

2286 - MaSh overhaul:

2287 . New SML-based learning algorithms eliminate the dependency on

2288 Python and increase performance and reliability.

2289 . MaSh and MeSh are now used by default together with the

2290 traditional MePo (Meng-Paulson) relevance filter. To disable

2291 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin

2292 Options / Isabelle / General to "none".

2293 - New option:

2294 smt_proofs

2295 - Renamed options:

2296 isar_compress ~> compress

2297 isar_try0 ~> try0

2299 INCOMPATIBILITY.

2301 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.

2303 * Nitpick:

2304 - Fixed soundness bug whereby mutually recursive datatypes could

2305 take infinite values.

2306 - Fixed soundness bug with low-level number functions such as

2307 "Abs_Integ" and "Rep_Integ".

2308 - Removed "std" option.

2309 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to

2310 "hide_types".

2312 * Metis: Removed legacy proof method 'metisFT'. Use 'metis

2313 (full_types)' instead. INCOMPATIBILITY.

2315 * Try0: Added 'algebra' and 'meson' to the set of proof methods.

2317 * Adjustion of INF and SUP operations:

2318 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.

2319 - Consolidated theorem names containing INFI and SUPR: have INF and

2320 SUP instead uniformly.

2321 - More aggressive normalization of expressions involving INF and Inf

2322 or SUP and Sup.

2323 - INF_image and SUP_image do not unfold composition.

2324 - Dropped facts INF_comp, SUP_comp.

2325 - Default congruence rules strong_INF_cong and strong_SUP_cong, with

2326 simplifier implication in premises. Generalize and replace former

2327 INT_cong, SUP_cong

2329 INCOMPATIBILITY.

2331 * SUP and INF generalized to conditionally_complete_lattice.

2333 * Swapped orientation of facts image_comp and vimage_comp:

2335 image_compose ~> image_comp [symmetric]

2336 image_comp ~> image_comp [symmetric]

2337 vimage_compose ~> vimage_comp [symmetric]

2338 vimage_comp ~> vimage_comp [symmetric]

2340 INCOMPATIBILITY.

2342 * Theory reorganization: split of Big_Operators.thy into

2343 Groups_Big.thy and Lattices_Big.thy.

2345 * Consolidated some facts about big group operators:

2347 setsum_0' ~> setsum.neutral

2348 setsum_0 ~> setsum.neutral_const

2349 setsum_addf ~> setsum.distrib

2350 setsum_cartesian_product ~> setsum.cartesian_product

2351 setsum_cases ~> setsum.If_cases

2352 setsum_commute ~> setsum.commute

2353 setsum_cong ~> setsum.cong

2354 setsum_delta ~> setsum.delta

2355 setsum_delta' ~> setsum.delta'

2356 setsum_diff1' ~> setsum.remove

2357 setsum_empty ~> setsum.empty

2358 setsum_infinite ~> setsum.infinite

2359 setsum_insert ~> setsum.insert

2360 setsum_inter_restrict'' ~> setsum.inter_filter

2361 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left

2362 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right

2363 setsum_mono_zero_left ~> setsum.mono_neutral_left

2364 setsum_mono_zero_right ~> setsum.mono_neutral_right

2365 setsum_reindex ~> setsum.reindex

2366 setsum_reindex_cong ~> setsum.reindex_cong

2367 setsum_reindex_nonzero ~> setsum.reindex_nontrivial

2368 setsum_restrict_set ~> setsum.inter_restrict

2369 setsum_Plus ~> setsum.Plus

2370 setsum_setsum_restrict ~> setsum.commute_restrict

2371 setsum_Sigma ~> setsum.Sigma

2372 setsum_subset_diff ~> setsum.subset_diff

2373 setsum_Un_disjoint ~> setsum.union_disjoint

2374 setsum_UN_disjoint ~> setsum.UNION_disjoint

2375 setsum_Un_Int ~> setsum.union_inter

2376 setsum_Union_disjoint ~> setsum.Union_disjoint

2377 setsum_UNION_zero ~> setsum.Union_comp

2378 setsum_Un_zero ~> setsum.union_inter_neutral

2379 strong_setprod_cong ~> setprod.strong_cong

2380 strong_setsum_cong ~> setsum.strong_cong

2381 setprod_1' ~> setprod.neutral

2382 setprod_1 ~> setprod.neutral_const

2383 setprod_cartesian_product ~> setprod.cartesian_product

2384 setprod_cong ~> setprod.cong

2385 setprod_delta ~> setprod.delta

2386 setprod_delta' ~> setprod.delta'

2387 setprod_empty ~> setprod.empty

2388 setprod_infinite ~> setprod.infinite

2389 setprod_insert ~> setprod.insert

2390 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left

2391 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right

2392 setprod_mono_one_left ~> setprod.mono_neutral_left

2393 setprod_mono_one_right ~> setprod.mono_neutral_right

2394 setprod_reindex ~> setprod.reindex

2395 setprod_reindex_cong ~> setprod.reindex_cong

2396 setprod_reindex_nonzero ~> setprod.reindex_nontrivial

2397 setprod_Sigma ~> setprod.Sigma

2398 setprod_subset_diff ~> setprod.subset_diff

2399 setprod_timesf ~> setprod.distrib

2400 setprod_Un2 ~> setprod.union_diff2

2401 setprod_Un_disjoint ~> setprod.union_disjoint

2402 setprod_UN_disjoint ~> setprod.UNION_disjoint

2403 setprod_Un_Int ~> setprod.union_inter

2404 setprod_Union_disjoint ~> setprod.Union_disjoint

2405 setprod_Un_one ~> setprod.union_inter_neutral

2407 Dropped setsum_cong2 (simple variant of setsum.cong).

2408 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)

2409 Dropped setsum_reindex_id, setprod_reindex_id

2410 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).

2412 INCOMPATIBILITY.

2414 * Abolished slightly odd global lattice interpretation for min/max.

2416 Fact consolidations:

2417 min_max.inf_assoc ~> min.assoc

2418 min_max.inf_commute ~> min.commute

2419 min_max.inf_left_commute ~> min.left_commute

2420 min_max.inf_idem ~> min.idem

2421 min_max.inf_left_idem ~> min.left_idem

2422 min_max.inf_right_idem ~> min.right_idem

2423 min_max.sup_assoc ~> max.assoc

2424 min_max.sup_commute ~> max.commute

2425 min_max.sup_left_commute ~> max.left_commute

2426 min_max.sup_idem ~> max.idem

2427 min_max.sup_left_idem ~> max.left_idem

2428 min_max.sup_inf_distrib1 ~> max_min_distrib2

2429 min_max.sup_inf_distrib2 ~> max_min_distrib1

2430 min_max.inf_sup_distrib1 ~> min_max_distrib2

2431 min_max.inf_sup_distrib2 ~> min_max_distrib1

2432 min_max.distrib ~> min_max_distribs

2433 min_max.inf_absorb1 ~> min.absorb1

2434 min_max.inf_absorb2 ~> min.absorb2

2435 min_max.sup_absorb1 ~> max.absorb1

2436 min_max.sup_absorb2 ~> max.absorb2

2437 min_max.le_iff_inf ~> min.absorb_iff1

2438 min_max.le_iff_sup ~> max.absorb_iff2

2439 min_max.inf_le1 ~> min.cobounded1

2440 min_max.inf_le2 ~> min.cobounded2

2441 le_maxI1, min_max.sup_ge1 ~> max.cobounded1

2442 le_maxI2, min_max.sup_ge2 ~> max.cobounded2

2443 min_max.le_infI1 ~> min.coboundedI1

2444 min_max.le_infI2 ~> min.coboundedI2

2445 min_max.le_supI1 ~> max.coboundedI1

2446 min_max.le_supI2 ~> max.coboundedI2

2447 min_max.less_infI1 ~> min.strict_coboundedI1

2448 min_max.less_infI2 ~> min.strict_coboundedI2

2449 min_max.less_supI1 ~> max.strict_coboundedI1

2450 min_max.less_supI2 ~> max.strict_coboundedI2

2451 min_max.inf_mono ~> min.mono

2452 min_max.sup_mono ~> max.mono

2453 min_max.le_infI, min_max.inf_greatest ~> min.boundedI

2454 min_max.le_supI, min_max.sup_least ~> max.boundedI

2455 min_max.le_inf_iff ~> min.bounded_iff

2456 min_max.le_sup_iff ~> max.bounded_iff

2458 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,

2459 min.left_commute, min.left_idem, max.commute, max.assoc,

2460 max.left_commute, max.left_idem directly.

2462 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,

2463 min.cobounded2, max.cobounded1m max.cobounded2 directly.

2465 For min_ac or max_ac, prefer more general collection ac_simps.

2467 INCOMPATIBILITY.

2469 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>

2470 Inf_fin_le_Sup_fin. INCOMPATIBILITY.

2472 * Qualified constant names Wellfounded.acc, Wellfounded.accp.

2473 INCOMPATIBILITY.

2475 * Fact generalization and consolidation:

2476 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1

2478 INCOMPATIBILITY.

2480 * Purely algebraic definition of even. Fact generalization and

2481 consolidation:

2482 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd

2483 even_zero_(nat|int) ~> even_zero

2485 INCOMPATIBILITY.

2487 * Abolished neg_numeral.

2488 - Canonical representation for minus one is "- 1".

2489 - Canonical representation for other negative numbers is "- (numeral _)".

2490 - When devising rule sets for number calculation, consider the

2491 following canonical cases: 0, 1, numeral _, - 1, - numeral _.

2492 - HOLogic.dest_number also recognizes numerals in non-canonical forms

2493 like "numeral One", "- numeral One", "- 0" and even "- ... - _".

2494 - Syntax for negative numerals is mere input syntax.

2496 INCOMPATIBILITY.

2498 * Reduced name variants for rules on associativity and commutativity:

2500 add_assoc ~> add.assoc

2501 add_commute ~> add.commute

2502 add_left_commute ~> add.left_commute

2503 mult_assoc ~> mult.assoc

2504 mult_commute ~> mult.commute

2505 mult_left_commute ~> mult.left_commute

2506 nat_add_assoc ~> add.assoc

2507 nat_add_commute ~> add.commute

2508 nat_add_left_commute ~> add.left_commute

2509 nat_mult_assoc ~> mult.assoc

2510 nat_mult_commute ~> mult.commute

2511 eq_assoc ~> iff_assoc

2512 eq_left_commute ~> iff_left_commute

2514 INCOMPATIBILITY.

2516 * Fact collections add_ac and mult_ac are considered old-fashioned.

2517 Prefer ac_simps instead, or specify rules

2518 (add|mult).(assoc|commute|left_commute) individually.

2520 * Elimination of fact duplicates:

2521 equals_zero_I ~> minus_unique

2522 diff_eq_0_iff_eq ~> right_minus_eq

2523 nat_infinite ~> infinite_UNIV_nat

2524 int_infinite ~> infinite_UNIV_int

2526 INCOMPATIBILITY.

2528 * Fact name consolidation:

2529 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus

2530 minus_le_self_iff ~> neg_less_eq_nonneg

2531 le_minus_self_iff ~> less_eq_neg_nonpos

2532 neg_less_nonneg ~> neg_less_pos

2533 less_minus_self_iff ~> less_neg_neg [simp]

2535 INCOMPATIBILITY.

2537 * More simplification rules on unary and binary minus:

2538 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,

2539 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,

2540 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,

2541 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,

2542 minus_add_cancel, uminus_add_conv_diff. These correspondingly have

2543 been taken away from fact collections algebra_simps and field_simps.

2544 INCOMPATIBILITY.

2546 To restore proofs, the following patterns are helpful:

2548 a) Arbitrary failing proof not involving "diff_def":

2549 Consider simplification with algebra_simps or field_simps.

2551 b) Lifting rules from addition to subtraction:

2552 Try with "using <rule for addition> of [... "- _" ...]" by simp".

2554 c) Simplification with "diff_def": just drop "diff_def".

2555 Consider simplification with algebra_simps or field_simps;

2556 or the brute way with

2557 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".

2559 * Introduce bdd_above and bdd_below in theory

2560 Conditionally_Complete_Lattices, use them instead of explicitly

2561 stating boundedness of sets.

2563 * ccpo.admissible quantifies only over non-empty chains to allow more

2564 syntax-directed proof rules; the case of the empty chain shows up as

2565 additional case in fixpoint induction proofs. INCOMPATIBILITY.

2567 * Removed and renamed theorems in Series:

2568 summable_le ~> suminf_le

2569 suminf_le ~> suminf_le_const

2570 series_pos_le ~> setsum_le_suminf

2571 series_pos_less ~> setsum_less_suminf

2572 suminf_ge_zero ~> suminf_nonneg

2573 suminf_gt_zero ~> suminf_pos

2574 suminf_gt_zero_iff ~> suminf_pos_iff

2575 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ

2576 suminf_0_le ~> suminf_nonneg [rotate]

2577 pos_summable ~> summableI_nonneg_bounded

2578 ratio_test ~> summable_ratio_test

2580 removed series_zero, replaced by sums_finite

2582 removed auxiliary lemmas:

2584 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,

2585 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,

2586 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,

2587 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,

2588 summable_convergent_sumr_iff, sumr_diff_mult_const

2590 INCOMPATIBILITY.

2592 * Replace (F)DERIV syntax by has_derivative:

2593 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"

2595 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"

2597 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax

2599 - removed constant isDiff

2601 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as

2602 input syntax.

2604 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.

2606 - Renamed FDERIV_... lemmas to has_derivative_...

2608 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV

2610 - removed DERIV_intros, has_derivative_eq_intros

2612 - introduced derivative_intros and deriative_eq_intros which

2613 includes now rules for DERIV, has_derivative and

2614 has_vector_derivative.

2616 - Other renamings:

2617 differentiable_def ~> real_differentiable_def

2618 differentiableE ~> real_differentiableE

2619 fderiv_def ~> has_derivative_at

2620 field_fderiv_def ~> field_has_derivative_at

2621 isDiff_der ~> differentiable_def

2622 deriv_fderiv ~> has_field_derivative_def

2623 deriv_def ~> DERIV_def

2625 INCOMPATIBILITY.

2627 * Include more theorems in continuous_intros. Remove the

2628 continuous_on_intros, isCont_intros collections, these facts are now

2629 in continuous_intros.

2631 * Theorems about complex numbers are now stated only using Re and Im,

2632 the Complex constructor is not used anymore. It is possible to use

2633 primcorec to defined the behaviour of a complex-valued function.

2635 Removed theorems about the Complex constructor from the simpset, they

2636 are available as the lemma collection legacy_Complex_simps. This

2637 especially removes

2639 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".

2641 Instead the reverse direction is supported with

2642 Complex_eq: "Complex a b = a + \<i> * b"

2644 Moved csqrt from Fundamental_Algebra_Theorem to Complex.

2646 Renamings:

2647 Re/Im ~> complex.sel

2648 complex_Re/Im_zero ~> zero_complex.sel

2649 complex_Re/Im_add ~> plus_complex.sel

2650 complex_Re/Im_minus ~> uminus_complex.sel

2651 complex_Re/Im_diff ~> minus_complex.sel

2652 complex_Re/Im_one ~> one_complex.sel

2653 complex_Re/Im_mult ~> times_complex.sel

2654 complex_Re/Im_inverse ~> inverse_complex.sel

2655 complex_Re/Im_scaleR ~> scaleR_complex.sel

2656 complex_Re/Im_i ~> ii.sel

2657 complex_Re/Im_cnj ~> cnj.sel

2658 Re/Im_cis ~> cis.sel

2660 complex_divide_def ~> divide_complex_def

2661 complex_norm_def ~> norm_complex_def

2662 cmod_def ~> norm_complex_de

2664 Removed theorems:

2665 complex_zero_def

2666 complex_add_def

2667 complex_minus_def

2668 complex_diff_def

2669 complex_one_def

2670 complex_mult_def

2671 complex_inverse_def

2672 complex_scaleR_def

2674 INCOMPATIBILITY.

2676 * Theory Lubs moved HOL image to HOL-Library. It is replaced by

2677 Conditionally_Complete_Lattices. INCOMPATIBILITY.

2679 * HOL-Library: new theory src/HOL/Library/Tree.thy.

2681 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it

2682 is subsumed by session Kleene_Algebra in AFP.

2684 * HOL-Library / theory RBT: various constants and facts are hidden;

2685 lifting setup is unregistered. INCOMPATIBILITY.

2687 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.

2689 * HOL-Word: bit representations prefer type bool over type bit.

2690 INCOMPATIBILITY.

2692 * HOL-Word:

2693 - Abandoned fact collection "word_arith_alts", which is a duplicate

2694 of "word_arith_wis".

2695 - Dropped first (duplicated) element in fact collections

2696 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",

2697 "uint_word_arith_bintrs".

2699 * HOL-Number_Theory:

2700 - consolidated the proofs of the binomial theorem

2701 - the function fib is again of type nat => nat and not overloaded

2702 - no more references to Old_Number_Theory in the HOL libraries

2703 (except the AFP)

2705 INCOMPATIBILITY.

2707 * HOL-Multivariate_Analysis:

2708 - Type class ordered_real_vector for ordered vector spaces.

2709 - New theory Complex_Basic_Analysis defining complex derivatives,

2710 holomorphic functions, etc., ported from HOL Light's canal.ml.

2711 - Changed order of ordered_euclidean_space to be compatible with

2712 pointwise ordering on products. Therefore instance of

2713 conditionally_complete_lattice and ordered_real_vector.

2714 INCOMPATIBILITY: use box instead of greaterThanLessThan or

2715 explicit set-comprehensions with eucl_less for other (half-)open

2716 intervals.

2717 - removed dependencies on type class ordered_euclidean_space with

2718 introduction of "cbox" on euclidean_space

2719 - renamed theorems:

2720 interval ~> box

2721 mem_interval ~> mem_box

2722 interval_eq_empty ~> box_eq_empty

2723 interval_ne_empty ~> box_ne_empty

2724 interval_sing(1) ~> cbox_sing

2725 interval_sing(2) ~> box_sing

2726 subset_interval_imp ~> subset_box_imp

2727 subset_interval ~> subset_box

2728 open_interval ~> open_box

2729 closed_interval ~> closed_cbox

2730 interior_closed_interval ~> interior_cbox

2731 bounded_closed_interval ~> bounded_cbox

2732 compact_interval ~> compact_cbox

2733 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric

2734 bounded_subset_closed_interval ~> bounded_subset_cbox

2735 mem_interval_componentwiseI ~> mem_box_componentwiseI

2736 convex_box ~> convex_prod

2737 rel_interior_real_interval ~> rel_interior_real_box

2738 convex_interval ~> convex_box

2739 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox

2740 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox

2741 content_closed_interval' ~> content_cbox'

2742 elementary_subset_interval ~> elementary_subset_box

2743 diameter_closed_interval ~> diameter_cbox

2744 frontier_closed_interval ~> frontier_cbox

2745 frontier_open_interval ~> frontier_box

2746 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric

2747 closure_open_interval ~> closure_box

2748 open_closed_interval_convex ~> open_cbox_convex

2749 open_interval_midpoint ~> box_midpoint

2750 content_image_affinity_interval ~> content_image_affinity_cbox

2751 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval

2752 bounded_interval ~> bounded_closed_interval + bounded_boxes

2754 - respective theorems for intervals over the reals:

2755 content_closed_interval + content_cbox

2756 has_integral + has_integral_real

2757 fine_division_exists + fine_division_exists_real

2758 has_integral_null + has_integral_null_real

2759 tagged_division_union_interval + tagged_division_union_interval_real

2760 has_integral_const + has_integral_const_real

2761 integral_const + integral_const_real

2762 has_integral_bound + has_integral_bound_real

2763 integrable_continuous + integrable_continuous_real

2764 integrable_subinterval + integrable_subinterval_real

2765 has_integral_reflect_lemma + has_integral_reflect_lemma_real

2766 integrable_reflect + integrable_reflect_real

2767 integral_reflect + integral_reflect_real

2768 image_affinity_interval + image_affinity_cbox

2769 image_smult_interval + image_smult_cbox

2770 integrable_const + integrable_const_ivl

2771 integrable_on_subinterval + integrable_on_subcbox

2773 - renamed theorems:

2774 derivative_linear ~> has_derivative_bounded_linear

2775 derivative_is_linear ~> has_derivative_linear

2776 bounded_linear_imp_linear ~> bounded_linear.linear

2778 * HOL-Probability:

2779 - Renamed positive_integral to nn_integral:

2781 . Renamed all lemmas "*positive_integral*" to *nn_integral*"

2782 positive_integral_positive ~> nn_integral_nonneg

2784 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.

2786 - replaced the Lebesgue integral on real numbers by the more general

2787 Bochner integral for functions into a real-normed vector space.

2789 integral_zero ~> integral_zero / integrable_zero

2790 integral_minus ~> integral_minus / integrable_minus

2791 integral_add ~> integral_add / integrable_add

2792 integral_diff ~> integral_diff / integrable_diff

2793 integral_setsum ~> integral_setsum / integrable_setsum

2794 integral_multc ~> integral_mult_left / integrable_mult_left

2795 integral_cmult ~> integral_mult_right / integrable_mult_right

2796 integral_triangle_inequality~> integral_norm_bound

2797 integrable_nonneg ~> integrableI_nonneg

2798 integral_positive ~> integral_nonneg_AE

2799 integrable_abs_iff ~> integrable_abs_cancel

2800 positive_integral_lim_INF ~> nn_integral_liminf

2801 lebesgue_real_affine ~> lborel_real_affine

2802 borel_integral_has_integral ~> has_integral_lebesgue_integral

2803 integral_indicator ~>

2804 integral_real_indicator / integrable_real_indicator

2805 positive_integral_fst ~> nn_integral_fst'

2806 positive_integral_fst_measurable ~> nn_integral_fst

2807 positive_integral_snd_measurable ~> nn_integral_snd

2809 integrable_fst_measurable ~>

2810 integral_fst / integrable_fst / AE_integrable_fst

2812 integrable_snd_measurable ~>

2813 integral_snd / integrable_snd / AE_integrable_snd

2815 integral_monotone_convergence ~>

2816 integral_monotone_convergence / integrable_monotone_convergence

2818 integral_monotone_convergence_at_top ~>

2819 integral_monotone_convergence_at_top /

2820 integrable_monotone_convergence_at_top

2822 has_integral_iff_positive_integral_lebesgue ~>

2823 has_integral_iff_has_bochner_integral_lebesgue_nonneg

2825 lebesgue_integral_has_integral ~>

2826 has_integral_integrable_lebesgue_nonneg

2828 positive_integral_lebesgue_has_integral ~>

2829 integral_has_integral_lebesgue_nonneg /

2830 integrable_has_integral_lebesgue_nonneg

2832 lebesgue_integral_real_affine ~>

2833 nn_integral_real_affine

2835 has_integral_iff_positive_integral_lborel ~>

2836 integral_has_integral_nonneg / integrable_has_integral_nonneg

2838 The following theorems where removed:

2840 lebesgue_integral_nonneg

2841 lebesgue_integral_uminus

2842 lebesgue_integral_cmult

2843 lebesgue_integral_multc

2844 lebesgue_integral_cmult_nonneg

2845 integral_cmul_indicator

2846 integral_real

2848 - Formalized properties about exponentially, Erlang, and normal

2849 distributed random variables.

2851 * HOL-Decision_Procs: Separate command 'approximate' for approximative

2852 computation in src/HOL/Decision_Procs/Approximation. Minor

2853 INCOMPATIBILITY.

2856 *** Scala ***

2858 * The signature and semantics of Document.Snapshot.cumulate_markup /

2859 select_markup have been clarified. Markup is now traversed in the

2860 order of reports given by the prover: later markup is usually more

2861 specific and may override results accumulated so far. The elements

2862 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.

2864 * Substantial reworking of internal PIDE protocol communication

2865 channels. INCOMPATIBILITY.

2868 *** ML ***

2870 * Subtle change of semantics of Thm.eq_thm: theory stamps are not

2871 compared (according to Thm.thm_ord), but assumed to be covered by the

2872 current background theory. Thus equivalent data produced in different

2873 branches of the theory graph usually coincides (e.g. relevant for

2874 theory merge). Note that the softer Thm.eq_thm_prop is often more

2875 appropriate than Thm.eq_thm.

2877 * Proper context for basic Simplifier operations: rewrite_rule,

2878 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to

2879 pass runtime Proof.context (and ensure that the simplified entity

2880 actually belongs to it).

2882 * Proper context discipline for read_instantiate and instantiate_tac:

2883 variables that are meant to become schematic need to be given as

2884 fixed, and are generalized by the explicit context of local variables.

2885 This corresponds to Isar attributes "where" and "of" with 'for'

2886 declaration. INCOMPATIBILITY, also due to potential change of indices

2887 of schematic variables.

2889 * Moved ML_Compiler.exn_trace and other operations on exceptions to

2890 structure Runtime. Minor INCOMPATIBILITY.

2892 * Discontinued old Toplevel.debug in favour of system option

2893 "ML_exception_trace", which may be also declared within the context

2894 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.

2896 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor

2897 INCOMPATIBILITY.

2899 * Configuration option "ML_print_depth" controls the pretty-printing

2900 depth of the ML compiler within the context. The old print_depth in

2901 ML is still available as default_print_depth, but rarely used. Minor

2902 INCOMPATIBILITY.

2904 * Toplevel function "use" refers to raw ML bootstrap environment,

2905 without Isar context nor antiquotations. Potential INCOMPATIBILITY.

2906 Note that 'ML_file' is the canonical command to load ML files into the

2907 formal context.

2909 * Simplified programming interface to define ML antiquotations, see

2910 structure ML_Antiquotation. Minor INCOMPATIBILITY.

2912 * ML antiquotation @{here} refers to its source position, which is

2913 occasionally useful for experimentation and diagnostic purposes.

2915 * ML antiquotation @{path} produces a Path.T value, similarly to

2916 Path.explode, but with compile-time check against the file-system and

2917 some PIDE markup. Note that unlike theory source, ML does not have a

2918 well-defined master directory, so an absolute symbolic path

2919 specification is usually required, e.g. "~~/src/HOL".

2921 * ML antiquotation @{print} inlines a function to print an arbitrary

2922 ML value, which is occasionally useful for diagnostic or demonstration

2923 purposes.

2926 *** System ***

2928 * Proof General with its traditional helper scripts is now an optional

2929 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle

2930 component repository http://isabelle.in.tum.de/components/. Note that

2931 the "system" manual provides general explanations about add-on

2932 components, especially those that are not bundled with the release.

2934 * The raw Isabelle process executable has been renamed from

2935 "isabelle-process" to "isabelle_process", which conforms to common

2936 shell naming conventions, and allows to define a shell function within

2937 the Isabelle environment to avoid dynamic path lookup. Rare

2938 incompatibility for old tools that do not use the ISABELLE_PROCESS

2939 settings variable.

2941 * Former "isabelle tty" has been superseded by "isabelle console",

2942 with implicit build like "isabelle jedit", and without the mostly

2943 obsolete Isar TTY loop.

2945 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER

2946 and PDF_VIEWER now refer to the actual programs, not shell

2947 command-lines. Discontinued option -c: invocation may be asynchronous

2948 via desktop environment, without any special precautions. Potential

2949 INCOMPATIBILITY with ambitious private settings.

2951 * Removed obsolete "isabelle unsymbolize". Note that the usual format

2952 for email communication is the Unicode rendering of Isabelle symbols,

2953 as produced by Isabelle/jEdit, for example.

2955 * Removed obsolete tool "wwwfind". Similar functionality may be

2956 integrated into Isabelle/jEdit eventually.

2958 * Improved 'display_drafts' concerning desktop integration and

2959 repeated invocation in PIDE front-end: re-use single file

2960 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.

2962 * Session ROOT specifications require explicit 'document_files' for

2963 robust dependencies on LaTeX sources. Only these explicitly given

2964 files are copied to the document output directory, before document

2965 processing is started.

2967 * Windows: support for regular TeX installation (e.g. MiKTeX) instead

2968 of TeX Live from Cygwin.

2972 New in Isabelle2013-2 (December 2013)

2973 -------------------------------------

2975 *** Prover IDE -- Isabelle/Scala/jEdit ***

2977 * More robust editing of running commands with internal forks,

2978 e.g. non-terminating 'by' steps.

2980 * More relaxed Sledgehammer panel: avoid repeated application of query

2981 after edits surrounding the command location.

2983 * More status information about commands that are interrupted

2984 accidentally (via physical event or Poly/ML runtime system signal,

2985 e.g. out-of-memory).

2988 *** System ***

2990 * More robust termination of external processes managed by

2991 Isabelle/ML: support cancellation of tasks within the range of

2992 milliseconds, as required for PIDE document editing with automatically

2993 tried tools (e.g. Sledgehammer).

2995 * Reactivated Isabelle/Scala kill command for external processes on

2996 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a

2997 workaround for some Debian/Ubuntu Linux versions from 2013.

3001 New in Isabelle2013-1 (November 2013)

3002 -------------------------------------

3004 *** General ***

3006 * Discontinued obsolete 'uses' within theory header. Note that

3007 commands like 'ML_file' work without separate declaration of file

3008 dependencies. Minor INCOMPATIBILITY.

3010 * Discontinued redundant 'use' command, which was superseded by

3011 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.

3013 * Simplified subscripts within identifiers, using plain \<^sub>

3014 instead of the second copy \<^isub> and \<^isup>. Superscripts are

3015 only for literal tokens within notation; explicit mixfix annotations

3016 for consts or fixed variables may be used as fall-back for unusual

3017 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in

3018 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to

3019 standardize symbols as a starting point for further manual cleanup.

3020 The ML reference variable "legacy_isub_isup" may be set as temporary

3021 workaround, to make the prover accept a subset of the old identifier

3022 syntax.

3024 * Document antiquotations: term style "isub" has been renamed to

3025 "sub". Minor INCOMPATIBILITY.

3027 * Uniform management of "quick_and_dirty" as system option (see also

3028 "isabelle options"), configuration option within the context (see also

3029 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor

3030 INCOMPATIBILITY, need to use more official Isabelle means to access

3031 quick_and_dirty, instead of historical poking into mutable reference.

3033 * Renamed command 'print_configs' to 'print_options'. Minor

3034 INCOMPATIBILITY.

3036 * Proper diagnostic command 'print_state'. Old 'pr' (with its

3037 implicit change of some global references) is retained for now as

3038 control command, e.g. for ProofGeneral 3.7.x.

3040 * Discontinued 'print_drafts' command with its old-fashioned PS output

3041 and Unix command-line print spooling. Minor INCOMPATIBILITY: use

3042 'display_drafts' instead and print via the regular document viewer.

3044 * Updated and extended "isar-ref" and "implementation" manual,

3045 eliminated old "ref" manual.

3048 *** Prover IDE -- Isabelle/Scala/jEdit ***

3050 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or

3051 Documentation panel.

3053 * Dockable window "Documentation" provides access to Isabelle

3054 documentation.

3056 * Dockable window "Find" provides query operations for formal entities

3057 (GUI front-end to 'find_theorems' command).

3059 * Dockable window "Sledgehammer" manages asynchronous / parallel

3060 sledgehammer runs over existing document sources, independently of

3061 normal editing and checking process.

3063 * Dockable window "Timing" provides an overview of relevant command

3064 timing information, depending on option jedit_timing_threshold. The

3065 same timing information is shown in the extended tooltip of the

3066 command keyword, when hovering the mouse over it while the CONTROL or

3067 COMMAND modifier is pressed.

3069 * Improved dockable window "Theories": Continuous checking of proof

3070 document (visible and required parts) may be controlled explicitly,

3071 using check box or shortcut "C+e ENTER". Individual theory nodes may

3072 be marked explicitly as required and checked in full, using check box

3073 or shortcut "C+e SPACE".

3075 * Improved completion mechanism, which is now managed by the

3076 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle

3077 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).

3079 * Standard jEdit keyboard shortcut C+b complete-word is remapped to

3080 isabelle.complete for explicit completion in Isabelle sources.

3081 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts

3082 to resolve conflict.

3084 * Improved support of various "minor modes" for Isabelle NEWS,

3085 options, session ROOT etc., with completion and SideKick tree view.

3087 * Strictly monotonic document update, without premature cancellation of

3088 running transactions that are still needed: avoid reset/restart of

3089 such command executions while editing.

3091 * Support for asynchronous print functions, as overlay to existing

3092 document content.

3094 * Support for automatic tools in HOL, which try to prove or disprove

3095 toplevel theorem statements.

3097 * Action isabelle.reset-font-size resets main text area font size

3098 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see

3099 also "Plugin Options / Isabelle / General"). It can be bound to some

3100 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).

3102 * File specifications in jEdit (e.g. file browser) may refer to

3103 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued

3104 obsolete $ISABELLE_HOME_WINDOWS variable.

3106 * Improved support for Linux look-and-feel "GTK+", see also "Utilities

3107 / Global Options / Appearance".

3109 * Improved support of native Mac OS X functionality via "MacOSX"

3110 plugin, which is now enabled by default.

3113 *** Pure ***

3115 * Commands 'interpretation' and 'sublocale' are now target-sensitive.

3116 In particular, 'interpretation' allows for non-persistent

3117 interpretation within "context ... begin ... end" blocks offering a

3118 light-weight alternative to 'sublocale'. See "isar-ref" manual for

3119 details.

3121 * Improved locales diagnostic command 'print_dependencies'.

3123 * Discontinued obsolete 'axioms' command, which has been marked as

3124 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'

3125 instead, while observing its uniform scope for polymorphism.

3127 * Discontinued empty name bindings in 'axiomatization'.

3128 INCOMPATIBILITY.

3130 * System option "proofs" has been discontinued. Instead the global

3131 state of Proofterm.proofs is persistently compiled into logic images

3132 as required, notably HOL-Proofs. Users no longer need to change

3133 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.

3135 * Syntax translation functions (print_translation etc.) always depend

3136 on Proof.context. Discontinued former "(advanced)" option -- this is

3137 now the default. Minor INCOMPATIBILITY.

3139 * Former global reference trace_unify_fail is now available as

3140 configuration option "unify_trace_failure" (global context only).

3142 * SELECT_GOAL now retains the syntactic context of the overall goal

3143 state (schematic variables etc.). Potential INCOMPATIBILITY in rare

3144 situations.

3147 *** HOL ***

3149 * Stronger precedence of syntax for big intersection and union on

3150 sets, in accordance with corresponding lattice operations.

3151 INCOMPATIBILITY.

3153 * Notation "{p:A. P}" now allows tuple patterns as well.

3155 * Nested case expressions are now translated in a separate check phase

3156 rather than during parsing. The data for case combinators is separated

3157 from the datatype package. The declaration attribute

3158 "case_translation" can be used to register new case combinators:

3160 declare [[case_translation case_combinator constructor1 ... constructorN]]

3162 * Code generator:

3163 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /

3164 'code_instance'.

3165 - 'code_identifier' declares name hints for arbitrary identifiers in

3166 generated code, subsuming 'code_modulename'.

3168 See the isar-ref manual for syntax diagrams, and the HOL theories for

3169 examples.

3171 * Attibute 'code': 'code' now declares concrete and abstract code

3172 equations uniformly. Use explicit 'code equation' and 'code abstract'

3173 to distinguish both when desired.

3175 * Discontinued theories Code_Integer and Efficient_Nat by a more

3176 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,

3177 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code

3178 generation for details. INCOMPATIBILITY.

3180 * Numeric types are mapped by default to target language numerals:

3181 natural (replaces former code_numeral) and integer (replaces former

3182 code_int). Conversions are available as integer_of_natural /

3183 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and

3184 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in

3185 ML). INCOMPATIBILITY.

3187 * Function package: For mutually recursive functions f and g, separate

3188 cases rules f.cases and g.cases are generated instead of unusable

3189 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,

3190 in the case that the unusable rule was used nevertheless.

3192 * Function package: For each function f, new rules f.elims are

3193 generated, which eliminate equalities of the form "f x = t".

3195 * New command 'fun_cases' derives ad-hoc elimination rules for

3196 function equations as simplified instances of f.elims, analogous to

3197 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.

3199 * Lifting:

3200 - parametrized correspondence relations are now supported:

3201 + parametricity theorems for the raw term can be specified in

3202 the command lift_definition, which allow us to generate stronger

3203 transfer rules

3204 + setup_lifting generates stronger transfer rules if parametric

3205 correspondence relation can be generated

3206 + various new properties of the relator must be specified to support

3207 parametricity

3208 + parametricity theorem for the Quotient relation can be specified

3209 - setup_lifting generates domain rules for the Transfer package

3210 - stronger reflexivity prover of respectfulness theorems for type

3211 copies

3212 - ===> and --> are now local. The symbols can be introduced

3213 by interpreting the locale lifting_syntax (typically in an

3214 anonymous context)

3215 - Lifting/Transfer relevant parts of Library/Quotient_* are now in

3216 Main. Potential INCOMPATIBILITY

3217 - new commands for restoring and deleting Lifting/Transfer context:

3218 lifting_forget, lifting_update

3219 - the command print_quotmaps was renamed to print_quot_maps.

3220 INCOMPATIBILITY

3222 * Transfer:

3223 - better support for domains in Transfer: replace Domainp T

3224 by the actual invariant in a transferred goal

3225 - transfer rules can have as assumptions other transfer rules

3226 - Experimental support for transferring from the raw level to the

3227 abstract level: Transfer.transferred attribute

3228 - Attribute version of the transfer method: untransferred attribute

3230 * Reification and reflection:

3231 - Reification is now directly available in HOL-Main in structure

3232 "Reification".

3233 - Reflection now handles multiple lists with variables also.

3234 - The whole reflection stack has been decomposed into conversions.

3235 INCOMPATIBILITY.

3237 * Revised devices for recursive definitions over finite sets:

3238 - Only one fundamental fold combinator on finite set remains:

3239 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b

3240 This is now identity on infinite sets.

3241 - Locales ("mini packages") for fundamental definitions with

3242 Finite_Set.fold: folding, folding_idem.

3243 - Locales comm_monoid_set, semilattice_order_set and

3244 semilattice_neutr_order_set for big operators on sets.

3245 See theory Big_Operators for canonical examples.

3246 Note that foundational constants comm_monoid_set.F and

3247 semilattice_set.F correspond to former combinators fold_image

3248 and fold1 respectively. These are now gone. You may use

3249 those foundational constants as substitutes, but it is

3250 preferable to interpret the above locales accordingly.

3251 - Dropped class ab_semigroup_idem_mult (special case of lattice,

3252 no longer needed in connection with Finite_Set.fold etc.)

3253 - Fact renames:

3254 card.union_inter ~> card_Un_Int [symmetric]

3255 card.union_disjoint ~> card_Un_disjoint

3256 INCOMPATIBILITY.

3258 * Locale hierarchy for abstract orderings and (semi)lattices.

3260 * Complete_Partial_Order.admissible is defined outside the type class

3261 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the

3262 class predicate assumption or sort constraint when possible.

3263 INCOMPATIBILITY.

3265 * Introduce type class "conditionally_complete_lattice": Like a

3266 complete lattice but does not assume the existence of the top and

3267 bottom elements. Allows to generalize some lemmas about reals and

3268 extended reals. Removed SupInf and replaced it by the instantiation

3269 of conditionally_complete_lattice for real. Renamed lemmas about

3270 conditionally-complete lattice from Sup_... to cSup_... and from

3271 Inf_... to cInf_... to avoid hidding of similar complete lattice

3272 lemmas.

3274 * Introduce type class linear_continuum as combination of

3275 conditionally-complete lattices and inner dense linorders which have

3276 more than one element. INCOMPATIBILITY.

3278 * Introduced type classes order_top and order_bot. The old classes top

3279 and bot only contain the syntax without assumptions. INCOMPATIBILITY:

3280 Rename bot -> order_bot, top -> order_top

3282 * Introduce type classes "no_top" and "no_bot" for orderings without

3283 top and bottom elements.

3285 * Split dense_linorder into inner_dense_order and no_top, no_bot.

3287 * Complex_Main: Unify and move various concepts from

3288 HOL-Multivariate_Analysis to HOL-Complex_Main.

3290 - Introduce type class (lin)order_topology and

3291 linear_continuum_topology. Allows to generalize theorems about

3292 limits and order. Instances are reals and extended reals.

3294 - continuous and continuos_on from Multivariate_Analysis:

3295 "continuous" is the continuity of a function at a filter. "isCont"

3296 is now an abbrevitation: "isCont x f == continuous (at _) f".

3298 Generalized continuity lemmas from isCont to continuous on an

3299 arbitrary filter.

3301 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove

3302 compactness of closed intervals on reals. Continuous functions

3303 attain infimum and supremum on compact sets. The inverse of a

3304 continuous function is continuous, when the function is continuous

3305 on a compact set.

3307 - connected from Multivariate_Analysis. Use it to prove the

3308 intermediate value theorem. Show connectedness of intervals on

3309 linear_continuum_topology).

3311 - first_countable_topology from Multivariate_Analysis. Is used to

3312 show equivalence of properties on the neighbourhood filter of x and

3313 on all sequences converging to x.

3315 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved

3316 theorems from Library/FDERIV.thy to Deriv.thy and base the

3317 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV

3318 which are restricted to sets, i.e. to represent derivatives from

3319 left or right.

3321 - Removed the within-filter. It is replaced by the principal filter:

3323 F within X = inf F (principal X)

3325 - Introduce "at x within U" as a single constant, "at x" is now an

3326 abbreviation for "at x within UNIV"

3328 - Introduce named theorem collections tendsto_intros,

3329 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems

3330 in tendsto_intros (or FDERIV_intros) are also available as

3331 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side

3332 is replaced by a congruence rule. This allows to apply them as

3333 intro rules and then proving equivalence by the simplifier.

3335 - Restructured theories in HOL-Complex_Main:

3337 + Moved RealDef and RComplete into Real

3339 + Introduced Topological_Spaces and moved theorems about

3340 topological spaces, filters, limits and continuity to it

3342 + Renamed RealVector to Real_Vector_Spaces

3344 + Split Lim, SEQ, Series into Topological_Spaces,

3345 Real_Vector_Spaces, and Limits

3347 + Moved Ln and Log to Transcendental

3349 + Moved theorems about continuity from Deriv to Topological_Spaces

3351 - Remove various auxiliary lemmas.

3353 INCOMPATIBILITY.

3355 * Nitpick:

3356 - Added option "spy".

3357 - Reduce incidence of "too high arity" errors.

3359 * Sledgehammer:

3360 - Renamed option:

3361 isar_shrink ~> isar_compress

3362 INCOMPATIBILITY.

3363 - Added options "isar_try0", "spy".

3364 - Better support for "isar_proofs".

3365 - MaSh has been fined-tuned and now runs as a local server.

3367 * Improved support for ad hoc overloading of constants (see also

3368 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).

3370 * Library/Polynomial.thy:

3371 - Use lifting for primitive definitions.

3372 - Explicit conversions from and to lists of coefficients, used for

3373 generated code.

3374 - Replaced recursion operator poly_rec by fold_coeffs.

3375 - Prefer pre-existing gcd operation for gcd.

3376 - Fact renames:

3377 poly_eq_iff ~> poly_eq_poly_eq_iff

3378 poly_ext ~> poly_eqI

3379 expand_poly_eq ~> poly_eq_iff

3380 IMCOMPATIBILITY.

3382 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and

3383 case_of_simps to convert function definitions between a list of

3384 equations with patterns on the lhs and a single equation with case

3385 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.

3387 * New Library/FSet.thy: type of finite sets defined as a subtype of

3388 sets defined by Lifting/Transfer.

3390 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.

3392 * Consolidation of library theories on product orders:

3394 Product_Lattice ~> Product_Order -- pointwise order on products

3395 Product_ord ~> Product_Lexorder -- lexicographic order on products

3397 INCOMPATIBILITY.

3399 * Imperative-HOL: The MREC combinator is considered legacy and no

3400 longer included by default. INCOMPATIBILITY, use partial_function

3401 instead, or import theory Legacy_Mrec as a fallback.

3403 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and

3404 ~~/src/HOL/Algebra/poly. Existing theories should be based on

3405 ~~/src/HOL/Library/Polynomial instead. The latter provides

3406 integration with HOL's type classes for rings. INCOMPATIBILITY.

3408 * HOL-BNF:

3409 - Various improvements to BNF-based (co)datatype package, including

3410 new commands "primrec_new", "primcorec", and

3411 "datatype_new_compat", as well as documentation. See

3412 "datatypes.pdf" for details.

3413 - New "coinduction" method to avoid some boilerplate (compared to

3414 coinduct).

3415 - Renamed keywords:

3416 data ~> datatype_new

3417 codata ~> codatatype

3418 bnf_def ~> bnf

3419 - Renamed many generated theorems, including

3420 discs ~> disc

3421 map_comp' ~> map_comp

3422 map_id' ~> map_id

3423 sels ~> sel

3424 set_map' ~> set_map

3425 sets ~> set

3426 IMCOMPATIBILITY.

3429 *** ML ***

3431 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function

3432 "check_property" allows to check specifications of the form "ALL x y

3433 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its

3434 Examples.thy in particular.

3436 * Improved printing of exception trace in Poly/ML 5.5.1, with regular

3437 tracing output in the command transaction context instead of physical

3438 stdout. See also Toplevel.debug, Toplevel.debugging and

3439 ML_Compiler.exn_trace.

3441 * ML type "theory" is now immutable, without any special treatment of

3442 drafts or linear updates (which could lead to "stale theory" errors in

3443 the past). Discontinued obsolete operations like Theory.copy,

3444 Theory.checkpoint, and the auxiliary type theory_ref. Minor

3445 INCOMPATIBILITY.

3447 * More uniform naming of goal functions for skipped proofs:

3449 Skip_Proof.prove ~> Goal.prove_sorry

3450 Skip_Proof.prove_global ~> Goal.prove_sorry_global

3452 Minor INCOMPATIBILITY.

3454 * Simplifier tactics and tools use proper Proof.context instead of

3455 historic type simpset. Old-style declarations like addsimps,

3456 addsimprocs etc. operate directly on Proof.context. Raw type simpset

3457 retains its use as snapshot of the main Simplifier context, using

3458 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port

3459 old tools by making them depend on (ctxt : Proof.context) instead of

3460 (ss : simpset), then turn (simpset_of ctxt) into ctxt.

3462 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)

3463 operate on Proof.context instead of claset, for uniformity with addIs,

3464 addEs, addDs etc. Note that claset_of and put_claset allow to manage

3465 clasets separately from the context.

3467 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.

3468 INCOMPATIBILITY, use @{context} instead.

3470 * Antiquotation @{theory_context A} is similar to @{theory A}, but

3471 presents the result as initial Proof.context.

3474 *** System ***

3476 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by

3477 "isabelle build" in Isabelle2013. INCOMPATIBILITY.

3479 * Discontinued obsolete isabelle-process options -f and -u (former

3480 administrative aliases of option -e). Minor INCOMPATIBILITY.

3482 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND

3483 settings variable.

3485 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic

3486 document formats: dvi.gz, ps, ps.gz -- the default document format is

3487 always pdf.

3489 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to

3490 specify global resources of the JVM process run by isabelle build.

3492 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows

3493 to run Isabelle/Scala source files as standalone programs.

3495 * Improved "isabelle keywords" tool (for old-style ProofGeneral

3496 keyword tables): use Isabelle/Scala operations, which inspect outer

3497 syntax without requiring to build sessions first.

3499 * Sessions may be organized via 'chapter' specifications in the ROOT

3500 file, which determines a two-level hierarchy of browser info. The old

3501 tree-like organization via implicit sub-session relation (with its

3502 tendency towards erratic fluctuation of URLs) has been discontinued.

3503 The default chapter is called "Unsorted". Potential INCOMPATIBILITY

3504 for HTML presentation of theories.

3508 New in Isabelle2013 (February 2013)

3509 -----------------------------------

3511 *** General ***

3513 * Theorem status about oracles and unfinished/failed future proofs is

3514 no longer printed by default, since it is incompatible with

3515 incremental / parallel checking of the persistent document model. ML

3516 function Thm.peek_status may be used to inspect a snapshot of the

3517 ongoing evaluation process. Note that in batch mode --- notably

3518 isabelle build --- the system ensures that future proofs of all

3519 accessible theorems in the theory context are finished (as before).

3521 * Configuration option show_markup controls direct inlining of markup

3522 into the printed representation of formal entities --- notably type

3523 and sort constraints. This enables Prover IDE users to retrieve that

3524 information via tooltips in the output window, for example.

3526 * Command 'ML_file' evaluates ML text from a file directly within the

3527 theory, without any predeclaration via 'uses' in the theory header.

3529 * Old command 'use' command and corresponding keyword 'uses' in the

3530 theory header are legacy features and will be discontinued soon.

3531 Tools that load their additional source files may imitate the

3532 'ML_file' implementation, such that the system can take care of

3533 dependencies properly.

3535 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which

3536 is called fastforce / fast_force_tac already since Isabelle2011-1.

3538 * Updated and extended "isar-ref" and "implementation" manual, reduced

3539 remaining material in old "ref" manual.

3541 * Improved support for auxiliary contexts that indicate block structure

3542 for specifications. Nesting of "context fixes ... context assumes ..."

3543 and "class ... context ...".

3545 * Attribute "consumes" allows a negative value as well, which is

3546 interpreted relatively to the total number of premises of the rule in

3547 the target context. This form of declaration is stable when exported

3548 from a nested 'context' with additional assumptions. It is the

3549 preferred form for definitional packages, notably cases/rules produced

3550 in HOL/inductive and HOL/function.

3552 * More informative error messages for Isar proof commands involving

3553 lazy enumerations (method applications etc.).

3555 * Refined 'help' command to retrieve outer syntax commands according

3556 to name patterns (with clickable results).

3559 *** Prover IDE -- Isabelle/Scala/jEdit ***

3561 * Parallel terminal proofs ('by') are enabled by default, likewise

3562 proofs that are built into packages like 'datatype', 'function'. This

3563 allows to "run ahead" checking the theory specifications on the

3564 surface, while the prover is still crunching on internal

3565 justifications. Unfinished / cancelled proofs are restarted as

3566 required to complete full proof checking eventually.

3568 * Improved output panel with tooltips, hyperlinks etc. based on the

3569 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of

3570 tooltips leads to some window that supports the same recursively,

3571 which can lead to stacks of tooltips as the semantic document content

3572 is explored. ESCAPE closes the whole stack, individual windows may be

3573 closed separately, or detached to become independent jEdit dockables.

3575 * Improved support for commands that produce graph output: the text

3576 message contains a clickable area to open a new instance of the graph

3577 browser on demand.

3579 * More robust incremental parsing of outer syntax (partial comments,

3580 malformed symbols). Changing the balance of open/close quotes and

3581 comment delimiters works more conveniently with unfinished situations

3582 that frequently occur in user interaction.

3584 * More efficient painting and improved reactivity when editing large

3585 files. More scalable management of formal document content.

3587 * Smarter handling of tracing messages: prover process pauses after

3588 certain number of messages per command transaction, with some user

3589 dialog to stop or continue. This avoids swamping the front-end with

3590 potentially infinite message streams.

3592 * More plugin options and preferences, based on Isabelle/Scala. The

3593 jEdit plugin option panel provides access to some Isabelle/Scala

3594 options, including tuning parameters for editor reactivity and color

3595 schemes.

3597 * Dockable window "Symbols" provides some editing support for Isabelle

3598 symbols.

3600 * Dockable window "Monitor" shows ML runtime statistics. Note that

3601 continuous display of the chart slows down the system.

3603 * Improved editing support for control styles: subscript, superscript,

3604 bold, reset of style -- operating on single symbols or text

3605 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.

3607 * Actions isabelle.increase-font-size and isabelle.decrease-font-size

3608 adjust the main text area font size, and its derivatives for output,

3609 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often

3610 need to be adapted to local keyboard layouts.

3612 * More reactive completion popup by default: use \t (TAB) instead of

3613 \n (NEWLINE) to minimize intrusion into regular flow of editing. See

3614 also "Plugin Options / SideKick / General / Code Completion Options".

3616 * Implicit check and build dialog of the specified logic session

3617 image. For example, HOL, HOLCF, HOL-Nominal can be produced on

3618 demand, without bundling big platform-dependent heap images in the

3619 Isabelle distribution.

3621 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates

3622 from Oracle provide better multi-platform experience. This version is

3623 now bundled exclusively with Isabelle.

3626 *** Pure ***

3628 * Code generation for Haskell: restrict unqualified imports from

3629 Haskell Prelude to a small set of fundamental operations.

3631 * Command 'export_code': relative file names are interpreted

3632 relatively to master directory of current theory rather than the

3633 rather arbitrary current working directory. INCOMPATIBILITY.

3635 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,

3636 use regular rule composition via "OF" / "THEN", or explicit proof

3637 structure instead. Note that Isabelle/ML provides a variety of

3638 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied

3639 with some care where this is really required.

3641 * Command 'typ' supports an additional variant with explicit sort

3642 constraint, to infer and check the most general type conforming to a

3643 given sort. Example (in HOL):

3645 typ "_ * _ * bool * unit" :: finite

3647 * Command 'locale_deps' visualizes all locales and their relations as

3648 a Hasse diagram.

3651 *** HOL ***

3653 * Sledgehammer:

3655 - Added MaSh relevance filter based on machine-learning; see the

3656 Sledgehammer manual for details.

3657 - Polished Isar proofs generated with "isar_proofs" option.

3658 - Rationalized type encodings ("type_enc" option).

3659 - Renamed "kill_provers" subcommand to "kill_all".

3660 - Renamed options:

3661 isar_proof ~> isar_proofs

3662 isar_shrink_factor ~> isar_shrink

3663 max_relevant ~> max_facts

3664 relevance_thresholds ~> fact_thresholds

3666 * Quickcheck: added an optimisation for equality premises. It is

3667 switched on by default, and can be switched off by setting the

3668 configuration quickcheck_optimise_equality to false.

3670 * Quotient: only one quotient can be defined by quotient_type

3671 INCOMPATIBILITY.

3673 * Lifting:

3674 - generation of an abstraction function equation in lift_definition

3675 - quot_del attribute

3676 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)

3678 * Simproc "finite_Collect" rewrites set comprehensions into pointfree

3679 expressions.

3681 * Preprocessing of the code generator rewrites set comprehensions into

3682 pointfree expressions.

3684 * The SMT solver Z3 has now by default a restricted set of directly

3685 supported features. For the full set of features (div/mod, nonlinear

3686 arithmetic, datatypes/records) with potential proof reconstruction

3687 failures, enable the configuration option "z3_with_extensions". Minor

3688 INCOMPATIBILITY.

3690 * Simplified 'typedef' specifications: historical options for implicit

3691 set definition and alternative name have been discontinued. The

3692 former behavior of "typedef (open) t = A" is now the default, but

3693 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories

3694 accordingly.

3696 * Removed constant "chars"; prefer "Enum.enum" on type "char"

3697 directly. INCOMPATIBILITY.

3699 * Moved operation product, sublists and n_lists from theory Enum to

3700 List. INCOMPATIBILITY.

3702 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.

3704 * Class "comm_monoid_diff" formalises properties of bounded

3705 subtraction, with natural numbers and multisets as typical instances.

3707 * Added combinator "Option.these" with type "'a option set => 'a set".

3709 * Theory "Transitive_Closure": renamed lemmas

3711 reflcl_tranclp -> reflclp_tranclp

3712 rtranclp_reflcl -> rtranclp_reflclp

3714 INCOMPATIBILITY.

3716 * Theory "Rings": renamed lemmas (in class semiring)

3718 left_distrib ~> distrib_right

3719 right_distrib ~> distrib_left

3721 INCOMPATIBILITY.

3723 * Generalized the definition of limits:

3725 - Introduced the predicate filterlim (LIM x F. f x :> G) which

3726 expresses that when the input values x converge to F then the

3727 output f x converges to G.

3729 - Added filters for convergence to positive (at_top) and negative

3730 infinity (at_bot).

3732 - Moved infinity in the norm (at_infinity) from

3733 Multivariate_Analysis to Complex_Main.

3735 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>

3736 at_top".

3738 INCOMPATIBILITY.

3740 * Theory "Library/Option_ord" provides instantiation of option type to

3741 lattice type classes.

3743 * Theory "Library/Multiset": renamed

3745 constant fold_mset ~> Multiset.fold

3746 fact fold_mset_commute ~> fold_mset_comm

3748 INCOMPATIBILITY.

3750 * Renamed theory Library/List_Prefix to Library/Sublist, with related

3751 changes as follows.

3753 - Renamed constants (and related lemmas)

3755 prefix ~> prefixeq

3756 strict_prefix ~> prefix

3758 - Replaced constant "postfix" by "suffixeq" with swapped argument

3759 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped

3760 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.

3761 Renamed lemmas accordingly.

3763 - Added constant "list_hembeq" for homeomorphic embedding on

3764 lists. Added abbreviation "sublisteq" for special case

3765 "list_hembeq (op =)".

3767 - Theory Library/Sublist no longer provides "order" and "bot" type

3768 class instances for the prefix order (merely corresponding locale

3769 interpretations). The type class instances are now in theory

3770 Library/Prefix_Order.

3772 - The sublist relation of theory Library/Sublist_Order is now based

3773 on "Sublist.sublisteq". Renamed lemmas accordingly:

3775 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff

3776 le_list_append_mono ~> Sublist.list_hembeq_append_mono

3777 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2

3778 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD

3779 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'

3780 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq

3781 le_list_drop_Cons ~> Sublist.sublisteq_Cons'

3782 le_list_drop_many ~> Sublist.sublisteq_drop_many

3783 le_list_filter_left ~> Sublist.sublisteq_filter_left

3784 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many

3785 le_list_rev_take_iff ~> Sublist.sublisteq_append

3786 le_list_same_length ~> Sublist.sublisteq_same_length

3787 le_list_take_many_iff ~> Sublist.sublisteq_append'

3788 less_eq_list.drop ~> less_eq_list_drop

3789 less_eq_list.induct ~> less_eq_list_induct

3790 not_le_list_length ~> Sublist.not_sublisteq_length

3792 INCOMPATIBILITY.

3794 * New theory Library/Countable_Set.

3796 * Theory Library/Debug and Library/Parallel provide debugging and

3797 parallel execution for code generated towards Isabelle/ML.

3799 * Theory Library/FuncSet: Extended support for Pi and extensional and

3800 introduce the extensional dependent function space "PiE". Replaced

3801 extensional_funcset by an abbreviation, and renamed lemmas from

3802 extensional_funcset to PiE as follows:

3804 extensional_empty ~> PiE_empty

3805 extensional_funcset_empty_domain ~> PiE_empty_domain

3806 extensional_funcset_empty_range ~> PiE_empty_range

3807 extensional_funcset_arb ~> PiE_arb

3808 extensional_funcset_mem ~> PiE_mem

3809 extensional_funcset_extend_domainI ~> PiE_fun_upd

3810 extensional_funcset_restrict_domain ~> fun_upd_in_PiE

3811 extensional_funcset_extend_domain_eq ~> PiE_insert_eq

3812 card_extensional_funcset ~> card_PiE

3813 finite_extensional_funcset ~> finite_PiE

3815 INCOMPATIBILITY.

3817 * Theory Library/FinFun: theory of almost everywhere constant

3818 functions (supersedes the AFP entry "Code Generation for Functions as

3819 Data").

3821 * Theory Library/Phantom: generic phantom type to make a type

3822 parameter appear in a constant's type. This alternative to adding

3823 TYPE('a) as another parameter avoids unnecessary closures in generated

3824 code.

3826 * Theory Library/RBT_Impl: efficient construction of red-black trees

3827 from sorted associative lists. Merging two trees with rbt_union may

3828 return a structurally different tree than before. Potential

3829 INCOMPATIBILITY.

3831 * Theory Library/IArray: immutable arrays with code generation.

3833 * Theory Library/Finite_Lattice: theory of finite lattices.

3835 * HOL/Multivariate_Analysis: replaced

3837 "basis :: 'a::euclidean_space => nat => real"

3838 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"

3840 on euclidean spaces by using the inner product "_ \<bullet> _" with

3841 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by

3842 "SUM i : Basis. f i * r i".

3844 With this change the following constants are also changed or removed:

3846 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)

3847 a $$ i ~> inner a i (where i : Basis)

3848 cart_base i removed

3849 \<pi>, \<pi>' removed

3851 Theorems about these constants where removed.

3853 Renamed lemmas:

3855 component_le_norm ~> Basis_le_norm

3856 euclidean_eq ~> euclidean_eq_iff

3857 differential_zero_maxmin_component ~> differential_zero_maxmin_cart

3858 euclidean_simps ~> inner_simps

3859 independent_basis ~> independent_Basis

3860 span_basis ~> span_Basis

3861 in_span_basis ~> in_span_Basis

3862 norm_bound_component_le ~> norm_boound_Basis_le

3863 norm_bound_component_lt ~> norm_boound_Basis_lt

3864 component_le_infnorm ~> Basis_le_infnorm

3866 INCOMPATIBILITY.

3868 * HOL/Probability:

3870 - Added simproc "measurable" to automatically prove measurability.

3872 - Added induction rules for sigma sets with disjoint union

3873 (sigma_sets_induct_disjoint) and for Borel-measurable functions

3874 (borel_measurable_induct).

3876 - Added the Daniell-Kolmogorov theorem (the existence the limit of a

3877 projective family).

3879 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the

3880 AFP entry "Ordinals_and_Cardinals").

3882 * HOL/BNF: New (co)datatype package based on bounded natural functors

3883 with support for mixed, nested recursion and interesting non-free

3884 datatypes.

3886 * HOL/Finite_Set and Relation: added new set and relation operations

3887 expressed by Finite_Set.fold.

3889 * New theory HOL/Library/RBT_Set: implementation of sets by red-black

3890 trees for the code generator.

3892 * HOL/Library/RBT and HOL/Library/Mapping have been converted to

3893 Lifting/Transfer.

3894 possible INCOMPATIBILITY.

3896 * HOL/Set: renamed Set.project -> Set.filter

3897 INCOMPATIBILITY.

3900 *** Document preparation ***

3902 * Dropped legacy antiquotations "term_style" and "thm_style", since

3903 styles may be given as arguments to "term" and "thm" already.

3904 Discontinued legacy styles "prem1" .. "prem19".

3906 * Default LaTeX rendering for \<euro> is now based on eurosym package,

3907 instead of slightly exotic babel/greek.

3909 * Document variant NAME may use different LaTeX entry point

3910 document/root_NAME.tex if that file exists, instead of the common

3911 document/root.tex.

3913 * Simplified custom document/build script, instead of old-style

3914 document/IsaMakefile. Minor INCOMPATIBILITY.

3917 *** ML ***

3919 * The default limit for maximum number of worker threads is now 8,

3920 instead of 4, in correspondence to capabilities of contemporary

3921 hardware and Poly/ML runtime system.

3923 * Type Seq.results and related operations support embedded error

3924 messages within lazy enumerations, and thus allow to provide

3925 informative errors in the absence of any usable results.

3927 * Renamed Position.str_of to Position.here to emphasize that this is a

3928 formal device to inline positions into message text, but not

3929 necessarily printing visible text.

3932 *** System ***

3934 * Advanced support for Isabelle sessions and build management, see

3935 "system" manual for the chapter of that name, especially the "isabelle

3936 build" tool and its examples. The "isabelle mkroot" tool prepares

3937 session root directories for use with "isabelle build", similar to

3938 former "isabelle mkdir" for "isabelle usedir". Note that this affects

3939 document preparation as well. INCOMPATIBILITY, isabelle usedir /

3940 mkdir / make are rendered obsolete.

3942 * Discontinued obsolete Isabelle/build script, it is superseded by the

3943 regular isabelle build tool. For example:

3945 isabelle build -s -b HOL

3947 * Discontinued obsolete "isabelle makeall".

3949 * Discontinued obsolete IsaMakefile and ROOT.ML files from the

3950 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that

3951 provides some traditional targets that invoke "isabelle build". Note

3952 that this is inefficient! Applications of Isabelle/HOL involving

3953 "isabelle make" should be upgraded to use "isabelle build" directly.

3955 * The "isabelle options" tool prints Isabelle system options, as

3956 required for "isabelle build", for example.

3958 * The "isabelle logo" tool produces EPS and PDF format simultaneously.

3959 Minor INCOMPATIBILITY in command-line options.

3961 * The "isabelle install" tool has now a simpler command-line. Minor

3962 INCOMPATIBILITY.

3964 * The "isabelle components" tool helps to resolve add-on components

3965 that are not bundled, or referenced from a bare-bones repository

3966 version of Isabelle.

3968 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general

3969 platform family: "linux", "macos", "windows".

3971 * The ML system is configured as regular component, and no longer

3972 picked up from some surrounding directory. Potential INCOMPATIBILITY

3973 for home-made settings.

3975 * Improved ML runtime statistics (heap, threads, future tasks etc.).

3977 * Discontinued support for Poly/ML 5.2.1, which was the last version

3978 without exception positions and advanced ML compiler/toplevel

3979 configuration.

3981 * Discontinued special treatment of Proof General -- no longer guess

3982 PROOFGENERAL_HOME based on accidental file-system layout. Minor

3983 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS

3984 settings manually, or use a Proof General version that has been

3985 bundled as Isabelle component.

3989 New in Isabelle2012 (May 2012)

3990 ------------------------------

3992 *** General ***

3994 * Prover IDE (PIDE) improvements:

3996 - more robust Sledgehammer integration (as before the sledgehammer

3997 command-line needs to be typed into the source buffer)

3998 - markup for bound variables

3999 - markup for types of term variables (displayed as tooltips)

4000 - support for user-defined Isar commands within the running session

4001 - improved support for Unicode outside original 16bit range

4002 e.g. glyph for \<A> (thanks to jEdit 4.5.1)

4004 * Forward declaration of outer syntax keywords within the theory

4005 header -- minor INCOMPATIBILITY for user-defined commands. Allow new

4006 commands to be used in the same theory where defined.

4008 * Auxiliary contexts indicate block structure for specifications with

4009 additional parameters and assumptions. Such unnamed contexts may be

4010 nested within other targets, like 'theory', 'locale', 'class',

4011 'instantiation' etc. Results from the local context are generalized

4012 accordingly and applied to the enclosing target context. Example:

4014 context

4015 fixes x y z :: 'a

4016 assumes xy: "x = y" and yz: "y = z"

4017 begin

4019 lemma my_trans: "x = z" using xy yz by simp

4021 end

4023 thm my_trans

4025 The most basic application is to factor-out context elements of

4026 several fixes/assumes/shows theorem statements, e.g. see

4027 ~~/src/HOL/Isar_Examples/Group_Context.thy

4029 Any other local theory specification element works within the "context

4030 ... begin ... end" block as well.

4032 * Bundled declarations associate attributed fact expressions with a

4033 given name in the context. These may be later included in other

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

4035 the logical dependencies of locales and locale interpretation. See

4036 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.

4038 * Commands 'lemmas' and 'theorems' allow local variables using 'for'

4039 declaration, and results are standardized before being stored. Thus

4040 old-style "standard" after instantiation or composition of facts

4041 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of

4042 indices of schematic variables.

4044 * Rule attributes in local theory declarations (e.g. locale or class)

4045 are now statically evaluated: the resulting theorem is stored instead

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

4047 the historic accident of dynamic re-evaluation in interpretations

4048 etc. was exploited.

4050 * New tutorial "Programming and Proving in Isabelle/HOL"

4051 ("prog-prove"). It completely supersedes "A Tutorial Introduction to

4052 Structured Isar Proofs" ("isar-overview"), which has been removed. It

4053 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order

4054 Logic" as the recommended beginners tutorial, but does not cover all

4055 of the material of that old tutorial.

4057 * Updated and extended reference manuals: "isar-ref",

4058 "implementation", "system"; reduced remaining material in old "ref"

4059 manual.

4062 *** Pure ***

4064 * Command 'definition' no longer exports the foundational "raw_def"

4065 into the user context. Minor INCOMPATIBILITY, may use the regular

4066 "def" result with attribute "abs_def" to imitate the old version.

4068 * Attribute "abs_def" turns an equation of the form "f x y == t" into

4069 "f == %x y. t", which ensures that "simp" or "unfold" steps always

4070 expand it. This also works for object-logic equality. (Formerly

4071 undocumented feature.)

4073 * Sort constraints are now propagated in simultaneous statements, just

4074 like type constraints. INCOMPATIBILITY in rare situations, where

4075 distinct sorts used to be assigned accidentally. For example:

4077 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"

4079 lemma "P (x::'a)" and "Q (y::'a::bar)"

4080 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"

4082 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more

4083 tolerant against multiple unifiers, as long as the final result is

4084 unique. (As before, rules are composed in canonical right-to-left

4085 order to accommodate newly introduced premises.)

4087 * Renamed some inner syntax categories:

4089 num ~> num_token

4090 xnum ~> xnum_token

4091 xstr ~> str_token

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

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

4095 position information via constraints).

4097 * Simplified configuration options for syntax ambiguity: see

4098 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref

4099 manual. Minor INCOMPATIBILITY.

4101 * Discontinued configuration option "syntax_positions": atomic terms

4102 in parse trees are always annotated by position constraints.

4104 * Old code generator for SML and its commands 'code_module',

4105 'code_library', 'consts_code', 'types_code' have been discontinued.

4106 Use commands of the generic code generator instead. INCOMPATIBILITY.

4108 * Redundant attribute "code_inline" has been discontinued. Use

4109 "code_unfold" instead. INCOMPATIBILITY.

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

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

4114 definition [code_abbrev]: "f = t"

4116 INCOMPATIBILITY.

4118 * Obsolete 'types' command has been discontinued. Use 'type_synonym'

4119 instead. INCOMPATIBILITY.

4121 * Discontinued old "prems" fact, which used to refer to the accidental

4122 collection of foundational premises in the context (already marked as

4123 legacy since Isabelle2011).

4126 *** HOL ***

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

4129 Isabelle2008). Definitions mem_def and Collect_def have disappeared.

4130 Non-trivial INCOMPATIBILITY. For developments keeping predicates and

4131 sets separate, it is often sufficient to rephrase some set S that has

4132 been accidentally used as predicates by "%x. x : S", and some

4133 predicate P that has been accidentally used as set by "{x. P x}".

4134 Corresponding proofs in a first step should be pruned from any

4135 tinkering with former theorems mem_def and Collect_def as far as

4136 possible.

4138 For developments which deliberately mix predicates and sets, a

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

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

4141 Isabelle2011-1 before jumping right into the current release.

4143 * Code generation by default implements sets as container type rather

4144 than predicates. INCOMPATIBILITY.

4146 * New type synonym 'a rel = ('a * 'a) set

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

4149 represents strictly positive binary numerals, along with functions

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

4151 positive and negated numeric literals, respectively. See also

4152 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some

4153 user theories may require adaptations as follows:

4155 - Theorems with number_ring or number_semiring constraints: These

4156 classes are gone; use comm_ring_1 or comm_semiring_1 instead.

4158 - Theories defining numeric types: Remove number, number_semiring,

4159 and number_ring instances. Defer all theorems about numerals until

4160 after classes one and semigroup_add have been instantiated.

4162 - Numeral-only simp rules: Replace each rule having a "number_of v"

4163 pattern with two copies, one for numeral and one for neg_numeral.

4165 - Theorems about subclasses of semiring_1 or ring_1: These classes

4166 automatically support numerals now, so more simp rules and

4167 simprocs may now apply within the proof.

4169 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:

4170 Redefine using other integer operations.

4172 * Transfer: New package intended to generalize the existing

4173 "descending" method and related theorem attributes from the Quotient

4174 package. (Not all functionality is implemented yet, but future

4175 development will focus on Transfer as an eventual replacement for the

4176 corresponding parts of the Quotient package.)

4178 - transfer_rule attribute: Maintains a collection of transfer rules,

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

4180 relate different type instances of the same polymorphic constant,

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

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

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

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

4187 - transfer method: Replaces a subgoal on abstract types with an

4188 equivalent subgoal on the corresponding raw types. Constants are

4189 replaced with corresponding ones according to the transfer rules.

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

4191 necessary for variables whose types change, but can be overridden

4192 for specific variables with e.g. "transfer fixing: x y z". The

4193 variant transfer' method allows replacing a subgoal with one that

4194 is logically stronger (rather than equivalent).

4196 - relator_eq attribute: Collects identity laws for relators of

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

4198 transfer method uses these lemmas to infer transfer rules for

4199 non-polymorphic constants on the fly.

4201 - transfer_prover method: Assists with proving a transfer rule for a

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

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

4204 after unfolding the constant definitions.

4206 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer

4207 from type nat to type int.

4209 * Lifting: New package intended to generalize the quotient_definition

4210 facility of the Quotient package; designed to work with Transfer.

4212 - lift_definition command: Defines operations on an abstract type in

4213 terms of a corresponding operation on a representation

4214 type. Example syntax:

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

4217 is List.insert

4219 Users must discharge a respectfulness proof obligation when each

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

4221 the proof is discharged automatically.) The obligation is

4222 presented in a user-friendly, readable form; a respectfulness

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

4224 by the package.

4226 - Integration with code_abstype: For typedefs (e.g. subtypes

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

4228 lift_definition generates a code certificate theorem and sets up

4229 code generation for each constant.

4231 - setup_lifting command: Sets up the Lifting package to work with a

4232 user-defined type. The user must provide either a quotient theorem

4233 or a type_definition theorem. The package configures transfer

4234 rules for equality and quantifiers on the type, and sets up the

4235 lift_definition command to work with the type.

4237 - Usage examples: See Quotient_Examples/Lift_DList.thy,

4238 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,

4239 Word/Word.thy and Library/Float.thy.

4241 * Quotient package:

4243 - The 'quotient_type' command now supports a 'morphisms' option with

4244 rep and abs functions, similar to typedef.

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

4247 Transfer packages, as with 'setup_lifting'.

4249 - The 'quotient_definition' command now requires the user to prove a

4250 respectfulness property at the point where the constant is

4251 defined, similar to lift_definition; INCOMPATIBILITY.

4253 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems

4254 accordingly, INCOMPATIBILITY.

4256 * New diagnostic command 'find_unused_assms' to find potentially

4257 superfluous assumptions in theorems using Quickcheck.

4259 * Quickcheck:

4261 - Quickcheck returns variable assignments as counterexamples, which

4262 allows to reveal the underspecification of functions under test.

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

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

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

4267 These counterexample are marked as potentially spurious, as

4268 Quickcheck also returns "xs = []" as a counterexample to the

4269 obvious theorem "hd xs = hd xs".

4271 After finding a potentially spurious counterexample, Quickcheck

4272 continues searching for genuine ones.

4274 By default, Quickcheck shows potentially spurious and genuine

4275 counterexamples. The option "genuine_only" sets quickcheck to only

4276 show genuine counterexamples.

4278 - The command 'quickcheck_generator' creates random and exhaustive

4279 value generators for a given type and operations.

4281 It generates values by using the operations as if they were

4282 constructors of that type.

4284 - Support for multisets.

4286 - Added "use_subtype" options.

4288 - Added "quickcheck_locale" configuration to specify how to process

4289 conjectures in a locale context.

4291 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option

4292 and affecting 'rat' and 'real'.

4294 * Sledgehammer:

4295 - Integrated more tightly with SPASS, as described in the ITP 2012

4296 paper "More SPASS with Isabelle".

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

4298 - Added support for the following provers: Alt-Ergo (via Why3 and

4299 TFF1), iProver, iProver-Eq.

4300 - Sped up the minimizer.

4301 - Added "lam_trans", "uncurry_aliases", and "minimize" options.

4302 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").

4303 - Renamed "sound" option to "strict".

4305 * Metis: Added possibility to specify lambda translations scheme as a

4306 parenthesized argument (e.g., "by (metis (lifting) ...)").

4308 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".

4310 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.

4312 * New "case_product" attribute to generate a case rule doing multiple

4313 case distinctions at the same time. E.g.

4315 list.exhaust [case_product nat.exhaust]

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

4318 a list and a nat.

4320 * New "eventually_elim" method as a generalized variant of the

4321 eventually_elim* rules. Supports structured proofs.

4323 * Typedef with implicit set definition is considered legacy. Use

4324 "typedef (open)" form instead, which will eventually become the

4325 default.

4327 * Record: code generation can be switched off manually with

4329 declare [[record_coden = false]] -- "default true"

4331 * Datatype: type parameters allow explicit sort constraints.

4333 * Concrete syntax for case expressions includes constraints for source

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

4335 INCOMPATIBILITY for old-style syntax translations that augment the

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

4337 one_case.

4339 * Clarified attribute "mono_set": pure declaration without modifying

4340 the result of the fact expression.

4342 * More default pred/set conversions on a couple of relation operations

4343 and predicates. Added powers of predicate relations. Consolidation

4344 of some relation theorems:

4346 converse_def ~> converse_unfold

4347 rel_comp_def ~> relcomp_unfold

4348 symp_def ~> (modified, use symp_def and sym_def instead)

4349 transp_def ~> transp_trans

4350 Domain_def ~> Domain_unfold

4351 Range_def ~> Domain_converse [symmetric]

4353 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.

4355 See theory "Relation" for examples for making use of pred/set

4356 conversions by means of attributes "to_set" and "to_pred".

4358 INCOMPATIBILITY.

4360 * Renamed facts about the power operation on relations, i.e., relpow

4361 to match the constant's name:

4363 rel_pow_1 ~> relpow_1

4364 rel_pow_0_I ~> relpow_0_I

4365 rel_pow_Suc_I ~> relpow_Suc_I

4366 rel_pow_Suc_I2 ~> relpow_Suc_I2

4367 rel_pow_0_E ~> relpow_0_E

4368 rel_pow_Suc_E ~> relpow_Suc_E

4369 rel_pow_E ~> relpow_E

4370 rel_pow_Suc_D2 ~> relpow_Suc_D2

4371 rel_pow_Suc_E2 ~> relpow_Suc_E2

4372 rel_pow_Suc_D2' ~> relpow_Suc_D2'

4373 rel_pow_E2 ~> relpow_E2

4374 rel_pow_add ~> relpow_add

4375 rel_pow_commute ~> relpow

4376 rel_pow_empty ~> relpow_empty:

4377 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow

4378 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl

4379 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow

4380 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow

4381 rel_pow_fun_conv ~> relpow_fun_conv

4382 rel_pow_finite_bounded1 ~> relpow_finite_bounded1

4383 rel_pow_finite_bounded ~> relpow_finite_bounded

4384 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow

4385 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow

4386 single_valued_rel_pow ~> single_valued_relpow

4388 INCOMPATIBILITY.

4390 * Theory Relation: Consolidated constant name for relation composition

4391 and corresponding theorem names:

4393 - Renamed constant rel_comp to relcomp.

4395 - Dropped abbreviation pred_comp. Use relcompp instead.

4397 - Renamed theorems:

4399 rel_compI ~> relcompI

4400 rel_compEpair ~> relcompEpair

4401 rel_compE ~> relcompE

4402 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq

4403 rel_comp_empty1 ~> relcomp_empty1

4404 rel_comp_mono ~> relcomp_mono

4405 rel_comp_subset_Sigma ~> relcomp_subset_Sigma

4406 rel_comp_distrib ~> relcomp_distrib

4407 rel_comp_distrib2 ~> relcomp_distrib2

4408 rel_comp_UNION_distrib ~> relcomp_UNION_distrib

4409 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2

4410 single_valued_rel_comp ~> single_valued_relcomp

4411 rel_comp_def ~> relcomp_unfold

4412 converse_rel_comp ~> converse_relcomp

4413 pred_compI ~> relcomppI

4414 pred_compE ~> relcomppE

4415 pred_comp_bot1 ~> relcompp_bot1

4416 pred_comp_bot2 ~> relcompp_bot2

4417 transp_pred_comp_less_eq ~> transp_relcompp_less_eq

4418 pred_comp_mono ~> relcompp_mono

4419 pred_comp_distrib ~> relcompp_distrib

4420 pred_comp_distrib2 ~> relcompp_distrib2

4421 converse_pred_comp ~> converse_relcompp

4423 finite_rel_comp ~> finite_relcomp

4425 set_rel_comp ~> set_relcomp

4427 INCOMPATIBILITY.

4429 * Theory Divides: Discontinued redundant theorems about div and mod.

4430 INCOMPATIBILITY, use the corresponding generic theorems instead.

4432 DIVISION_BY_ZERO ~> div_by_0, mod_by_0

4433 zdiv_self ~> div_self

4434 zmod_self ~> mod_self

4435 zdiv_zero ~> div_0

4436 zmod_zero ~> mod_0

4437 zdiv_zmod_equality ~> div_mod_equality2

4438 zdiv_zmod_equality2 ~> div_mod_equality

4439 zmod_zdiv_trivial ~> mod_div_trivial

4440 zdiv_zminus_zminus ~> div_minus_minus

4441 zmod_zminus_zminus ~> mod_minus_minus

4442 zdiv_zminus2 ~> div_minus_right

4443 zmod_zminus2 ~> mod_minus_right

4444 zdiv_minus1_right ~> div_minus1_right

4445 zmod_minus1_right ~> mod_minus1_right

4446 zdvd_mult_div_cancel ~> dvd_mult_div_cancel

4447 zmod_zmult1_eq ~> mod_mult_right_eq

4448 zpower_zmod ~> power_mod

4449 zdvd_zmod ~> dvd_mod

4450 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd

4451 mod_mult_distrib ~> mult_mod_left

4452 mod_mult_distrib2 ~> mult_mod_right

4454 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use

4455 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.

4457 * Finite_Set.fold now qualified. INCOMPATIBILITY.

4459 * Consolidated theorem names concerning fold combinators:

4461 inf_INFI_fold_inf ~> inf_INF_fold_inf

4462 sup_SUPR_fold_sup ~> sup_SUP_fold_sup

4463 INFI_fold_inf ~> INF_fold_inf

4464 SUPR_fold_sup ~> SUP_fold_sup

4465 union_set ~> union_set_fold

4466 minus_set ~> minus_set_fold

4467 INFI_set_fold ~> INF_set_fold

4468 SUPR_set_fold ~> SUP_set_fold

4469 INF_code ~> INF_set_foldr

4470 SUP_code ~> SUP_set_foldr

4471 foldr.simps ~> foldr.simps (in point-free formulation)

4472 foldr_fold_rev ~> foldr_conv_fold

4473 foldl_fold ~> foldl_conv_fold

4474 foldr_foldr ~> foldr_conv_foldl

4475 foldl_foldr ~> foldl_conv_foldr

4476 fold_set_remdups ~> fold_set_fold_remdups

4477 fold_set ~> fold_set_fold

4478 fold1_set ~> fold1_set_fold

4480 INCOMPATIBILITY.

4482 * Dropped rarely useful theorems concerning fold combinators:

4483 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,

4484 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,

4485 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,

4486 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,

4487 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,

4488 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.

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

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

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

4492 unfolding "foldr_conv_fold" and "foldl_conv_fold".

4494 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,

4495 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,

4496 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,

4497 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding

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

4499 fold_conv_foldr and fold_rev.

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

4502 through option types.

4504 * "Transitive_Closure.ntrancl": bounded transitive closure on

4505 relations.

4507 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.

4509 * Theory Int: Discontinued many legacy theorems specific to type int.

4510 INCOMPATIBILITY, use the corresponding generic theorems instead.

4512 zminus_zminus ~> minus_minus

4513 zminus_0 ~> minus_zero

4514 zminus_zadd_distrib ~> minus_add_distrib

4515 zadd_commute ~> add_commute

4516 zadd_assoc ~> add_assoc

4517 zadd_left_commute ~> add_left_commute

4518 zadd_ac ~> add_ac

4519 zmult_ac ~> mult_ac

4520 zadd_0 ~> add_0_left

4521 zadd_0_right ~> add_0_right

4522 zadd_zminus_inverse2 ~> left_minus

4523 zmult_zminus ~> mult_minus_left

4524 zmult_commute ~> mult_commute

4525 zmult_assoc ~> mult_assoc

4526 zadd_zmult_distrib ~> left_distrib

4527 zadd_zmult_distrib2 ~> right_distrib

4528 zdiff_zmult_distrib ~> left_diff_distrib

4529 zdiff_zmult_distrib2 ~> right_diff_distrib

4530 zmult_1 ~> mult_1_left

4531 zmult_1_right ~> mult_1_right

4532 zle_refl ~> order_refl

4533 zle_trans ~> order_trans

4534 zle_antisym ~> order_antisym

4535 zle_linear ~> linorder_linear

4536 zless_linear ~> linorder_less_linear

4537 zadd_left_mono ~> add_left_mono

4538 zadd_strict_right_mono ~> add_strict_right_mono

4539 zadd_zless_mono ~> add_less_le_mono

4540 int_0_less_1 ~> zero_less_one

4541 int_0_neq_1 ~> zero_neq_one

4542 zless_le ~> less_le

4543 zpower_zadd_distrib ~> power_add

4544 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff

4545 zero_le_zpower_abs ~> zero_le_power_abs

4547 * Theory Deriv: Renamed

4549 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing

4551 * Theory Library/Multiset: Improved code generation of multisets.

4553 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets

4554 are expressed via type classes again. The special syntax

4555 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant

4556 setsum_set, which is now subsumed by Big_Operators.setsum.

4557 INCOMPATIBILITY.

4559 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,

4560 use theory HOL/Library/Nat_Bijection instead.

4562 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black

4563 trees is now inside a type class context. Names of affected

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

4565 theories working directly with raw red-black trees, adapt the names as

4566 follows:

4568 Operations:

4569 bulkload -> rbt_bulkload

4570 del_from_left -> rbt_del_from_left

4571 del_from_right -> rbt_del_from_right

4572 del -> rbt_del

4573 delete -> rbt_delete

4574 ins -> rbt_ins

4575 insert -> rbt_insert

4576 insertw -> rbt_insert_with

4577 insert_with_key -> rbt_insert_with_key

4578 map_entry -> rbt_map_entry

4579 lookup -> rbt_lookup

4580 sorted -> rbt_sorted

4581 tree_greater -> rbt_greater

4582 tree_less -> rbt_less

4583 tree_less_symbol -> rbt_less_symbol

4584 union -> rbt_union

4585 union_with -> rbt_union_with

4586 union_with_key -> rbt_union_with_key

4588 Lemmas:

4589 balance_left_sorted -> balance_left_rbt_sorted

4590 balance_left_tree_greater -> balance_left_rbt_greater

4591 balance_left_tree_less -> balance_left_rbt_less

4592 balance_right_sorted -> balance_right_rbt_sorted

4593 balance_right_tree_greater -> balance_right_rbt_greater

4594 balance_right_tree_less -> balance_right_rbt_less

4595 balance_sorted -> balance_rbt_sorted

4596 balance_tree_greater -> balance_rbt_greater

4597 balance_tree_less -> balance_rbt_less

4598 bulkload_is_rbt -> rbt_bulkload_is_rbt

4599 combine_sorted -> combine_rbt_sorted

4600 combine_tree_greater -> combine_rbt_greater

4601 combine_tree_less -> combine_rbt_less

4602 delete_in_tree -> rbt_delete_in_tree

4603 delete_is_rbt -> rbt_delete_is_rbt

4604 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater

4605 del_from_left_tree_less -> rbt_del_from_left_rbt_less

4606 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater

4607 del_from_right_tree_less -> rbt_del_from_right_rbt_less

4608 del_in_tree -> rbt_del_in_tree

4609 del_inv1_inv2 -> rbt_del_inv1_inv2

4610 del_sorted -> rbt_del_rbt_sorted

4611 del_tree_greater -> rbt_del_rbt_greater

4612 del_tree_less -> rbt_del_rbt_less

4613 dom_lookup_Branch -> dom_rbt_lookup_Branch

4614 entries_lookup -> entries_rbt_lookup

4615 finite_dom_lookup -> finite_dom_rbt_lookup

4616 insert_sorted -> rbt_insert_rbt_sorted

4617 insertw_is_rbt -> rbt_insertw_is_rbt

4618 insertwk_is_rbt -> rbt_insertwk_is_rbt

4619 insertwk_sorted -> rbt_insertwk_rbt_sorted

4620 insertw_sorted -> rbt_insertw_rbt_sorted

4621 ins_sorted -> ins_rbt_sorted

4622 ins_tree_greater -> ins_rbt_greater

4623 ins_tree_less -> ins_rbt_less

4624 is_rbt_sorted -> is_rbt_rbt_sorted

4625 lookup_balance -> rbt_lookup_balance

4626 lookup_bulkload -> rbt_lookup_rbt_bulkload

4627 lookup_delete -> rbt_lookup_rbt_delete

4628 lookup_Empty -> rbt_lookup_Empty

4629 lookup_from_in_tree -> rbt_lookup_from_in_tree

4630 lookup_in_tree -> rbt_lookup_in_tree

4631 lookup_ins -> rbt_lookup_ins

4632 lookup_insert -> rbt_lookup_rbt_insert

4633 lookup_insertw -> rbt_lookup_rbt_insertw

4634 lookup_insertwk -> rbt_lookup_rbt_insertwk

4635 lookup_keys -> rbt_lookup_keys

4636 lookup_map -> rbt_lookup_map

4637 lookup_map_entry -> rbt_lookup_rbt_map_entry

4638 lookup_tree_greater -> rbt_lookup_rbt_greater

4639 lookup_tree_less -> rbt_lookup_rbt_less

4640 lookup_union -> rbt_lookup_rbt_union

4641 map_entry_color_of -> rbt_map_entry_color_of

4642 map_entry_inv1 -> rbt_map_entry_inv1

4643 map_entry_inv2 -> rbt_map_entry_inv2

4644 map_entry_is_rbt -> rbt_map_entry_is_rbt

4645 map_entry_sorted -> rbt_map_entry_rbt_sorted

4646 map_entry_tree_greater -> rbt_map_entry_rbt_greater

4647 map_entry_tree_less -> rbt_map_entry_rbt_less

4648 map_tree_greater -> map_rbt_greater

4649 map_tree_less -> map_rbt_less

4650 map_sorted -> map_rbt_sorted

4651 paint_sorted -> paint_rbt_sorted

4652 paint_lookup -> paint_rbt_lookup

4653 paint_tree_greater -> paint_rbt_greater

4654 paint_tree_less -> paint_rbt_less

4655 sorted_entries -> rbt_sorted_entries

4656 tree_greater_eq_trans -> rbt_greater_eq_trans

4657 tree_greater_nit -> rbt_greater_nit

4658 tree_greater_prop -> rbt_greater_prop

4659 tree_greater_simps -> rbt_greater_simps

4660 tree_greater_trans -> rbt_greater_trans

4661 tree_less_eq_trans -> rbt_less_eq_trans

4662 tree_less_nit -> rbt_less_nit

4663 tree_less_prop -> rbt_less_prop

4664 tree_less_simps -> rbt_less_simps

4665 tree_less_trans -> rbt_less_trans

4666 tree_ord_props -> rbt_ord_props

4667 union_Branch -> rbt_union_Branch

4668 union_is_rbt -> rbt_union_is_rbt

4669 unionw_is_rbt -> rbt_unionw_is_rbt

4670 unionwk_is_rbt -> rbt_unionwk_is_rbt

4671 unionwk_sorted -> rbt_unionwk_rbt_sorted

4673 * Theory HOL/Library/Float: Floating point numbers are now defined as

4674 a subset of the real numbers. All operations are defined using the

4675 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.

4677 Changed Operations:

4678 float_abs -> abs

4679 float_nprt -> nprt

4680 float_pprt -> pprt

4681 pow2 -> use powr

4682 round_down -> float_round_down

4683 round_up -> float_round_up

4684 scale -> exponent

4686 Removed Operations:

4687 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod

4689 Renamed Lemmas:

4690 abs_float_def -> Float.compute_float_abs

4691 bitlen_ge0 -> bitlen_nonneg

4692 bitlen.simps -> Float.compute_bitlen

4693 float_components -> Float_mantissa_exponent

4694 float_divl.simps -> Float.compute_float_divl

4695 float_divr.simps -> Float.compute_float_divr

4696 float_eq_odd -> mult_powr_eq_mult_powr_iff

4697 float_power -> real_of_float_power

4698 lapprox_posrat_def -> Float.compute_lapprox_posrat

4699 lapprox_rat.simps -> Float.compute_lapprox_rat

4700 le_float_def' -> Float.compute_float_le

4701 le_float_def -> less_eq_float.rep_eq

4702 less_float_def' -> Float.compute_float_less

4703 less_float_def -> less_float.rep_eq

4704 normfloat_def -> Float.compute_normfloat

4705 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0

4706 normfloat -> normfloat_def

4707 normfloat_unique -> use normfloat_def

4708 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral

4709 one_float_def -> Float.compute_float_one

4710 plus_float_def -> Float.compute_float_plus

4711 rapprox_posrat_def -> Float.compute_rapprox_posrat

4712 rapprox_rat.simps -> Float.compute_rapprox_rat

4713 real_of_float_0 -> zero_float.rep_eq

4714 real_of_float_1 -> one_float.rep_eq

4715 real_of_float_abs -> abs_float.rep_eq

4716 real_of_float_add -> plus_float.rep_eq

4717 real_of_float_minus -> uminus_float.rep_eq

4718 real_of_float_mult -> times_float.rep_eq

4719 real_of_float_simp -> Float.rep_eq

4720 real_of_float_sub -> minus_float.rep_eq

4721 round_down.simps -> Float.compute_float_round_down

4722 round_up.simps -> Float.compute_float_round_up

4723 times_float_def -> Float.compute_float_times

4724 uminus_float_def -> Float.compute_float_uminus

4725 zero_float_def -> Float.compute_float_zero

4727 Lemmas not necessary anymore, use the transfer method:

4728 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,

4729 float_divr, float_le_simp, float_less1_mantissa_bound,

4730 float_less_simp, float_less_zero, float_le_zero,

4731 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,

4732 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,

4733 lapprox_rat_bottom, normalized_float, rapprox_posrat,

4734 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,

4735 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,

4736 round_up, zero_le_float, zero_less_float

4738 * New theory HOL/Library/DAList provides an abstract type for

4739 association lists with distinct keys.

4741 * Session HOL/IMP: Added new theory of abstract interpretation of

4742 annotated commands.

4744 * Session HOL-Import: Re-implementation from scratch is faster,

4745 simpler, and more scalable. Requires a proof bundle, which is

4746 available as an external component. Discontinued old (and mostly

4747 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.

4749 * Session HOL-Word: Discontinued many redundant theorems specific to

4750 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems

4751 instead.

4753 word_sub_alt ~> word_sub_wi

4754 word_add_alt ~> word_add_def

4755 word_mult_alt ~> word_mult_def

4756 word_minus_alt ~> word_minus_def

4757 word_0_alt ~> word_0_wi

4758 word_1_alt ~> word_1_wi

4759 word_add_0 ~> add_0_left

4760 word_add_0_right ~> add_0_right

4761 word_mult_1 ~> mult_1_left

4762 word_mult_1_right ~> mult_1_right

4763 word_add_commute ~> add_commute

4764 word_add_assoc ~> add_assoc

4765 word_add_left_commute ~> add_left_commute

4766 word_mult_commute ~> mult_commute

4767 word_mult_assoc ~> mult_assoc

4768 word_mult_left_commute ~> mult_left_commute

4769 word_left_distrib ~> left_distrib

4770 word_right_distrib ~> right_distrib

4771 word_left_minus ~> left_minus

4772 word_diff_0_right ~> diff_0_right

4773 word_diff_self ~> diff_self

4774 word_sub_def ~> diff_minus

4775 word_diff_minus ~> diff_minus

4776 word_add_ac ~> add_ac

4777 word_mult_ac ~> mult_ac

4778 word_plus_ac0 ~> add_0_left add_0_right add_ac

4779 word_times_ac1 ~> mult_1_left mult_1_right mult_ac

4780 word_order_trans ~> order_trans

4781 word_order_refl ~> order_refl

4782 word_order_antisym ~> order_antisym

4783 word_order_linear ~> linorder_linear

4784 lenw1_zero_neq_one ~> zero_neq_one

4785 word_number_of_eq ~> number_of_eq

4786 word_of_int_add_hom ~> wi_hom_add

4787 word_of_int_sub_hom ~> wi_hom_sub

4788 word_of_int_mult_hom ~> wi_hom_mult

4789 word_of_int_minus_hom ~> wi_hom_neg

4790 word_of_int_succ_hom ~> wi_hom_succ

4791 word_of_int_pred_hom ~> wi_hom_pred

4792 word_of_int_0_hom ~> word_0_wi

4793 word_of_int_1_hom ~> word_1_wi

4795 * Session HOL-Word: New proof method "word_bitwise" for splitting

4796 machine word equalities and inequalities into logical circuits,

4797 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,

4798 multiplication, shifting by constants, bitwise operators and numeric

4799 constants. Requires fixed-length word types, not 'a word. Solves

4800 many standard word identities outright and converts more into first

4801 order problems amenable to blast or similar. See also examples in

4802 HOL/Word/Examples/WordExamples.thy.

4804 * Session HOL-Probability: Introduced the type "'a measure" to

4805 represent measures, this replaces the records 'a algebra and 'a

4806 measure_space. The locales based on subset_class now have two

4807 locale-parameters the space \<Omega> and the set of measurable sets M.

4808 The product of probability spaces uses now the same constant as the

4809 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)

4810 measure". Most constants are defined now outside of locales and gain

4811 an additional parameter, like null_sets, almost_eventually or \<mu>'.

4812 Measure space constructions for distributions and densities now got

4813 their own constants distr and density. Instead of using locales to

4814 describe measure spaces with a finite space, the measure count_space

4815 and point_measure is introduced. INCOMPATIBILITY.

4817 Renamed constants:

4818 measure -> emeasure

4819 finite_measure.\<mu>' -> measure

4820 product_algebra_generator -> prod_algebra

4821 product_prob_space.emb -> prod_emb

4822 product_prob_space.infprod_algebra -> PiM

4824 Removed locales:

4825 completeable_measure_space

4826 finite_measure_space

4827 finite_prob_space

4828 finite_product_finite_prob_space

4829 finite_product_sigma_algebra

4830 finite_sigma_algebra

4831 measure_space

4832 pair_finite_prob_space

4833 pair_finite_sigma_algebra

4834 pair_finite_space

4835 pair_sigma_algebra

4836 product_sigma_algebra

4838 Removed constants:

4839 conditional_space

4840 distribution -> use distr measure, or distributed predicate

4841 image_space

4842 joint_distribution -> use distr measure, or distributed predicate

4843 pair_measure_generator

4844 product_prob_space.infprod_algebra -> use PiM

4845 subvimage

4847 Replacement theorems:

4848 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite

4849 finite_measure.empty_measure -> measure_empty

4850 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq

4851 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq

4852 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably

4853 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure

4854 finite_measure.finite_measure -> finite_measure.emeasure_finite

4855 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton

4856 finite_measure.positive_measure' -> measure_nonneg

4857 finite_measure.real_measure -> finite_measure.emeasure_real

4858 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb

4859 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite

4860 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty

4861 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed

4862 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple

4863 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple

4864 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple

4865 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple

4866 information_space.entropy_commute -> information_space.entropy_commute_simple

4867 information_space.entropy_eq -> information_space.entropy_simple_distributed

4868 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed

4869 information_space.entropy_positive -> information_space.entropy_nonneg_simple

4870 information_space.entropy_uniform_max -> information_space.entropy_uniform

4871 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq

4872 information_space.KL_eq_0 -> information_space.KL_same_eq_0

4873 information_space.KL_ge_0 -> information_space.KL_nonneg

4874 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed

4875 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple

4876 Int_stable_cuboids -> Int_stable_atLeastAtMost

4877 Int_stable_product_algebra_generator -> positive_integral

4878 measure_preserving -> equality "distr M N f = N" "f : measurable M N"

4879 measure_space.additive -> emeasure_additive

4880 measure_space.AE_iff_null_set -> AE_iff_null

4881 measure_space.almost_everywhere_def -> eventually_ae_filter

4882 measure_space.almost_everywhere_vimage -> AE_distrD

4883 measure_space.continuity_from_above -> INF_emeasure_decseq

4884 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq

4885 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq

4886 measure_space.continuity_from_below -> SUP_emeasure_incseq

4887 measure_space_density -> emeasure_density

4888 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density

4889 measure_space.integrable_vimage -> integrable_distr

4890 measure_space.integral_translated_density -> integral_density

4891 measure_space.integral_vimage -> integral_distr

4892 measure_space.measure_additive -> plus_emeasure

4893 measure_space.measure_compl -> emeasure_compl

4894 measure_space.measure_countable_increasing -> emeasure_countable_increasing

4895 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably

4896 measure_space.measure_decseq -> decseq_emeasure

4897 measure_space.measure_Diff -> emeasure_Diff

4898 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set

4899 measure_space.measure_eq_0 -> emeasure_eq_0

4900 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite

4901 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton

4902 measure_space.measure_incseq -> incseq_emeasure

4903 measure_space.measure_insert -> emeasure_insert

4904 measure_space.measure_mono -> emeasure_mono

4905 measure_space.measure_not_negative -> emeasure_not_MInf

4906 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq

4907 measure_space.measure_setsum -> setsum_emeasure

4908 measure_space.measure_setsum_split -> setsum_emeasure_cover

4909 measure_space.measure_space_vimage -> emeasure_distr

4910 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite

4911 measure_space.measure_subadditive -> subadditive

4912 measure_space.measure_top -> emeasure_space

4913 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0

4914 measure_space.measure_Un_null_set -> emeasure_Un_null_set

4915 measure_space.positive_integral_translated_density -> positive_integral_density

4916 measure_space.positive_integral_vimage -> positive_integral_distr

4917 measure_space.real_continuity_from_above -> Lim_measure_decseq

4918 measure_space.real_continuity_from_below -> Lim_measure_incseq

4919 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably

4920 measure_space.real_measure_Diff -> measure_Diff

4921 measure_space.real_measure_finite_Union -> measure_finite_Union

4922 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton

4923 measure_space.real_measure_subadditive -> measure_subadditive

4924 measure_space.real_measure_Union -> measure_Union

4925 measure_space.real_measure_UNION -> measure_UNION

4926 measure_space.simple_function_vimage -> simple_function_comp

4927 measure_space.simple_integral_vimage -> simple_integral_distr

4928 measure_space.simple_integral_vimage -> simple_integral_distr

4929 measure_unique_Int_stable -> measure_eqI_generator_eq

4930 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq

4931 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1

4932 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2

4933 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1

4934 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2

4935 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff

4936 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap

4937 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'

4938 pair_sigma_algebra.sets_swap -> sets_pair_swap

4939 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1

4940 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2

4941 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap

4942 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2

4943 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt

4944 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times

4945 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM

4946 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq

4947 prob_space.measure_space_1 -> prob_space.emeasure_space_1

4948 prob_space.prob_space_vimage -> prob_space_distr

4949 prob_space.random_variable_restrict -> measurable_restrict

4950 prob_space_unique_Int_stable -> measure_eqI_prob_space

4951 product_algebraE -> prod_algebraE_all

4952 product_algebra_generator_der -> prod_algebra_eq_finite

4953 product_algebra_generator_into_space -> prod_algebra_sets_into_space

4954 product_algebraI -> sets_PiM_I_finite

4955 product_measure_exists -> product_sigma_finite.sigma_finite

4956 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator

4957 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb

4958 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty

4959 product_prob_space.measurable_component -> measurable_component_singleton

4960 product_prob_space.measurable_emb -> measurable_prod_emb

4961 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single

4962 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton

4963 product_prob_space.measure_emb -> emeasure_prod_emb

4964 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict

4965 product_sigma_algebra.product_algebra_into_space -> space_closed

4966 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge

4967 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton

4968 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge

4969 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable

4970 sets_product_algebra -> sets_PiM

4971 sigma_algebra.measurable_sigma -> measurable_measure_of

4972 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint

4973 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr

4974 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq

4975 space_product_algebra -> space_PiM

4977 * Session HOL-TPTP: support to parse and import TPTP problems (all

4978 languages) into Isabelle/HOL.

4981 *** FOL ***

4983 * New "case_product" attribute (see HOL).

4986 *** ZF ***

4988 * Greater support for structured proofs involving induction or case

4989 analysis.

4991 * Much greater use of mathematical symbols.

4993 * Removal of many ML theorem bindings. INCOMPATIBILITY.

4996 *** ML ***

4998 * Antiquotation @{keyword "name"} produces a parser for outer syntax

4999 from a minor keyword introduced via theory header declaration.

5001 * Antiquotation @{command_spec "name"} produces the

5002 Outer_Syntax.command_spec from a major keyword introduced via theory

5003 header declaration; it can be passed to Outer_Syntax.command etc.

5005 * Local_Theory.define no longer hard-wires default theorem name

5006 "foo_def", but retains the binding as given. If that is Binding.empty

5007 / Attrib.empty_binding, the result is not registered as user-level

5008 fact. The Local_Theory.define_internal variant allows to specify a

5009 non-empty name (used for the foundation in the background theory),

5010 while omitting the fact binding in the user-context. Potential

5011 INCOMPATIBILITY for derived definitional packages: need to specify

5012 naming policy for primitive definitions more explicitly.

5014 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in

5015 conformance with similar operations in structure Term and Logic.

5017 * Antiquotation @{attributes [...]} embeds attribute source

5018 representation into the ML text, which is particularly useful with

5019 declarations like Local_Theory.note.

5021 * Structure Proof_Context follows standard naming scheme. Old

5022 ProofContext has been discontinued. INCOMPATIBILITY.

5024 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle

5025 change of semantics: update is applied to auxiliary local theory

5026 context as well.

5028 * Modernized some old-style infix operations:

5030 addeqcongs ~> Simplifier.add_eqcong

5031 deleqcongs ~> Simplifier.del_eqcong

5032 addcongs ~> Simplifier.add_cong

5033 delcongs ~> Simplifier.del_cong

5034 setmksimps ~> Simplifier.set_mksimps

5035 setmkcong ~> Simplifier.set_mkcong

5036 setmksym ~> Simplifier.set_mksym

5037 setmkeqTrue ~> Simplifier.set_mkeqTrue

5038 settermless ~> Simplifier.set_termless

5039 setsubgoaler ~> Simplifier.set_subgoaler

5040 addsplits ~> Splitter.add_split

5041 delsplits ~> Splitter.del_split

5044 *** System ***

5046 * USER_HOME settings variable points to cross-platform user home

5047 directory, which coincides with HOME on POSIX systems only. Likewise,

5048 the Isabelle path specification "~" now expands to $USER_HOME, instead

5049 of former $HOME. A different default for USER_HOME may be set

5050 explicitly in shell environment, before Isabelle settings are

5051 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where

5052 the generic user home was intended.

5054 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name

5055 notation, which is useful for the jEdit file browser, for example.

5057 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar

5058 (not just JRE).

5062 New in Isabelle2011-1 (October 2011)

5063 ------------------------------------

5065 *** General ***

5067 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as

5068 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.

5070 - Management of multiple theory files directly from the editor

5071 buffer store -- bypassing the file-system (no requirement to save

5072 files for checking).

5074 - Markup of formal entities within the text buffer, with semantic

5075 highlighting, tooltips and hyperlinks to jump to defining source

5076 positions.

5078 - Improved text rendering, with sub/superscripts in the source

5079 buffer (including support for copy/paste wrt. output panel, HTML

5080 theory output and other non-Isabelle text boxes).

5082 - Refined scheduling of proof checking and printing of results,

5083 based on interactive editor view. (Note: jEdit folding and

5084 narrowing allows to restrict buffer perspectives explicitly.)

5086 - Reduced CPU performance requirements, usable on machines with few

5087 cores.

5089 - Reduced memory requirements due to pruning of unused document

5090 versions (garbage collection).

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

5093 including some remaining limitations.

5095 * Theory loader: source files are exclusively located via the master

5096 directory of each theory node (where the .thy file itself resides).

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

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

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

5100 INCOMPATIBILITY.

5102 * Theory loader: source files are identified by content via SHA1

5103 digests. Discontinued former path/modtime identification and optional

5104 ISABELLE_FILE_IDENT plugin scripts.

5106 * Parallelization of nested Isar proofs is subject to

5107 Goal.parallel_proofs_threshold (default 100). See also isabelle

5108 usedir option -Q.

5110 * Name space: former unsynchronized references are now proper

5111 configuration options, with more conventional names:

5113 long_names ~> names_long

5114 short_names ~> names_short

5115 unique_names ~> names_unique

5117 Minor INCOMPATIBILITY, need to declare options in context like this:

5119 declare [[names_unique = false]]

5121 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note

5122 that the result needs to be unique, which means fact specifications

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

5125 * Attribute "case_names" has been refined: the assumptions in each case

5126 can be named now by following the case name with [name1 name2 ...].

5128 * Isabelle/Isar reference manual has been updated and extended:

5129 - "Synopsis" provides a catalog of main Isar language concepts.

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

5131 - Updated material from classic "ref" manual, notably about

5132 "Classical Reasoner".

5135 *** HOL ***

5137 * Class bot and top require underlying partial order rather than

5138 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.

5140 * Class complete_lattice: generalized a couple of lemmas from sets;

5141 generalized theorems INF_cong and SUP_cong. New type classes for

5142 complete boolean algebras and complete linear orders. Lemmas

5143 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in

5144 class complete_linorder.

5146 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,

5147 Sup_fun_def, Inf_apply, Sup_apply.

5149 Removed redundant lemmas (the right hand side gives hints how to

5150 replace them for (metis ...), or (simp only: ...) proofs):

5152 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]

5153 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]

5154 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right

5155 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right

5156 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right

5157 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right

5158 Inter_def ~> INF_def, image_def

5159 Union_def ~> SUP_def, image_def

5160 INT_eq ~> INF_def, and image_def

5161 UN_eq ~> SUP_def, and image_def

5162 INF_subset ~> INF_superset_mono [OF _ order_refl]

5164 More consistent and comprehensive names:

5166 INTER_eq_Inter_image ~> INF_def

5167 UNION_eq_Union_image ~> SUP_def

5168 INFI_def ~> INF_def

5169 SUPR_def ~> SUP_def

5170 INF_leI ~> INF_lower

5171 INF_leI2 ~> INF_lower2

5172 le_INFI ~> INF_greatest

5173 le_SUPI ~> SUP_upper

5174 le_SUPI2 ~> SUP_upper2

5175 SUP_leI ~> SUP_least

5176 INFI_bool_eq ~> INF_bool_eq

5177 SUPR_bool_eq ~> SUP_bool_eq

5178 INFI_apply ~> INF_apply

5179 SUPR_apply ~> SUP_apply

5180 INTER_def ~> INTER_eq

5181 UNION_def ~> UNION_eq

5183 INCOMPATIBILITY.

5185 * Renamed theory Complete_Lattice to Complete_Lattices.

5186 INCOMPATIBILITY.

5188 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,

5189 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,

5190 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,

5191 Sup_insert are now declared as [simp]. INCOMPATIBILITY.

5193 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,

5194 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,

5195 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor

5196 INCOMPATIBILITY.

5198 * Added syntactic classes "inf" and "sup" for the respective

5199 constants. INCOMPATIBILITY: Changes in the argument order of the

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

5202 * Theorem collections ball_simps and bex_simps do not contain theorems

5203 referring to UNION any longer; these have been moved to collection

5204 UN_ball_bex_simps. INCOMPATIBILITY.

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

5207 separate type class floor_ceiling.

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

5211 locale fun_left_comm ~> locale comp_fun_commute

5212 locale fun_left_comm_idem ~> locale comp_fun_idem

5214 Both use point-free characterization; interpretation proofs may need

5215 adjustment. INCOMPATIBILITY.

5217 * Theory Limits: Type "'a net" has been renamed to "'a filter", in

5218 accordance with standard mathematical terminology. INCOMPATIBILITY.

5220 * Theory Complex_Main: The locale interpretations for the

5221 bounded_linear and bounded_bilinear locales have been removed, in

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

5223 original names for distributivity theorems, potential INCOMPATIBILITY.

5225 divide.add ~> add_divide_distrib

5226 divide.diff ~> diff_divide_distrib

5227 divide.setsum ~> setsum_divide_distrib

5228 mult.add_right ~> right_distrib

5229 mult.diff_right ~> right_diff_distrib

5230 mult_right.setsum ~> setsum_right_distrib

5231 mult_left.diff ~> left_diff_distrib

5233 * Theory Complex_Main: Several redundant theorems have been removed or

5234 replaced by more general versions. INCOMPATIBILITY.

5236 real_diff_def ~> minus_real_def

5237 real_divide_def ~> divide_real_def

5238 real_less_def ~> less_le

5239 real_abs_def ~> abs_real_def

5240 real_sgn_def ~> sgn_real_def

5241 real_mult_commute ~> mult_commute

5242 real_mult_assoc ~> mult_assoc

5243 real_mult_1 ~> mult_1_left

5244 real_add_mult_distrib ~> left_distrib

5245 real_zero_not_eq_one ~> zero_neq_one

5246 real_mult_inverse_left ~> left_inverse

5247 INVERSE_ZERO ~> inverse_zero

5248 real_le_refl ~> order_refl

5249 real_le_antisym ~> order_antisym

5250 real_le_trans ~> order_trans

5251 real_le_linear ~> linear

5252 real_le_eq_diff ~> le_iff_diff_le_0

5253 real_add_left_mono ~> add_left_mono

5254 real_mult_order ~> mult_pos_pos

5255 real_mult_less_mono2 ~> mult_strict_left_mono

5256 real_of_int_real_of_nat ~> real_of_int_of_nat_eq

5257 real_0_le_divide_iff ~> zero_le_divide_iff

5258 realpow_two_disj ~> power2_eq_iff

5259 real_squared_diff_one_factored ~> square_diff_one_factored

5260 realpow_two_diff ~> square_diff_square_factored

5261 reals_complete2 ~> complete_real

5262 real_sum_squared_expand ~> power2_sum

5263 exp_ln_eq ~> ln_unique

5264 expi_add ~> exp_add

5265 expi_zero ~> exp_zero

5266 lemma_DERIV_subst ~> DERIV_cong

5267 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff

5268 LIMSEQ_const ~> tendsto_const

5269 LIMSEQ_norm ~> tendsto_norm

5270 LIMSEQ_add ~> tendsto_add

5271 LIMSEQ_minus ~> tendsto_minus

5272 LIMSEQ_minus_cancel ~> tendsto_minus_cancel

5273 LIMSEQ_diff ~> tendsto_diff

5274 bounded_linear.LIMSEQ ~> bounded_linear.tendsto

5275 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto

5276 LIMSEQ_mult ~> tendsto_mult

5277 LIMSEQ_inverse ~> tendsto_inverse

5278 LIMSEQ_divide ~> tendsto_divide

5279 LIMSEQ_pow ~> tendsto_power

5280 LIMSEQ_setsum ~> tendsto_setsum

5281 LIMSEQ_setprod ~> tendsto_setprod

5282 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff

5283 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff

5284 LIMSEQ_imp_rabs ~> tendsto_rabs

5285 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]

5286 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]

5287 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]

5288 LIMSEQ_Complex ~> tendsto_Complex

5289 LIM_ident ~> tendsto_ident_at

5290 LIM_const ~> tendsto_const

5291 LIM_add ~> tendsto_add

5292 LIM_add_zero ~> tendsto_add_zero

5293 LIM_minus ~> tendsto_minus

5294 LIM_diff ~> tendsto_diff

5295 LIM_norm ~> tendsto_norm

5296 LIM_norm_zero ~> tendsto_norm_zero

5297 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel

5298 LIM_norm_zero_iff ~> tendsto_norm_zero_iff

5299 LIM_rabs ~> tendsto_rabs

5300 LIM_rabs_zero ~> tendsto_rabs_zero

5301 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel

5302 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff

5303 LIM_compose ~> tendsto_compose

5304 LIM_mult ~> tendsto_mult

5305 LIM_scaleR ~> tendsto_scaleR

5306 LIM_of_real ~> tendsto_of_real

5307 LIM_power ~> tendsto_power

5308 LIM_inverse ~> tendsto_inverse

5309 LIM_sgn ~> tendsto_sgn

5310 isCont_LIM_compose ~> isCont_tendsto_compose

5311 bounded_linear.LIM ~> bounded_linear.tendsto

5312 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero

5313 bounded_bilinear.LIM ~> bounded_bilinear.tendsto

5314 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero

5315 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero

5316 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero

5317 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]

5319 * Theory Complex_Main: The definition of infinite series was

5320 generalized. Now it is defined on the type class {topological_space,

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

5323 * Theory Complex_Main: The complex exponential function "expi" is now

5324 a type-constrained abbreviation for "exp :: complex => complex"; thus

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

5327 * Code generation:

5329 - Theory Library/Code_Char_ord provides native ordering of

5330 characters in the target language.

5332 - Commands code_module and code_library are legacy, use export_code

5333 instead.

5335 - Method "evaluation" is legacy, use method "eval" instead.

5337 - Legacy evaluator "SML" is deactivated by default. May be

5338 reactivated by the following theory command:

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

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

5344 * New proof method "induction" that gives induction hypotheses the

5345 name "IH", thus distinguishing them from further hypotheses that come

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

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

5348 syntax.

5350 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is

5351 still available as a legacy feature for some time.

5353 * Nitpick:

5354 - Added "need" and "total_consts" options.

5355 - Reintroduced "show_skolems" option by popular demand.

5356 - Renamed attribute: nitpick_def ~> nitpick_unfold.

5357 INCOMPATIBILITY.

5359 * Sledgehammer:

5360 - Use quasi-sound (and efficient) translations by default.

5361 - Added support for the following provers: E-ToFoF, LEO-II,

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

5363 - Automatically preplay and minimize proofs before showing them if

5364 this can be done within reasonable time.

5365 - sledgehammer available_provers ~> sledgehammer supported_provers.

5366 INCOMPATIBILITY.

5367 - Added "preplay_timeout", "slicing", "type_enc", "sound",

5368 "max_mono_iters", and "max_new_mono_instances" options.

5369 - Removed "explicit_apply" and "full_types" options as well as "Full

5370 Types" Proof General menu item. INCOMPATIBILITY.

5372 * Metis:

5373 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.

5374 - Obsoleted "metisFT" -- use "metis (full_types)" instead.

5375 INCOMPATIBILITY.

5377 * Command 'try':

5378 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and

5379 "elim:" options. INCOMPATIBILITY.

5380 - Introduced 'try' that not only runs 'try_methods' but also

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

5383 * Quickcheck:

5384 - Added "eval" option to evaluate terms for the found counterexample

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

5386 - Added post-processing of terms to obtain readable counterexamples

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

5388 - New counterexample generator quickcheck[narrowing] enables

5389 narrowing-based testing. Requires the Glasgow Haskell compiler

5390 with its installation location defined in the Isabelle settings

5391 environment as ISABELLE_GHC.

5392 - Removed quickcheck tester "SML" based on the SML code generator

5393 (formly in HOL/Library).

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

5396 use 'partial_function' instead.

5398 * Theory Library/Extended_Reals replaces now the positive extended

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

5400 Multivariate_Analysis/Extended_Real_Limits.

5402 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,

5403 from where it must be imported explicitly if it is really required.

5404 INCOMPATIBILITY.

5406 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has

5407 been moved here. INCOMPATIBILITY.

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

5410 arithmetic.

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

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

5414 and lattice type classes.

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

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

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

5420 (cset) via the generic monad ad-hoc overloading facility.

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

5423 for implementation, an invariant-ensuring type, and connection to an

5424 abstract type. INCOMPATIBILITY.

5426 - RBT is split into RBT and RBT_Mapping.

5427 - AssocList is split and renamed into AList and AList_Mapping.

5428 - DList is split into DList_Impl, DList, and DList_Cset.

5429 - Cset is split into Cset and List_Cset.

5431 * Theory Library/Nat_Infinity has been renamed to

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

5433 constants:

5435 type inat ~> type enat

5436 Fin ~> enat

5437 Infty ~> infinity (overloaded)

5438 iSuc ~> eSuc

5439 the_Fin ~> the_enat

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

5442 been renamed accordingly. INCOMPATIBILITY.

5444 * Session Multivariate_Analysis: The euclidean_space type class now

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

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

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

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

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

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

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

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

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

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

5456 been renamed as follows (INCOMPATIBILITY):

5458 Cart_eq ~> vec_eq_iff

5459 dist_nth_le_cart ~> dist_vec_nth_le

5460 tendsto_vector ~> vec_tendstoI

5461 Cauchy_vector ~> vec_CauchyI

5463 * Session Multivariate_Analysis: Several duplicate theorems have been

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

5465 general versions. INCOMPATIBILITY.

5467 finite_choice ~> finite_set_choice

5468 eventually_conjI ~> eventually_conj

5469 eventually_and ~> eventually_conj_iff

5470 eventually_false ~> eventually_False

5471 setsum_norm ~> norm_setsum

5472 Lim_sequentially ~> LIMSEQ_def

5473 Lim_ident_at ~> LIM_ident

5474 Lim_const ~> tendsto_const

5475 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]

5476 Lim_neg ~> tendsto_minus

5477 Lim_add ~> tendsto_add

5478 Lim_sub ~> tendsto_diff

5479 Lim_mul ~> tendsto_scaleR

5480 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]

5481 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]

5482 Lim_linear ~> bounded_linear.tendsto

5483 Lim_component ~> tendsto_euclidean_component

5484 Lim_component_cart ~> tendsto_vec_nth

5485 Lim_inner ~> tendsto_inner [OF tendsto_const]

5486 dot_lsum ~> inner_setsum_left

5487 dot_rsum ~> inner_setsum_right

5488 continuous_cmul ~> continuous_scaleR [OF continuous_const]

5489 continuous_neg ~> continuous_minus

5490 continuous_sub ~> continuous_diff

5491 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]

5492 continuous_mul ~> continuous_scaleR

5493 continuous_inv ~> continuous_inverse

5494 continuous_at_within_inv ~> continuous_at_within_inverse

5495 continuous_at_inv ~> continuous_at_inverse

5496 continuous_at_norm ~> continuous_norm [OF continuous_at_id]

5497 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]

5498 continuous_at_component ~> continuous_component [OF continuous_at_id]

5499 continuous_on_neg ~> continuous_on_minus

5500 continuous_on_sub ~> continuous_on_diff

5501 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]

5502 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]

5503 continuous_on_mul ~> continuous_on_scaleR

5504 continuous_on_mul_real ~> continuous_on_mult

5505 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]

5506 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]

5507 continuous_on_inverse ~> continuous_on_inv

5508 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus

5509 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff

5510 subset_interior ~> interior_mono

5511 subset_closure ~> closure_mono

5512 closure_univ ~> closure_UNIV

5513 real_arch_lt ~> reals_Archimedean2

5514 real_arch ~> reals_Archimedean3

5515 real_abs_norm ~> abs_norm_cancel

5516 real_abs_sub_norm ~> norm_triangle_ineq3

5517 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2

5519 * Session HOL-Probability:

5520 - Caratheodory's extension lemma is now proved for ring_of_sets.

5521 - Infinite products of probability measures are now available.

5522 - Sigma closure is independent, if the generator is independent

5523 - Use extended reals instead of positive extended

5524 reals. INCOMPATIBILITY.

5526 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.

5528 expand_fun_below ~> fun_below_iff

5529 below_fun_ext ~> fun_belowI

5530 expand_cfun_eq ~> cfun_eq_iff

5531 ext_cfun ~> cfun_eqI

5532 expand_cfun_below ~> cfun_below_iff

5533 below_cfun_ext ~> cfun_belowI

5534 monofun_fun_fun ~> fun_belowD

5535 monofun_fun_arg ~> monofunE

5536 monofun_lub_fun ~> adm_monofun [THEN admD]

5537 cont_lub_fun ~> adm_cont [THEN admD]

5538 cont2cont_Rep_CFun ~> cont2cont_APP

5539 cont_Rep_CFun_app ~> cont_APP_app

5540 cont_Rep_CFun_app_app ~> cont_APP_app_app

5541 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]

5542 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]

5543 contlub_cfun ~> lub_APP [symmetric]

5544 contlub_LAM ~> lub_LAM [symmetric]

5545 thelubI ~> lub_eqI

5546 UU_I ~> bottomI

5547 lift_distinct1 ~> lift.distinct(1)

5548 lift_distinct2 ~> lift.distinct(2)

5549 Def_not_UU ~> lift.distinct(2)

5550 Def_inject ~> lift.inject

5551 below_UU_iff ~> below_bottom_iff

5552 eq_UU_iff ~> eq_bottom_iff

5555 *** Document preparation ***

5557 * Antiquotation @{rail} layouts railroad syntax diagrams, see also

5558 isar-ref manual, both for description and actual application of the

5559 same.

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

5562 result.

5564 * Antiquotations: term style "isub" provides ad-hoc conversion of

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

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

5568 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>

5569 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).

5571 * Localized \isabellestyle switch can be used within blocks or groups

5572 like this:

5574 \isabellestyle{it} %preferred default

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

5577 * Discontinued special treatment of hard tabulators. Implicit

5578 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual

5579 layouts.

5582 *** ML ***

5584 * The inner syntax of sort/type/term/prop supports inlined YXML

5585 representations within quoted string tokens. By encoding logical

5586 entities via Term_XML (in ML or Scala) concrete syntax can be

5587 bypassed, which is particularly useful for producing bits of text

5588 under external program control.

5590 * Antiquotations for ML and document preparation are managed as theory

5591 data, which requires explicit setup.

5593 * Isabelle_Process.is_active allows tools to check if the official

5594 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop

5595 (better known as Proof General).

5597 * Structure Proof_Context follows standard naming scheme. Old

5598 ProofContext is still available for some time as legacy alias.

5600 * Structure Timing provides various operations for timing; supersedes

5601 former start_timing/end_timing etc.

5603 * Path.print is the official way to show file-system paths to users

5604 (including quotes etc.).

5606 * Inner syntax: identifiers in parse trees of generic categories

5607 "logic", "aprop", "idt" etc. carry position information (disguised as

5608 type constraints). Occasional INCOMPATIBILITY with non-compliant

5609 translations that choke on unexpected type constraints. Positions can

5610 be stripped in ML translations via Syntax.strip_positions /

5611 Syntax.strip_positions_ast, or via the syntax constant

5612 "_strip_positions" within parse trees. As last resort, positions can

5613 be disabled via the configuration option Syntax.positions, which is

5614 called "syntax_positions" in Isar attribute syntax.

5616 * Discontinued special status of various ML structures that contribute

5617 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less

5618 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,

5619 refer directly to Ast.Constant, Lexicon.is_identifier,

5620 Syntax_Trans.mk_binder_tr etc.

5622 * Typed print translation: discontinued show_sorts argument, which is

5623 already available via context of "advanced" translation.

5625 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic

5626 goal states; body tactic needs to address all subgoals uniformly.

5628 * Slightly more special eq_list/eq_set, with shortcut involving

5629 pointer equality (assumes that eq relation is reflexive).

5631 * Classical tactics use proper Proof.context instead of historic types

5632 claset/clasimpset. Old-style declarations like addIs, addEs, addDs

5633 operate directly on Proof.context. Raw type claset retains its use as

5634 snapshot of the classical context, which can be recovered via

5635 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.

5636 INCOMPATIBILITY, classical tactics and derived proof methods require

5637 proper Proof.context.

5640 *** System ***

5642 * Discontinued support for Poly/ML 5.2, which was the last version

5643 without proper multithreading and TimeLimit implementation.

5645 * Discontinued old lib/scripts/polyml-platform, which has been

5646 obsolete since Isabelle2009-2.

5648 * Various optional external tools are referenced more robustly and

5649 uniformly by explicit Isabelle settings as follows:

5651 ISABELLE_CSDP (formerly CSDP_EXE)

5652 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)

5653 ISABELLE_OCAML (formerly EXEC_OCAML)

5654 ISABELLE_SWIPL (formerly EXEC_SWIPL)

5655 ISABELLE_YAP (formerly EXEC_YAP)

5657 Note that automated detection from the file-system or search path has

5658 been discontinued. INCOMPATIBILITY.

5660 * Scala layer provides JVM method invocation service for static

5661 methods of type (String)String, see Invoke_Scala.method in ML. For

5662 example:

5664 Invoke_Scala.method "java.lang.System.getProperty" "java.home"

5666 Together with YXML.string_of_body/parse_body and XML.Encode/Decode

5667 this allows to pass structured values between ML and Scala.

5669 * The IsabelleText fonts includes some further glyphs to support the

5670 Prover IDE. Potential INCOMPATIBILITY: users who happen to have

5671 installed a local copy (which is normally *not* required) need to

5672 delete or update it from ~~/lib/fonts/.

5676 New in Isabelle2011 (January 2011)

5677 ----------------------------------

5679 *** General ***

5681 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see

5682 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with

5683 useful tooltips and hyperlinks produced from its static analysis. The

5684 bundled component provides an executable Isabelle tool that can be run

5685 like this:

5687 Isabelle2011/bin/isabelle jedit

5689 * Significantly improved Isabelle/Isar implementation manual.

5691 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER

5692 (and thus refers to something like $HOME/.isabelle/Isabelle2011),

5693 while the default heap location within that directory lacks that extra

5694 suffix. This isolates multiple Isabelle installations from each

5695 other, avoiding problems with old settings in new versions.

5696 INCOMPATIBILITY, need to copy/upgrade old user settings manually.

5698 * Source files are always encoded as UTF-8, instead of old-fashioned

5699 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require

5700 the following package declarations:

5702 \usepackage[utf8]{inputenc}

5703 \usepackage{textcomp}

5705 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that

5706 a Unicode character is treated as a single symbol, not a sequence of

5707 non-ASCII bytes as before. Since Isabelle/ML string literals may

5708 contain symbols without further backslash escapes, Unicode can now be

5709 used here as well. Recall that Symbol.explode in ML provides a

5710 consistent view on symbols, while raw explode (or String.explode)

5711 merely give a byte-oriented representation.

5713 * Theory loader: source files are primarily located via the master

5714 directory of each theory node (where the .thy file itself resides).

5715 The global load path is still partially available as legacy feature.

5716 Minor INCOMPATIBILITY due to subtle change in file lookup: use

5717 explicit paths, relatively to the theory.

5719 * Special treatment of ML file names has been discontinued.

5720 Historically, optional extensions .ML or .sml were added on demand --

5721 at the cost of clarity of file dependencies. Recall that Isabelle/ML

5722 files exclusively use the .ML extension. Minor INCOMPATIBILITY.

5724 * Various options that affect pretty printing etc. are now properly

5725 handled within the context via configuration options, instead of

5726 unsynchronized references or print modes. There are both ML Config.T

5727 entities and Isar declaration attributes to access these.

5729 ML (Config.T) Isar (attribute)

5731 eta_contract eta_contract

5732 show_brackets show_brackets

5733 show_sorts show_sorts

5734 show_types show_types

5735 show_question_marks show_question_marks

5736 show_consts show_consts

5737 show_abbrevs show_abbrevs

5739 Syntax.ast_trace syntax_ast_trace

5740 Syntax.ast_stat syntax_ast_stat

5741 Syntax.ambiguity_level syntax_ambiguity_level

5743 Goal_Display.goals_limit goals_limit

5744 Goal_Display.show_main_goal show_main_goal

5746 Method.rule_trace rule_trace

5748 Thy_Output.display thy_output_display

5749 Thy_Output.quotes thy_output_quotes

5750 Thy_Output.indent thy_output_indent

5751 Thy_Output.source thy_output_source

5752 Thy_Output.break thy_output_break

5754 Note that corresponding "..._default" references in ML may only be

5755 changed globally at the ROOT session setup, but *not* within a theory.

5756 The option "show_abbrevs" supersedes the former print mode

5757 "no_abbrevs" with inverted meaning.

5759 * More systematic naming of some configuration options.

5760 INCOMPATIBILITY.

5762 trace_simp ~> simp_trace

5763 debug_simp ~> simp_debug

5765 * Support for real valued configuration options, using simplistic

5766 floating-point notation that coincides with the inner syntax for

5767 float_token.

5769 * Support for real valued preferences (with approximative PGIP type):

5770 front-ends need to accept "pgint" values in float notation.

5771 INCOMPATIBILITY.

5773 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from

5774 DejaVu Sans.

5776 * Discontinued support for Poly/ML 5.0 and 5.1 versions.

5779 *** Pure ***

5781 * Command 'type_synonym' (with single argument) replaces somewhat

5782 outdated 'types', which is still available as legacy feature for some

5783 time.

5785 * Command 'nonterminal' (with 'and' separated list of arguments)

5786 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.

5788 * Command 'notepad' replaces former 'example_proof' for

5789 experimentation in Isar without any result. INCOMPATIBILITY.

5791 * Locale interpretation commands 'interpret' and 'sublocale' accept

5792 lists of equations to map definitions in a locale to appropriate

5793 entities in the context of the interpretation. The 'interpretation'

5794 command already provided this functionality.

5796 * Diagnostic command 'print_dependencies' prints the locale instances

5797 that would be activated if the specified expression was interpreted in

5798 the current context. Variant "print_dependencies!" assumes a context

5799 without interpretations.

5801 * Diagnostic command 'print_interps' prints interpretations in proofs

5802 in addition to interpretations in theories.

5804 * Discontinued obsolete 'global' and 'local' commands to manipulate

5805 the theory name space. Rare INCOMPATIBILITY. The ML functions

5806 Sign.root_path and Sign.local_path may be applied directly where this

5807 feature is still required for historical reasons.

5809 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use

5810 'definition' instead.

5812 * The "prems" fact, which refers to the accidental collection of

5813 foundational premises in the context, is now explicitly marked as

5814 legacy feature and will be discontinued soon. Consider using "assms"

5815 of the head statement or reference facts by explicit names.

5817 * Document antiquotations @{class} and @{type} print classes and type

5818 constructors.

5820 * Document antiquotation @{file} checks file/directory entries within

5821 the local file system.

5824 *** HOL ***

5826 * Coercive subtyping: functions can be declared as coercions and type

5827 inference will add them as necessary upon input of a term. Theory

5828 Complex_Main declares real :: nat => real and real :: int => real as

5829 coercions. A coercion function f is declared like this:

5831 declare [[coercion f]]

5833 To lift coercions through type constructors (e.g. from nat => real to

5834 nat list => real list), map functions can be declared, e.g.

5836 declare [[coercion_map map]]

5838 Currently coercion inference is activated only in theories including

5839 real numbers, i.e. descendants of Complex_Main. This is controlled by

5840 the configuration option "coercion_enabled", e.g. it can be enabled in

5841 other theories like this:

5843 declare [[coercion_enabled]]

5845 * Command 'partial_function' provides basic support for recursive

5846 function definitions over complete partial orders. Concrete instances

5847 are provided for i) the option type, ii) tail recursion on arbitrary

5848 types, and iii) the heap monad of Imperative_HOL. See

5849 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy

5850 for examples.

5852 * Function package: f.psimps rules are no longer implicitly declared

5853 as [simp]. INCOMPATIBILITY.

5855 * Datatype package: theorems generated for executable equality (class

5856 "eq") carry proper names and are treated as default code equations.

5858 * Inductive package: now offers command 'inductive_simps' to

5859 automatically derive instantiated and simplified equations for

5860 inductive predicates, similar to 'inductive_cases'.

5862 * Command 'enriched_type' allows to register properties of the

5863 functorial structure of types.

5865 * Improved infrastructure for term evaluation using code generator

5866 techniques, in particular static evaluation conversions.

5868 * Code generator: Scala (2.8 or higher) has been added to the target

5869 languages.

5871 * Code generator: globbing constant expressions "*" and "Theory.*"

5872 have been replaced by the more idiomatic "_" and "Theory._".

5873 INCOMPATIBILITY.

5875 * Code generator: export_code without explicit file declaration prints

5876 to standard output. INCOMPATIBILITY.

5878 * Code generator: do not print function definitions for case

5879 combinators any longer.

5881 * Code generator: simplification with rules determined with

5882 src/Tools/Code/code_simp.ML and method "code_simp".

5884 * Code generator for records: more idiomatic representation of record

5885 types. Warning: records are not covered by ancient SML code

5886 generation any longer. INCOMPATIBILITY. In cases of need, a suitable

5887 rep_datatype declaration helps to succeed then:

5889 record 'a foo = ...

5890 ...

5891 rep_datatype foo_ext ...

5893 * Records: logical foundation type for records does not carry a

5894 '_type' suffix any longer (obsolete due to authentic syntax).

5895 INCOMPATIBILITY.

5897 * Quickcheck now by default uses exhaustive testing instead of random

5898 testing. Random testing can be invoked by "quickcheck [random]",

5899 exhaustive testing by "quickcheck [exhaustive]".

5901 * Quickcheck instantiates polymorphic types with small finite

5902 datatypes by default. This enables a simple execution mechanism to

5903 handle quantifiers and function equality over the finite datatypes.

5905 * Quickcheck random generator has been renamed from "code" to

5906 "random". INCOMPATIBILITY.

5908 * Quickcheck now has a configurable time limit which is set to 30

5909 seconds by default. This can be changed by adding [timeout = n] to the

5910 quickcheck command. The time limit for Auto Quickcheck is still set

5911 independently.

5913 * Quickcheck in locales considers interpretations of that locale for

5914 counter example search.

5916 * Sledgehammer:

5917 - Added "smt" and "remote_smt" provers based on the "smt" proof

5918 method. See the Sledgehammer manual for details ("isabelle doc

5919 sledgehammer").

5920 - Renamed commands:

5921 sledgehammer atp_info ~> sledgehammer running_provers

5922 sledgehammer atp_kill ~> sledgehammer kill_provers

5923 sledgehammer available_atps ~> sledgehammer available_provers

5924 INCOMPATIBILITY.

5925 - Renamed options:

5926 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]

5927 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]

5928 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]

5929 (and "ms" and "min" are no longer supported)

5930 INCOMPATIBILITY.

5932 * Nitpick:

5933 - Renamed options:

5934 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]

5935 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]

5936 INCOMPATIBILITY.

5937 - Added support for partial quotient types.

5938 - Added local versions of the "Nitpick.register_xxx" functions.

5939 - Added "whack" option.

5940 - Allow registration of quotient types as codatatypes.

5941 - Improved "merge_type_vars" option to merge more types.

5942 - Removed unsound "fast_descrs" option.

5943 - Added custom symmetry breaking for datatypes, making it possible to reach

5944 higher cardinalities.

5945 - Prevent the expansion of too large definitions.

5947 * Proof methods "metis" and "meson" now have configuration options

5948 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled

5949 to diagnose these tools. E.g.

5951 using [[metis_trace = true]]

5953 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available

5954 manually as command 'solve_direct'.

5956 * The default SMT solver Z3 must be enabled explicitly (due to

5957 licensing issues) by setting the environment variable

5958 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For

5959 commercial applications, the SMT solver CVC3 is provided as fall-back;

5960 changing the SMT solver is done via the configuration option

5961 "smt_solver".

5963 * Remote SMT solvers need to be referred to by the "remote_" prefix,

5964 i.e. "remote_cvc3" and "remote_z3".

5966 * Added basic SMT support for datatypes, records, and typedefs using

5967 the oracle mode (no proofs). Direct support of pairs has been dropped

5968 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT

5969 support for a similar behavior). Minor INCOMPATIBILITY.

5971 * Changed SMT configuration options:

5972 - Renamed:

5973 z3_proofs ~> smt_oracle (with inverted meaning)

5974 z3_trace_assms ~> smt_trace_used_facts

5975 INCOMPATIBILITY.

5976 - Added:

5977 smt_verbose

5978 smt_random_seed

5979 smt_datatypes

5980 smt_infer_triggers

5981 smt_monomorph_limit

5982 cvc3_options

5983 remote_cvc3_options

5984 remote_z3_options

5985 yices_options

5987 * Boogie output files (.b2i files) need to be declared in the theory

5988 header.

5990 * Simplification procedure "list_to_set_comprehension" rewrites list

5991 comprehensions applied to List.set to set comprehensions. Occasional

5992 INCOMPATIBILITY, may be deactivated like this:

5994 declare [[simproc del: list_to_set_comprehension]]

5996 * Removed old version of primrec package. INCOMPATIBILITY.

5998 * Removed simplifier congruence rule of "prod_case", as has for long

5999 been the case with "split". INCOMPATIBILITY.

6001 * String.literal is a type, but not a datatype. INCOMPATIBILITY.

6003 * Removed [split_format ... and ... and ...] version of

6004 [split_format]. Potential INCOMPATIBILITY.

6006 * Predicate "sorted" now defined inductively, with nice induction

6007 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.

6009 * Constant "contents" renamed to "the_elem", to free the generic name

6010 contents for other uses. INCOMPATIBILITY.

6012 * Renamed class eq and constant eq (for code generation) to class

6013 equal and constant equal, plus renaming of related facts and various

6014 tuning. INCOMPATIBILITY.

6016 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.

6018 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".

6019 INCOMPATIBILITY.

6021 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to

6022 avoid confusion with finite sets. INCOMPATIBILITY.

6024 * Abandoned locales equiv, congruent and congruent2 for equivalence

6025 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same

6026 for congruent(2)).

6028 * Some previously unqualified names have been qualified:

6030 types

6031 bool ~> HOL.bool

6032 nat ~> Nat.nat

6034 constants

6035 Trueprop ~> HOL.Trueprop

6036 True ~> HOL.True

6037 False ~> HOL.False

6038 op & ~> HOL.conj

6039 op | ~> HOL.disj

6040 op --> ~> HOL.implies

6041 op = ~> HOL.eq

6042 Not ~> HOL.Not

6043 The ~> HOL.The

6044 All ~> HOL.All

6045 Ex ~> HOL.Ex

6046 Ex1 ~> HOL.Ex1

6047 Let ~> HOL.Let

6048 If ~> HOL.If

6049 Ball ~> Set.Ball

6050 Bex ~> Set.Bex

6051 Suc ~> Nat.Suc

6052 Pair ~> Product_Type.Pair

6053 fst ~> Product_Type.fst

6054 snd ~> Product_Type.snd

6055 curry ~> Product_Type.curry

6056 op : ~> Set.member

6057 Collect ~> Set.Collect

6059 INCOMPATIBILITY.

6061 * More canonical naming convention for some fundamental definitions:

6063 bot_bool_eq ~> bot_bool_def

6064 top_bool_eq ~> top_bool_def

6065 inf_bool_eq ~> inf_bool_def

6066 sup_bool_eq ~> sup_bool_def

6067 bot_fun_eq ~> bot_fun_def

6068 top_fun_eq ~> top_fun_def

6069 inf_fun_eq ~> inf_fun_def

6070 sup_fun_eq ~> sup_fun_def

6072 INCOMPATIBILITY.

6074 * More stylized fact names:

6076 expand_fun_eq ~> fun_eq_iff

6077 expand_set_eq ~> set_eq_iff

6078 set_ext ~> set_eqI

6079 nat_number ~> eval_nat_numeral

6081 INCOMPATIBILITY.

6083 * Refactoring of code-generation specific operations in theory List:

6085 constants

6086 null ~> List.null

6088 facts

6089 mem_iff ~> member_def

6090 null_empty ~> null_def

6092 INCOMPATIBILITY. Note that these were not supposed to be used

6093 regularly unless for striking reasons; their main purpose was code

6094 generation.

6096 Various operations from the Haskell prelude are used for generating

6097 Haskell code.

6099 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term

6100 "surj f" is now an abbreviation of "range f = UNIV". The theorems

6101 bij_def and surj_def are unchanged. INCOMPATIBILITY.

6103 * Abolished some non-alphabetic type names: "prod" and "sum" replace

6104 "*" and "+" respectively. INCOMPATIBILITY.

6106 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write

6107 "Sum_Type.Plus" instead.

6109 * Constant "split" has been merged with constant "prod_case"; names of

6110 ML functions, facts etc. involving split have been retained so far,

6111 though. INCOMPATIBILITY.

6113 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"

6114 instead. INCOMPATIBILITY.

6116 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".

6117 INCOMPATIBILITY.

6119 * Former theory Library/Enum is now part of the HOL-Main image.

6120 INCOMPATIBILITY: all constants of the Enum theory now have to be

6121 referred to by its qualified name.

6123 enum ~> Enum.enum

6124 nlists ~> Enum.nlists

6125 product ~> Enum.product

6127 * Theory Library/Monad_Syntax provides do-syntax for monad types.

6128 Syntax in Library/State_Monad has been changed to avoid ambiguities.

6129 INCOMPATIBILITY.

6131 * Theory Library/SetsAndFunctions has been split into

6132 Library/Function_Algebras and Library/Set_Algebras; canonical names

6133 for instance definitions for functions; various improvements.

6134 INCOMPATIBILITY.

6136 * Theory Library/Multiset provides stable quicksort implementation of

6137 sort_key.

6139 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.

6140 INCOMPATIBILITY.

6142 * Session Multivariate_Analysis: introduced a type class for euclidean

6143 space. Most theorems are now stated in terms of euclidean spaces

6144 instead of finite cartesian products.

6146 types

6147 real ^ 'n ~> 'a::real_vector

6148 ~> 'a::euclidean_space

6149 ~> 'a::ordered_euclidean_space

6150 (depends on your needs)

6152 constants

6153 _ $ _ ~> _ $$ _

6154 \<chi> x. _ ~> \<chi>\<chi> x. _

6155 CARD('n) ~> DIM('a)

6157 Also note that the indices are now natural numbers and not from some

6158 finite type. Finite cartesian products of euclidean spaces, products

6159 of euclidean spaces the real and complex numbers are instantiated to

6160 be euclidean_spaces. INCOMPATIBILITY.

6162 * Session Probability: introduced pextreal as positive extended real

6163 numbers. Use pextreal as value for measures. Introduce the

6164 Radon-Nikodym derivative, product spaces and Fubini's theorem for

6165 arbitrary sigma finite measures. Introduces Lebesgue measure based on

6166 the integral in Multivariate Analysis. INCOMPATIBILITY.

6168 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.

6169 INCOMPATIBILITY.

6171 * Session SPARK (with image HOL-SPARK) provides commands to load and

6172 prove verification conditions generated by the SPARK Ada program

6173 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.

6176 *** HOL-Algebra ***

6178 * Theorems for additive ring operations (locale abelian_monoid and

6179 descendants) are generated by interpretation from their multiplicative

6180 counterparts. Names (in particular theorem names) have the mandatory

6181 qualifier 'add'. Previous theorem names are redeclared for

6182 compatibility.

6184 * Structure "int_ring" is now an abbreviation (previously a

6185 definition). This fits more natural with advanced interpretations.

6188 *** HOLCF ***

6190 * The domain package now runs in definitional mode by default: The

6191 former command 'new_domain' is now called 'domain'. To use the domain

6192 package in its original axiomatic mode, use 'domain (unsafe)'.

6193 INCOMPATIBILITY.

6195 * The new class "domain" is now the default sort. Class "predomain"

6196 is an unpointed version of "domain". Theories can be updated by

6197 replacing sort annotations as shown below. INCOMPATIBILITY.

6199 'a::type ~> 'a::countable

6200 'a::cpo ~> 'a::predomain

6201 'a::pcpo ~> 'a::domain

6203 * The old type class "rep" has been superseded by class "domain".

6204 Accordingly, users of the definitional package must remove any

6205 "default_sort rep" declarations. INCOMPATIBILITY.

6207 * The domain package (definitional mode) now supports unpointed

6208 predomain argument types, as long as they are marked 'lazy'. (Strict

6209 arguments must be in class "domain".) For example, the following

6210 domain definition now works:

6212 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")

6214 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class

6215 instances for types from main HOL: bool, nat, int, char, 'a + 'b,

6216 'a option, and 'a list. Additionally, it configures fixrec and the

6217 domain package to work with these types. For example:

6219 fixrec isInl :: "('a + 'b) u -> tr"

6220 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"

6222 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")

6224 * The "(permissive)" option of fixrec has been replaced with a

6225 per-equation "(unchecked)" option. See

6226 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.

6228 * The "bifinite" class no longer fixes a constant "approx"; the class

6229 now just asserts that such a function exists. INCOMPATIBILITY.

6231 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer

6232 defines an embedding of type 'a defl into udom by default; instances

6233 of "bifinite" and "domain" classes are available in

6234 src/HOL/HOLCF/Library/Defl_Bifinite.thy.

6236 * The syntax "REP('a)" has been replaced with "DEFL('a)".

6238 * The predicate "directed" has been removed. INCOMPATIBILITY.

6240 * The type class "finite_po" has been removed. INCOMPATIBILITY.

6242 * The function "cprod_map" has been renamed to "prod_map".

6243 INCOMPATIBILITY.

6245 * The monadic bind operator on each powerdomain has new binder syntax

6246 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents

6247 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".

6249 * The infix syntax for binary union on each powerdomain has changed

6250 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set

6251 syntax. INCOMPATIBILITY.

6253 * The constant "UU" has been renamed to "bottom". The syntax "UU" is

6254 still supported as an input translation.

6256 * Renamed some theorems (the original names are also still available).

6258 expand_fun_below ~> fun_below_iff

6259 below_fun_ext ~> fun_belowI

6260 expand_cfun_eq ~> cfun_eq_iff

6261 ext_cfun ~> cfun_eqI

6262 expand_cfun_below ~> cfun_below_iff

6263 below_cfun_ext ~> cfun_belowI

6264 cont2cont_Rep_CFun ~> cont2cont_APP

6266 * The Abs and Rep functions for various types have changed names.

6267 Related theorem names have also changed to match. INCOMPATIBILITY.

6269 Rep_CFun ~> Rep_cfun

6270 Abs_CFun ~> Abs_cfun

6271 Rep_Sprod ~> Rep_sprod

6272 Abs_Sprod ~> Abs_sprod

6273 Rep_Ssum ~> Rep_ssum

6274 Abs_Ssum ~> Abs_ssum

6276 * Lemmas with names of the form *_defined_iff or *_strict_iff have