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

NEWS

author | wenzelm |

Tue Oct 11 20:54:42 2016 +0200 (2016-10-11) | |

changeset 64150 | b10f2ddd7679 |

parent 64122 | 74fde524799e |

child 64240 | eabf80376aab |

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

clarified modules;

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 Isabelle2016-1 (December 2016)

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

10 *** General ***

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

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

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

16 bundle foo

17 begin

18 declare a [simp]

19 declare b [intro]

20 end

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

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

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

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

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

28 discontinued.

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

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

32 quotes when sub-languages are nested.

34 * Mixfix annotations support general block properties, with syntax

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

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

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

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

40 * Proof method "blast" is more robust wrt. corner cases of Pure

41 statements without object-logic judgment.

43 * Commands 'prf' and 'full_prf' are somewhat more informative (again):

44 proof terms are reconstructed and cleaned from administrative thm nodes.

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

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

48 examples.

50 * Code generator: implicits in Scala (stemming from type class

51 instances) are generated into companion object of corresponding type

52 class, to resolve some situations where ambiguities may occur.

54 * Splitter in simp, auto and friends:

55 - The syntax "split add" has been discontinued, use plain "split",

56 INCOMPATIBILITY.

57 - For situations with many conditional or case expressions, there is

58 an alternative splitting strategy that can be much faster. It is

59 selected by writing "split!" instead of "split". It applies safe

60 introduction and elimination rules after each split rule. As a

61 result the subgoal may be split into several subgoals.

63 * Solve direct: option 'solve_direct_strict_warnings' gives explicit

64 warnings for lemma statements with trivial proofs.

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

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

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

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

73 systematic renaming.

75 * PIDE document markup works across multiple Isar commands, e.g. the

76 results established at the end of a proof are properly identified in the

77 theorem statement.

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

80 situations where old ASCII notation may be updated.

82 * Dockable window "Symbols" also provides access to 'abbrevs' from the

83 outer syntax of the current theory buffer. This provides clickable

84 syntax templates, including entries with empty abbrevs name (which are

85 inaccessible via keyboard completion).

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

88 following independent stages:

90 src/Pure/ROOT0.ML

91 src/Pure/ROOT.ML

92 src/Pure/Pure.thy

93 src/Pure/ML_Bootstrap.thy

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

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

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

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

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

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

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

103 * Isabelle/ML and Standard ML files are presented in Sidekick with the

104 tree structure of section headings: this special comment format is

105 described in "implementation" chapter 0, e.g. (*** section ***).

107 * Sidekick parser "isabelle-context" shows nesting of context blocks

108 according to 'begin' and 'end' structure.

110 * Syntactic indentation according to Isabelle outer syntax. Action

111 "indent-lines" (shortcut C+i) indents the current line according to

112 command keywords and some command substructure. Action

113 "isabelle.newline" (shortcut ENTER) indents the old and the new line

114 according to command keywords only; see also option

115 "jedit_indent_newline".

117 * Semantic indentation for unstructured proof scripts ('apply' etc.) via

118 number of subgoals. This requires information of ongoing document

119 processing and may thus lag behind, when the user is editing too

120 quickly; see also option "jedit_script_indent" and

121 "jedit_script_indent_limit".

123 * Refined folding mode "isabelle" based on Isar syntax: 'next' and 'qed'

124 are treated as delimiters for fold structure; 'begin' and 'end'

125 structure of theory specifications is treated as well.

127 * Action "isabelle.keymap-merge" asks the user to resolve pending

128 Isabelle keymap changes that are in conflict with the current jEdit

129 keymap; non-conflicting changes are always applied implicitly. This

130 action is automatically invoked on Isabelle/jEdit startup and thus

131 increases chances that users see new keyboard shortcuts when re-using

132 old keymaps.

134 * Command 'proof' provides information about proof outline with cases,

135 e.g. for proof methods "cases", "induct", "goal_cases".

137 * Completion templates for commands involving "begin ... end" blocks,

138 e.g. 'context', 'notepad'.

140 * Additional abbreviations for syntactic completion may be specified

141 within the theory header as 'abbrevs'. The theory syntax for 'keywords'

142 has been simplified accordingly: optional abbrevs need to go into the

143 new 'abbrevs' section.

145 * Global abbreviations via $ISABELLE_HOME/etc/abbrevs and

146 $ISABELLE_HOME_USER/etc/abbrevs are no longer supported. Minor

147 INCOMPATIBILITY, use 'abbrevs' within theory header instead.

149 * ML and document antiquotations for file-systems paths are more uniform

150 and diverse:

152 @{path NAME} -- no file-system check

153 @{file NAME} -- check for plain file

154 @{dir NAME} -- check for directory

156 Minor INCOMPATIBILITY, former uses of @{file} and @{file_unchecked} may

157 have to be changed.

160 *** Document preparation ***

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

164 * New document and ML antiquotation @{locale} for locales, similar to

165 existing antiquotation @{class}.

167 * Mixfix annotations support delimiters like \<^control>\<open>cartouche\<close> --

168 this allows special forms of document output.

170 * Raw LaTeX output now works via \<^latex>\<open>...\<close> instead of raw control

171 symbol \<^raw:...>. INCOMPATIBILITY, notably for LaTeXsugar.thy and its

172 derivatives.

174 * \<^raw:...> symbols are no longer supported.

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

177 Isabelle2015).

180 *** Isar ***

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

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

184 'definition', 'inductive', 'function'.

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

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

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

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

190 context: INCOMPATIBILITY.

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

193 optional abstraction over local parameters. The syntax resembles

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

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

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

198 context.

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

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

203 * The defining position of a literal fact \<open>prop\<close> is maintained more

204 carefully, and made accessible as hyperlink in the Prover IDE.

206 * Commands 'finally' and 'ultimately' used to expose the result as

207 literal fact: this accidental behaviour has been discontinued. Rare

208 INCOMPATIBILITY, use more explicit means to refer to facts in Isar.

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

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

212 INCOMPATIBILITY.

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

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

216 definitions.

218 * Proof method "use" allows to modify the main facts of a given method

219 expression, e.g.

221 (use facts in simp)

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

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

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

228 *** Pure ***

230 * Pure provides basic versions of proof methods "simp" and "simp_all"

231 that only know about meta-equality (==). Potential INCOMPATIBILITY in

232 theory imports that merge Pure with e.g. Main of Isabelle/HOL: the order

233 is relevant to avoid confusion of Pure.simp vs. HOL.simp.

235 * The command 'unfolding' and proof method "unfold" include a second

236 stage where given equations are passed through the attribute "abs_def"

237 before rewriting. This ensures that definitions are fully expanded,

238 regardless of the actual parameters that are provided. Rare

239 INCOMPATIBILITY in some corner cases: use proof method (simp only:)

240 instead, or declare [[unfold_abs_def = false]] in the proof context.

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

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

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

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

246 INCOMPATIBILITY, need to provide explicit type constraints for Pure

247 types where this is really intended.

250 *** HOL ***

252 * Dedicated syntax LENGTH('a) for length of types.

254 * New proof method "argo" using the built-in Argo solver based on SMT

255 technology. The method can be used to prove goals of quantifier-free

256 propositional logic, goals based on a combination of quantifier-free

257 propositional logic with equality, and goals based on a combination of

258 quantifier-free propositional logic with linear real arithmetic

259 including min/max/abs. See HOL/ex/Argo_Examples.thy for examples.

261 * Metis: The problem encoding has changed very slightly. This might

262 break existing proofs. INCOMPATIBILITY.

264 * Sledgehammer:

265 - The MaSh relevance filter is now faster than before.

266 - Produce syntactically correct Vampire 4.0 problem files.

268 * (Co)datatype package:

269 - New commands for defining corecursive functions and reasoning about

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

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

272 method. See 'isabelle doc corec'.

273 - The predicator :: ('a \<Rightarrow> bool) \<Rightarrow> 'a F \<Rightarrow> bool is now a first-class

274 citizen in bounded natural functors.

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

276 to the map function.

277 - 'bnf' automatically discharges reflexive proof obligations.

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

279 terms of map and set

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

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

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

283 INCOMPATIBILITY: manual 'bnf' declarations may need adjustment.

284 - Renamed lemmas:

285 rel_prod_apply ~> rel_prod_inject

286 pred_prod_apply ~> pred_prod_inject

287 INCOMPATIBILITY.

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

289 - The theorems about "rel" and "set" may have a slightly different (but

290 equivalent) form.

291 INCOMPATIBILITY.

293 * The 'coinductive' command produces a proper coinduction rule for

294 mutual coinductive predicates. This new rule replaces the old rule,

295 which exposed details of the internal fixpoint construction and was

296 hard to use. INCOMPATIBILITY.

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

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

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

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

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

305 eliminated altogether.

307 * The unique existence quantifier no longer provides 'binder' syntax,

308 but uses syntax translations (as for bounded unique existence). Thus

309 iterated quantification \<exists>!x y. P x y with its slightly confusing

310 sequential meaning \<exists>!x. \<exists>!y. P x y is no longer possible. Instead,

311 pattern abstraction admits simultaneous unique existence \<exists>!(x, y). P x y

312 (analogous to existing notation \<exists>!(x, y)\<in>A. P x y). Potential

313 INCOMPATIBILITY in rare situations.

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

316 INCOMPATIBILITY.

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

319 corresponding to {0..255}.

321 - Logical representation:

322 * 0 is instantiated to the ASCII zero character.

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

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

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

326 are non-canonical.

327 - Printing and parsing:

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

329 (as before).

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

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

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

333 is parsable for every numeral expression n.

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

335 printed as their logical representation.

336 - Explicit conversions from and to the natural numbers are

337 provided as char_of_nat, nat_of_char (as before).

338 - The auxiliary nibble type has been discontinued.

340 INCOMPATIBILITY.

342 * Type class "div" with operation "mod" renamed to type class "modulo"

343 with operation "modulo", analogously to type class "divide". This

344 eliminates the need to qualify any of those names in the presence of

345 infix "mod" syntax. INCOMPATIBILITY.

347 * Statements and proofs of Knaster-Tarski fixpoint combinators lfp/gfp

348 have been clarified. The fixpoint properties are lfp_fixpoint, its

349 symmetric lfp_unfold (as before), and the duals for gfp. Auxiliary items

350 for the proof (lfp_lemma2 etc.) are no longer exported, but can be

351 easily recovered by composition with eq_refl. Minor INCOMPATIBILITY.

353 * Constant "surj" is a mere input abbreviation, to avoid hiding an

354 equation in term output. Minor INCOMPATIBILITY.

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

357 which renders those abstract effectively.

359 * Command 'export_code' checks given constants for abstraction

360 violations: a small guarantee that given constants specify a safe

361 interface for the generated code.

363 * Code generation for Scala: ambiguous implicts in class diagrams are

364 spelt out explicitly.

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

367 explicitly provided auxiliary definitions for required type class

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

369 the tutorial on code generation for details.

371 * Theory Set_Interval.thy: substantial new theorems on indexed sums

372 and products.

374 * Theory List.thy: ranaming of listsum ~> sum_list, listprod ~>

375 prod_list, INCOMPATIBILITY.

377 * Locale bijection establishes convenient default simp rules such as

378 "inv f (f a) = a" for total bijections.

380 * Abstract locales semigroup, abel_semigroup, semilattice,

381 semilattice_neutr, ordering, ordering_top, semilattice_order,

382 semilattice_neutr_order, comm_monoid_set, semilattice_set,

383 semilattice_neutr_set, semilattice_order_set,

384 semilattice_order_neutr_set monoid_list, comm_monoid_list,

385 comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified

386 syntax uniformly that does not clash with corresponding global syntax.

387 INCOMPATIBILITY.

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

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

391 lifting_syntax begin ... end". Minor INCOMPATIBILITY.

393 * Some old / obsolete theorems have been renamed / removed, potential

394 INCOMPATIBILITY.

396 nat_less_cases -- removed, use linorder_cases instead

397 inv_image_comp -- removed, use image_inv_f_f instead

398 image_surj_f_inv_f ~> image_f_inv_f

400 * Some theorems about groups and orders have been generalised from

401 groups to semi-groups that are also monoids:

402 le_add_same_cancel1

403 le_add_same_cancel2

404 less_add_same_cancel1

405 less_add_same_cancel2

406 add_le_same_cancel1

407 add_le_same_cancel2

408 add_less_same_cancel1

409 add_less_same_cancel2

411 * Some simplifications theorems about rings have been removed, since

412 superseeded by a more general version:

413 less_add_cancel_left_greater_zero ~> less_add_same_cancel1

414 less_add_cancel_right_greater_zero ~> less_add_same_cancel2

415 less_eq_add_cancel_left_greater_eq_zero ~> le_add_same_cancel1

416 less_eq_add_cancel_right_greater_eq_zero ~> le_add_same_cancel2

417 less_eq_add_cancel_left_less_eq_zero ~> add_le_same_cancel1

418 less_eq_add_cancel_right_less_eq_zero ~> add_le_same_cancel2

419 less_add_cancel_left_less_zero ~> add_less_same_cancel1

420 less_add_cancel_right_less_zero ~> add_less_same_cancel2

421 INCOMPATIBILITY.

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

424 resemble the f.split naming convention, INCOMPATIBILITY.

426 * Added class topological_monoid.

428 * HOL-Library: theory FinFun bundles "finfun_syntax" and

429 "no_finfun_syntax" allow to control optional syntax in local contexts;

430 this supersedes former theory FinFun_Syntax. INCOMPATIBILITY, e.g. use

431 "unbundle finfun_syntax" to imitate import of

432 "~~/src/HOL/Library/FinFun_Syntax".

434 * HOL-Library: theory Multiset_Permutations (executably) defines the set of

435 permutations of a given set or multiset, i.e. the set of all lists that

436 contain every element of the carrier (multi-)set exactly once.

438 * HOL-Library: multiset membership is now expressed using set_mset

439 rather than count.

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

442 by default.

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

445 equations count_eq_zero_iff and not_in_iff.

447 - Rules count_inI and in_countE obtain facts of the form

448 "count M a = n" from membership.

450 - Rules count_in_diffI and in_diff_countE obtain facts of the form

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

453 INCOMPATIBILITY.

455 * HOL-Library: theory LaTeXsugar uses new-style "dummy_pats" for

456 displaying equations in functional programming style --- variables

457 present on the left-hand but not on the righ-hand side are replaced by

458 underscores.

460 * HOL-Library: theory Combinator_PER provides combinator to build

461 partial equivalence relations from a predicate and an equivalence

462 relation.

464 * HOL-Library: theory Perm provides basic facts about almost everywhere

465 fix bijections.

467 * HOL-Library: theory Normalized_Fraction allows viewing an element of a

468 field of fractions as a normalized fraction (i.e. a pair of numerator

469 and denominator such that the two are coprime and the denominator is

470 normalized wrt. unit factors).

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

474 * Session HOL-Multivariate_Analysis has been renamed to HOL-Analysis.

476 * HOL-Analysis: measure theory has been moved here from HOL-Probability.

477 When importing HOL-Analysis some theorems need additional name spaces

478 prefixes due to name clashes. INCOMPATIBILITY.

480 * HOL-Analysis: more complex analysis including Cauchy's inequality,

481 Liouville theorem, open mapping theorem, maximum modulus principle,

482 Residue theorem, Schwarz Lemma.

484 * HOL-Analysis: Theory of polyhedra: faces, extreme points, polytopes,

485 and the Krein–Milman Minkowski theorem.

487 * HOL-Analysis: Numerous results ported from the HOL Light libraries:

488 homeomorphisms, continuous function extensions, invariance of domain.

490 * HOL-Probability: the type of emeasure and nn_integral was changed from

491 ereal to ennreal, INCOMPATIBILITY.

493 emeasure :: 'a measure \<Rightarrow> 'a set \<Rightarrow> ennreal

494 nn_integral :: 'a measure \<Rightarrow> ('a \<Rightarrow> ennreal) \<Rightarrow> ennreal

496 * HOL-Probability: Code generation and QuickCheck for Probability Mass

497 Functions.

499 * HOL-Probability: theory Random_Permutations contains some theory about

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

501 list in random order.

503 * HOL-Probability: theory SPMF formalises discrete subprobability

504 distributions.

506 * HOL-Number_Theory: algebraic foundation for primes: Generalisation of

507 predicate "prime" and introduction of predicates "prime_elem",

508 "irreducible", a "prime_factorization" function, and the

509 "factorial_ring" typeclass with instance proofs for nat, int, poly. Some

510 theorems now have different names, most notably "prime_def" is now

511 "prime_nat_iff". INCOMPATIBILITY.

513 * HOL-Library: the names of multiset theorems have been normalised to

514 distinguish which ordering the theorems are about

516 mset_less_eqI ~> mset_subset_eqI

517 mset_less_insertD ~> mset_subset_insertD

518 mset_less_eq_count ~> mset_subset_eq_count

519 mset_less_diff_self ~> mset_subset_diff_self

520 mset_le_exists_conv ~> mset_subset_eq_exists_conv

521 mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel

522 mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel

523 mset_le_mono_add ~> mset_subset_eq_mono_add

524 mset_le_add_left ~> mset_subset_eq_add_left

525 mset_le_add_right ~> mset_subset_eq_add_right

526 mset_le_single ~> mset_subset_eq_single

527 mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute

528 diff_le_self ~> diff_subset_eq_self

529 mset_leD ~> mset_subset_eqD

530 mset_lessD ~> mset_subsetD

531 mset_le_insertD ~> mset_subset_eq_insertD

532 mset_less_of_empty ~> mset_subset_of_empty

533 mset_less_size ~> mset_subset_size

534 wf_less_mset_rel ~> wf_subset_mset_rel

535 count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq

536 mset_remdups_le ~> mset_remdups_subset_eq

537 ms_lesseq_impl ~> subset_eq_mset_impl

539 Some functions have been renamed:

540 ms_lesseq_impl -> subset_eq_mset_impl

542 * HOL-Library: multisets are now ordered with the multiset ordering

543 #\<subseteq># ~> \<le>

544 #\<subset># ~> <

545 le_multiset ~> less_eq_multiset

546 less_multiset ~> le_multiset

547 INCOMPATIBILITY.

549 * HOL-Library: the prefix multiset_order has been discontinued: the

550 theorems can be directly accessed. As a consequence, the lemmas

551 "order_multiset" and "linorder_multiset" have been discontinued, and the

552 interpretations "multiset_linorder" and "multiset_wellorder" have been

553 replaced by instantiations. INCOMPATIBILITY.

555 * HOL-Library: some theorems about the multiset ordering have been

556 renamed:

558 le_multiset_def ~> less_eq_multiset_def

559 less_multiset_def ~> le_multiset_def

560 less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset

561 mult_less_not_refl ~> mset_le_not_refl

562 mult_less_trans ~> mset_le_trans

563 mult_less_not_sym ~> mset_le_not_sym

564 mult_less_asym ~> mset_le_asym

565 mult_less_irrefl ~> mset_le_irrefl

566 union_less_mono2{,1,2} ~> union_le_mono2{,1,2}

568 le_multiset\<^sub>H\<^sub>O ~> less_eq_multiset\<^sub>H\<^sub>O

569 le_multiset_total ~> less_eq_multiset_total

570 less_multiset_right_total ~> subset_eq_imp_le_multiset

571 le_multiset_empty_left ~> less_eq_multiset_empty_left

572 le_multiset_empty_right ~> less_eq_multiset_empty_right

573 less_multiset_empty_right ~> le_multiset_empty_left

574 less_multiset_empty_left ~> le_multiset_empty_right

575 union_less_diff_plus ~> union_le_diff_plus

576 ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset

577 less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty

578 le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty

579 INCOMPATIBILITY.

581 * HOL-Library: the lemma mset_map has now the attribute [simp].

582 INCOMPATIBILITY.

584 * HOL-Library: some theorems about multisets have been removed.

585 INCOMPATIBILITY, use the following replacements:

587 le_multiset_plus_plus_left_iff ~> add_less_cancel_right

588 less_multiset_plus_plus_left_iff ~> add_less_cancel_right

589 le_multiset_plus_plus_right_iff ~> add_less_cancel_left

590 less_multiset_plus_plus_right_iff ~> add_less_cancel_left

591 add_eq_self_empty_iff ~> add_cancel_left_right

592 mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right

593 mset_less_add_bothsides ~> subset_mset.add_less_cancel_right

594 mset_le_add_bothsides ~> subset_mset.add_less_cancel_right

595 empty_inter ~> subset_mset.inf_bot_left

596 inter_empty ~> subset_mset.inf_bot_right

597 empty_sup ~> subset_mset.sup_bot_left

598 sup_empty ~> subset_mset.sup_bot_right

599 bdd_below_multiset ~> subset_mset.bdd_above_bot

600 subset_eq_empty ~> subset_mset.le_zero_eq

601 le_empty ~> subset_mset.le_zero_eq

602 mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero

603 mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero

605 * HOL-Library: some typeclass constraints about multisets have been

606 reduced from ordered or linordered to preorder. Multisets have the

607 additional typeclasses order_bot, no_top,

608 ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add,

609 linordered_cancel_ab_semigroup_add, and

610 ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY.

612 * HOL-Library: there are some new simplification rules about multisets,

613 the multiset ordering, and the subset ordering on multisets.

614 INCOMPATIBILITY.

616 * HOL-Library: the subset ordering on multisets has now the

617 interpretations ordered_ab_semigroup_monoid_add_imp_le and

618 bounded_lattice_bot. INCOMPATIBILITY.

620 * HOL-Library/Multiset: single has been removed in favor of add_mset

621 that roughly corresponds to Set.insert. Some theorems have removed or

622 changed:

624 single_not_empty ~> add_mset_not_empty or empty_not_add_mset

625 fold_mset_insert ~> fold_mset_add_mset

626 image_mset_insert ~> image_mset_add_mset

627 union_single_eq_diff

628 multi_self_add_other_not_self

629 diff_single_eq_union

630 INCOMPATIBILITY.

632 * HOL-Library/Multiset: some theorems have been changed to use add_mset

633 instead of single:

635 mset_add

636 multi_self_add_other_not_self

637 diff_single_eq_union

638 union_single_eq_diff

639 union_single_eq_member

640 add_eq_conv_diff

641 insert_noteq_member

642 add_eq_conv_ex

643 multi_member_split

644 multiset_add_sub_el_shuffle

645 mset_subset_eq_insertD

646 mset_subset_insertD

647 insert_subset_eq_iff

648 insert_union_subset_iff

649 multi_psub_of_add_self

650 inter_add_left1

651 inter_add_left2

652 inter_add_right1

653 inter_add_right2

654 sup_union_left1

655 sup_union_left2

656 sup_union_right1

657 sup_union_right2

658 size_eq_Suc_imp_eq_union

659 multi_nonempty_split

660 mset_insort

661 mset_update

662 mult1I

663 less_add

664 mset_zip_take_Cons_drop_twice

665 rel_mset_Zero

666 msed_map_invL

667 msed_map_invR

668 msed_rel_invL

669 msed_rel_invR

670 le_multiset_right_total

671 multiset_induct

672 multiset_induct2_size

673 multiset_induct2

674 INCOMPATIBILITY.

676 * HOL-Library/Multiset. The definitions of some constants have changed

677 to use add_mset instead of adding a single element:

678 image_mset

679 mset

680 replicate_mset

681 mult1

682 pred_mset

683 rel_mset'

684 mset_insort

685 INCOMPATIBILITY.

687 * HOL-Library/Multiset. Due to the above changes, the attributes of some

688 multiset theorems have been changed:

689 insert_DiffM [] ~> [simp]

690 insert_DiffM2 [simp] ~> []

691 diff_add_mset_swap [simp]

692 fold_mset_add_mset [simp]

693 diff_diff_add [simp] (for multisets only)

694 diff_cancel [simp] ~> []

695 count_single [simp] ~> []

696 set_mset_single [simp] ~> []

697 size_multiset_single [simp] ~> []

698 size_single [simp] ~> []

699 image_mset_single [simp] ~> []

700 mset_subset_eq_mono_add_right_cancel [simp] ~> []

701 mset_subset_eq_mono_add_left_cancel [simp] ~> []

702 fold_mset_single [simp] ~> []

703 subset_eq_empty [simp] ~> []

704 empty_sup [simp] ~> []

705 sup_empty [simp] ~> []

706 inter_empty [simp] ~> []

707 empty_inter [simp] ~> []

708 INCOMPATIBILITY.

710 * HOL-Library/Multiset. The order of the variables in the second cases

711 of multiset_induct, multiset_induct2_size, multiset_induct2 has been

712 changed (e.g. Add A a ~> Add a A). INCOMPATIBILITY.

714 * HOL-Library/Multiset. There is now a simplification procedure on

715 multisets. It mimics the behavior of the procedure on natural numbers.

716 INCOMPATIBILITY.

718 * HOL-Library/Multiset. Renamed sums and products of multisets:

719 msetsum ~> sum_mset

720 msetprod ~> prod_mset

722 * HOL-Library/Multiset. The notation for intersection and union of

723 multisets have been changed:

724 #\<inter> ~> \<inter>#

725 #\<union> ~> \<union>#

726 INCOMPATIBILITY.

728 * HOL-Library/Multiset. The lemma one_step_implies_mult_aux on multisets

729 has been removed, use one_step_implies_mult instead. INCOMPATIBILITY.

731 * The following theorems have been renamed:

732 setsum_left_distrib ~> setsum_distrib_right

733 setsum_right_distrib ~> setsum_distrib_left

734 INCOMPATIBILITY.

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

737 INCOMPATIBILITY.

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

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

742 * Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY.

744 * The type class ordered_comm_monoid_add is now called

745 ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add

746 is introduced as the combination of ordered_ab_semigroup_add +

747 comm_monoid_add. INCOMPATIBILITY.

749 * Introduced the type classes canonically_ordered_comm_monoid_add and

750 dioid.

752 * Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When

753 instantiating linordered_semiring_strict and ordered_ab_group_add, an

754 explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might

755 be required. INCOMPATIBILITY.

757 * HOL-Library: theory Complete_Partial_Order2 provides reasoning support

758 for monotonicity and continuity in chain-complete partial orders and

759 about admissibility conditions for fixpoint inductions.

761 * HOL-Library: theory Polynomial contains also derivation of polynomials

762 but not gcd/lcm on polynomials over fields. This has been moved to a

763 separate theory Library/Polynomial_GCD_euclidean.thy, to pave way for a

764 possible future different type class instantiation for polynomials over

765 factorial rings. INCOMPATIBILITY.

767 * HOL-Library: theory Sublist.thy provides function "prefixes" with the

768 following renaming

770 prefixeq -> prefix

771 prefix -> strict_prefix

772 suffixeq -> suffix

773 suffix -> strict_suffix

775 Added theory of longest common prefixes.

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

778 of a more general type also:

779 lcm_left_commute_nat ~> lcm.left_commute

780 lcm_left_commute_int ~> lcm.left_commute

781 gcd_left_commute_nat ~> gcd.left_commute

782 gcd_left_commute_int ~> gcd.left_commute

783 gcd_greatest_iff_nat ~> gcd_greatest_iff

784 gcd_greatest_iff_int ~> gcd_greatest_iff

785 coprime_dvd_mult_nat ~> coprime_dvd_mult

786 coprime_dvd_mult_int ~> coprime_dvd_mult

787 zpower_numeral_even ~> power_numeral_even

788 gcd_mult_cancel_nat ~> gcd_mult_cancel

789 gcd_mult_cancel_int ~> gcd_mult_cancel

790 div_gcd_coprime_nat ~> div_gcd_coprime

791 div_gcd_coprime_int ~> div_gcd_coprime

792 zpower_numeral_odd ~> power_numeral_odd

793 zero_less_int_conv ~> of_nat_0_less_iff

794 gcd_greatest_nat ~> gcd_greatest

795 gcd_greatest_int ~> gcd_greatest

796 coprime_mult_nat ~> coprime_mult

797 coprime_mult_int ~> coprime_mult

798 lcm_commute_nat ~> lcm.commute

799 lcm_commute_int ~> lcm.commute

800 int_less_0_conv ~> of_nat_less_0_iff

801 gcd_commute_nat ~> gcd.commute

802 gcd_commute_int ~> gcd.commute

803 Gcd_insert_nat ~> Gcd_insert

804 Gcd_insert_int ~> Gcd_insert

805 of_int_int_eq ~> of_int_of_nat_eq

806 lcm_least_nat ~> lcm_least

807 lcm_least_int ~> lcm_least

808 lcm_assoc_nat ~> lcm.assoc

809 lcm_assoc_int ~> lcm.assoc

810 int_le_0_conv ~> of_nat_le_0_iff

811 int_eq_0_conv ~> of_nat_eq_0_iff

812 Gcd_empty_nat ~> Gcd_empty

813 Gcd_empty_int ~> Gcd_empty

814 gcd_assoc_nat ~> gcd.assoc

815 gcd_assoc_int ~> gcd.assoc

816 zero_zle_int ~> of_nat_0_le_iff

817 lcm_dvd2_nat ~> dvd_lcm2

818 lcm_dvd2_int ~> dvd_lcm2

819 lcm_dvd1_nat ~> dvd_lcm1

820 lcm_dvd1_int ~> dvd_lcm1

821 gcd_zero_nat ~> gcd_eq_0_iff

822 gcd_zero_int ~> gcd_eq_0_iff

823 gcd_dvd2_nat ~> gcd_dvd2

824 gcd_dvd2_int ~> gcd_dvd2

825 gcd_dvd1_nat ~> gcd_dvd1

826 gcd_dvd1_int ~> gcd_dvd1

827 int_numeral ~> of_nat_numeral

828 lcm_ac_nat ~> ac_simps

829 lcm_ac_int ~> ac_simps

830 gcd_ac_nat ~> ac_simps

831 gcd_ac_int ~> ac_simps

832 abs_int_eq ~> abs_of_nat

833 zless_int ~> of_nat_less_iff

834 zdiff_int ~> of_nat_diff

835 zadd_int ~> of_nat_add

836 int_mult ~> of_nat_mult

837 int_Suc ~> of_nat_Suc

838 inj_int ~> inj_of_nat

839 int_1 ~> of_nat_1

840 int_0 ~> of_nat_0

841 Lcm_empty_nat ~> Lcm_empty

842 Lcm_empty_int ~> Lcm_empty

843 Lcm_insert_nat ~> Lcm_insert

844 Lcm_insert_int ~> Lcm_insert

845 comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd

846 comp_fun_idem_gcd_int ~> comp_fun_idem_gcd

847 comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm

848 comp_fun_idem_lcm_int ~> comp_fun_idem_lcm

849 Lcm_eq_0 ~> Lcm_eq_0_I

850 Lcm0_iff ~> Lcm_0_iff

851 Lcm_dvd_int ~> Lcm_least

852 divides_mult_nat ~> divides_mult

853 divides_mult_int ~> divides_mult

854 lcm_0_nat ~> lcm_0_right

855 lcm_0_int ~> lcm_0_right

856 lcm_0_left_nat ~> lcm_0_left

857 lcm_0_left_int ~> lcm_0_left

858 dvd_gcd_D1_nat ~> dvd_gcdD1

859 dvd_gcd_D1_int ~> dvd_gcdD1

860 dvd_gcd_D2_nat ~> dvd_gcdD2

861 dvd_gcd_D2_int ~> dvd_gcdD2

862 coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff

863 coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff

864 realpow_minus_mult ~> power_minus_mult

865 realpow_Suc_le_self ~> power_Suc_le_self

866 dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest

867 INCOMPATIBILITY.

869 * Renamed HOL/Quotient_Examples/FSet.thy to

870 HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY.

873 *** ML ***

875 * ML antiquotation @{path} is superseded by @{file}, which ensures that

876 the argument is a plain file. Minor INCOMPATIBILITY.

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

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

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

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

882 INCOMPATIBILITY.

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

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

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

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

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

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

890 superseded by General.Div.

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

893 This is particularly useful for conditional compilation, without

894 requiring separate files.

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

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

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

900 with approximative output quality.

902 * Option ML_exception_debugger controls detailed exception trace via the

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

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

905 debugger information requires consirable time and space: main

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

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

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

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

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

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

913 balanced blocks of Local_Theory.open_target versus

914 Local_Theory.close_target instead. Rare INCOMPATIBILITY.

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

917 replaced by structure Timeout, with slightly different signature.

918 INCOMPATIBILITY.

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

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

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

923 File.full_path). Potential INCOMPATIBILITY.

925 * Binding.empty_atts supersedes Thm.empty_binding and

926 Attrib.empty_binding. Minor INCOMPATIBILITY.

929 *** System ***

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

932 settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64,

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

934 ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been

935 discontinued. Potential INCOMPATIBILITY.

937 * The Isabelle system environment always ensures that the main

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

939 "isabelle_scala_script".

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

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

943 Isabelle_Tool.Body.

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

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

947 particular:

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

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

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

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

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

955 prover front-ends should use ML_Process or Isabelle_Process in

956 Isabelle/Scala. INCOMPATIBILITY.

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

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

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

961 return code 1.

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

964 bootstrapping Isabelle/Pure interactively.

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

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

968 Isabelle/ML or Isabelle/Scala.

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

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

972 produce robust shell scripts under program control, without worrying

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

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

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

976 been discontinued.

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

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

981 much less disk space.

983 * System option "checkpoint" helps to fine-tune the global heap space

984 management of isabelle build. This is relevant for big sessions that may

985 exhaust the small 32-bit address space of the ML process (which is used

986 by default).

988 * System option "ML_process_policy" specifies an optional command prefix

989 for the underlying ML process, e.g. to control CPU affinity on

990 multiprocessor systems. The "isabelle jedit" tool allows to override the

991 implicit default via option -p.

993 * The isabelle_java executable allows to run a Java process within the

994 name space of Java and Scala components that are bundled with Isabelle,

995 but without the Isabelle settings environment.

999 New in Isabelle2016 (February 2016)

1000 -----------------------------------

1002 *** General ***

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

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

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

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

1008 examples that do require HOL.

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

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

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

1014 without any special print mode. Important ASCII replacement syntax

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

1016 has been removed (see below).

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

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

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

1022 context has been discontinued. Rare INCOMPATIBILITY, use explicit

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

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

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

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

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

1029 meaning.

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

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

1033 to update old sources.

1035 * Toplevel theorem statements have been simplified as follows:

1037 theorems ~> lemmas

1038 schematic_lemma ~> schematic_goal

1039 schematic_theorem ~> schematic_goal

1040 schematic_corollary ~> schematic_goal

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

1043 accordingly.

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

1046 'theorem'.

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

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

1050 deferred definitions require a surrounding 'overloading' block.

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

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

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

1057 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',

1058 'SML_file_no_debug' control compilation of sources with or without

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

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

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

1062 any effect on the running ML program.

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

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

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

1067 update.

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

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

1071 enable option "editor_output_state".

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

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

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

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

1077 visibility.

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

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

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

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

1083 panel.

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

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

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

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

1090 implicit: a popup will show up unconditionally.

1092 * Additional abbreviations for syntactic completion may be specified in

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

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

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

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

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

1099 suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.

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

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

1103 the editor.

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

1106 instead of former C+e LEFT.

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

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

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

1111 instead.

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

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

1115 single-instance applications seen on common GUI desktops.

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

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

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

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

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

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

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

1128 *** Document preparation ***

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

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

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

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

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

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

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

1139 follows:

1141 \<^item> itemize

1142 \<^enum> enumerate

1143 \<^descr> description

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

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

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

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

1149 standard Isabelle fonts provide glyphs to render important control

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

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

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

1154 standard LaTeX macros of the same names.

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

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

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

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

1160 cartouche tokens seen in theory sources.

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

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

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

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

1166 or terminal spaces are ignored.

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

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

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

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

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

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

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

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

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

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

1182 documentation, with a hyperlink in the Prover IDE.

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

1185 entities of the Isar language.

1187 * HTML presentation uses the standard IsabelleText font and Unicode

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

1189 print mode "HTML" loses its special meaning.

1192 *** Isar ***

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

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

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

1197 example:

1199 have result: "C x y"

1200 if "A x" and "B y"

1201 for x :: 'a and y :: 'a

1202 <proof>

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

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

1206 corresponds to a raw proof block like this:

1208 {

1209 fix x :: 'a and y :: 'a

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

1211 have "C x y" <proof>

1212 }

1213 note result = this

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

1216 instead of 'assume' above.

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

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

1221 assume result: "C x y"

1222 if "A x" and "B y"

1223 for x :: 'a and y :: 'a

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

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

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

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

1230 example:

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

1234 is equivalent to:

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

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

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

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

1241 follows:

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

1245 or:

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

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

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

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

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

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

1256 of the local context elements yet.

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

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

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

1262 then have something

1263 proof cases

1264 case a

1265 then show ?thesis <proof>

1266 next

1267 case b

1268 then show ?thesis <proof>

1269 next

1270 case c

1271 then show ?thesis <proof>

1272 qed

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

1276 case a: (c xs)

1277 case a [attributes]: (c xs)

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

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

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

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

1283 and always put attributes in front.

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

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

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

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

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

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

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

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

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

1296 supply [simp] = a

1297 proof

1298 show A by simp

1299 next

1300 show A by simp

1301 qed

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

1304 proof body as well, abstracted over relevant parameters.

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

1307 parameter scope for of each clause.

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

1310 statements: result is abstracted over unknowns.

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

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

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

1315 manual.

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

1318 ('apply' scripts).

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

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

1322 example:

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

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

1326 proof goal_cases

1327 case (1 x)

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

1329 next

1330 case (2 y z)

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

1332 qed

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

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

1336 proof goal_cases

1337 case prems: 1

1338 then show ?case using prems sorry

1339 next

1340 case prems: 2

1341 then show ?case using prems sorry

1342 qed

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

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

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

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

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

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

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

1353 occasionally useful for demonstration and testing purposes.

1356 *** Pure ***

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

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

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

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

1363 * Keyword 'rewrites' identifies rewrite morphisms in interpretation

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

1366 * More gentle suppression of syntax along locale morphisms while

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

1368 would be suppressed for morphisms except term identity. Now

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

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

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

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

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

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

1376 begin

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

1378 end

1380 locale morphism =

1381 left: struct composition + right: struct composition'

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

1383 begin

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

1385 end

1387 * Command 'global_interpretation' issues interpretations into global

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

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

1391 'defines'.

1393 * Command 'permanent_interpretation' has been discontinued. Use

1394 'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.

1396 * Command 'print_definitions' prints dependencies of definitional

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

1399 * Configuration option rule_insts_schematic has been discontinued

1400 (intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.

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

1403 INCOMPATIBILITY in situations where the previous misbehaviour has been

1404 exploited.

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

1407 operations behave more similar to abbreviations. Potential

1408 INCOMPATIBILITY in exotic situations.

1411 *** HOL ***

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

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

1415 global collection of overloaded constant / type definitions into

1416 account. Type definitions with open dependencies on overloaded

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

1418 provides extra robustness in theory construction. Rare INCOMPATIBILITY.

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

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

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

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

1424 Option.is_none_def. Occasional INCOMPATIBILITY in applications.

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

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

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

1429 simplify porting old theories:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1458 INCOMPATIBILITY, use plain "::" instead.

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

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

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

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

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

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

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

1468 definition and its monotonicity result. Rare INCOMPATIBILITY.

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

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

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

1473 also subject to "inductive_internals". Rare INCOMPATIBILITY.

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

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

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

1478 INCOMPATIBILITY.

1480 * Combinator to represent case distinction on products is named

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

1482 theorem aliasses have been retained.

1484 Consolidated facts:

1485 PairE ~> prod.exhaust

1486 Pair_eq ~> prod.inject

1487 pair_collapse ~> prod.collapse

1488 Pair_fst_snd_eq ~> prod_eq_iff

1489 split_twice ~> prod.case_distrib

1490 split_weak_cong ~> prod.case_cong_weak

1491 split_split ~> prod.split

1492 split_split_asm ~> prod.split_asm

1493 splitI ~> case_prodI

1494 splitD ~> case_prodD

1495 splitI2 ~> case_prodI2

1496 splitI2' ~> case_prodI2'

1497 splitE ~> case_prodE

1498 splitE' ~> case_prodE'

1499 split_pair ~> case_prod_Pair

1500 split_eta ~> case_prod_eta

1501 split_comp ~> case_prod_comp

1502 mem_splitI ~> mem_case_prodI

1503 mem_splitI2 ~> mem_case_prodI2

1504 mem_splitE ~> mem_case_prodE

1505 The_split ~> The_case_prod

1506 cond_split_eta ~> cond_case_prod_eta

1507 Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE

1508 Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI

1509 in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq

1510 Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD

1511 Collect_split_Grp_inD ~> Collect_case_prod_Grp_in

1512 Domain_Collect_split ~> Domain_Collect_case_prod

1513 Image_Collect_split ~> Image_Collect_case_prod

1514 Range_Collect_split ~> Range_Collect_case_prod

1515 Eps_split ~> Eps_case_prod

1516 Eps_split_eq ~> Eps_case_prod_eq

1517 split_rsp ~> case_prod_rsp

1518 curry_split ~> curry_case_prod

1519 split_curry ~> case_prod_curry

1521 Changes in structure HOLogic:

1522 split_const ~> case_prod_const

1523 mk_split ~> mk_case_prod

1524 mk_psplits ~> mk_ptupleabs

1525 strip_psplits ~> strip_ptupleabs

1527 INCOMPATIBILITY.

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

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

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

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

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

1535 Consolidated facts (among others):

1536 real_of_nat_le_iff -> of_nat_le_iff

1537 real_of_nat_numeral of_nat_numeral

1538 real_of_int_zero of_int_0

1539 real_of_nat_zero of_nat_0

1540 real_of_one of_int_1

1541 real_of_int_add of_int_add

1542 real_of_nat_add of_nat_add

1543 real_of_int_diff of_int_diff

1544 real_of_nat_diff of_nat_diff

1545 floor_subtract floor_diff_of_int

1546 real_of_int_inject of_int_eq_iff

1547 real_of_int_gt_zero_cancel_iff of_int_0_less_iff

1548 real_of_int_ge_zero_cancel_iff of_int_0_le_iff

1549 real_of_nat_ge_zero of_nat_0_le_iff

1550 real_of_int_ceiling_ge le_of_int_ceiling

1551 ceiling_less_eq ceiling_less_iff

1552 ceiling_le_eq ceiling_le_iff

1553 less_floor_eq less_floor_iff

1554 floor_less_eq floor_less_iff

1555 floor_divide_eq_div floor_divide_of_int_eq

1556 real_of_int_zero_cancel of_nat_eq_0_iff

1557 ceiling_real_of_int ceiling_of_int

1559 INCOMPATIBILITY.

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

1562 been removed. INCOMPATIBILITY.

1564 * Quickcheck setup for finite sets.

1566 * Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.

1568 * Sledgehammer:

1569 - The MaSh relevance filter has been sped up.

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

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

1572 - Auto Sledgehammer now minimizes and preplays the results.

1573 - Handle Vampire 4.0 proof output without raising exception.

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

1575 Isabelle/jEdit instead. INCOMPATIBILITY.

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

1578 * Nitpick:

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

1580 - Fixed soundness bug in "destroy_constrs" optimization.

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

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

1583 - Eliminated obsolete "blocking" option.

1585 * (Co)datatype package:

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

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

1588 - Always generate "case_transfer" theorem.

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

1590 "rel_coinduct", and "coinduct" theorems. INCOMPATIBILITY.

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

1592 being defined.

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

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

1596 'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',

1597 'transfer_prover_start' and 'transfer_prover_end'.

1599 * New diagnostic command print_record for displaying record definitions.

1601 * Division on integers is bootstrapped directly from division on

1602 naturals and uses generic numeral algorithm for computations. Slight

1603 INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former

1604 simprocs binary_int_div and binary_int_mod

1606 * Tightened specification of class semiring_no_zero_divisors. Minor

1607 INCOMPATIBILITY.

1609 * Class algebraic_semidom introduces common algebraic notions of

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

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

1612 fields with notions that are trivial there.

1614 * Class normalization_semidom specifies canonical representants for

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

1616 This formalizes associated elements as well.

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

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

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

1621 gcd_nat.assoc and gcd_int.assoc by gcd.assoc.

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

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

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

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

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

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

1629 during instantiation.

1631 * New cancellation simprocs for boolean algebras to cancel complementary

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

1633 "top". INCOMPATIBILITY.

1635 * Class uniform_space introduces uniform spaces btw topological spaces

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

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

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

1640 open_real_def \<leadsto> open_dist

1641 open_complex_def \<leadsto> open_dist

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

1645 * Library/Multiset:

1646 - Renamed multiset inclusion operators:

1647 < ~> <#

1648 > ~> >#

1649 <= ~> <=#

1650 >= ~> >=#

1651 \<le> ~> \<le>#

1652 \<ge> ~> \<ge>#

1653 INCOMPATIBILITY.

1654 - Added multiset inclusion operator syntax:

1655 \<subset>#

1656 \<subseteq>#

1657 \<supset>#

1658 \<supseteq>#

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

1660 "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",

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

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

1663 are now available through the "subset_mset" interpretation

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

1665 INCOMPATIBILITY.

1666 - Renamed conversions:

1667 multiset_of ~> mset

1668 multiset_of_set ~> mset_set

1669 set_of ~> set_mset

1670 INCOMPATIBILITY

1671 - Renamed lemmas:

1672 mset_le_def ~> subseteq_mset_def

1673 mset_less_def ~> subset_mset_def

1674 less_eq_multiset.rep_eq ~> subseteq_mset_def

1675 INCOMPATIBILITY

1676 - Removed lemmas generated by lift_definition:

1677 less_eq_multiset.abs_eq, less_eq_multiset.rsp,

1678 less_eq_multiset.transfer, less_eq_multiset_def

1679 INCOMPATIBILITY

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

1683 * Library/Bourbaki_Witt_Fixpoint: Added formalisation of the

1684 Bourbaki-Witt fixpoint theorem for increasing functions in

1685 chain-complete partial orders.

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

1688 Minor INCOMPATIBILITY, use 'function' instead.

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

1691 periodic functions.

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

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

1695 GCD.

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

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

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

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

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

1704 (exponentiation on real numbers) again.

1706 * HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour

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

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

1709 Theorem of Algebra. Ported from HOL Light.

1711 * HOL-Multivariate_Analysis: topological concepts such as connected

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

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

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

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

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

1718 properties.

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

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

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

1724 structures.

1727 *** ML ***

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

1730 system are available:

1732 profile_time (*CPU time*)

1733 profile_time_thread (*CPU time on this thread*)

1734 profile_allocations (*overall heap allocations*)

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

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

1739 Isar proof method.

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

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

1743 breaks.

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

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

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

1749 * Simproc programming interfaces have been simplified:

1750 Simplifier.make_simproc and Simplifier.define_simproc supersede various

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

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

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

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

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

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

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

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

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

1764 Old cterm_instantiate is superseded by infer_instantiate.

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

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

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

1769 instead (with proper context).

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

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

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

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

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

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

1778 the proof context discipline.

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

1781 context_tactic, which allows to change the proof context dynamically

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

1783 METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are

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

1787 *** System ***

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

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

1792 conflations:

1794 hence ~> then have

1795 thus ~> then show

1797 This syntax is more orthogonal and improves readability and

1798 maintainability of proofs.

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

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

1802 performance.

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

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

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

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

1810 space.

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

1813 platforms as follows.

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

1816 associated with the main app bundle

1818 - isabelle jedit: settings

1819 JEDIT_JAVA_SYSTEM_OPTIONS

1820 JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64

1822 - isabelle build: settings

1823 ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64

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

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

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

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

1830 required after change.

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

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

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

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

1840 New in Isabelle2015 (May 2015)

1841 ------------------------------

1843 *** General ***

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

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

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

1849 context

1850 begin

1852 private definition ...

1853 private lemma ...

1855 qualified definition ...

1856 qualified lemma ...

1858 lemma ...

1859 theorem ...

1861 end

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

1864 naming policy.

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

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

1868 INCOMPATIBILITY, use 'sorry' instead.

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

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

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

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

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

1876 schematically expanded before search. Search results match the naive

1877 expectation more closely, particularly wrt. abbreviations.

1878 INCOMPATIBILITY.

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

1881 theory context.

1883 * Outer syntax commands are managed authentically within the theory

1884 context, without implicit global state. Potential for accidental

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

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

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

1889 update_semicolons" to remove obsolete semicolons from old theory

1890 sources.

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

1893 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.

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

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

1897 method provides basic fact/term matching in addition to

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

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

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

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

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

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

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

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

1910 option jedit_structure_limit determines maximum number of lines to scan

1911 in the buffer.

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

1914 marker, SideKick parser.

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

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

1918 the editor (hyperlinks, completion etc.).

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

1921 Options / Text Area).

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

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

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

1927 restrict the visualized hierarchy.

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

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

1933 *** Document preparation ***

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

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

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

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

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

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

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

1942 update_header"). Minor INCOMPATIBILITY.

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

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

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

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

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

1950 style.

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

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

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

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

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

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

1959 tags. Potential INCOMPATIBILITY in exotic situations.

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

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

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

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

1965 dynamically in GUI front-ends. Implementations of document

1966 antiquotations need to observe the margin explicitly according to

1967 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.

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

1970 mandatory for document preparation. The legacy mode with implicit

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

1972 INCOMPATIBILITY.

1975 *** Pure ***

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

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

1979 these variables become schematic in the instantiated theorem; this

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

1981 Configuration option rule_insts_schematic (default false) controls use

1982 of schematic variables outside the context. Minor INCOMPATIBILITY,

1983 declare rule_insts_schematic = true temporarily and update to use local

1984 variable declarations or dummy patterns instead.

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

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

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

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

1991 incremented to avoid material in the proof context. Rare

1992 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to

1993 different index.

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

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

1997 of numeral signs, particularly in expressions involving infix syntax

1998 like "(- 1) ^ n".

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

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

2002 token category instead.

2005 *** HOL ***

2007 * New (co)datatype package:

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

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

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

2011 'isabelle doc datatypes' for information on porting.

2012 INCOMPATIBILITY.

2013 - Renamed theorems:

2014 disc_corec ~> corec_disc

2015 disc_corec_iff ~> corec_disc_iff

2016 disc_exclude ~> distinct_disc

2017 disc_exhaust ~> exhaust_disc

2018 disc_map_iff ~> map_disc_iff

2019 sel_corec ~> corec_sel

2020 sel_exhaust ~> exhaust_sel

2021 sel_map ~> map_sel

2022 sel_set ~> set_sel

2023 sel_split ~> split_sel

2024 sel_split_asm ~> split_sel_asm

2025 strong_coinduct ~> coinduct_strong

2026 weak_case_cong ~> case_cong_weak

2027 INCOMPATIBILITY.

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

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

2030 INCOMPATIBILITY.

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

2032 consequences of other set rules "by auto".

2033 INCOMPATIBILITY.

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

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

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

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

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

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

2040 INCOMPATIBILITY.

2041 - Renamed theories:

2042 BNF_Comp ~> BNF_Composition

2043 BNF_FP_Base ~> BNF_Fixpoint_Base

2044 BNF_GFP ~> BNF_Greatest_Fixpoint

2045 BNF_LFP ~> BNF_Least_Fixpoint

2046 BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions

2047 Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions

2048 INCOMPATIBILITY.

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

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

2051 Lifting_Product and Lifting_Option from Main became obsolete and

2052 were removed. Changed definitions of the relators rel_prod and

2053 rel_sum (using inductive).

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

2055 of rel_prod_def and rel_sum_def.

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

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

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

2059 constructors, case combinators, discriminators, selectors and

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

2061 rules.

2063 * Old datatype package:

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

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

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

2067 'isabelle doc datatypes' for information on porting.

2068 INCOMPATIBILITY.

2069 - Renamed theorems:

2070 weak_case_cong ~> case_cong_weak

2071 INCOMPATIBILITY.

2072 - Renamed theory:

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

2074 INCOMPATIBILITY.

2076 * Nitpick:

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

2078 operations.

2080 * Sledgehammer:

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

2082 default.

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

2084 source. The "z3_non_commercial" option is discontinued.

2085 - Minimization is now always enabled by default.

2086 Removed sub-command:

2087 min

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

2089 dramatically improved.

2090 - Improved support for CVC4 and veriT.

2092 * Old and new SMT modules:

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

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

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

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

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

2098 point to it.

2099 INCOMPATIBILITY.

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

2101 INCOMPATIBILITY.

2102 - New option 'smt_reconstruction_step_timeout' to limit the

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

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

2105 method, especially runtime statistics of Z3 proof reconstruction.

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

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

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

2110 lifting, and avoids tedious workarounds.

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

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

2114 Minor INCOMPATIBILITY.

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

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

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

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

2121 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.

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

2124 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.

2126 * Class linordered_semidom really requires no zero divisors.

2127 INCOMPATIBILITY.

2129 * Classes division_ring, field and linordered_field always demand

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

2131 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.

2133 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit

2134 additive inverse operation. INCOMPATIBILITY.

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

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

2138 INCOMPATIBILITY: type constraints may be necessary.

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

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

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

2143 needed.

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

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

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

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

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

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

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

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

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

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

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

2158 "nat_floor"/"nat_ceiling".

2160 * Qualified some duplicated fact names required for boostrapping the

2161 type class hierarchy:

2162 ab_add_uminus_conv_diff ~> diff_conv_add_uminus

2163 field_inverse_zero ~> inverse_zero

2164 field_divide_inverse ~> divide_inverse

2165 field_inverse ~> left_inverse

2166 Minor INCOMPATIBILITY.

2168 * Eliminated fact duplicates:

2169 mult_less_imp_less_right ~> mult_right_less_imp_less

2170 mult_less_imp_less_left ~> mult_left_less_imp_less

2171 Minor INCOMPATIBILITY.

2173 * Fact consolidation: even_less_0_iff is subsumed by

2174 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).

2176 * Generalized and consolidated some theorems concerning divsibility:

2177 dvd_reduce ~> dvd_add_triv_right_iff

2178 dvd_plus_eq_right ~> dvd_add_right_iff

2179 dvd_plus_eq_left ~> dvd_add_left_iff

2180 Minor INCOMPATIBILITY.

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

2183 and part of theory Main.

2184 even_def ~> even_iff_mod_2_eq_zero

2185 INCOMPATIBILITY.

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

2188 INCOMPATIBILITY.

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

2191 Fact rename:

2192 listsum_def ~> listsum.eq_foldr

2193 INCOMPATIBILITY.

2195 * Product over lists via constant "listprod".

2197 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to

2198 Cons_nth_drop_Suc.

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

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

2202 HOL/Codegenerator_Test/Code_Test* for examples.

2204 * Library/Multiset:

2205 - Introduced "replicate_mset" operation.

2206 - Introduced alternative characterizations of the multiset ordering in

2207 "Library/Multiset_Order".

2208 - Renamed multiset ordering:

2209 <# ~> #<#

2210 <=# ~> #<=#

2211 \<subset># ~> #\<subset>#

2212 \<subseteq># ~> #\<subseteq>#

2213 INCOMPATIBILITY.

2214 - Introduced abbreviations for ill-named multiset operations:

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

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

2217 INCOMPATIBILITY.

2218 - Renamed

2219 in_multiset_of ~> in_multiset_in_set

2220 Multiset.fold ~> fold_mset

2221 Multiset.filter ~> filter_mset

2222 INCOMPATIBILITY.

2223 - Removed mcard, is equal to size.

2224 - Added attributes:

2225 image_mset.id [simp]

2226 image_mset_id [simp]

2227 elem_multiset_of_set [simp, intro]

2228 comp_fun_commute_plus_mset [simp]

2229 comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]

2230 in_mset_fold_plus_iff [iff]

2231 set_of_Union_mset [simp]

2232 in_Union_mset_iff [iff]

2233 INCOMPATIBILITY.

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

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

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

2238 argument. Minor INCOMPATIBILITY.

2240 * HOL-Decision_Procs: New counterexample generator quickcheck

2241 [approximation] for inequalities of transcendental functions. Uses

2242 hardware floating point arithmetic to randomly discover potential

2243 counterexamples. Counterexamples are certified with the "approximation"

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

2245 examples.

2247 * HOL-Probability: Reworked measurability prover

2248 - applies destructor rules repeatedly

2249 - removed application splitting (replaced by destructor rule)

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

2251 projection

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

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

2257 *** ML ***

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

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

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

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

2263 contemporary applications use the strict Name_Space.check (and

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

2265 INCOMPATIBILITY in rare applications of Name_Space.intern.

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

2268 ERROR instead of internal Toplevel.UNDEF.

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

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

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

2274 INCOMPATIBILITY.

2276 * Former combinators NAMED_CRITICAL and CRITICAL for central critical

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

2278 Multithreading.synchronized and its high-level derivative

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

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

2281 nested.

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

2284 change of semantics with minimal potential for INCOMPATIBILITY.

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

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

2288 available as Thm.global_ctyp_of and Thm.global_cterm_of.

2289 INCOMPATIBILITY.

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

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

2293 Thm.term_of etc.

2295 * Proper context for various elementary tactics: assume_tac,

2296 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,

2297 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.

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

2300 PARALLEL_GOALS.

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

2303 which also allows to specify a fork priority.

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

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

2307 markup). Minor INCOMPATIBILITY.

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

2310 Input.source (with formal position information).

2313 *** System ***

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

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

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

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

2321 be externally triggered using an appropriate ROOT file plus a

2322 corresponding theory. Parametrization is possible using environment

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

2324 INCOMPATIBILITY.

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

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

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

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

2331 menu Global Options / Appearance.

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

2334 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.

2338 New in Isabelle2014 (August 2014)

2339 ---------------------------------

2341 *** General ***

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

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

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

2346 environment is restricted to the Standard ML implementation of

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

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

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

2350 some examples.

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

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

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

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

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

2357 restore the previous behavior. INCOMPATIBILITY, especially where

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

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

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

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

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

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

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

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

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

2368 exception. Potential INCOMPATIBILITY for non-conformant tactical

2369 proof tools.

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

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

2373 supports input via ` (backquote).

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

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

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

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

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

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

2382 Minor INCOMPATIBILITY.

2384 * Discontinued legacy_isub_isup, which was a temporary workaround for

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

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

2387 INCOMPATIBILITY.

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

2390 which results in an active hyperlink within the text.

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

2393 not check existence within the file-system.

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

2396 isar-ref, jedit, system.

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

2401 * Improved Document panel: simplified interaction where every single

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

2403 buffer.

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

2406 to PIDE hyperlinks.

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

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

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

2412 auxiliary ML files.

2414 * Improved syntactic and semantic completion mechanism, with simple

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

2416 file-name completion, spell-checker completion.

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

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

2420 keystrokes with slow / remote graphics displays.

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

2423 item, depending on Isabelle options.

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

2426 selections, rectangular selections, rectangular selection as "tall

2427 caret".

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

2430 completion popup and context-menu.

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

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

2434 operations for the context. Minor incompatibility in keyboard

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

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

2438 to highlight text via regular expression.

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

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

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

2443 "isabelle jedit -m MODE".

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

2446 networking operations instead of jEdit virtual file-systems.

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

2449 imports) are automatically removed from the document model.

2451 * Improved monitor panel.

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

2454 more robust treatment of threads and interrupts.

2456 * Improved management of dockable windows: clarified keyboard focus

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

2458 "Detach" a copy where this makes sense.

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

2461 simplification process, enabled by the "simp_trace_new" attribute

2462 within the context.

2465 *** Pure ***

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

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

2469 that is not immediately visible. INCOMPATIBILITY, use regular

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

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

2472 finished trivially if the underlying class definition is made vacuous

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

2474 Axclass.class_axiomatization, Axclass.classrel_axiomatization,

2475 Axclass.arity_axiomatization.

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

2478 qualified. Rare INCOMPATIBILITY, but with potentially serious

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

2480 renaming needs to be applied:

2482 == ~> Pure.eq

2483 ==> ~> Pure.imp

2484 all ~> Pure.all

2485 TYPE ~> Pure.type

2486 dummy_pattern ~> Pure.dummy_pattern

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

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

2490 old constants:

2492 setup {*

2493 fn thy => thy

2494 |> Sign.root_path

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

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

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

2498 |> Sign.restore_naming thy

2499 *}

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

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

2503 the auxiliary aliases are deleted.

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

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

2507 instantiated theorem.

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

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

2511 where instantiations with schematic variables are intended (for

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

2513 following temporary definition may help to port old applications:

2515 attribute_setup standard =

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

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

2519 attributed fact expressions (concerning background theory, declared

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

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

2522 primitive Thm.assume_hyps.

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

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

2526 differently, e.g. via cartouches).

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

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

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

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

2535 *** HOL ***

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

2538 language requirements. INCOMPATIBILITY.

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

2541 INCOMPATIBILITY.

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

2544 INCOMPATIBILITY.

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

2547 option. Minor INCOMPATIBILITY.

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

2550 INCOMPATIBILITY.

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

2553 with the given constants.

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

2556 operations on records.

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

2559 ML. Minor INCOMPATIBILITY.

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

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

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

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

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

2569 now deal with conjunctions. For help with converting proofs, the old

2570 behaviour of the simplifier can be restored like this: declare/using

2571 [[simp_legacy_precond]]. This configuration option will disappear

2572 again in the future. INCOMPATIBILITY.

2574 * Simproc "finite_Collect" is no longer enabled by default, due to

2575 spurious crashes and other surprises. Potential INCOMPATIBILITY.

2577 * Moved new (co)datatype package and its dependencies from session

2578 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',

2579 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now

2580 part of theory "Main".

2582 Theory renamings:

2583 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)

2584 Library/Wfrec.thy ~> Wfrec.thy

2585 Library/Zorn.thy ~> Zorn.thy

2586 Cardinals/Order_Relation.thy ~> Order_Relation.thy

2587 Library/Order_Union.thy ~> Cardinals/Order_Union.thy

2588 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy

2589 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy

2590 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy

2591 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy

2592 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy

2593 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy

2594 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy

2595 BNF/BNF_Comp.thy ~> BNF_Comp.thy

2596 BNF/BNF_Def.thy ~> BNF_Def.thy

2597 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy

2598 BNF/BNF_GFP.thy ~> BNF_GFP.thy

2599 BNF/BNF_LFP.thy ~> BNF_LFP.thy

2600 BNF/BNF_Util.thy ~> BNF_Util.thy

2601 BNF/Coinduction.thy ~> Coinduction.thy

2602 BNF/More_BNFs.thy ~> Library/More_BNFs.thy

2603 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy

2604 BNF/Examples/* ~> BNF_Examples/*

2606 New theories:

2607 Wellorder_Extension.thy (split from Zorn.thy)

2608 Library/Cardinal_Notations.thy

2609 Library/BNF_Axomatization.thy

2610 BNF_Examples/Misc_Primcorec.thy

2611 BNF_Examples/Stream_Processor.thy

2613 Discontinued theories:

2614 BNF/BNF.thy

2615 BNF/Equiv_Relations_More.thy

2617 INCOMPATIBILITY.

2619 * New (co)datatype package:

2620 - Command 'primcorec' is fully implemented.

2621 - Command 'datatype_new' generates size functions ("size_xxx" and

2622 "size") as required by 'fun'.

2623 - BNFs are integrated with the Lifting tool and new-style

2624 (co)datatypes with Transfer.

2625 - Renamed commands:

2626 datatype_new_compat ~> datatype_compat

2627 primrec_new ~> primrec

2628 wrap_free_constructors ~> free_constructors

2629 INCOMPATIBILITY.

2630 - The generated constants "xxx_case" and "xxx_rec" have been renamed

2631 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").

2632 INCOMPATIBILITY.

2633 - The constant "xxx_(un)fold" and related theorems are no longer

2634 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually

2635 using "prim(co)rec".

2636 INCOMPATIBILITY.

2637 - No discriminators are generated for nullary constructors by

2638 default, eliminating the need for the odd "=:" syntax.

2639 INCOMPATIBILITY.

2640 - No discriminators or selectors are generated by default by

2641 "datatype_new", unless custom names are specified or the new

2642 "discs_sels" option is passed.

2643 INCOMPATIBILITY.

2645 * Old datatype package:

2646 - The generated theorems "xxx.cases" and "xxx.recs" have been

2647 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->

2648 "sum.case"). INCOMPATIBILITY.

2649 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have

2650 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,

2651 "prod_case" ~> "case_prod"). INCOMPATIBILITY.

2653 * The types "'a list" and "'a option", their set and map functions,

2654 their relators, and their selectors are now produced using the new

2655 BNF-based datatype package.

2657 Renamed constants:

2658 Option.set ~> set_option

2659 Option.map ~> map_option

2660 option_rel ~> rel_option

2662 Renamed theorems:

2663 set_def ~> set_rec[abs_def]

2664 map_def ~> map_rec[abs_def]

2665 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")

2666 option.recs ~> option.rec

2667 list_all2_def ~> list_all2_iff

2668 set.simps ~> set_simps (or the slightly different "list.set")

2669 map.simps ~> list.map

2670 hd.simps ~> list.sel(1)

2671 tl.simps ~> list.sel(2-3)

2672 the.simps ~> option.sel

2674 INCOMPATIBILITY.

2676 * The following map functions and relators have been renamed:

2677 sum_map ~> map_sum

2678 map_pair ~> map_prod

2679 prod_rel ~> rel_prod

2680 sum_rel ~> rel_sum

2681 fun_rel ~> rel_fun

2682 set_rel ~> rel_set

2683 filter_rel ~> rel_filter

2684 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")

2685 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")

2686 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")

2688 INCOMPATIBILITY.

2690 * Lifting and Transfer:

2691 - a type variable as a raw type is supported

2692 - stronger reflexivity prover

2693 - rep_eq is always generated by lift_definition

2694 - setup for Lifting/Transfer is now automated for BNFs

2695 + holds for BNFs that do not contain a dead variable

2696 + relator_eq, relator_mono, relator_distr, relator_domain,

2697 relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,

2698 right_unique, right_total, left_unique, left_total are proved

2699 automatically

2700 + definition of a predicator is generated automatically

2701 + simplification rules for a predicator definition are proved

2702 automatically for datatypes

2703 - consolidation of the setup of Lifting/Transfer

2704 + property that a relator preservers reflexivity is not needed any

2705 more

2706 Minor INCOMPATIBILITY.

2707 + left_total and left_unique rules are now transfer rules

2708 (reflexivity_rule attribute not needed anymore)

2709 INCOMPATIBILITY.

2710 + Domainp does not have to be a separate assumption in

2711 relator_domain theorems (=> more natural statement)

2712 INCOMPATIBILITY.

2713 - registration of code equations is more robust

2714 Potential INCOMPATIBILITY.

2715 - respectfulness proof obligation is preprocessed to a more readable

2716 form

2717 Potential INCOMPATIBILITY.

2718 - eq_onp is always unfolded in respectfulness proof obligation

2719 Potential INCOMPATIBILITY.

2720 - unregister lifting setup for Code_Numeral.integer and

2721 Code_Numeral.natural

2722 Potential INCOMPATIBILITY.

2723 - Lifting.invariant -> eq_onp

2724 INCOMPATIBILITY.

2726 * New internal SAT solver "cdclite" that produces models and proof

2727 traces. This solver replaces the internal SAT solvers "enumerate" and

2728 "dpll". Applications that explicitly used one of these two SAT

2729 solvers should use "cdclite" instead. In addition, "cdclite" is now

2730 the default SAT solver for the "sat" and "satx" proof methods and

2731 corresponding tactics; the old default can be restored using "declare

2732 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.

2734 * SMT module: A new version of the SMT module, temporarily called

2735 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,

2736 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also

2737 supported as oracles. Yices is no longer supported, because no version

2738 of the solver can handle both SMT-LIB 2 and quantifiers.

2740 * Activation of Z3 now works via "z3_non_commercial" system option

2741 (without requiring restart), instead of former settings variable

2742 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu

2743 Plugin Options / Isabelle / General.

2745 * Sledgehammer:

2746 - Z3 can now produce Isar proofs.

2747 - MaSh overhaul:

2748 . New SML-based learning algorithms eliminate the dependency on

2749 Python and increase performance and reliability.

2750 . MaSh and MeSh are now used by default together with the

2751 traditional MePo (Meng-Paulson) relevance filter. To disable

2752 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin

2753 Options / Isabelle / General to "none".

2754 - New option:

2755 smt_proofs

2756 - Renamed options:

2757 isar_compress ~> compress

2758 isar_try0 ~> try0

2760 INCOMPATIBILITY.

2762 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.

2764 * Nitpick:

2765 - Fixed soundness bug whereby mutually recursive datatypes could

2766 take infinite values.

2767 - Fixed soundness bug with low-level number functions such as

2768 "Abs_Integ" and "Rep_Integ".

2769 - Removed "std" option.

2770 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to

2771 "hide_types".

2773 * Metis: Removed legacy proof method 'metisFT'. Use 'metis

2774 (full_types)' instead. INCOMPATIBILITY.

2776 * Try0: Added 'algebra' and 'meson' to the set of proof methods.

2778 * Adjustion of INF and SUP operations:

2779 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.

2780 - Consolidated theorem names containing INFI and SUPR: have INF and

2781 SUP instead uniformly.

2782 - More aggressive normalization of expressions involving INF and Inf

2783 or SUP and Sup.

2784 - INF_image and SUP_image do not unfold composition.

2785 - Dropped facts INF_comp, SUP_comp.

2786 - Default congruence rules strong_INF_cong and strong_SUP_cong, with

2787 simplifier implication in premises. Generalize and replace former

2788 INT_cong, SUP_cong

2790 INCOMPATIBILITY.

2792 * SUP and INF generalized to conditionally_complete_lattice.

2794 * Swapped orientation of facts image_comp and vimage_comp:

2796 image_compose ~> image_comp [symmetric]

2797 image_comp ~> image_comp [symmetric]

2798 vimage_compose ~> vimage_comp [symmetric]

2799 vimage_comp ~> vimage_comp [symmetric]

2801 INCOMPATIBILITY.

2803 * Theory reorganization: split of Big_Operators.thy into

2804 Groups_Big.thy and Lattices_Big.thy.

2806 * Consolidated some facts about big group operators:

2808 setsum_0' ~> setsum.neutral

2809 setsum_0 ~> setsum.neutral_const

2810 setsum_addf ~> setsum.distrib

2811 setsum_cartesian_product ~> setsum.cartesian_product

2812 setsum_cases ~> setsum.If_cases

2813 setsum_commute ~> setsum.commute

2814 setsum_cong ~> setsum.cong

2815 setsum_delta ~> setsum.delta

2816 setsum_delta' ~> setsum.delta'

2817 setsum_diff1' ~> setsum.remove

2818 setsum_empty ~> setsum.empty

2819 setsum_infinite ~> setsum.infinite

2820 setsum_insert ~> setsum.insert

2821 setsum_inter_restrict'' ~> setsum.inter_filter

2822 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left

2823 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right

2824 setsum_mono_zero_left ~> setsum.mono_neutral_left

2825 setsum_mono_zero_right ~> setsum.mono_neutral_right

2826 setsum_reindex ~> setsum.reindex

2827 setsum_reindex_cong ~> setsum.reindex_cong

2828 setsum_reindex_nonzero ~> setsum.reindex_nontrivial

2829 setsum_restrict_set ~> setsum.inter_restrict

2830 setsum_Plus ~> setsum.Plus

2831 setsum_setsum_restrict ~> setsum.commute_restrict

2832 setsum_Sigma ~> setsum.Sigma

2833 setsum_subset_diff ~> setsum.subset_diff

2834 setsum_Un_disjoint ~> setsum.union_disjoint

2835 setsum_UN_disjoint ~> setsum.UNION_disjoint

2836 setsum_Un_Int ~> setsum.union_inter

2837 setsum_Union_disjoint ~> setsum.Union_disjoint

2838 setsum_UNION_zero ~> setsum.Union_comp

2839 setsum_Un_zero ~> setsum.union_inter_neutral

2840 strong_setprod_cong ~> setprod.strong_cong

2841 strong_setsum_cong ~> setsum.strong_cong

2842 setprod_1' ~> setprod.neutral

2843 setprod_1 ~> setprod.neutral_const

2844 setprod_cartesian_product ~> setprod.cartesian_product

2845 setprod_cong ~> setprod.cong

2846 setprod_delta ~> setprod.delta

2847 setprod_delta' ~> setprod.delta'

2848 setprod_empty ~> setprod.empty

2849 setprod_infinite ~> setprod.infinite

2850 setprod_insert ~> setprod.insert

2851 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left

2852 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right

2853 setprod_mono_one_left ~> setprod.mono_neutral_left

2854 setprod_mono_one_right ~> setprod.mono_neutral_right

2855 setprod_reindex ~> setprod.reindex

2856 setprod_reindex_cong ~> setprod.reindex_cong

2857 setprod_reindex_nonzero ~> setprod.reindex_nontrivial

2858 setprod_Sigma ~> setprod.Sigma

2859 setprod_subset_diff ~> setprod.subset_diff

2860 setprod_timesf ~> setprod.distrib

2861 setprod_Un2 ~> setprod.union_diff2

2862 setprod_Un_disjoint ~> setprod.union_disjoint

2863 setprod_UN_disjoint ~> setprod.UNION_disjoint

2864 setprod_Un_Int ~> setprod.union_inter

2865 setprod_Union_disjoint ~> setprod.Union_disjoint

2866 setprod_Un_one ~> setprod.union_inter_neutral

2868 Dropped setsum_cong2 (simple variant of setsum.cong).

2869 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)

2870 Dropped setsum_reindex_id, setprod_reindex_id

2871 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).

2873 INCOMPATIBILITY.

2875 * Abolished slightly odd global lattice interpretation for min/max.

2877 Fact consolidations:

2878 min_max.inf_assoc ~> min.assoc

2879 min_max.inf_commute ~> min.commute

2880 min_max.inf_left_commute ~> min.left_commute

2881 min_max.inf_idem ~> min.idem

2882 min_max.inf_left_idem ~> min.left_idem

2883 min_max.inf_right_idem ~> min.right_idem

2884 min_max.sup_assoc ~> max.assoc

2885 min_max.sup_commute ~> max.commute

2886 min_max.sup_left_commute ~> max.left_commute

2887 min_max.sup_idem ~> max.idem

2888 min_max.sup_left_idem ~> max.left_idem

2889 min_max.sup_inf_distrib1 ~> max_min_distrib2

2890 min_max.sup_inf_distrib2 ~> max_min_distrib1

2891 min_max.inf_sup_distrib1 ~> min_max_distrib2

2892 min_max.inf_sup_distrib2 ~> min_max_distrib1

2893 min_max.distrib ~> min_max_distribs

2894 min_max.inf_absorb1 ~> min.absorb1

2895 min_max.inf_absorb2 ~> min.absorb2

2896 min_max.sup_absorb1 ~> max.absorb1

2897 min_max.sup_absorb2 ~> max.absorb2

2898 min_max.le_iff_inf ~> min.absorb_iff1

2899 min_max.le_iff_sup ~> max.absorb_iff2

2900 min_max.inf_le1 ~> min.cobounded1

2901 min_max.inf_le2 ~> min.cobounded2

2902 le_maxI1, min_max.sup_ge1 ~> max.cobounded1

2903 le_maxI2, min_max.sup_ge2 ~> max.cobounded2

2904 min_max.le_infI1 ~> min.coboundedI1

2905 min_max.le_infI2 ~> min.coboundedI2

2906 min_max.le_supI1 ~> max.coboundedI1

2907 min_max.le_supI2 ~> max.coboundedI2

2908 min_max.less_infI1 ~> min.strict_coboundedI1

2909 min_max.less_infI2 ~> min.strict_coboundedI2

2910 min_max.less_supI1 ~> max.strict_coboundedI1

2911 min_max.less_supI2 ~> max.strict_coboundedI2

2912 min_max.inf_mono ~> min.mono

2913 min_max.sup_mono ~> max.mono

2914 min_max.le_infI, min_max.inf_greatest ~> min.boundedI

2915 min_max.le_supI, min_max.sup_least ~> max.boundedI

2916 min_max.le_inf_iff ~> min.bounded_iff

2917 min_max.le_sup_iff ~> max.bounded_iff

2919 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,

2920 min.left_commute, min.left_idem, max.commute, max.assoc,

2921 max.left_commute, max.left_idem directly.

2923 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,

2924 min.cobounded2, max.cobounded1m max.cobounded2 directly.

2926 For min_ac or max_ac, prefer more general collection ac_simps.

2928 INCOMPATIBILITY.

2930 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>

2931 Inf_fin_le_Sup_fin. INCOMPATIBILITY.

2933 * Qualified constant names Wellfounded.acc, Wellfounded.accp.

2934 INCOMPATIBILITY.

2936 * Fact generalization and consolidation:

2937 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1

2939 INCOMPATIBILITY.

2941 * Purely algebraic definition of even. Fact generalization and

2942 consolidation:

2943 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd

2944 even_zero_(nat|int) ~> even_zero

2946 INCOMPATIBILITY.

2948 * Abolished neg_numeral.

2949 - Canonical representation for minus one is "- 1".

2950 - Canonical representation for other negative numbers is "- (numeral _)".

2951 - When devising rule sets for number calculation, consider the

2952 following canonical cases: 0, 1, numeral _, - 1, - numeral _.

2953 - HOLogic.dest_number also recognizes numerals in non-canonical forms

2954 like "numeral One", "- numeral One", "- 0" and even "- ... - _".

2955 - Syntax for negative numerals is mere input syntax.

2957 INCOMPATIBILITY.

2959 * Reduced name variants for rules on associativity and commutativity:

2961 add_assoc ~> add.assoc

2962 add_commute ~> add.commute

2963 add_left_commute ~> add.left_commute

2964 mult_assoc ~> mult.assoc

2965 mult_commute ~> mult.commute

2966 mult_left_commute ~> mult.left_commute

2967 nat_add_assoc ~> add.assoc

2968 nat_add_commute ~> add.commute

2969 nat_add_left_commute ~> add.left_commute

2970 nat_mult_assoc ~> mult.assoc

2971 nat_mult_commute ~> mult.commute

2972 eq_assoc ~> iff_assoc

2973 eq_left_commute ~> iff_left_commute

2975 INCOMPATIBILITY.

2977 * Fact collections add_ac and mult_ac are considered old-fashioned.

2978 Prefer ac_simps instead, or specify rules

2979 (add|mult).(assoc|commute|left_commute) individually.

2981 * Elimination of fact duplicates:

2982 equals_zero_I ~> minus_unique

2983 diff_eq_0_iff_eq ~> right_minus_eq

2984 nat_infinite ~> infinite_UNIV_nat

2985 int_infinite ~> infinite_UNIV_int

2987 INCOMPATIBILITY.

2989 * Fact name consolidation:

2990 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus

2991 minus_le_self_iff ~> neg_less_eq_nonneg

2992 le_minus_self_iff ~> less_eq_neg_nonpos

2993 neg_less_nonneg ~> neg_less_pos

2994 less_minus_self_iff ~> less_neg_neg [simp]

2996 INCOMPATIBILITY.

2998 * More simplification rules on unary and binary minus:

2999 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,

3000 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,

3001 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,

3002 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,

3003 minus_add_cancel, uminus_add_conv_diff. These correspondingly have

3004 been taken away from fact collections algebra_simps and field_simps.

3005 INCOMPATIBILITY.

3007 To restore proofs, the following patterns are helpful:

3009 a) Arbitrary failing proof not involving "diff_def":

3010 Consider simplification with algebra_simps or field_simps.

3012 b) Lifting rules from addition to subtraction:

3013 Try with "using <rule for addition> of [... "- _" ...]" by simp".

3015 c) Simplification with "diff_def": just drop "diff_def".

3016 Consider simplification with algebra_simps or field_simps;

3017 or the brute way with

3018 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".

3020 * Introduce bdd_above and bdd_below in theory

3021 Conditionally_Complete_Lattices, use them instead of explicitly

3022 stating boundedness of sets.

3024 * ccpo.admissible quantifies only over non-empty chains to allow more

3025 syntax-directed proof rules; the case of the empty chain shows up as

3026 additional case in fixpoint induction proofs. INCOMPATIBILITY.

3028 * Removed and renamed theorems in Series:

3029 summable_le ~> suminf_le

3030 suminf_le ~> suminf_le_const

3031 series_pos_le ~> setsum_le_suminf

3032 series_pos_less ~> setsum_less_suminf

3033 suminf_ge_zero ~> suminf_nonneg

3034 suminf_gt_zero ~> suminf_pos

3035 suminf_gt_zero_iff ~> suminf_pos_iff

3036 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ

3037 suminf_0_le ~> suminf_nonneg [rotate]

3038 pos_summable ~> summableI_nonneg_bounded

3039 ratio_test ~> summable_ratio_test

3041 removed series_zero, replaced by sums_finite

3043 removed auxiliary lemmas:

3045 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,

3046 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,

3047 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,

3048 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,

3049 summable_convergent_sumr_iff, sumr_diff_mult_const

3051 INCOMPATIBILITY.

3053 * Replace (F)DERIV syntax by has_derivative:

3054 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"

3056 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"

3058 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax

3060 - removed constant isDiff

3062 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as

3063 input syntax.

3065 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.

3067 - Renamed FDERIV_... lemmas to has_derivative_...

3069 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV

3071 - removed DERIV_intros, has_derivative_eq_intros

3073 - introduced derivative_intros and deriative_eq_intros which

3074 includes now rules for DERIV, has_derivative and

3075 has_vector_derivative.

3077 - Other renamings:

3078 differentiable_def ~> real_differentiable_def

3079 differentiableE ~> real_differentiableE

3080 fderiv_def ~> has_derivative_at

3081 field_fderiv_def ~> field_has_derivative_at

3082 isDiff_der ~> differentiable_def

3083 deriv_fderiv ~> has_field_derivative_def

3084 deriv_def ~> DERIV_def

3086 INCOMPATIBILITY.

3088 * Include more theorems in continuous_intros. Remove the

3089 continuous_on_intros, isCont_intros collections, these facts are now

3090 in continuous_intros.

3092 * Theorems about complex numbers are now stated only using Re and Im,

3093 the Complex constructor is not used anymore. It is possible to use

3094 primcorec to defined the behaviour of a complex-valued function.

3096 Removed theorems about the Complex constructor from the simpset, they

3097 are available as the lemma collection legacy_Complex_simps. This

3098 especially removes

3100 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".

3102 Instead the reverse direction is supported with

3103 Complex_eq: "Complex a b = a + \<i> * b"

3105 Moved csqrt from Fundamental_Algebra_Theorem to Complex.

3107 Renamings:

3108 Re/Im ~> complex.sel

3109 complex_Re/Im_zero ~> zero_complex.sel

3110 complex_Re/Im_add ~> plus_complex.sel

3111 complex_Re/Im_minus ~> uminus_complex.sel

3112 complex_Re/Im_diff ~> minus_complex.sel

3113 complex_Re/Im_one ~> one_complex.sel

3114 complex_Re/Im_mult ~> times_complex.sel

3115 complex_Re/Im_inverse ~> inverse_complex.sel

3116 complex_Re/Im_scaleR ~> scaleR_complex.sel

3117 complex_Re/Im_i ~> ii.sel

3118 complex_Re/Im_cnj ~> cnj.sel

3119 Re/Im_cis ~> cis.sel

3121 complex_divide_def ~> divide_complex_def

3122 complex_norm_def ~> norm_complex_def

3123 cmod_def ~> norm_complex_de

3125 Removed theorems:

3126 complex_zero_def

3127 complex_add_def

3128 complex_minus_def

3129 complex_diff_def

3130 complex_one_def

3131 complex_mult_def

3132 complex_inverse_def

3133 complex_scaleR_def

3135 INCOMPATIBILITY.

3137 * Theory Lubs moved HOL image to HOL-Library. It is replaced by

3138 Conditionally_Complete_Lattices. INCOMPATIBILITY.

3140 * HOL-Library: new theory src/HOL/Library/Tree.thy.

3142 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it

3143 is subsumed by session Kleene_Algebra in AFP.

3145 * HOL-Library / theory RBT: various constants and facts are hidden;

3146 lifting setup is unregistered. INCOMPATIBILITY.

3148 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.

3150 * HOL-Word: bit representations prefer type bool over type bit.

3151 INCOMPATIBILITY.

3153 * HOL-Word:

3154 - Abandoned fact collection "word_arith_alts", which is a duplicate

3155 of "word_arith_wis".

3156 - Dropped first (duplicated) element in fact collections

3157 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",

3158 "uint_word_arith_bintrs".

3160 * HOL-Number_Theory:

3161 - consolidated the proofs of the binomial theorem

3162 - the function fib is again of type nat => nat and not overloaded

3163 - no more references to Old_Number_Theory in the HOL libraries

3164 (except the AFP)

3166 INCOMPATIBILITY.

3168 * HOL-Multivariate_Analysis:

3169 - Type class ordered_real_vector for ordered vector spaces.

3170 - New theory Complex_Basic_Analysis defining complex derivatives,

3171 holomorphic functions, etc., ported from HOL Light's canal.ml.

3172 - Changed order of ordered_euclidean_space to be compatible with

3173 pointwise ordering on products. Therefore instance of

3174 conditionally_complete_lattice and ordered_real_vector.

3175 INCOMPATIBILITY: use box instead of greaterThanLessThan or

3176 explicit set-comprehensions with eucl_less for other (half-)open

3177 intervals.

3178 - removed dependencies on type class ordered_euclidean_space with

3179 introduction of "cbox" on euclidean_space

3180 - renamed theorems:

3181 interval ~> box

3182 mem_interval ~> mem_box

3183 interval_eq_empty ~> box_eq_empty

3184 interval_ne_empty ~> box_ne_empty

3185 interval_sing(1) ~> cbox_sing

3186 interval_sing(2) ~> box_sing

3187 subset_interval_imp ~> subset_box_imp

3188 subset_interval ~> subset_box

3189 open_interval ~> open_box

3190 closed_interval ~> closed_cbox

3191 interior_closed_interval ~> interior_cbox

3192 bounded_closed_interval ~> bounded_cbox

3193 compact_interval ~> compact_cbox

3194 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric

3195 bounded_subset_closed_interval ~> bounded_subset_cbox

3196 mem_interval_componentwiseI ~> mem_box_componentwiseI

3197 convex_box ~> convex_prod

3198 rel_interior_real_interval ~> rel_interior_real_box

3199 convex_interval ~> convex_box

3200 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox

3201 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox

3202 content_closed_interval' ~> content_cbox'

3203 elementary_subset_interval ~> elementary_subset_box

3204 diameter_closed_interval ~> diameter_cbox

3205 frontier_closed_interval ~> frontier_cbox

3206 frontier_open_interval ~> frontier_box

3207 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric

3208 closure_open_interval ~> closure_box

3209 open_closed_interval_convex ~> open_cbox_convex

3210 open_interval_midpoint ~> box_midpoint

3211 content_image_affinity_interval ~> content_image_affinity_cbox

3212 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval

3213 bounded_interval ~> bounded_closed_interval + bounded_boxes

3215 - respective theorems for intervals over the reals:

3216 content_closed_interval + content_cbox

3217 has_integral + has_integral_real

3218 fine_division_exists + fine_division_exists_real

3219 has_integral_null + has_integral_null_real

3220 tagged_division_union_interval + tagged_division_union_interval_real

3221 has_integral_const + has_integral_const_real

3222 integral_const + integral_const_real

3223 has_integral_bound + has_integral_bound_real

3224 integrable_continuous + integrable_continuous_real

3225 integrable_subinterval + integrable_subinterval_real

3226 has_integral_reflect_lemma + has_integral_reflect_lemma_real

3227 integrable_reflect + integrable_reflect_real

3228 integral_reflect + integral_reflect_real

3229 image_affinity_interval + image_affinity_cbox

3230 image_smult_interval + image_smult_cbox

3231 integrable_const + integrable_const_ivl

3232 integrable_on_subinterval + integrable_on_subcbox

3234 - renamed theorems:

3235 derivative_linear ~> has_derivative_bounded_linear

3236 derivative_is_linear ~> has_derivative_linear

3237 bounded_linear_imp_linear ~> bounded_linear.linear

3239 * HOL-Probability:

3240 - Renamed positive_integral to nn_integral:

3242 . Renamed all lemmas "*positive_integral*" to *nn_integral*"

3243 positive_integral_positive ~> nn_integral_nonneg

3245 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.

3247 - replaced the Lebesgue integral on real numbers by the more general

3248 Bochner integral for functions into a real-normed vector space.

3250 integral_zero ~> integral_zero / integrable_zero

3251 integral_minus ~> integral_minus / integrable_minus

3252 integral_add ~> integral_add / integrable_add

3253 integral_diff ~> integral_diff / integrable_diff

3254 integral_setsum ~> integral_setsum / integrable_setsum

3255 integral_multc ~> integral_mult_left / integrable_mult_left

3256 integral_cmult ~> integral_mult_right / integrable_mult_right

3257 integral_triangle_inequality~> integral_norm_bound

3258 integrable_nonneg ~> integrableI_nonneg

3259 integral_positive ~> integral_nonneg_AE

3260 integrable_abs_iff ~> integrable_abs_cancel

3261 positive_integral_lim_INF ~> nn_integral_liminf

3262 lebesgue_real_affine ~> lborel_real_affine

3263 borel_integral_has_integral ~> has_integral_lebesgue_integral

3264 integral_indicator ~>

3265 integral_real_indicator / integrable_real_indicator

3266 positive_integral_fst ~> nn_integral_fst'

3267 positive_integral_fst_measurable ~> nn_integral_fst

3268 positive_integral_snd_measurable ~> nn_integral_snd

3270 integrable_fst_measurable ~>

3271 integral_fst / integrable_fst / AE_integrable_fst

3273 integrable_snd_measurable ~>

3274 integral_snd / integrable_snd / AE_integrable_snd

3276 integral_monotone_convergence ~>

3277 integral_monotone_convergence / integrable_monotone_convergence

3279 integral_monotone_convergence_at_top ~>

3280 integral_monotone_convergence_at_top /

3281 integrable_monotone_convergence_at_top

3283 has_integral_iff_positive_integral_lebesgue ~>

3284 has_integral_iff_has_bochner_integral_lebesgue_nonneg

3286 lebesgue_integral_has_integral ~>

3287 has_integral_integrable_lebesgue_nonneg

3289 positive_integral_lebesgue_has_integral ~>

3290 integral_has_integral_lebesgue_nonneg /

3291 integrable_has_integral_lebesgue_nonneg

3293 lebesgue_integral_real_affine ~>

3294 nn_integral_real_affine

3296 has_integral_iff_positive_integral_lborel ~>

3297 integral_has_integral_nonneg / integrable_has_integral_nonneg

3299 The following theorems where removed:

3301 lebesgue_integral_nonneg

3302 lebesgue_integral_uminus

3303 lebesgue_integral_cmult

3304 lebesgue_integral_multc

3305 lebesgue_integral_cmult_nonneg

3306 integral_cmul_indicator

3307 integral_real

3309 - Formalized properties about exponentially, Erlang, and normal

3310 distributed random variables.

3312 * HOL-Decision_Procs: Separate command 'approximate' for approximative

3313 computation in src/HOL/Decision_Procs/Approximation. Minor

3314 INCOMPATIBILITY.

3317 *** Scala ***

3319 * The signature and semantics of Document.Snapshot.cumulate_markup /

3320 select_markup have been clarified. Markup is now traversed in the

3321 order of reports given by the prover: later markup is usually more

3322 specific and may override results accumulated so far. The elements

3323 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.

3325 * Substantial reworking of internal PIDE protocol communication

3326 channels. INCOMPATIBILITY.

3329 *** ML ***

3331 * Subtle change of semantics of Thm.eq_thm: theory stamps are not

3332 compared (according to Thm.thm_ord), but assumed to be covered by the

3333 current background theory. Thus equivalent data produced in different

3334 branches of the theory graph usually coincides (e.g. relevant for

3335 theory merge). Note that the softer Thm.eq_thm_prop is often more

3336 appropriate than Thm.eq_thm.

3338 * Proper context for basic Simplifier operations: rewrite_rule,

3339 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to

3340 pass runtime Proof.context (and ensure that the simplified entity

3341 actually belongs to it).

3343 * Proper context discipline for read_instantiate and instantiate_tac:

3344 variables that are meant to become schematic need to be given as

3345 fixed, and are generalized by the explicit context of local variables.

3346 This corresponds to Isar attributes "where" and "of" with 'for'

3347 declaration. INCOMPATIBILITY, also due to potential change of indices

3348 of schematic variables.

3350 * Moved ML_Compiler.exn_trace and other operations on exceptions to

3351 structure Runtime. Minor INCOMPATIBILITY.

3353 * Discontinued old Toplevel.debug in favour of system option

3354 "ML_exception_trace", which may be also declared within the context

3355 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.

3357 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor

3358 INCOMPATIBILITY.

3360 * Configuration option "ML_print_depth" controls the pretty-printing

3361 depth of the ML compiler within the context. The old print_depth in

3362 ML is still available as default_print_depth, but rarely used. Minor

3363 INCOMPATIBILITY.

3365 * Toplevel function "use" refers to raw ML bootstrap environment,

3366 without Isar context nor antiquotations. Potential INCOMPATIBILITY.

3367 Note that 'ML_file' is the canonical command to load ML files into the

3368 formal context.

3370 * Simplified programming interface to define ML antiquotations, see

3371 structure ML_Antiquotation. Minor INCOMPATIBILITY.

3373 * ML antiquotation @{here} refers to its source position, which is

3374 occasionally useful for experimentation and diagnostic purposes.

3376 * ML antiquotation @{path} produces a Path.T value, similarly to

3377 Path.explode, but with compile-time check against the file-system and

3378 some PIDE markup. Note that unlike theory source, ML does not have a

3379 well-defined master directory, so an absolute symbolic path

3380 specification is usually required, e.g. "~~/src/HOL".

3382 * ML antiquotation @{print} inlines a function to print an arbitrary

3383 ML value, which is occasionally useful for diagnostic or demonstration

3384 purposes.

3387 *** System ***

3389 * Proof General with its traditional helper scripts is now an optional

3390 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle

3391 component repository http://isabelle.in.tum.de/components/. Note that

3392 the "system" manual provides general explanations about add-on

3393 components, especially those that are not bundled with the release.

3395 * The raw Isabelle process executable has been renamed from

3396 "isabelle-process" to "isabelle_process", which conforms to common

3397 shell naming conventions, and allows to define a shell function within

3398 the Isabelle environment to avoid dynamic path lookup. Rare

3399 incompatibility for old tools that do not use the ISABELLE_PROCESS

3400 settings variable.

3402 * Former "isabelle tty" has been superseded by "isabelle console",

3403 with implicit build like "isabelle jedit", and without the mostly

3404 obsolete Isar TTY loop.

3406 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER

3407 and PDF_VIEWER now refer to the actual programs, not shell

3408 command-lines. Discontinued option -c: invocation may be asynchronous

3409 via desktop environment, without any special precautions. Potential

3410 INCOMPATIBILITY with ambitious private settings.

3412 * Removed obsolete "isabelle unsymbolize". Note that the usual format

3413 for email communication is the Unicode rendering of Isabelle symbols,

3414 as produced by Isabelle/jEdit, for example.

3416 * Removed obsolete tool "wwwfind". Similar functionality may be

3417 integrated into Isabelle/jEdit eventually.

3419 * Improved 'display_drafts' concerning desktop integration and

3420 repeated invocation in PIDE front-end: re-use single file

3421 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.

3423 * Session ROOT specifications require explicit 'document_files' for

3424 robust dependencies on LaTeX sources. Only these explicitly given

3425 files are copied to the document output directory, before document

3426 processing is started.

3428 * Windows: support for regular TeX installation (e.g. MiKTeX) instead

3429 of TeX Live from Cygwin.

3433 New in Isabelle2013-2 (December 2013)

3434 -------------------------------------

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

3438 * More robust editing of running commands with internal forks,

3439 e.g. non-terminating 'by' steps.

3441 * More relaxed Sledgehammer panel: avoid repeated application of query

3442 after edits surrounding the command location.

3444 * More status information about commands that are interrupted

3445 accidentally (via physical event or Poly/ML runtime system signal,

3446 e.g. out-of-memory).

3449 *** System ***

3451 * More robust termination of external processes managed by

3452 Isabelle/ML: support cancellation of tasks within the range of

3453 milliseconds, as required for PIDE document editing with automatically

3454 tried tools (e.g. Sledgehammer).

3456 * Reactivated Isabelle/Scala kill command for external processes on

3457 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a

3458 workaround for some Debian/Ubuntu Linux versions from 2013.

3462 New in Isabelle2013-1 (November 2013)

3463 -------------------------------------

3465 *** General ***

3467 * Discontinued obsolete 'uses' within theory header. Note that

3468 commands like 'ML_file' work without separate declaration of file

3469 dependencies. Minor INCOMPATIBILITY.

3471 * Discontinued redundant 'use' command, which was superseded by

3472 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.

3474 * Simplified subscripts within identifiers, using plain \<^sub>

3475 instead of the second copy \<^isub> and \<^isup>. Superscripts are

3476 only for literal tokens within notation; explicit mixfix annotations

3477 for consts or fixed variables may be used as fall-back for unusual

3478 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in

3479 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to

3480 standardize symbols as a starting point for further manual cleanup.

3481 The ML reference variable "legacy_isub_isup" may be set as temporary

3482 workaround, to make the prover accept a subset of the old identifier

3483 syntax.

3485 * Document antiquotations: term style "isub" has been renamed to

3486 "sub". Minor INCOMPATIBILITY.

3488 * Uniform management of "quick_and_dirty" as system option (see also

3489 "isabelle options"), configuration option within the context (see also

3490 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor

3491 INCOMPATIBILITY, need to use more official Isabelle means to access

3492 quick_and_dirty, instead of historical poking into mutable reference.

3494 * Renamed command 'print_configs' to 'print_options'. Minor

3495 INCOMPATIBILITY.

3497 * Proper diagnostic command 'print_state'. Old 'pr' (with its

3498 implicit change of some global references) is retained for now as

3499 control command, e.g. for ProofGeneral 3.7.x.

3501 * Discontinued 'print_drafts' command with its old-fashioned PS output

3502 and Unix command-line print spooling. Minor INCOMPATIBILITY: use

3503 'display_drafts' instead and print via the regular document viewer.

3505 * Updated and extended "isar-ref" and "implementation" manual,

3506 eliminated old "ref" manual.

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

3511 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or

3512 Documentation panel.

3514 * Dockable window "Documentation" provides access to Isabelle

3515 documentation.

3517 * Dockable window "Find" provides query operations for formal entities

3518 (GUI front-end to 'find_theorems' command).

3520 * Dockable window "Sledgehammer" manages asynchronous / parallel

3521 sledgehammer runs over existing document sources, independently of

3522 normal editing and checking process.

3524 * Dockable window "Timing" provides an overview of relevant command

3525 timing information, depending on option jedit_timing_threshold. The

3526 same timing information is shown in the extended tooltip of the

3527 command keyword, when hovering the mouse over it while the CONTROL or

3528 COMMAND modifier is pressed.

3530 * Improved dockable window "Theories": Continuous checking of proof

3531 document (visible and required parts) may be controlled explicitly,

3532 using check box or shortcut "C+e ENTER". Individual theory nodes may

3533 be marked explicitly as required and checked in full, using check box

3534 or shortcut "C+e SPACE".

3536 * Improved completion mechanism, which is now managed by the

3537 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle

3538 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).

3540 * Standard jEdit keyboard shortcut C+b complete-word is remapped to

3541 isabelle.complete for explicit completion in Isabelle sources.

3542 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts

3543 to resolve conflict.

3545 * Improved support of various "minor modes" for Isabelle NEWS,

3546 options, session ROOT etc., with completion and SideKick tree view.

3548 * Strictly monotonic document update, without premature cancellation of

3549 running transactions that are still needed: avoid reset/restart of

3550 such command executions while editing.

3552 * Support for asynchronous print functions, as overlay to existing

3553 document content.

3555 * Support for automatic tools in HOL, which try to prove or disprove

3556 toplevel theorem statements.

3558 * Action isabelle.reset-font-size resets main text area font size

3559 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see

3560 also "Plugin Options / Isabelle / General"). It can be bound to some

3561 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).

3563 * File specifications in jEdit (e.g. file browser) may refer to

3564 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued

3565 obsolete $ISABELLE_HOME_WINDOWS variable.

3567 * Improved support for Linux look-and-feel "GTK+", see also "Utilities

3568 / Global Options / Appearance".

3570 * Improved support of native Mac OS X functionality via "MacOSX"

3571 plugin, which is now enabled by default.

3574 *** Pure ***

3576 * Commands 'interpretation' and 'sublocale' are now target-sensitive.

3577 In particular, 'interpretation' allows for non-persistent

3578 interpretation within "context ... begin ... end" blocks offering a

3579 light-weight alternative to 'sublocale'. See "isar-ref" manual for

3580 details.

3582 * Improved locales diagnostic command 'print_dependencies'.

3584 * Discontinued obsolete 'axioms' command, which has been marked as

3585 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'

3586 instead, while observing its uniform scope for polymorphism.

3588 * Discontinued empty name bindings in 'axiomatization'.

3589 INCOMPATIBILITY.

3591 * System option "proofs" has been discontinued. Instead the global

3592 state of Proofterm.proofs is persistently compiled into logic images

3593 as required, notably HOL-Proofs. Users no longer need to change

3594 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.

3596 * Syntax translation functions (print_translation etc.) always depend

3597 on Proof.context. Discontinued former "(advanced)" option -- this is

3598 now the default. Minor INCOMPATIBILITY.

3600 * Former global reference trace_unify_fail is now available as

3601 configuration option "unify_trace_failure" (global context only).

3603 * SELECT_GOAL now retains the syntactic context of the overall goal

3604 state (schematic variables etc.). Potential INCOMPATIBILITY in rare

3605 situations.

3608 *** HOL ***

3610 * Stronger precedence of syntax for big intersection and union on

3611 sets, in accordance with corresponding lattice operations.

3612 INCOMPATIBILITY.

3614 * Notation "{p:A. P}" now allows tuple patterns as well.

3616 * Nested case expressions are now translated in a separate check phase

3617 rather than during parsing. The data for case combinators is separated

3618 from the datatype package. The declaration attribute

3619 "case_translation" can be used to register new case combinators:

3621 declare [[case_translation case_combinator constructor1 ... constructorN]]

3623 * Code generator:

3624 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /

3625 'code_instance'.

3626 - 'code_identifier' declares name hints for arbitrary identifiers in

3627 generated code, subsuming 'code_modulename'.

3629 See the isar-ref manual for syntax diagrams, and the HOL theories for

3630 examples.

3632 * Attibute 'code': 'code' now declares concrete and abstract code

3633 equations uniformly. Use explicit 'code equation' and 'code abstract'

3634 to distinguish both when desired.

3636 * Discontinued theories Code_Integer and Efficient_Nat by a more

3637 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,

3638 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code

3639 generation for details. INCOMPATIBILITY.

3641 * Numeric types are mapped by default to target language numerals:

3642 natural (replaces former code_numeral) and integer (replaces former

3643 code_int). Conversions are available as integer_of_natural /

3644 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and

3645 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in

3646 ML). INCOMPATIBILITY.

3648 * Function package: For mutually recursive functions f and g, separate

3649 cases rules f.cases and g.cases are generated instead of unusable

3650 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,

3651 in the case that the unusable rule was used nevertheless.

3653 * Function package: For each function f, new rules f.elims are

3654 generated, which eliminate equalities of the form "f x = t".

3656 * New command 'fun_cases' derives ad-hoc elimination rules for

3657 function equations as simplified instances of f.elims, analogous to

3658 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.

3660 * Lifting:

3661 - parametrized correspondence relations are now supported:

3662 + parametricity theorems for the raw term can be specified in

3663 the command lift_definition, which allow us to generate stronger

3664 transfer rules

3665 + setup_lifting generates stronger transfer rules if parametric

3666 correspondence relation can be generated

3667 + various new properties of the relator must be specified to support

3668 parametricity

3669 + parametricity theorem for the Quotient relation can be specified

3670 - setup_lifting generates domain rules for the Transfer package

3671 - stronger reflexivity prover of respectfulness theorems for type

3672 copies

3673 - ===> and --> are now local. The symbols can be introduced

3674 by interpreting the locale lifting_syntax (typically in an

3675 anonymous context)

3676 - Lifting/Transfer relevant parts of Library/Quotient_* are now in

3677 Main. Potential INCOMPATIBILITY

3678 - new commands for restoring and deleting Lifting/Transfer context:

3679 lifting_forget, lifting_update

3680 - the command print_quotmaps was renamed to print_quot_maps.

3681 INCOMPATIBILITY

3683 * Transfer:

3684 - better support for domains in Transfer: replace Domainp T

3685 by the actual invariant in a transferred goal

3686 - transfer rules can have as assumptions other transfer rules

3687 - Experimental support for transferring from the raw level to the

3688 abstract level: Transfer.transferred attribute

3689 - Attribute version of the transfer method: untransferred attribute

3691 * Reification and reflection:

3692 - Reification is now directly available in HOL-Main in structure

3693 "Reification".

3694 - Reflection now handles multiple lists with variables also.

3695 - The whole reflection stack has been decomposed into conversions.

3696 INCOMPATIBILITY.

3698 * Revised devices for recursive definitions over finite sets:

3699 - Only one fundamental fold combinator on finite set remains:

3700 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b

3701 This is now identity on infinite sets.

3702 - Locales ("mini packages") for fundamental definitions with

3703 Finite_Set.fold: folding, folding_idem.

3704 - Locales comm_monoid_set, semilattice_order_set and

3705 semilattice_neutr_order_set for big operators on sets.

3706 See theory Big_Operators for canonical examples.

3707 Note that foundational constants comm_monoid_set.F and

3708 semilattice_set.F correspond to former combinators fold_image

3709 and fold1 respectively. These are now gone. You may use

3710 those foundational constants as substitutes, but it is

3711 preferable to interpret the above locales accordingly.

3712 - Dropped class ab_semigroup_idem_mult (special case of lattice,

3713 no longer needed in connection with Finite_Set.fold etc.)

3714 - Fact renames:

3715 card.union_inter ~> card_Un_Int [symmetric]

3716 card.union_disjoint ~> card_Un_disjoint

3717 INCOMPATIBILITY.

3719 * Locale hierarchy for abstract orderings and (semi)lattices.

3721 * Complete_Partial_Order.admissible is defined outside the type class

3722 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the

3723 class predicate assumption or sort constraint when possible.

3724 INCOMPATIBILITY.

3726 * Introduce type class "conditionally_complete_lattice": Like a

3727 complete lattice but does not assume the existence of the top and

3728 bottom elements. Allows to generalize some lemmas about reals and

3729 extended reals. Removed SupInf and replaced it by the instantiation

3730 of conditionally_complete_lattice for real. Renamed lemmas about

3731 conditionally-complete lattice from Sup_... to cSup_... and from

3732 Inf_... to cInf_... to avoid hidding of similar complete lattice

3733 lemmas.

3735 * Introduce type class linear_continuum as combination of

3736 conditionally-complete lattices and inner dense linorders which have

3737 more than one element. INCOMPATIBILITY.

3739 * Introduced type classes order_top and order_bot. The old classes top

3740 and bot only contain the syntax without assumptions. INCOMPATIBILITY:

3741 Rename bot -> order_bot, top -> order_top

3743 * Introduce type classes "no_top" and "no_bot" for orderings without

3744 top and bottom elements.

3746 * Split dense_linorder into inner_dense_order and no_top, no_bot.

3748 * Complex_Main: Unify and move various concepts from

3749 HOL-Multivariate_Analysis to HOL-Complex_Main.

3751 - Introduce type class (lin)order_topology and

3752 linear_continuum_topology. Allows to generalize theorems about

3753 limits and order. Instances are reals and extended reals.

3755 - continuous and continuos_on from Multivariate_Analysis:

3756 "continuous" is the continuity of a function at a filter. "isCont"

3757 is now an abbrevitation: "isCont x f == continuous (at _) f".

3759 Generalized continuity lemmas from isCont to continuous on an

3760 arbitrary filter.

3762 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove

3763 compactness of closed intervals on reals. Continuous functions

3764 attain infimum and supremum on compact sets. The inverse of a

3765 continuous function is continuous, when the function is continuous

3766 on a compact set.

3768 - connected from Multivariate_Analysis. Use it to prove the

3769 intermediate value theorem. Show connectedness of intervals on

3770 linear_continuum_topology).

3772 - first_countable_topology from Multivariate_Analysis. Is used to

3773 show equivalence of properties on the neighbourhood filter of x and

3774 on all sequences converging to x.

3776 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved

3777 theorems from Library/FDERIV.thy to Deriv.thy and base the

3778 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV

3779 which are restricted to sets, i.e. to represent derivatives from

3780 left or right.

3782 - Removed the within-filter. It is replaced by the principal filter:

3784 F within X = inf F (principal X)

3786 - Introduce "at x within U" as a single constant, "at x" is now an

3787 abbreviation for "at x within UNIV"

3789 - Introduce named theorem collections tendsto_intros,

3790 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems

3791 in tendsto_intros (or FDERIV_intros) are also available as

3792 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side

3793 is replaced by a congruence rule. This allows to apply them as

3794 intro rules and then proving equivalence by the simplifier.

3796 - Restructured theories in HOL-Complex_Main:

3798 + Moved RealDef and RComplete into Real

3800 + Introduced Topological_Spaces and moved theorems about

3801 topological spaces, filters, limits and continuity to it

3803 + Renamed RealVector to Real_Vector_Spaces

3805 + Split Lim, SEQ, Series into Topological_Spaces,

3806 Real_Vector_Spaces, and Limits

3808 + Moved Ln and Log to Transcendental

3810 + Moved theorems about continuity from Deriv to Topological_Spaces

3812 - Remove various auxiliary lemmas.

3814 INCOMPATIBILITY.

3816 * Nitpick:

3817 - Added option "spy".

3818 - Reduce incidence of "too high arity" errors.

3820 * Sledgehammer:

3821 - Renamed option:

3822 isar_shrink ~> isar_compress

3823 INCOMPATIBILITY.

3824 - Added options "isar_try0", "spy".

3825 - Better support for "isar_proofs".

3826 - MaSh has been fined-tuned and now runs as a local server.

3828 * Improved support for ad hoc overloading of constants (see also

3829 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).

3831 * Library/Polynomial.thy:

3832 - Use lifting for primitive definitions.

3833 - Explicit conversions from and to lists of coefficients, used for

3834 generated code.

3835 - Replaced recursion operator poly_rec by fold_coeffs.

3836 - Prefer pre-existing gcd operation for gcd.

3837 - Fact renames:

3838 poly_eq_iff ~> poly_eq_poly_eq_iff

3839 poly_ext ~> poly_eqI

3840 expand_poly_eq ~> poly_eq_iff

3841 IMCOMPATIBILITY.

3843 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and

3844 case_of_simps to convert function definitions between a list of

3845 equations with patterns on the lhs and a single equation with case

3846 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.

3848 * New Library/FSet.thy: type of finite sets defined as a subtype of

3849 sets defined by Lifting/Transfer.

3851 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.

3853 * Consolidation of library theories on product orders:

3855 Product_Lattice ~> Product_Order -- pointwise order on products

3856 Product_ord ~> Product_Lexorder -- lexicographic order on products

3858 INCOMPATIBILITY.

3860 * Imperative-HOL: The MREC combinator is considered legacy and no

3861 longer included by default. INCOMPATIBILITY, use partial_function

3862 instead, or import theory Legacy_Mrec as a fallback.

3864 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and

3865 ~~/src/HOL/Algebra/poly. Existing theories should be based on

3866 ~~/src/HOL/Library/Polynomial instead. The latter provides

3867 integration with HOL's type classes for rings. INCOMPATIBILITY.

3869 * HOL-BNF:

3870 - Various improvements to BNF-based (co)datatype package, including

3871 new commands "primrec_new", "primcorec", and

3872 "datatype_new_compat", as well as documentation. See

3873 "datatypes.pdf" for details.

3874 - New "coinduction" method to avoid some boilerplate (compared to

3875 coinduct).

3876 - Renamed keywords:

3877 data ~> datatype_new

3878 codata ~> codatatype

3879 bnf_def ~> bnf

3880 - Renamed many generated theorems, including

3881 discs ~> disc

3882 map_comp' ~> map_comp

3883 map_id' ~> map_id

3884 sels ~> sel

3885 set_map' ~> set_map

3886 sets ~> set

3887 IMCOMPATIBILITY.

3890 *** ML ***

3892 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function

3893 "check_property" allows to check specifications of the form "ALL x y

3894 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its

3895 Examples.thy in particular.

3897 * Improved printing of exception trace in Poly/ML 5.5.1, with regular

3898 tracing output in the command transaction context instead of physical

3899 stdout. See also Toplevel.debug, Toplevel.debugging and

3900 ML_Compiler.exn_trace.

3902 * ML type "theory" is now immutable, without any special treatment of

3903 drafts or linear updates (which could lead to "stale theory" errors in

3904 the past). Discontinued obsolete operations like Theory.copy,

3905 Theory.checkpoint, and the auxiliary type theory_ref. Minor

3906 INCOMPATIBILITY.

3908 * More uniform naming of goal functions for skipped proofs:

3910 Skip_Proof.prove ~> Goal.prove_sorry

3911 Skip_Proof.prove_global ~> Goal.prove_sorry_global

3913 Minor INCOMPATIBILITY.

3915 * Simplifier tactics and tools use proper Proof.context instead of

3916 historic type simpset. Old-style declarations like addsimps,

3917 addsimprocs etc. operate directly on Proof.context. Raw type simpset

3918 retains its use as snapshot of the main Simplifier context, using

3919 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port

3920 old tools by making them depend on (ctxt : Proof.context) instead of

3921 (ss : simpset), then turn (simpset_of ctxt) into ctxt.

3923 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)

3924 operate on Proof.context instead of claset, for uniformity with addIs,

3925 addEs, addDs etc. Note that claset_of and put_claset allow to manage

3926 clasets separately from the context.

3928 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.

3929 INCOMPATIBILITY, use @{context} instead.

3931 * Antiquotation @{theory_context A} is similar to @{theory A}, but

3932 presents the result as initial Proof.context.

3935 *** System ***

3937 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by

3938 "isabelle build" in Isabelle2013. INCOMPATIBILITY.

3940 * Discontinued obsolete isabelle-process options -f and -u (former

3941 administrative aliases of option -e). Minor INCOMPATIBILITY.

3943 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND

3944 settings variable.

3946 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic

3947 document formats: dvi.gz, ps, ps.gz -- the default document format is

3948 always pdf.

3950 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to

3951 specify global resources of the JVM process run by isabelle build.

3953 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows

3954 to run Isabelle/Scala source files as standalone programs.

3956 * Improved "isabelle keywords" tool (for old-style ProofGeneral

3957 keyword tables): use Isabelle/Scala operations, which inspect outer

3958 syntax without requiring to build sessions first.

3960 * Sessions may be organized via 'chapter' specifications in the ROOT

3961 file, which determines a two-level hierarchy of browser info. The old

3962 tree-like organization via implicit sub-session relation (with its

3963 tendency towards erratic fluctuation of URLs) has been discontinued.

3964 The default chapter is called "Unsorted". Potential INCOMPATIBILITY

3965 for HTML presentation of theories.

3969 New in Isabelle2013 (February 2013)

3970 -----------------------------------

3972 *** General ***

3974 * Theorem status about oracles and unfinished/failed future proofs is

3975 no longer printed by default, since it is incompatible with

3976 incremental / parallel checking of the persistent document model. ML

3977 function Thm.peek_status may be used to inspect a snapshot of the

3978 ongoing evaluation process. Note that in batch mode --- notably

3979 isabelle build --- the system ensures that future proofs of all

3980 accessible theorems in the theory context are finished (as before).

3982 * Configuration option show_markup controls direct inlining of markup

3983 into the printed representation of formal entities --- notably type

3984 and sort constraints. This enables Prover IDE users to retrieve that

3985 information via tooltips in the output window, for example.

3987 * Command 'ML_file' evaluates ML text from a file directly within the

3988 theory, without any predeclaration via 'uses' in the theory header.

3990 * Old command 'use' command and corresponding keyword 'uses' in the

3991 theory header are legacy features and will be discontinued soon.

3992 Tools that load their additional source files may imitate the

3993 'ML_file' implementation, such that the system can take care of

3994 dependencies properly.

3996 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which

3997 is called fastforce / fast_force_tac already since Isabelle2011-1.

3999 * Updated and extended "isar-ref" and "implementation" manual, reduced

4000 remaining material in old "ref" manual.

4002 * Improved support for auxiliary contexts that indicate block structure

4003 for specifications. Nesting of "context fixes ... context assumes ..."

4004 and "class ... context ...".

4006 * Attribute "consumes" allows a negative value as well, which is

4007 interpreted relatively to the total number of premises of the rule in

4008 the target context. This form of declaration is stable when exported

4009 from a nested 'context' with additional assumptions. It is the

4010 preferred form for definitional packages, notably cases/rules produced

4011 in HOL/inductive and HOL/function.

4013 * More informative error messages for Isar proof commands involving

4014 lazy enumerations (method applications etc.).

4016 * Refined 'help' command to retrieve outer syntax commands according

4017 to name patterns (with clickable results).

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

4022 * Parallel terminal proofs ('by') are enabled by default, likewise

4023 proofs that are built into packages like 'datatype', 'function'. This

4024 allows to "run ahead" checking the theory specifications on the

4025 surface, while the prover is still crunching on internal

4026 justifications. Unfinished / cancelled proofs are restarted as

4027 required to complete full proof checking eventually.

4029 * Improved output panel with tooltips, hyperlinks etc. based on the

4030 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of

4031 tooltips leads to some window that supports the same recursively,

4032 which can lead to stacks of tooltips as the semantic document content

4033 is explored. ESCAPE closes the whole stack, individual windows may be

4034 closed separately, or detached to become independent jEdit dockables.

4036 * Improved support for commands that produce graph output: the text

4037 message contains a clickable area to open a new instance of the graph

4038 browser on demand.

4040 * More robust incremental parsing of outer syntax (partial comments,

4041 malformed symbols). Changing the balance of open/close quotes and

4042 comment delimiters works more conveniently with unfinished situations

4043 that frequently occur in user interaction.

4045 * More efficient painting and improved reactivity when editing large

4046 files. More scalable management of formal document content.

4048 * Smarter handling of tracing messages: prover process pauses after

4049 certain number of messages per command transaction, with some user

4050 dialog to stop or continue. This avoids swamping the front-end with

4051 potentially infinite message streams.

4053 * More plugin options and preferences, based on Isabelle/Scala. The

4054 jEdit plugin option panel provides access to some Isabelle/Scala

4055 options, including tuning parameters for editor reactivity and color

4056 schemes.

4058 * Dockable window "Symbols" provides some editing support for Isabelle

4059 symbols.

4061 * Dockable window "Monitor" shows ML runtime statistics. Note that

4062 continuous display of the chart slows down the system.

4064 * Improved editing support for control styles: subscript, superscript,

4065 bold, reset of style -- operating on single symbols or text

4066 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.

4068 * Actions isabelle.increase-font-size and isabelle.decrease-font-size

4069 adjust the main text area font size, and its derivatives for output,

4070 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often

4071 need to be adapted to local keyboard layouts.

4073 * More reactive completion popup by default: use \t (TAB) instead of

4074 \n (NEWLINE) to minimize intrusion into regular flow of editing. See

4075 also "Plugin Options / SideKick / General / Code Completion Options".

4077 * Implicit check and build dialog of the specified logic session

4078 image. For example, HOL, HOLCF, HOL-Nominal can be produced on

4079 demand, without bundling big platform-dependent heap images in the

4080 Isabelle distribution.

4082 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates

4083 from Oracle provide better multi-platform experience. This version is

4084 now bundled exclusively with Isabelle.

4087 *** Pure ***

4089 * Code generation for Haskell: restrict unqualified imports from

4090 Haskell Prelude to a small set of fundamental operations.

4092 * Command 'export_code': relative file names are interpreted

4093 relatively to master directory of current theory rather than the

4094 rather arbitrary current working directory. INCOMPATIBILITY.

4096 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,

4097 use regular rule composition via "OF" / "THEN", or explicit proof

4098 structure instead. Note that Isabelle/ML provides a variety of

4099 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied

4100 with some care where this is really required.

4102 * Command 'typ' supports an additional variant with explicit sort

4103 constraint, to infer and check the most general type conforming to a

4104 given sort. Example (in HOL):

4106 typ "_ * _ * bool * unit" :: finite

4108 * Command 'locale_deps' visualizes all locales and their relations as

4109 a Hasse diagram.

4112 *** HOL ***

4114 * Sledgehammer:

4116 - Added MaSh relevance filter based on machine-learning; see the

4117 Sledgehammer manual for details.

4118 - Polished Isar proofs generated with "isar_proofs" option.

4119 - Rationalized type encodings ("type_enc" option).

4120 - Renamed "kill_provers" subcommand to "kill_all".

4121 - Renamed options:

4122 isar_proof ~> isar_proofs

4123 isar_shrink_factor ~> isar_shrink

4124 max_relevant ~> max_facts

4125 relevance_thresholds ~> fact_thresholds

4127 * Quickcheck: added an optimisation for equality premises. It is

4128 switched on by default, and can be switched off by setting the

4129 configuration quickcheck_optimise_equality to false.

4131 * Quotient: only one quotient can be defined by quotient_type

4132 INCOMPATIBILITY.

4134 * Lifting:

4135 - generation of an abstraction function equation in lift_definition

4136 - quot_del attribute

4137 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)

4139 * Simproc "finite_Collect" rewrites set comprehensions into pointfree

4140 expressions.

4142 * Preprocessing of the code generator rewrites set comprehensions into

4143 pointfree expressions.

4145 * The SMT solver Z3 has now by default a restricted set of directly

4146 supported features. For the full set of features (div/mod, nonlinear

4147 arithmetic, datatypes/records) with potential proof reconstruction

4148 failures, enable the configuration option "z3_with_extensions". Minor

4149 INCOMPATIBILITY.

4151 * Simplified 'typedef' specifications: historical options for implicit

4152 set definition and alternative name have been discontinued. The

4153 former behavior of "typedef (open) t = A" is now the default, but

4154 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories

4155 accordingly.

4157 * Removed constant "chars"; prefer "Enum.enum" on type "char"

4158 directly. INCOMPATIBILITY.

4160 * Moved operation product, sublists and n_lists from theory Enum to

4161 List. INCOMPATIBILITY.

4163 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.

4165 * Class "comm_monoid_diff" formalises properties of bounded

4166 subtraction, with natural numbers and multisets as typical instances.

4168 * Added combinator "Option.these" with type "'a option set => 'a set".

4170 * Theory "Transitive_Closure": renamed lemmas

4172 reflcl_tranclp -> reflclp_tranclp

4173 rtranclp_reflcl -> rtranclp_reflclp

4175 INCOMPATIBILITY.

4177 * Theory "Rings": renamed lemmas (in class semiring)

4179 left_distrib ~> distrib_right

4180 right_distrib ~> distrib_left

4182 INCOMPATIBILITY.

4184 * Generalized the definition of limits:

4186 - Introduced the predicate filterlim (LIM x F. f x :> G) which

4187 expresses that when the input values x converge to F then the

4188 output f x converges to G.

4190 - Added filters for convergence to positive (at_top) and negative

4191 infinity (at_bot).

4193 - Moved infinity in the norm (at_infinity) from

4194 Multivariate_Analysis to Complex_Main.

4196 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>

4197 at_top".

4199 INCOMPATIBILITY.

4201 * Theory "Library/Option_ord" provides instantiation of option type to

4202 lattice type classes.

4204 * Theory "Library/Multiset": renamed

4206 constant fold_mset ~> Multiset.fold

4207 fact fold_mset_commute ~> fold_mset_comm

4209 INCOMPATIBILITY.

4211 * Renamed theory Library/List_Prefix to Library/Sublist, with related

4212 changes as follows.

4214 - Renamed constants (and related lemmas)

4216 prefix ~> prefixeq

4217 strict_prefix ~> prefix

4219 - Replaced constant "postfix" by "suffixeq" with swapped argument

4220 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped

4221 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.

4222 Renamed lemmas accordingly.

4224 - Added constant "list_hembeq" for homeomorphic embedding on

4225 lists. Added abbreviation "sublisteq" for special case

4226 "list_hembeq (op =)".

4228 - Theory Library/Sublist no longer provides "order" and "bot" type

4229 class instances for the prefix order (merely corresponding locale

4230 interpretations). The type class instances are now in theory

4231 Library/Prefix_Order.

4233 - The sublist relation of theory Library/Sublist_Order is now based

4234 on "Sublist.sublisteq". Renamed lemmas accordingly:

4236 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff

4237 le_list_append_mono ~> Sublist.list_hembeq_append_mono

4238 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2

4239 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD

4240 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'

4241 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq

4242 le_list_drop_Cons ~> Sublist.sublisteq_Cons'

4243 le_list_drop_many ~> Sublist.sublisteq_drop_many

4244 le_list_filter_left ~> Sublist.sublisteq_filter_left

4245 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many

4246 le_list_rev_take_iff ~> Sublist.sublisteq_append

4247 le_list_same_length ~> Sublist.sublisteq_same_length

4248 le_list_take_many_iff ~> Sublist.sublisteq_append'

4249 less_eq_list.drop ~> less_eq_list_drop

4250 less_eq_list.induct ~> less_eq_list_induct

4251 not_le_list_length ~> Sublist.not_sublisteq_length

4253 INCOMPATIBILITY.

4255 * New theory Library/Countable_Set.

4257 * Theory Library/Debug and Library/Parallel provide debugging and

4258 parallel execution for code generated towards Isabelle/ML.

4260 * Theory Library/FuncSet: Extended support for Pi and extensional and

4261 introduce the extensional dependent function space "PiE". Replaced

4262 extensional_funcset by an abbreviation, and renamed lemmas from

4263 extensional_funcset to PiE as follows:

4265 extensional_empty ~> PiE_empty

4266 extensional_funcset_empty_domain ~> PiE_empty_domain

4267 extensional_funcset_empty_range ~> PiE_empty_range

4268 extensional_funcset_arb ~> PiE_arb

4269 extensional_funcset_mem ~> PiE_mem

4270 extensional_funcset_extend_domainI ~> PiE_fun_upd

4271 extensional_funcset_restrict_domain ~> fun_upd_in_PiE

4272 extensional_funcset_extend_domain_eq ~> PiE_insert_eq

4273 card_extensional_funcset ~> card_PiE

4274 finite_extensional_funcset ~> finite_PiE

4276 INCOMPATIBILITY.

4278 * Theory Library/FinFun: theory of almost everywhere constant

4279 functions (supersedes the AFP entry "Code Generation for Functions as

4280 Data").

4282 * Theory Library/Phantom: generic phantom type to make a type

4283 parameter appear in a constant's type. This alternative to adding

4284 TYPE('a) as another parameter avoids unnecessary closures in generated

4285 code.

4287 * Theory Library/RBT_Impl: efficient construction of red-black trees

4288 from sorted associative lists. Merging two trees with rbt_union may

4289 return a structurally different tree than before. Potential

4290 INCOMPATIBILITY.

4292 * Theory Library/IArray: immutable arrays with code generation.

4294 * Theory Library/Finite_Lattice: theory of finite lattices.

4296 * HOL/Multivariate_Analysis: replaced

4298 "basis :: 'a::euclidean_space => nat => real"

4299 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"

4301 on euclidean spaces by using the inner product "_ \<bullet> _" with

4302 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by

4303 "SUM i : Basis. f i * r i".

4305 With this change the following constants are also changed or removed:

4307 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)

4308 a $$ i ~> inner a i (where i : Basis)

4309 cart_base i removed

4310 \<pi>, \<pi>' removed

4312 Theorems about these constants where removed.

4314 Renamed lemmas:

4316 component_le_norm ~> Basis_le_norm

4317 euclidean_eq ~> euclidean_eq_iff

4318 differential_zero_maxmin_component ~> differential_zero_maxmin_cart

4319 euclidean_simps ~> inner_simps

4320 independent_basis ~> independent_Basis

4321 span_basis ~> span_Basis

4322 in_span_basis ~> in_span_Basis

4323 norm_bound_component_le ~> norm_boound_Basis_le

4324 norm_bound_component_lt ~> norm_boound_Basis_lt

4325 component_le_infnorm ~> Basis_le_infnorm

4327 INCOMPATIBILITY.

4329 * HOL/Probability:

4331 - Added simproc "measurable" to automatically prove measurability.

4333 - Added induction rules for sigma sets with disjoint union

4334 (sigma_sets_induct_disjoint) and for Borel-measurable functions

4335 (borel_measurable_induct).

4337 - Added the Daniell-Kolmogorov theorem (the existence the limit of a

4338 projective family).

4340 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the

4341 AFP entry "Ordinals_and_Cardinals").

4343 * HOL/BNF: New (co)datatype package based on bounded natural functors

4344 with support for mixed, nested recursion and interesting non-free

4345 datatypes.

4347 * HOL/Finite_Set and Relation: added new set and relation operations

4348 expressed by Finite_Set.fold.

4350 * New theory HOL/Library/RBT_Set: implementation of sets by red-black

4351 trees for the code generator.

4353 * HOL/Library/RBT and HOL/Library/Mapping have been converted to

4354 Lifting/Transfer.

4355 possible INCOMPATIBILITY.

4357 * HOL/Set: renamed Set.project -> Set.filter

4358 INCOMPATIBILITY.

4361 *** Document preparation ***

4363 * Dropped legacy antiquotations "term_style" and "thm_style", since

4364 styles may be given as arguments to "term" and "thm" already.

4365 Discontinued legacy styles "prem1" .. "prem19".

4367 * Default LaTeX rendering for \<euro> is now based on eurosym package,

4368 instead of slightly exotic babel/greek.

4370 * Document variant NAME may use different LaTeX entry point

4371 document/root_NAME.tex if that file exists, instead of the common

4372 document/root.tex.

4374 * Simplified custom document/build script, instead of old-style

4375 document/IsaMakefile. Minor INCOMPATIBILITY.

4378 *** ML ***

4380 * The default limit for maximum number of worker threads is now 8,

4381 instead of 4, in correspondence to capabilities of contemporary

4382 hardware and Poly/ML runtime system.

4384 * Type Seq.results and related operations support embedded error

4385 messages within lazy enumerations, and thus allow to provide

4386 informative errors in the absence of any usable results.

4388 * Renamed Position.str_of to Position.here to emphasize that this is a

4389 formal device to inline positions into message text, but not

4390 necessarily printing visible text.

4393 *** System ***

4395 * Advanced support for Isabelle sessions and build management, see

4396 "system" manual for the chapter of that name, especially the "isabelle

4397 build" tool and its examples. The "isabelle mkroot" tool prepares

4398 session root directories for use with "isabelle build", similar to

4399 former "isabelle mkdir" for "isabelle usedir". Note that this affects

4400 document preparation as well. INCOMPATIBILITY, isabelle usedir /

4401 mkdir / make are rendered obsolete.

4403 * Discontinued obsolete Isabelle/build script, it is superseded by the

4404 regular isabelle build tool. For example:

4406 isabelle build -s -b HOL

4408 * Discontinued obsolete "isabelle makeall".

4410 * Discontinued obsolete IsaMakefile and ROOT.ML files from the

4411 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that

4412 provides some traditional targets that invoke "isabelle build". Note

4413 that this is inefficient! Applications of Isabelle/HOL involving

4414 "isabelle make" should be upgraded to use "isabelle build" directly.

4416 * The "isabelle options" tool prints Isabelle system options, as

4417 required for "isabelle build", for example.

4419 * The "isabelle logo" tool produces EPS and PDF format simultaneously.

4420 Minor INCOMPATIBILITY in command-line options.

4422 * The "isabelle install" tool has now a simpler command-line. Minor

4423 INCOMPATIBILITY.

4425 * The "isabelle components" tool helps to resolve add-on components

4426 that are not bundled, or referenced from a bare-bones repository

4427 version of Isabelle.

4429 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general

4430 platform family: "linux", "macos", "windows".

4432 * The ML system is configured as regular component, and no longer

4433 picked up from some surrounding directory. Potential INCOMPATIBILITY

4434 for home-made settings.

4436 * Improved ML runtime statistics (heap, threads, future tasks etc.).

4438 * Discontinued support for Poly/ML 5.2.1, which was the last version

4439 without exception positions and advanced ML compiler/toplevel

4440 configuration.

4442 * Discontinued special treatment of Proof General -- no longer guess

4443 PROOFGENERAL_HOME based on accidental file-system layout. Minor

4444 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS

4445 settings manually, or use a Proof General version that has been

4446 bundled as Isabelle component.

4450 New in Isabelle2012 (May 2012)

4451 ------------------------------

4453 *** General ***

4455 * Prover IDE (PIDE) improvements:

4457 - more robust Sledgehammer integration (as before the sledgehammer

4458 command-line needs to be typed into the source buffer)

4459 - markup for bound variables

4460 - markup for types of term variables (displayed as tooltips)

4461 - support for user-defined Isar commands within the running session

4462 - improved support for Unicode outside original 16bit range

4463 e.g. glyph for \<A> (thanks to jEdit 4.5.1)

4465 * Forward declaration of outer syntax keywords within the theory

4466 header -- minor INCOMPATIBILITY for user-defined commands. Allow new

4467 commands to be used in the same theory where defined.

4469 * Auxiliary contexts indicate block structure for specifications with

4470 additional parameters and assumptions. Such unnamed contexts may be

4471 nested within other targets, like 'theory', 'locale', 'class',

4472 'instantiation' etc. Results from the local context are generalized

4473 accordingly and applied to the enclosing target context. Example:

4475 context

4476 fixes x y z :: 'a

4477 assumes xy: "x = y" and yz: "y = z"

4478 begin

4480 lemma my_trans: "x = z" using xy yz by simp

4482 end

4484 thm my_trans

4486 The most basic application is to factor-out context elements of

4487 several fixes/assumes/shows theorem statements, e.g. see

4488 ~~/src/HOL/Isar_Examples/Group_Context.thy

4490 Any other local theory specification element works within the "context

4491 ... begin ... end" block as well.

4493 * Bundled declarations associate attributed fact expressions with a

4494 given name in the context. These may be later included in other

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

4496 the logical dependencies of locales and locale interpretation. See

4497 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.

4499 * Commands 'lemmas' and 'theorems' allow local variables using 'for'

4500 declaration, and results are standardized before being stored. Thus

4501 old-style "standard" after instantiation or composition of facts

4502 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of

4503 indices of schematic variables.

4505 * Rule attributes in local theory declarations (e.g. locale or class)

4506 are now statically evaluated: the resulting theorem is stored instead

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

4508 the historic accident of dynamic re-evaluation in interpretations

4509 etc. was exploited.

4511 * New tutorial "Programming and Proving in Isabelle/HOL"

4512 ("prog-prove"). It completely supersedes "A Tutorial Introduction to

4513 Structured Isar Proofs" ("isar-overview"), which has been removed. It

4514 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order

4515 Logic" as the recommended beginners tutorial, but does not cover all

4516 of the material of that old tutorial.

4518 * Updated and extended reference manuals: "isar-ref",

4519 "implementation", "system"; reduced remaining material in old "ref"

4520 manual.

4523 *** Pure ***

4525 * Command 'definition' no longer exports the foundational "raw_def"

4526 into the user context. Minor INCOMPATIBILITY, may use the regular

4527 "def" result with attribute "abs_def" to imitate the old version.

4529 * Attribute "abs_def" turns an equation of the form "f x y == t" into

4530 "f == %x y. t", which ensures that "simp" or "unfold" steps always

4531 expand it. This also works for object-logic equality. (Formerly

4532 undocumented feature.)

4534 * Sort constraints are now propagated in simultaneous statements, just

4535 like type constraints. INCOMPATIBILITY in rare situations, where

4536 distinct sorts used to be assigned accidentally. For example:

4538 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"

4540 lemma "P (x::'a)" and "Q (y::'a::bar)"

4541 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"

4543 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more

4544 tolerant against multiple unifiers, as long as the final result is

4545 unique. (As before, rules are composed in canonical right-to-left

4546 order to accommodate newly introduced premises.)

4548 * Renamed some inner syntax categories:

4550 num ~> num_token

4551 xnum ~> xnum_token

4552 xstr ~> str_token

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

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

4556 position information via constraints).

4558 * Simplified configuration options for syntax ambiguity: see

4559 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref

4560 manual. Minor INCOMPATIBILITY.

4562 * Discontinued configuration option "syntax_positions": atomic terms

4563 in parse trees are always annotated by position constraints.

4565 * Old code generator for SML and its commands 'code_module',

4566 'code_library', 'consts_code', 'types_code' have been discontinued.

4567 Use commands of the generic code generator instead. INCOMPATIBILITY.

4569 * Redundant attribute "code_inline" has been discontinued. Use

4570 "code_unfold" instead. INCOMPATIBILITY.

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

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

4575 definition [code_abbrev]: "f = t"

4577 INCOMPATIBILITY.

4579 * Obsolete 'types' command has been discontinued. Use 'type_synonym'

4580 instead. INCOMPATIBILITY.

4582 * Discontinued old "prems" fact, which used to refer to the accidental

4583 collection of foundational premises in the context (already marked as

4584 legacy since Isabelle2011).

4587 *** HOL ***

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

4590 Isabelle2008). Definitions mem_def and Collect_def have disappeared.

4591 Non-trivial INCOMPATIBILITY. For developments keeping predicates and

4592 sets separate, it is often sufficient to rephrase some set S that has

4593 been accidentally used as predicates by "%x. x : S", and some

4594 predicate P that has been accidentally used as set by "{x. P x}".

4595 Corresponding proofs in a first step should be pruned from any

4596 tinkering with former theorems mem_def and Collect_def as far as

4597 possible.

4599 For developments which deliberately mix predicates and sets, a

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

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

4602 Isabelle2011-1 before jumping right into the current release.

4604 * Code generation by default implements sets as container type rather

4605 than predicates. INCOMPATIBILITY.

4607 * New type synonym 'a rel = ('a * 'a) set

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

4610 represents strictly positive binary numerals, along with functions

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

4612 positive and negated numeric literals, respectively. See also

4613 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some

4614 user theories may require adaptations as follows:

4616 - Theorems with number_ring or number_semiring constraints: These

4617 classes are gone; use comm_ring_1 or comm_semiring_1 instead.

4619 - Theories defining numeric types: Remove number, number_semiring,

4620 and number_ring instances. Defer all theorems about numerals until

4621 after classes one and semigroup_add have been instantiated.

4623 - Numeral-only simp rules: Replace each rule having a "number_of v"

4624 pattern with two copies, one for numeral and one for neg_numeral.

4626 - Theorems about subclasses of semiring_1 or ring_1: These classes

4627 automatically support numerals now, so more simp rules and

4628 simprocs may now apply within the proof.

4630 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:

4631 Redefine using other integer operations.

4633 * Transfer: New package intended to generalize the existing

4634 "descending" method and related theorem attributes from the Quotient

4635 package. (Not all functionality is implemented yet, but future

4636 development will focus on Transfer as an eventual replacement for the

4637 corresponding parts of the Quotient package.)

4639 - transfer_rule attribute: Maintains a collection of transfer rules,

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

4641 relate different type instances of the same polymorphic constant,

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

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

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

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

4648 - transfer method: Replaces a subgoal on abstract types with an

4649 equivalent subgoal on the corresponding raw types. Constants are

4650 replaced with corresponding ones according to the transfer rules.

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

4652 necessary for variables whose types change, but can be overridden

4653 for specific variables with e.g. "transfer fixing: x y z". The

4654 variant transfer' method allows replacing a subgoal with one that

4655 is logically stronger (rather than equivalent).

4657 - relator_eq attribute: Collects identity laws for relators of

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

4659 transfer method uses these lemmas to infer transfer rules for

4660 non-polymorphic constants on the fly.

4662 - transfer_prover method: Assists with proving a transfer rule for a

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

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

4665 after unfolding the constant definitions.

4667 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer

4668 from type nat to type int.

4670 * Lifting: New package intended to generalize the quotient_definition

4671 facility of the Quotient package; designed to work with Transfer.

4673 - lift_definition command: Defines operations on an abstract type in

4674 terms of a corresponding operation on a representation

4675 type. Example syntax:

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

4678 is List.insert

4680 Users must discharge a respectfulness proof obligation when each

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

4682 the proof is discharged automatically.) The obligation is

4683 presented in a user-friendly, readable form; a respectfulness

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

4685 by the package.

4687 - Integration with code_abstype: For typedefs (e.g. subtypes

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

4689 lift_definition generates a code certificate theorem and sets up

4690 code generation for each constant.

4692 - setup_lifting command: Sets up the Lifting package to work with a

4693 user-defined type. The user must provide either a quotient theorem

4694 or a type_definition theorem. The package configures transfer

4695 rules for equality and quantifiers on the type, and sets up the

4696 lift_definition command to work with the type.

4698 - Usage examples: See Quotient_Examples/Lift_DList.thy,

4699 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,

4700 Word/Word.thy and Library/Float.thy.

4702 * Quotient package:

4704 - The 'quotient_type' command now supports a 'morphisms' option with

4705 rep and abs functions, similar to typedef.

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

4708 Transfer packages, as with 'setup_lifting'.

4710 - The 'quotient_definition' command now requires the user to prove a

4711 respectfulness property at the point where the constant is

4712 defined, similar to lift_definition; INCOMPATIBILITY.

4714 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems

4715 accordingly, INCOMPATIBILITY.

4717 * New diagnostic command 'find_unused_assms' to find potentially

4718 superfluous assumptions in theorems using Quickcheck.

4720 * Quickcheck:

4722 - Quickcheck returns variable assignments as counterexamples, which

4723 allows to reveal the underspecification of functions under test.

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

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

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

4728 These counterexample are marked as potentially spurious, as

4729 Quickcheck also returns "xs = []" as a counterexample to the

4730 obvious theorem "hd xs = hd xs".

4732 After finding a potentially spurious counterexample, Quickcheck

4733 continues searching for genuine ones.

4735 By default, Quickcheck shows potentially spurious and genuine

4736 counterexamples. The option "genuine_only" sets quickcheck to only

4737 show genuine counterexamples.

4739 - The command 'quickcheck_generator' creates random and exhaustive

4740 value generators for a given type and operations.

4742 It generates values by using the operations as if they were

4743 constructors of that type.

4745 - Support for multisets.

4747 - Added "use_subtype" options.

4749 - Added "quickcheck_locale" configuration to specify how to process

4750 conjectures in a locale context.

4752 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option

4753 and affecting 'rat' and 'real'.

4755 * Sledgehammer:

4756 - Integrated more tightly with SPASS, as described in the ITP 2012

4757 paper "More SPASS with Isabelle".

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

4759 - Added support for the following provers: Alt-Ergo (via Why3 and

4760 TFF1), iProver, iProver-Eq.

4761 - Sped up the minimizer.

4762 - Added "lam_trans", "uncurry_aliases", and "minimize" options.

4763 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").

4764 - Renamed "sound" option to "strict".

4766 * Metis: Added possibility to specify lambda translations scheme as a

4767 parenthesized argument (e.g., "by (metis (lifting) ...)").

4769 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".

4771 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.

4773 * New "case_product" attribute to generate a case rule doing multiple

4774 case distinctions at the same time. E.g.

4776 list.exhaust [case_product nat.exhaust]

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

4779 a list and a nat.

4781 * New "eventually_elim" method as a generalized variant of the

4782 eventually_elim* rules. Supports structured proofs.

4784 * Typedef with implicit set definition is considered legacy. Use

4785 "typedef (open)" form instead, which will eventually become the

4786 default.

4788 * Record: code generation can be switched off manually with

4790 declare [[record_coden = false]] -- "default true"

4792 * Datatype: type parameters allow explicit sort constraints.

4794 * Concrete syntax for case expressions includes constraints for source

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

4796 INCOMPATIBILITY for old-style syntax translations that augment the

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

4798 one_case.

4800 * Clarified attribute "mono_set": pure declaration without modifying

4801 the result of the fact expression.

4803 * More default pred/set conversions on a couple of relation operations

4804 and predicates. Added powers of predicate relations. Consolidation

4805 of some relation theorems:

4807 converse_def ~> converse_unfold

4808 rel_comp_def ~> relcomp_unfold

4809 symp_def ~> (modified, use symp_def and sym_def instead)

4810 transp_def ~> transp_trans

4811 Domain_def ~> Domain_unfold

4812 Range_def ~> Domain_converse [symmetric]

4814 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.

4816 See theory "Relation" for examples for making use of pred/set

4817 conversions by means of attributes "to_set" and "to_pred".

4819 INCOMPATIBILITY.

4821 * Renamed facts about the power operation on relations, i.e., relpow

4822 to match the constant's name:

4824 rel_pow_1 ~> relpow_1

4825 rel_pow_0_I ~> relpow_0_I

4826 rel_pow_Suc_I ~> relpow_Suc_I

4827 rel_pow_Suc_I2 ~> relpow_Suc_I2

4828 rel_pow_0_E ~> relpow_0_E

4829 rel_pow_Suc_E ~> relpow_Suc_E

4830 rel_pow_E ~> relpow_E

4831 rel_pow_Suc_D2 ~> relpow_Suc_D2

4832 rel_pow_Suc_E2 ~> relpow_Suc_E2

4833 rel_pow_Suc_D2' ~> relpow_Suc_D2'

4834 rel_pow_E2 ~> relpow_E2

4835 rel_pow_add ~> relpow_add

4836 rel_pow_commute ~> relpow

4837 rel_pow_empty ~> relpow_empty:

4838 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow

4839 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl

4840 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow

4841 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow

4842 rel_pow_fun_conv ~> relpow_fun_conv

4843 rel_pow_finite_bounded1 ~> relpow_finite_bounded1

4844 rel_pow_finite_bounded ~> relpow_finite_bounded

4845 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow

4846 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow

4847 single_valued_rel_pow ~> single_valued_relpow

4849 INCOMPATIBILITY.

4851 * Theory Relation: Consolidated constant name for relation composition

4852 and corresponding theorem names:

4854 - Renamed constant rel_comp to relcomp.

4856 - Dropped abbreviation pred_comp. Use relcompp instead.

4858 - Renamed theorems:

4860 rel_compI ~> relcompI

4861 rel_compEpair ~> relcompEpair

4862 rel_compE ~> relcompE

4863 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq

4864 rel_comp_empty1 ~> relcomp_empty1

4865 rel_comp_mono ~> relcomp_mono

4866 rel_comp_subset_Sigma ~> relcomp_subset_Sigma

4867 rel_comp_distrib ~> relcomp_distrib

4868 rel_comp_distrib2 ~> relcomp_distrib2

4869 rel_comp_UNION_distrib ~> relcomp_UNION_distrib

4870 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2

4871 single_valued_rel_comp ~> single_valued_relcomp

4872 rel_comp_def ~> relcomp_unfold

4873 converse_rel_comp ~> converse_relcomp

4874 pred_compI ~> relcomppI

4875 pred_compE ~> relcomppE

4876 pred_comp_bot1 ~> relcompp_bot1

4877 pred_comp_bot2 ~> relcompp_bot2

4878 transp_pred_comp_less_eq ~> transp_relcompp_less_eq

4879 pred_comp_mono ~> relcompp_mono

4880 pred_comp_distrib ~> relcompp_distrib

4881 pred_comp_distrib2 ~> relcompp_distrib2

4882 converse_pred_comp ~> converse_relcompp

4884 finite_rel_comp ~> finite_relcomp

4886 set_rel_comp ~> set_relcomp

4888 INCOMPATIBILITY.

4890 * Theory Divides: Discontinued redundant theorems about div and mod.

4891 INCOMPATIBILITY, use the corresponding generic theorems instead.

4893 DIVISION_BY_ZERO ~> div_by_0, mod_by_0

4894 zdiv_self ~> div_self

4895 zmod_self ~> mod_self

4896 zdiv_zero ~> div_0

4897 zmod_zero ~> mod_0

4898 zdiv_zmod_equality ~> div_mod_equality2

4899 zdiv_zmod_equality2 ~> div_mod_equality

4900 zmod_zdiv_trivial ~> mod_div_trivial

4901 zdiv_zminus_zminus ~> div_minus_minus

4902 zmod_zminus_zminus ~> mod_minus_minus

4903 zdiv_zminus2 ~> div_minus_right

4904 zmod_zminus2 ~> mod_minus_right

4905 zdiv_minus1_right ~> div_minus1_right

4906 zmod_minus1_right ~> mod_minus1_right

4907 zdvd_mult_div_cancel ~> dvd_mult_div_cancel

4908 zmod_zmult1_eq ~> mod_mult_right_eq

4909 zpower_zmod ~> power_mod

4910 zdvd_zmod ~> dvd_mod

4911 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd

4912 mod_mult_distrib ~> mult_mod_left

4913 mod_mult_distrib2 ~> mult_mod_right

4915 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use

4916 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.

4918 * Finite_Set.fold now qualified. INCOMPATIBILITY.

4920 * Consolidated theorem names concerning fold combinators:

4922 inf_INFI_fold_inf ~> inf_INF_fold_inf

4923 sup_SUPR_fold_sup ~> sup_SUP_fold_sup

4924 INFI_fold_inf ~> INF_fold_inf

4925 SUPR_fold_sup ~> SUP_fold_sup

4926 union_set ~> union_set_fold

4927 minus_set ~> minus_set_fold

4928 INFI_set_fold ~> INF_set_fold

4929 SUPR_set_fold ~> SUP_set_fold

4930 INF_code ~> INF_set_foldr

4931 SUP_code ~> SUP_set_foldr

4932 foldr.simps ~> foldr.simps (in point-free formulation)

4933 foldr_fold_rev ~> foldr_conv_fold

4934 foldl_fold ~> foldl_conv_fold

4935 foldr_foldr ~> foldr_conv_foldl

4936 foldl_foldr ~> foldl_conv_foldr

4937 fold_set_remdups ~> fold_set_fold_remdups

4938 fold_set ~> fold_set_fold

4939 fold1_set ~> fold1_set_fold

4941 INCOMPATIBILITY.

4943 * Dropped rarely useful theorems concerning fold combinators:

4944 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,

4945 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,

4946 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,

4947 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,

4948 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,

4949 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.

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

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

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

4953 unfolding "foldr_conv_fold" and "foldl_conv_fold".

4955 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,

4956 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,

4957 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,

4958 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding

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

4960 fold_conv_foldr and fold_rev.

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

4963 through option types.

4965 * "Transitive_Closure.ntrancl": bounded transitive closure on

4966 relations.

4968 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.

4970 * Theory Int: Discontinued many legacy theorems specific to type int.

4971 INCOMPATIBILITY, use the corresponding generic theorems instead.

4973 zminus_zminus ~> minus_minus

4974 zminus_0 ~> minus_zero

4975 zminus_zadd_distrib ~> minus_add_distrib

4976 zadd_commute ~> add_commute

4977 zadd_assoc ~> add_assoc

4978 zadd_left_commute ~> add_left_commute

4979 zadd_ac ~> add_ac

4980 zmult_ac ~> mult_ac

4981 zadd_0 ~> add_0_left

4982 zadd_0_right ~> add_0_right

4983 zadd_zminus_inverse2 ~> left_minus

4984 zmult_zminus ~> mult_minus_left

4985 zmult_commute ~> mult_commute

4986 zmult_assoc ~> mult_assoc

4987 zadd_zmult_distrib ~> left_distrib

4988 zadd_zmult_distrib2 ~> right_distrib

4989 zdiff_zmult_distrib ~> left_diff_distrib

4990 zdiff_zmult_distrib2 ~> right_diff_distrib

4991 zmult_1 ~> mult_1_left

4992 zmult_1_right ~> mult_1_right

4993 zle_refl ~> order_refl

4994 zle_trans ~> order_trans

4995 zle_antisym ~> order_antisym

4996 zle_linear ~> linorder_linear

4997 zless_linear ~> linorder_less_linear

4998 zadd_left_mono ~> add_left_mono

4999 zadd_strict_right_mono ~> add_strict_right_mono

5000 zadd_zless_mono ~> add_less_le_mono

5001 int_0_less_1 ~> zero_less_one

5002 int_0_neq_1 ~> zero_neq_one

5003 zless_le ~> less_le

5004 zpower_zadd_distrib ~> power_add

5005 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff

5006 zero_le_zpower_abs ~> zero_le_power_abs

5008 * Theory Deriv: Renamed

5010 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing

5012 * Theory Library/Multiset: Improved code generation of multisets.

5014 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets

5015 are expressed via type classes again. The special syntax

5016 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant

5017 setsum_set, which is now subsumed by Big_Operators.setsum.

5018 INCOMPATIBILITY.

5020 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,

5021 use theory HOL/Library/Nat_Bijection instead.

5023 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black

5024 trees is now inside a type class context. Names of affected

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

5026 theories working directly with raw red-black trees, adapt the names as

5027 follows:

5029 Operations:

5030 bulkload -> rbt_bulkload

5031 del_from_left -> rbt_del_from_left

5032 del_from_right -> rbt_del_from_right

5033 del -> rbt_del

5034 delete -> rbt_delete

5035 ins -> rbt_ins

5036 insert -> rbt_insert

5037 insertw -> rbt_insert_with

5038 insert_with_key -> rbt_insert_with_key

5039 map_entry -> rbt_map_entry

5040 lookup -> rbt_lookup

5041 sorted -> rbt_sorted

5042 tree_greater -> rbt_greater

5043 tree_less -> rbt_less

5044 tree_less_symbol -> rbt_less_symbol

5045 union -> rbt_union

5046 union_with -> rbt_union_with

5047 union_with_key -> rbt_union_with_key

5049 Lemmas:

5050 balance_left_sorted -> balance_left_rbt_sorted

5051 balance_left_tree_greater -> balance_left_rbt_greater

5052 balance_left_tree_less -> balance_left_rbt_less

5053 balance_right_sorted -> balance_right_rbt_sorted

5054 balance_right_tree_greater -> balance_right_rbt_greater

5055 balance_right_tree_less -> balance_right_rbt_less

5056 balance_sorted -> balance_rbt_sorted

5057 balance_tree_greater -> balance_rbt_greater

5058 balance_tree_less -> balance_rbt_less

5059 bulkload_is_rbt -> rbt_bulkload_is_rbt

5060 combine_sorted -> combine_rbt_sorted

5061 combine_tree_greater -> combine_rbt_greater

5062 combine_tree_less -> combine_rbt_less

5063 delete_in_tree -> rbt_delete_in_tree

5064 delete_is_rbt -> rbt_delete_is_rbt

5065 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater

5066 del_from_left_tree_less -> rbt_del_from_left_rbt_less

5067 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater

5068 del_from_right_tree_less -> rbt_del_from_right_rbt_less

5069 del_in_tree -> rbt_del_in_tree

5070 del_inv1_inv2 -> rbt_del_inv1_inv2

5071 del_sorted -> rbt_del_rbt_sorted

5072 del_tree_greater -> rbt_del_rbt_greater

5073 del_tree_less -> rbt_del_rbt_less

5074 dom_lookup_Branch -> dom_rbt_lookup_Branch

5075 entries_lookup -> entries_rbt_lookup

5076 finite_dom_lookup -> finite_dom_rbt_lookup

5077 insert_sorted -> rbt_insert_rbt_sorted

5078 insertw_is_rbt -> rbt_insertw_is_rbt

5079 insertwk_is_rbt -> rbt_insertwk_is_rbt

5080 insertwk_sorted -> rbt_insertwk_rbt_sorted

5081 insertw_sorted -> rbt_insertw_rbt_sorted

5082 ins_sorted -> ins_rbt_sorted

5083 ins_tree_greater -> ins_rbt_greater

5084 ins_tree_less -> ins_rbt_less

5085 is_rbt_sorted -> is_rbt_rbt_sorted

5086 lookup_balance -> rbt_lookup_balance

5087 lookup_bulkload -> rbt_lookup_rbt_bulkload

5088 lookup_delete -> rbt_lookup_rbt_delete

5089 lookup_Empty -> rbt_lookup_Empty

5090 lookup_from_in_tree -> rbt_lookup_from_in_tree

5091 lookup_in_tree -> rbt_lookup_in_tree

5092 lookup_ins -> rbt_lookup_ins

5093 lookup_insert -> rbt_lookup_rbt_insert

5094 lookup_insertw -> rbt_lookup_rbt_insertw

5095 lookup_insertwk -> rbt_lookup_rbt_insertwk

5096 lookup_keys -> rbt_lookup_keys

5097 lookup_map -> rbt_lookup_map

5098 lookup_map_entry -> rbt_lookup_rbt_map_entry

5099 lookup_tree_greater -> rbt_lookup_rbt_greater

5100 lookup_tree_less -> rbt_lookup_rbt_less

5101 lookup_union -> rbt_lookup_rbt_union

5102 map_entry_color_of -> rbt_map_entry_color_of

5103 map_entry_inv1 -> rbt_map_entry_inv1

5104 map_entry_inv2 -> rbt_map_entry_inv2

5105 map_entry_is_rbt -> rbt_map_entry_is_rbt

5106 map_entry_sorted -> rbt_map_entry_rbt_sorted

5107 map_entry_tree_greater -> rbt_map_entry_rbt_greater

5108 map_entry_tree_less -> rbt_map_entry_rbt_less

5109 map_tree_greater -> map_rbt_greater

5110 map_tree_less -> map_rbt_less

5111 map_sorted -> map_rbt_sorted

5112 paint_sorted -> paint_rbt_sorted

5113 paint_lookup -> paint_rbt_lookup

5114 paint_tree_greater -> paint_rbt_greater

5115 paint_tree_less -> paint_rbt_less

5116 sorted_entries -> rbt_sorted_entries

5117 tree_greater_eq_trans -> rbt_greater_eq_trans

5118 tree_greater_nit -> rbt_greater_nit

5119 tree_greater_prop -> rbt_greater_prop

5120 tree_greater_simps -> rbt_greater_simps

5121 tree_greater_trans -> rbt_greater_trans

5122 tree_less_eq_trans -> rbt_less_eq_trans

5123 tree_less_nit -> rbt_less_nit

5124 tree_less_prop -> rbt_less_prop

5125 tree_less_simps -> rbt_less_simps

5126 tree_less_trans -> rbt_less_trans

5127 tree_ord_props -> rbt_ord_props

5128 union_Branch -> rbt_union_Branch

5129 union_is_rbt -> rbt_union_is_rbt

5130 unionw_is_rbt -> rbt_unionw_is_rbt

5131 unionwk_is_rbt -> rbt_unionwk_is_rbt

5132 unionwk_sorted -> rbt_unionwk_rbt_sorted

5134 * Theory HOL/Library/Float: Floating point numbers are now defined as

5135 a subset of the real numbers. All operations are defined using the

5136 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.

5138 Changed Operations:

5139 float_abs -> abs

5140 float_nprt -> nprt

5141 float_pprt -> pprt

5142 pow2 -> use powr

5143 round_down -> float_round_down

5144 round_up -> float_round_up

5145 scale -> exponent

5147 Removed Operations:

5148 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod

5150 Renamed Lemmas:

5151 abs_float_def -> Float.compute_float_abs

5152 bitlen_ge0 -> bitlen_nonneg

5153 bitlen.simps -> Float.compute_bitlen

5154 float_components -> Float_mantissa_exponent

5155 float_divl.simps -> Float.compute_float_divl

5156 float_divr.simps -> Float.compute_float_divr

5157 float_eq_odd -> mult_powr_eq_mult_powr_iff

5158 float_power -> real_of_float_power

5159 lapprox_posrat_def -> Float.compute_lapprox_posrat

5160 lapprox_rat.simps -> Float.compute_lapprox_rat

5161 le_float_def' -> Float.compute_float_le

5162 le_float_def -> less_eq_float.rep_eq

5163 less_float_def' -> Float.compute_float_less

5164 less_float_def -> less_float.rep_eq

5165 normfloat_def -> Float.compute_normfloat

5166 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0

5167 normfloat -> normfloat_def

5168 normfloat_unique -> use normfloat_def

5169 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral

5170 one_float_def -> Float.compute_float_one

5171 plus_float_def -> Float.compute_float_plus

5172 rapprox_posrat_def -> Float.compute_rapprox_posrat

5173 rapprox_rat.simps -> Float.compute_rapprox_rat

5174 real_of_float_0 -> zero_float.rep_eq

5175 real_of_float_1 -> one_float.rep_eq

5176 real_of_float_abs -> abs_float.rep_eq

5177 real_of_float_add -> plus_float.rep_eq

5178 real_of_float_minus -> uminus_float.rep_eq

5179 real_of_float_mult -> times_float.rep_eq

5180 real_of_float_simp -> Float.rep_eq

5181 real_of_float_sub -> minus_float.rep_eq

5182 round_down.simps -> Float.compute_float_round_down

5183 round_up.simps -> Float.compute_float_round_up

5184 times_float_def -> Float.compute_float_times

5185 uminus_float_def -> Float.compute_float_uminus

5186 zero_float_def -> Float.compute_float_zero

5188 Lemmas not necessary anymore, use the transfer method:

5189 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,

5190 float_divr, float_le_simp, float_less1_mantissa_bound,

5191 float_less_simp, float_less_zero, float_le_zero,

5192 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,

5193 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,

5194 lapprox_rat_bottom, normalized_float, rapprox_posrat,

5195 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,

5196 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,

5197 round_up, zero_le_float, zero_less_float

5199 * New theory HOL/Library/DAList provides an abstract type for

5200 association lists with distinct keys.

5202 * Session HOL/IMP: Added new theory of abstract interpretation of

5203 annotated commands.

5205 * Session HOL-Import: Re-implementation from scratch is faster,

5206 simpler, and more scalable. Requires a proof bundle, which is

5207 available as an external component. Discontinued old (and mostly

5208 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.

5210 * Session HOL-Word: Discontinued many redundant theorems specific to

5211 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems

5212 instead.

5214 word_sub_alt ~> word_sub_wi

5215 word_add_alt ~> word_add_def

5216 word_mult_alt ~> word_mult_def

5217 word_minus_alt ~> word_minus_def

5218 word_0_alt ~> word_0_wi

5219 word_1_alt ~> word_1_wi

5220 word_add_0 ~> add_0_left

5221 word_add_0_right ~> add_0_right

5222 word_mult_1 ~> mult_1_left

5223 word_mult_1_right ~> mult_1_right

5224 word_add_commute ~> add_commute

5225 word_add_assoc ~> add_assoc

5226 word_add_left_commute ~> add_left_commute

5227 word_mult_commute ~> mult_commute

5228 word_mult_assoc ~> mult_assoc

5229 word_mult_left_commute ~> mult_left_commute

5230 word_left_distrib ~> left_distrib

5231 word_right_distrib ~> right_distrib

5232 word_left_minus ~> left_minus

5233 word_diff_0_right ~> diff_0_right

5234 word_diff_self ~> diff_self

5235 word_sub_def ~> diff_minus

5236 word_diff_minus ~> diff_minus

5237 word_add_ac ~> add_ac

5238 word_mult_ac ~> mult_ac

5239 word_plus_ac0 ~> add_0_left add_0_right add_ac

5240 word_times_ac1 ~> mult_1_left mult_1_right mult_ac

5241 word_order_trans ~> order_trans

5242 word_order_refl ~> order_refl

5243 word_order_antisym ~> order_antisym

5244 word_order_linear ~> linorder_linear

5245 lenw1_zero_neq_one ~> zero_neq_one

5246 word_number_of_eq ~> number_of_eq

5247 word_of_int_add_hom ~> wi_hom_add

5248 word_of_int_sub_hom ~> wi_hom_sub

5249 word_of_int_mult_hom ~> wi_hom_mult

5250 word_of_int_minus_hom ~> wi_hom_neg

5251 word_of_int_succ_hom ~> wi_hom_succ

5252 word_of_int_pred_hom ~> wi_hom_pred

5253 word_of_int_0_hom ~> word_0_wi

5254 word_of_int_1_hom ~> word_1_wi

5256 * Session HOL-Word: New proof method "word_bitwise" for splitting

5257 machine word equalities and inequalities into logical circuits,

5258 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,

5259 multiplication, shifting by constants, bitwise operators and numeric

5260 constants. Requires fixed-length word types, not 'a word. Solves

5261 many standard word identities outright and converts more into first

5262 order problems amenable to blast or similar. See also examples in

5263 HOL/Word/Examples/WordExamples.thy.

5265 * Session HOL-Probability: Introduced the type "'a measure" to

5266 represent measures, this replaces the records 'a algebra and 'a

5267 measure_space. The locales based on subset_class now have two

5268 locale-parameters the space \<Omega> and the set of measurable sets M.

5269 The product of probability spaces uses now the same constant as the

5270 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)

5271 measure". Most constants are defined now outside of locales and gain

5272 an additional parameter, like null_sets, almost_eventually or \<mu>'.

5273 Measure space constructions for distributions and densities now got

5274 their own constants distr and density. Instead of using locales to

5275 describe measure spaces with a finite space, the measure count_space

5276 and point_measure is introduced. INCOMPATIBILITY.

5278 Renamed constants:

5279 measure -> emeasure

5280 finite_measure.\<mu>' -> measure

5281 product_algebra_generator -> prod_algebra

5282 product_prob_space.emb -> prod_emb

5283 product_prob_space.infprod_algebra -> PiM

5285 Removed locales:

5286 completeable_measure_space

5287 finite_measure_space

5288 finite_prob_space

5289 finite_product_finite_prob_space

5290 finite_product_sigma_algebra

5291 finite_sigma_algebra

5292 measure_space

5293 pair_finite_prob_space

5294 pair_finite_sigma_algebra

5295 pair_finite_space

5296 pair_sigma_algebra

5297 product_sigma_algebra

5299 Removed constants:

5300 conditional_space

5301 distribution -> use distr measure, or distributed predicate

5302 image_space

5303 joint_distribution -> use distr measure, or distributed predicate

5304 pair_measure_generator

5305 product_prob_space.infprod_algebra -> use PiM

5306 subvimage

5308 Replacement theorems:

5309 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite

5310 finite_measure.empty_measure -> measure_empty

5311 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq

5312 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq

5313 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably

5314 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure

5315 finite_measure.finite_measure -> finite_measure.emeasure_finite

5316 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton

5317 finite_measure.positive_measure' -> measure_nonneg

5318 finite_measure.real_measure -> finite_measure.emeasure_real

5319 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb

5320 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite

5321 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty

5322 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed

5323 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple

5324 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple

5325 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple

5326 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple

5327 information_space.entropy_commute -> information_space.entropy_commute_simple

5328 information_space.entropy_eq -> information_space.entropy_simple_distributed

5329 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed

5330 information_space.entropy_positive -> information_space.entropy_nonneg_simple

5331 information_space.entropy_uniform_max -> information_space.entropy_uniform

5332 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq

5333 information_space.KL_eq_0 -> information_space.KL_same_eq_0

5334 information_space.KL_ge_0 -> information_space.KL_nonneg

5335 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed

5336 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple

5337 Int_stable_cuboids -> Int_stable_atLeastAtMost

5338 Int_stable_product_algebra_generator -> positive_integral

5339 measure_preserving -> equality "distr M N f = N" "f : measurable M N"

5340 measure_space.additive -> emeasure_additive

5341 measure_space.AE_iff_null_set -> AE_iff_null

5342 measure_space.almost_everywhere_def -> eventually_ae_filter

5343 measure_space.almost_everywhere_vimage -> AE_distrD

5344 measure_space.continuity_from_above -> INF_emeasure_decseq

5345 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq

5346 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq

5347 measure_space.continuity_from_below -> SUP_emeasure_incseq

5348 measure_space_density -> emeasure_density

5349 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density

5350 measure_space.integrable_vimage -> integrable_distr

5351 measure_space.integral_translated_density -> integral_density

5352 measure_space.integral_vimage -> integral_distr

5353 measure_space.measure_additive -> plus_emeasure

5354 measure_space.measure_compl -> emeasure_compl

5355 measure_space.measure_countable_increasing -> emeasure_countable_increasing

5356 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably

5357 measure_space.measure_decseq -> decseq_emeasure

5358 measure_space.measure_Diff -> emeasure_Diff

5359 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set

5360 measure_space.measure_eq_0 -> emeasure_eq_0

5361 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite

5362 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton

5363 measure_space.measure_incseq -> incseq_emeasure

5364 measure_space.measure_insert -> emeasure_insert

5365 measure_space.measure_mono -> emeasure_mono

5366 measure_space.measure_not_negative -> emeasure_not_MInf

5367 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq

5368 measure_space.measure_setsum -> setsum_emeasure

5369 measure_space.measure_setsum_split -> setsum_emeasure_cover

5370 measure_space.measure_space_vimage -> emeasure_distr

5371 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite

5372 measure_space.measure_subadditive -> subadditive

5373 measure_space.measure_top -> emeasure_space

5374 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0

5375 measure_space.measure_Un_null_set -> emeasure_Un_null_set

5376 measure_space.positive_integral_translated_density -> positive_integral_density

5377 measure_space.positive_integral_vimage -> positive_integral_distr

5378 measure_space.real_continuity_from_above -> Lim_measure_decseq

5379 measure_space.real_continuity_from_below -> Lim_measure_incseq

5380 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably

5381 measure_space.real_measure_Diff -> measure_Diff

5382 measure_space.real_measure_finite_Union -> measure_finite_Union

5383 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton

5384 measure_space.real_measure_subadditive -> measure_subadditive

5385 measure_space.real_measure_Union -> measure_Union

5386 measure_space.real_measure_UNION -> measure_UNION

5387 measure_space.simple_function_vimage -> simple_function_comp

5388 measure_space.simple_integral_vimage -> simple_integral_distr

5389 measure_space.simple_integral_vimage -> simple_integral_distr

5390 measure_unique_Int_stable -> measure_eqI_generator_eq

5391 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq

5392 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1

5393 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2

5394 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1

5395 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2

5396 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff

5397 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap

5398 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'

5399 pair_sigma_algebra.sets_swap -> sets_pair_swap

5400 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1

5401 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2

5402 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap

5403 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2

5404 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt

5405 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times

5406 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM

5407 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq

5408 prob_space.measure_space_1 -> prob_space.emeasure_space_1

5409 prob_space.prob_space_vimage -> prob_space_distr

5410 prob_space.random_variable_restrict -> measurable_restrict

5411 prob_space_unique_Int_stable -> measure_eqI_prob_space

5412 product_algebraE -> prod_algebraE_all

5413 product_algebra_generator_der -> prod_algebra_eq_finite

5414 product_algebra_generator_into_space -> prod_algebra_sets_into_space

5415 product_algebraI -> sets_PiM_I_finite

5416 product_measure_exists -> product_sigma_finite.sigma_finite

5417 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator

5418 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb

5419 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty

5420 product_prob_space.measurable_component -> measurable_component_singleton

5421 product_prob_space.measurable_emb -> measurable_prod_emb

5422 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single

5423 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton

5424 product_prob_space.measure_emb -> emeasure_prod_emb

5425 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict

5426 product_sigma_algebra.product_algebra_into_space -> space_closed

5427 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge

5428 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton

5429 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge

5430 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable

5431 sets_product_algebra -> sets_PiM

5432 sigma_algebra.measurable_sigma -> measurable_measure_of

5433 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint

5434 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr

5435 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq

5436 space_product_algebra -> space_PiM

5438 * Session HOL-TPTP: support to parse and import TPTP problems (all

5439 languages) into Isabelle/HOL.

5442 *** FOL ***

5444 * New "case_product" attribute (see HOL).

5447 *** ZF ***

5449 * Greater support for structured proofs involving induction or case

5450 analysis.

5452 * Much greater use of mathematical symbols.

5454 * Removal of many ML theorem bindings. INCOMPATIBILITY.

5457 *** ML ***

5459 * Antiquotation @{keyword "name"} produces a parser for outer syntax

5460 from a minor keyword introduced via theory header declaration.

5462 * Antiquotation @{command_spec "name"} produces the

5463 Outer_Syntax.command_spec from a major keyword introduced via theory

5464 header declaration; it can be passed to Outer_Syntax.command etc.

5466 * Local_Theory.define no longer hard-wires default theorem name

5467 "foo_def", but retains the binding as given. If that is Binding.empty

5468 / Attrib.empty_binding, the result is not registered as user-level

5469 fact. The Local_Theory.define_internal variant allows to specify a

5470 non-empty name (used for the foundation in the background theory),

5471 while omitting the fact binding in the user-context. Potential

5472 INCOMPATIBILITY for derived definitional packages: need to specify

5473 naming policy for primitive definitions more explicitly.

5475 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in

5476 conformance with similar operations in structure Term and Logic.

5478 * Antiquotation @{attributes [...]} embeds attribute source

5479 representation into the ML text, which is particularly useful with

5480 declarations like Local_Theory.note.

5482 * Structure Proof_Context follows standard naming scheme. Old

5483 ProofContext has been discontinued. INCOMPATIBILITY.

5485 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle

5486 change of semantics: update is applied to auxiliary local theory

5487 context as well.

5489 * Modernized some old-style infix operations:

5491 addeqcongs ~> Simplifier.add_eqcong

5492 deleqcongs ~> Simplifier.del_eqcong

5493 addcongs ~> Simplifier.add_cong

5494 delcongs ~> Simplifier.del_cong

5495 setmksimps ~> Simplifier.set_mksimps

5496 setmkcong ~> Simplifier.set_mkcong

5497 setmksym ~> Simplifier.set_mksym

5498 setmkeqTrue ~> Simplifier.set_mkeqTrue

5499 settermless ~> Simplifier.set_termless

5500 setsubgoaler ~> Simplifier.set_subgoaler

5501 addsplits ~> Splitter.add_split

5502 delsplits ~> Splitter.del_split

5505 *** System ***

5507 * USER_HOME settings variable points to cross-platform user home

5508 directory, which coincides with HOME on POSIX systems only. Likewise,

5509 the Isabelle path specification "~" now expands to $USER_HOME, instead

5510 of former $HOME. A different default for USER_HOME may be set

5511 explicitly in shell environment, before Isabelle settings are

5512 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where

5513 the generic user home was intended.

5515 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name

5516 notation, which is useful for the jEdit file browser, for example.

5518 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar

5519 (not just JRE).

5523 New in Isabelle2011-1 (October 2011)

5524 ------------------------------------

5526 *** General ***

5528 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as

5529 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.

5531 - Management of multiple theory files directly from the editor

5532 buffer store -- bypassing the file-system (no requirement to save

5533 files for checking).

5535 - Markup of formal entities within the text buffer, with semantic

5536 highlighting, tooltips and hyperlinks to jump to defining source

5537 positions.

5539 - Improved text rendering, with sub/superscripts in the source

5540 buffer (including support for copy/paste wrt. output panel, HTML

5541 theory output and other non-Isabelle text boxes).

5543 - Refined scheduling of proof checking and printing of results,

5544 based on interactive editor view. (Note: jEdit folding and

5545 narrowing allows to restrict buffer perspectives explicitly.)

5547 - Reduced CPU performance requirements, usable on machines with few

5548 cores.

5550 - Reduced memory requirements due to pruning of unused document

5551 versions (garbage collection).

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

5554 including some remaining limitations.

5556 * Theory loader: source files are exclusively located via the master

5557 directory of each theory node (where the .thy file itself resides).

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

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

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

5561 INCOMPATIBILITY.

5563 * Theory loader: source files are identified by content via SHA1

5564 digests. Discontinued former path/modtime identification and optional

5565 ISABELLE_FILE_IDENT plugin scripts.

5567 * Parallelization of nested Isar proofs is subject to

5568 Goal.parallel_proofs_threshold (default 100). See also isabelle

5569 usedir option -Q.

5571 * Name space: former unsynchronized references are now proper

5572 configuration options, with more conventional names:

5574 long_names ~> names_long

5575 short_names ~> names_short

5576 unique_names ~> names_unique

5578 Minor INCOMPATIBILITY, need to declare options in context like this:

5580 declare [[names_unique = false]]

5582 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note

5583 that the result needs to be unique, which means fact specifications

5584 may have to be refined after enriching a proof context.

5586 * Attribute "case_names" has been refined: the assumptions in each case

5587 can be named now by following the case name with [name1 name2 ...].

5589 * Isabelle/Isar reference manual has been updated and extended:

5590 - "Synopsis" provides a catalog of main Isar language concepts.

5591 - Formal references in syntax diagrams, via @{rail} antiquotation.

5592 - Updated material from classic "ref" manual, notably about

5593 "Classical Reasoner".

5596 *** HOL ***

5598 * Class bot and top require underlying partial order rather than

5599 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.

5601 * Class complete_lattice: generalized a couple of lemmas from sets;

5602 generalized theorems INF_cong and SUP_cong. New type classes for

5603 complete boolean algebras and complete linear orders. Lemmas

5604 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in

5605 class complete_linorder.

5607 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,

5608 Sup_fun_def, Inf_apply, Sup_apply.

5610 Removed redundant lemmas (the right hand side gives hints how to

5611 replace them for (metis ...), or (simp only: ...) proofs):

5613 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]

5614 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]

5615 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right

5616 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right

5617 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right

5618 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right

5619 Inter_def ~> INF_def, image_def

5620 Union_def ~> SUP_def, image_def

5621 INT_eq ~> INF_def, and image_def

5622 UN_eq ~> SUP_def, and image_def

5623 INF_subset ~> INF_superset_mono [OF _ order_refl]

5625 More consistent and comprehensive names:

5627 INTER_eq_Inter_image ~> INF_def

5628 UNION_eq_Union_image ~> SUP_def

5629 INFI_def ~> INF_def

5630 SUPR_def ~> SUP_def

5631 INF_leI ~> INF_lower

5632 INF_leI2 ~> INF_lower2

5633 le_INFI ~> INF_greatest

5634 le_SUPI ~> SUP_upper

5635 le_SUPI2 ~> SUP_upper2

5636 SUP_leI ~> SUP_least

5637 INFI_bool_eq ~> INF_bool_eq

5638 SUPR_bool_eq ~> SUP_bool_eq

5639 INFI_apply ~> INF_apply

5640 SUPR_apply ~> SUP_apply

5641 INTER_def ~> INTER_eq

5642 UNION_def ~> UNION_eq

5644 INCOMPATIBILITY.

5646 * Renamed theory Complete_Lattice to Complete_Lattices.

5647 INCOMPATIBILITY.

5649 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,

5650 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,

5651 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,

5652 Sup_insert are now declared as [simp]. INCOMPATIBILITY.

5654 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,

5655 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,

5656 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor

5657 INCOMPATIBILITY.

5659 * Added syntactic classes "inf" and "sup" for the respective

5660 constants. INCOMPATIBILITY: Changes in the argument order of the

5661 (mostly internal) locale predicates for some derived classes.

5663 * Theorem collections ball_simps and bex_simps do not contain theorems

5664 referring to UNION any longer; these have been moved to collection

5665 UN_ball_bex_simps. INCOMPATIBILITY.

5667 * Theory Archimedean_Field: floor now is defined as parameter of a

5668 separate type class floor_ceiling.

5670 * Theory Finite_Set: more coherent development of fold_set locales:

5672 locale fun_left_comm ~> locale comp_fun_commute

5673 locale fun_left_comm_idem ~> locale comp_fun_idem

5675 Both use point-free characterization; interpretation proofs may need

5676 adjustment. INCOMPATIBILITY.

5678 * Theory Limits: Type "'a net" has been renamed to "'a filter", in

5679 accordance with standard mathematical terminology. INCOMPATIBILITY.

5681 * Theory Complex_Main: The locale interpretations for the

5682 bounded_linear and bounded_bilinear locales have been removed, in

5683 order to reduce the number of duplicate lemmas. Users must use the

5684 original names for distributivity theorems, potential INCOMPATIBILITY.

5686 divide.add ~> add_divide_distrib

5687 divide.diff ~> diff_divide_distrib

5688 divide.setsum ~> setsum_divide_distrib

5689 mult.add_right ~> right_distrib

5690 mult.diff_right ~> right_diff_distrib

5691 mult_right.setsum ~> setsum_right_distrib

5692 mult_left.diff ~> left_diff_distrib

5694 * Theory Complex_Main: Several redundant theorems have been removed or

5695 replaced by more general versions. INCOMPATIBILITY.

5697 real_diff_def ~> minus_real_def

5698 real_divide_def ~> divide_real_def

5699 real_less_def ~> less_le

5700 real_abs_def ~> abs_real_def

5701 real_sgn_def ~> sgn_real_def

5702 real_mult_commute ~> mult_commute

5703 real_mult_assoc ~> mult_assoc

5704 real_mult_1 ~> mult_1_left

5705 real_add_mult_distrib ~> left_distrib

5706 real_zero_not_eq_one ~> zero_neq_one

5707 real_mult_inverse_left ~> left_inverse

5708 INVERSE_ZERO ~> inverse_zero

5709 real_le_refl ~> order_refl

5710 real_le_antisym ~> order_antisym

5711 real_le_trans ~> order_trans

5712 real_le_linear ~> linear

5713 real_le_eq_diff ~> le_iff_diff_le_0

5714 real_add_left_mono ~> add_left_mono

5715 real_mult_order ~> mult_pos_pos

5716 real_mult_less_mono2 ~> mult_strict_left_mono

5717 real_of_int_real_of_nat ~> real_of_int_of_nat_eq

5718 real_0_le_divide_iff ~> zero_le_divide_iff

5719 realpow_two_disj ~> power2_eq_iff

5720 real_squared_diff_one_factored ~> square_diff_one_factored

5721 realpow_two_diff ~> square_diff_square_factored

5722 reals_complete2 ~> complete_real

5723 real_sum_squared_expand ~> power2_sum

5724 exp_ln_eq ~> ln_unique

5725 expi_add ~> exp_add

5726 expi_zero ~> exp_zero

5727 lemma_DERIV_subst ~> DERIV_cong

5728 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff

5729 LIMSEQ_const ~> tendsto_const

5730 LIMSEQ_norm ~> tendsto_norm

5731 LIMSEQ_add ~> tendsto_add

5732 LIMSEQ_minus ~> tendsto_minus

5733 LIMSEQ_minus_cancel ~> tendsto_minus_cancel

5734 LIMSEQ_diff ~> tendsto_diff

5735 bounded_linear.LIMSEQ ~> bounded_linear.tendsto

5736 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto

5737 LIMSEQ_mult ~> tendsto_mult

5738 LIMSEQ_inverse ~> tendsto_inverse

5739 LIMSEQ_divide ~> tendsto_divide

5740 LIMSEQ_pow ~> tendsto_power

5741 LIMSEQ_setsum ~> tendsto_setsum

5742 LIMSEQ_setprod ~> tendsto_setprod

5743 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff

5744 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff

5745 LIMSEQ_imp_rabs ~> tendsto_rabs

5746 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]

5747 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]

5748 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]

5749 LIMSEQ_Complex ~> tendsto_Complex

5750 LIM_ident ~> tendsto_ident_at

5751 LIM_const ~> tendsto_const

5752 LIM_add ~> tendsto_add

5753 LIM_add_zero ~> tendsto_add_zero

5754 LIM_minus ~> tendsto_minus

5755 LIM_diff ~> tendsto_diff

5756 LIM_norm ~> tendsto_norm

5757 LIM_norm_zero ~> tendsto_norm_zero

5758 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel

5759 LIM_norm_zero_iff ~> tendsto_norm_zero_iff

5760 LIM_rabs ~> tendsto_rabs

5761 LIM_rabs_zero ~> tendsto_rabs_zero

5762 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel

5763 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff

5764 LIM_compose ~> tendsto_compose

5765 LIM_mult ~> tendsto_mult

5766 LIM_scaleR ~> tendsto_scaleR

5767 LIM_of_real ~> tendsto_of_real

5768 LIM_power ~> tendsto_power

5769 LIM_inverse ~> tendsto_inverse

5770 LIM_sgn ~> tendsto_sgn

5771 isCont_LIM_compose ~> isCont_tendsto_compose

5772 bounded_linear.LIM ~> bounded_linear.tendsto

5773 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero

5774 bounded_bilinear.LIM ~> bounded_bilinear.tendsto

5775 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero

5776 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero

5777 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero

5778 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]

5780 * Theory Complex_Main: The definition of infinite series was

5781 generalized. Now it is defined on the type class {topological_space,

5782 comm_monoid_add}. Hence it is useable also for extended real numbers.

5784 * Theory Complex_Main: The complex exponential function "expi" is now

5785 a type-constrained abbreviation for "exp :: complex => complex"; thus

5786 several polymorphic lemmas about "exp" are now applicable to "expi".

5788 * Code generation:

5790 - Theory Library/Code_Char_ord provides native ordering of

5791 characters in the target language.

5793 - Commands code_module and code_library are legacy, use export_code

5794 instead.

5796 - Method "evaluation" is legacy, use method "eval" instead.

5798 - Legacy evaluator "SML" is deactivated by default. May be

5799 reactivated by the following theory command:

5801 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}

5803 * Declare ext [intro] by default. Rare INCOMPATIBILITY.

5805 * New proof method "induction" that gives induction hypotheses the

5806 name "IH", thus distinguishing them from further hypotheses that come

5807 from rule induction. The latter are still called "hyps". Method

5808 "induction" is a thin wrapper around "induct" and follows the same

5809 syntax.

5811 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is

5812 still available as a legacy feature for some time.

5814 * Nitpick:

5815 - Added "need" and "total_consts" options.

5816 - Reintroduced "show_skolems" option by popular demand.

5817 - Renamed attribute: nitpick_def ~> nitpick_unfold.

5818 INCOMPATIBILITY.

5820 * Sledgehammer:

5821 - Use quasi-sound (and efficient) translations by default.

5822 - Added support for the following provers: E-ToFoF, LEO-II,

5823 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.

5824 - Automatically preplay and minimize proofs before showing them if

5825 this can be done within reasonable time.

5826 - sledgehammer available_provers ~> sledgehammer supported_provers.

5827 INCOMPATIBILITY.

5828 - Added "preplay_timeout", "slicing", "type_enc", "sound",

5829 "max_mono_iters", and "max_new_mono_instances" options.

5830 - Removed "explicit_apply" and "full_types" options as well as "Full

5831 Types" Proof General menu item. INCOMPATIBILITY.

5833 * Metis:

5834 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.

5835 - Obsoleted "metisFT" -- use "metis (full_types)" instead.

5836 INCOMPATIBILITY.

5838 * Command 'try':

5839 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and

5840 "elim:" options. INCOMPATIBILITY.

5841 - Introduced 'try' that not only runs 'try_methods' but also

5842 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.

5844 * Quickcheck:

5845 - Added "eval" option to evaluate terms for the found counterexample

5846 (currently only supported by the default (exhaustive) tester).

5847 - Added post-processing of terms to obtain readable counterexamples

5848 (currently only supported by the default (exhaustive) tester).

5849 - New counterexample generator quickcheck[narrowing] enables

5850 narrowing-based testing. Requires the Glasgow Haskell compiler

5851 with its installation location defined in the Isabelle settings

5852 environment as ISABELLE_GHC.

5853 - Removed quickcheck tester "SML" based on the SML code generator

5854 (formly in HOL/Library).

5856 * Function package: discontinued option "tailrec". INCOMPATIBILITY,

5857 use 'partial_function' instead.

5859 * Theory Library/Extended_Reals replaces now the positive extended

5860 reals found in probability theory. This file is extended by

5861 Multivariate_Analysis/Extended_Real_Limits.

5863 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,

5864 from where it must be imported explicitly if it is really required.

5865 INCOMPATIBILITY.

5867 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has

5868 been moved here. INCOMPATIBILITY.

5870 * Theory Library/Saturated provides type of numbers with saturated

5871 arithmetic.

5873 * Theory Library/Product_Lattice defines a pointwise ordering for the

5874 product type 'a * 'b, and provides instance proofs for various order

5875 and lattice type classes.

5877 * Theory Library/Countable now provides the "countable_datatype" proof

5878 method for proving "countable" class instances for datatypes.

5880 * Theory Library/Cset_Monad allows do notation for computable sets

5881 (cset) via the generic monad ad-hoc overloading facility.

5883 * Library: Theories of common data structures are split into theories

5884 for implementation, an invariant-ensuring type, and connection to an

5885 abstract type. INCOMPATIBILITY.

5887 - RBT is split into RBT and RBT_Mapping.

5888 - AssocList is split and renamed into AList and AList_Mapping.

5889 - DList is split into DList_Impl, DList, and DList_Cset.

5890 - Cset is split into Cset and List_Cset.

5892 * Theory Library/Nat_Infinity has been renamed to

5893 Library/Extended_Nat, with name changes of the following types and

5894 constants:

5896 type inat ~> type enat

5897 Fin ~> enat

5898 Infty ~> infinity (overloaded)

5899 iSuc ~> eSuc

5900 the_Fin ~> the_enat

5902 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has

5903 been renamed accordingly. INCOMPATIBILITY.

5905 * Session Multivariate_Analysis: The euclidean_space type class now

5906 fixes a constant "Basis :: 'a set" consisting of the standard

5907 orthonormal basis for the type. Users now have the option of

5908 quantifying over this set instead of using the "basis" function, e.g.

5909 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".

5911 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed

5912 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants

5913 "Cart_nth" and "Cart_lambda" have been respectively renamed to

5914 "vec_nth" and "vec_lambda"; theorems mentioning those names have

5915 changed to match. Definition theorems for overloaded constants now use

5916 the standard "foo_vec_def" naming scheme. A few other theorems have

5917 been renamed as follows (INCOMPATIBILITY):

5919 Cart_eq ~> vec_eq_iff

5920 dist_nth_le_cart ~> dist_vec_nth_le

5921 tendsto_vector ~> vec_tendstoI

5922 Cauchy_vector ~> vec_CauchyI

5924 * Session Multivariate_Analysis: Several duplicate theorems have been

5925 removed, and other theorems have been renamed or replaced with more

5926 general versions. INCOMPATIBILITY.

5928 finite_choice ~> finite_set_choice

5929 eventually_conjI ~> eventually_conj

5930 eventually_and ~> eventually_conj_iff

5931 eventually_false ~> eventually_False

5932 setsum_norm ~> norm_setsum

5933 Lim_sequentially ~> LIMSEQ_def

5934 Lim_ident_at ~> LIM_ident

5935 Lim_const ~> tendsto_const

5936 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]

5937 Lim_neg ~> tendsto_minus

5938 Lim_add ~> tendsto_add

5939 Lim_sub ~> tendsto_diff

5940 Lim_mul ~> tendsto_scaleR

5941 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]

5942 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]

5943 Lim_linear ~> bounded_linear.tendsto

5944 Lim_component ~> tendsto_euclidean_component

5945 Lim_component_cart ~> tendsto_vec_nth

5946 Lim_inner ~> tendsto_inner [OF tendsto_const]

5947 dot_lsum ~> inner_setsum_left

5948 dot_rsum ~> inner_setsum_right

5949 continuous_cmul ~> continuous_scaleR [OF continuous_const]

5950 continuous_neg ~> continuous_minus

5951 continuous_sub ~> continuous_diff

5952 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]

5953 continuous_mul ~> continuous_scaleR

5954 continuous_inv ~> continuous_inverse

5955 continuous_at_within_inv ~> continuous_at_within_inverse

5956 continuous_at_inv ~> continuous_at_inverse

5957 continuous_at_norm ~> continuous_norm [OF continuous_at_id]

5958 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]

5959 continuous_at_component ~> continuous_component [OF continuous_at_id]

5960 continuous_on_neg ~> continuous_on_minus

5961 continuous_on_sub ~> continuous_on_diff

5962 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]

5963 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]

5964 continuous_on_mul ~> continuous_on_scaleR

5965 continuous_on_mul_real ~> continuous_on_mult

5966 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]

5967 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]

5968 continuous_on_inverse ~> continuous_on_inv

5969 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus

5970 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff

5971 subset_interior ~> interior_mono

5972 subset_closure ~> closure_mono

5973 closure_univ ~> closure_UNIV

5974 real_arch_lt ~> reals_Archimedean2

5975 real_arch ~> reals_Archimedean3

5976 real_abs_norm ~> abs_norm_cancel

5977 real_abs_sub_norm ~> norm_triangle_ineq3

5978 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2

5980 * Session HOL-Probability:

5981 - Caratheodory's extension lemma is now proved for ring_of_sets.

5982 - Infinite products of probability measures are now available.

5983 - Sigma closure is independent, if the generator is independent

5984 - Use extended reals instead of positive extended

5985 reals. INCOMPATIBILITY.

5987 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.

5989 expand_fun_below ~> fun_below_iff

5990 below_fun_ext ~> fun_belowI

5991 expand_cfun_eq ~> cfun_eq_iff

5992 ext_cfun ~> cfun_eqI

5993 expand_cfun_below ~> cfun_below_iff

5994 below_cfun_ext ~> cfun_belowI

5995 monofun_fun_fun ~> fun_belowD

5996 monofun_fun_arg ~> monofunE

5997 monofun_lub_fun ~> adm_monofun [THEN admD]

5998 cont_lub_fun ~> adm_cont [THEN admD]

5999 cont2cont_Rep_CFun ~> cont2cont_APP

6000 cont_Rep_CFun_app ~> cont_APP_app

6001 cont_Rep_CFun_app_app ~> cont_APP_app_app

6002 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]

6003 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]

6004 contlub_cfun ~> lub_APP [symmetric]

6005 contlub_LAM ~> lub_LAM [symmetric]

6006 thelubI ~> lub_eqI

6007 UU_I ~> bottomI

6008 lift_distinct1 ~> lift.distinct(1)

6009 lift_distinct2 ~> lift.distinct(2)

6010 Def_not_UU ~> lift.distinct(2)

6011 Def_inject ~> lift.inject

6012 below_UU_iff ~> below_bottom_iff

6013 eq_UU_iff ~> eq_bottom_iff

6016 *** Document preparation ***

6018 * Antiquotation @{rail} layouts railroad syntax diagrams, see also

6019 isar-ref manual, both for description and actual application of the

6020 same.

6022 * Antiquotation @{value} evaluates the given term and presents its

6023 result.

6025 * Antiquotations: term style "isub" provides ad-hoc conversion of

6026 variables x1, y23 into subscripted form x\<^isub>1,

6027 y\<^isub>2\<^isub>3.

6029 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>

6030 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).

6032 * Localized \isabellestyle switch can be used within blocks or groups

6033 like this:

6035 \isabellestyle{it} %preferred default

6036 {\isabellestylett @{text "typewriter stuff"}}

6038 * Discontinued special treatment of hard tabulators. Implicit

6039 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual

6040 layouts.

6043 *** ML ***

6045 * The inner syntax of sort/type/term/prop supports inlined YXML

6046 representations within quoted string tokens. By encoding logical

6047 entities via Term_XML (in ML or Scala) concrete syntax can be

6048 bypassed, which is particularly useful for producing bits of text

6049 under external program control.

6051 * Antiquotations for ML and document preparation are managed as theory

6052 data, which requires explicit setup.

6054 * Isabelle_Process.is_active allows tools to check if the official

6055 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop

6056 (better known as Proof General).

6058 * Structure Proof_Context follows standard naming scheme. Old

6059 ProofContext is still available for some time as legacy alias.

6061 * Structure Timing provides various operations for timing; supersedes

6062 former start_timing/end_timing etc.

6064 * Path.print is the official way to show file-system paths to users

6065 (including quotes etc.).

6067 * Inner syntax: identifiers in parse trees of generic categories

6068 "logic", "aprop", "idt" etc. carry position information (disguised as

6069 type constraints). Occasional INCOMPATIBILITY with non-compliant

6070 translations that choke on unexpected type constraints. Positions can

6071 be stripped in ML translations via Syntax.strip_positions /

6072 Syntax.strip_positions_ast, or via the syntax constant

6073 "_strip_positions" within parse trees. As last resort, positions can

6074 be disabled via the configuration option Syntax.positions, which is

6075 called "syntax_positions" in Isar attribute syntax.

6077 * Discontinued special status of various ML structures that contribute

6078 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less

6079 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,

6080 refer directly to Ast.Constant, Lexicon.is_identifier,

6081 Syntax_Trans.mk_binder_tr etc.

6083 * Typed print translation: discontinued show_sorts argument, which is

6084 already available via context of "advanced" translation.

6086 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic

6087 goal states; body tactic needs to address all subgoals uniformly.

6089 * Slightly more special eq_list/eq_set, with shortcut involving

6090 pointer equality (assumes that eq relation is reflexive).

6092 * Classical tactics use proper Proof.context instead of historic types

6093 claset/clasimpset. Old-style declarations like addIs, addEs, addDs

6094 operate directly on Proof.context. Raw type claset retains its use as

6095 snapshot of the classical context, which can be recovered via

6096 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.

6097 INCOMPATIBILITY, classical tactics and derived proof methods require

6098 proper Proof.context.

6101 *** System ***

6103 * Discontinued support for Poly/ML 5.2, which was the last version

6104 without proper multithreading and TimeLimit implementation.

6106 * Discontinued old lib/scripts/polyml-platform, which has been

6107 obsolete since Isabelle2009-2.

6109 * Various optional external tools are referenced more robustly and

6110 uniformly by explicit Isabelle settings as follows:

6112 ISABELLE_CSDP (formerly CSDP_EXE)

6113 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)

6114 ISABELLE_OCAML (formerly EXEC_OCAML)

6115 ISABELLE_SWIPL (formerly EXEC_SWIPL)

6116 ISABELLE_YAP (formerly EXEC_YAP)

6118 Note that automated detection from the file-system or search path has

6119 been discontinued. INCOMPATIBILITY.

6121 * Scala layer provides JVM method invocation service for static

6122 methods of type (String)String, see Invoke_Scala.method in ML. For

6123 example:

6125 Invoke_Scala.method "java.lang.System.getProperty" "java.home"

6127 Together with YXML.string_of_body/parse_body and XML.Encode/Decode

6128 this allows to pass structured values between ML and Scala.

6130 * The IsabelleText fonts includes some further glyphs to support the

6131 Prover IDE. Potential INCOMPATIBILITY: users who happen to have

6132 installed a local copy (which is normally *not* required) need to

6133 delete or update it from ~~/lib/fonts/.

6137 New in Isabelle2011 (January 2011)

6138 ----------------------------------

6140 *** General ***

6142 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see

6143 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with

6144 useful tooltips and hyperlinks produced from its static analysis. The

6145 bundled component provides an executable Isabelle tool that can be run

6146 like this:

6148 Isabelle2011/bin/isabelle jedit

6150 * Significantly improved Isabelle/Isar implementation manual.

6152 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER

6153 (and thus refers to something like $HOME/.isabelle/Isabelle2011),

6154 while the default heap location within that directory lacks that extra

6155 suffix. This isolates multiple Isabelle installations from each

6156 other, avoiding problems with old settings in new versions.

6157 INCOMPATIBILITY, need to copy/upgrade old user settings manually.

6159 * Source files are always encoded as UTF-8, instead of old-fashioned

6160 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require

6161 the following package declarations:

6163 \usepackage[utf8]{inputenc}

6164 \usepackage{textcomp}

6166 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that

6167 a Unicode character is treated as a single symbol, not a sequence of

6168 non-ASCII bytes as before. Since Isabelle/ML string literals may

6169 contain symbols without further backslash escapes, Unicode can now be

6170 used here as well. Recall that Symbol.explode in ML provides a

6171 consistent view on symbols, while raw explode (or String.explode)

6172 merely give a byte-oriented representation.

6174 * Theory loader: source files are primarily located via the master

6175 directory of each theory node (where the .thy file itself resides).

6176 The global load path is still partially available as legacy feature.

6177 Minor INCOMPATIBILITY due to subtle change in file lookup: use

6178 explicit paths, relatively to the theory.

6180 * Special treatment of ML file names has been discontinued.

6181 Historically, optional extensions .ML or .sml were added on demand --

6182 at the cost of clarity of file dependencies. Recall that Isabelle/ML

6183 files exclusively use the .ML extension. Minor INCOMPATIBILITY.

6185 * Various options that affect pretty printing etc. are now properly

6186 handled within the context via configuration options, instead of

6187 unsynchronized references or print modes. There are both ML Config.T

6188 entities and Isar declaration attributes to access these.

6190 ML (Config.T) Isar (attribute)

6192 eta_contract eta_contract

6193 show_brackets show_brackets

6194 show_sorts show_sorts

6195 show_types show_types

6196 show_question_marks show_question_marks

6197 show_consts show_consts

6198 show_abbrevs show_abbrevs

6200 Syntax.ast_trace syntax_ast_trace

6201 Syntax.ast_stat syntax_ast_stat

6202 Syntax.ambiguity_level syntax_ambiguity_level

6204 Goal_Display.goals_limit goals_limit

6205 Goal_Display.show_main_goal show_main_goal

6207 Method.rule_trace rule_trace

6209 Thy_Output.display thy_output_display

6210 Thy_Output.quotes thy_output_quotes

6211 Thy_Output.indent thy_output_indent

6212 Thy_Output.source thy_output_source

6213 Thy_Output.break thy_output_break

6215 Note that corresponding "..._default" references in ML may only be

6216 changed globally at the ROOT session setup, but *not* within a theory.

6217 The option "show_abbrevs" supersedes the former print mode

6218 "no_abbrevs" with inverted meaning.

6220 * More systematic naming of some configuration options.

6221 INCOMPATIBILITY.

6223 trace_simp ~> simp_trace

6224 debug_simp ~> simp_debug

6226 * Support for real valued configuration options, using simplistic

6227 floating-point notation that coincides with the inner syntax for

6228 float_token.

6230 * Support for real valued preferences (with approximative PGIP type):

6231 front-ends need to accept "pgint" values in float notation.

6232 INCOMPATIBILITY.

6234 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from

6235 DejaVu Sans.

6237 * Discontinued support for Poly/ML 5.0 and 5.1 versions.

6240 *** Pure ***

6242 * Command 'type_synonym' (with single argument) replaces somewhat

6243 outdated 'types', which is still available as legacy feature for some

6244 time.

6246 * Command 'nonterminal' (with 'and' separated list of arguments)

6247 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.

6249 * Command 'notepad' replaces former 'example_proof' for

6250 experimentation in Isar without any result. INCOMPATIBILITY.

6252 * Locale interpretation commands 'interpret' and 'sublocale' accept

6253 lists of equations to map definitions in a locale to appropriate

6254 entities in the context of the interpretation. The 'interpretation'

6255 command already provided this functionality.

6257 * Diagnostic command 'print_dependencies' prints the locale instances

6258 that would be activated if the specified expression was interpreted in

6259 the current context. Variant "print_dependencies!" assumes a context

6260 without interpretations.

6262 * Diagnostic command 'print_interps' prints interpretations in proofs

6263 in addition to interpretations in theories.

6265 * Discontinued obsolete 'global' and 'local' commands to manipulate

6266 the theory name space. Rare INCOMPATIBILITY. The ML functions