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

NEWS

author | paulson <lp15@cam.ac.uk> |

Tue Dec 01 14:09:10 2015 +0000 (2015-12-01) | |

changeset 61762 | d50b993b4fb9 |

parent 61748 | fc53fbf9fe01 |

child 61766 | 507b39df1a57 |

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

Removal of redundant lemmas (diff_less_iff, diff_le_iff) and of the abbreviation Exp. Addition of some new material.

1 Isabelle NEWS -- history of user-relevant changes

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

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

7 New in this Isabelle version

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

10 *** General ***

12 * Toplevel theorem statements have been simplified as follows:

14 theorems ~> lemmas

15 schematic_lemma ~> schematic_goal

16 schematic_theorem ~> schematic_goal

17 schematic_corollary ~> schematic_goal

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

20 accordingly.

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

23 'theorem'.

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

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

27 to update old sources.

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

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

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

34 implicit: a popup will show up unconditionally.

36 * Improved scheduling for urgent print tasks (e.g. command state output,

37 interactive queries) wrt. long-running background tasks.

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

40 Isabelle/ML and official Standard ML. Configuration option "ML_debugger"

41 and commands 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',

42 'SML_file_no_debug' control compilation of sources with debugging

43 information. The Debugger panel allows to set breakpoints (via context

44 menu), step through stopped threads, evaluate local ML expressions etc.

45 At least one Debugger view needs to be active to have any effect on the

46 running ML program.

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

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

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

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

53 full document node content is taken into account.

55 * The State panel manages explicit proof state output. The jEdit action

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

57 according to cursor position.

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

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

61 enable option "editor_output_state".

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

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

65 the editor.

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

68 instead of former C+e LEFT.

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

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

72 single-instance applications seen on common GUI desktops.

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

75 application wrapper threat the default $USER_HOME/Scratch.thy more

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

77 instead.

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

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

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

84 *** Document preparation ***

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

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

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

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

90 standard Isabelle fonts provide glyphs to render important control

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

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

94 (outer syntax with command keywords etc.). This may be used in the short

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

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

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

100 documentation, with a hyperlink in the Prover IDE.

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

103 entities of the Isar language.

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

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

107 standard LaTeX macros of the same names.

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

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

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

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

113 cartouche tokens seen in theory sources.

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

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

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

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

119 or terminal spaces are ignored.

121 * HTML presentation uses the standard IsabelleText font and Unicode

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

123 print mode "HTML" loses its special meaning.

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

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

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

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

130 follows:

132 \<^item> itemize

133 \<^enum> enumerate

134 \<^descr> description

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

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

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

140 * Document antiquotations @{emph} and @{bold} output LaTeX source

141 recursively, adding appropriate text style markup. These may be used in

142 the short form \<^emph>\<open>...\<close> and \<^bold>\<open>...\<close>.

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

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

148 *** Isar ***

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

151 proof body as well, abstracted over relevant parameters.

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

154 parameter scope for of each clause.

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

157 statements: result is abstracted over unknowns.

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

160 rule statements like fixes/assumes/shows in theorem specifications, but

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

162 example:

164 have result: "C x y"

165 if "A x" and "B y"

166 for x :: 'a and y :: 'a

167 <proof>

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

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

171 corresponds to a raw proof block like this:

173 {

174 fix x :: 'a and y :: 'a

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

176 have "C x y" <proof>

177 }

178 note result = this

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

181 instead of 'assume' above.

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

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

186 assume result: "C x y"

187 if "A x" and "B y"

188 for x :: 'a and y :: 'a

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

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

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

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

195 example:

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

199 is equivalent to:

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

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

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

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

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

209 or:

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

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

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

217 * New command 'supply' supports fact definitions during goal refinement

218 ('apply' scripts).

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

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

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

223 of the local context elements yet.

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

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

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

229 then have something

230 proof cases

231 case a

232 then show ?thesis <proof>

233 next

234 case b

235 then show ?thesis <proof>

236 next

237 case c

238 then show ?thesis <proof>

239 qed

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

243 case a: (c xs)

244 case a [attributes]: (c xs)

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

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

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

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

250 and always put attributes in front.

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

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

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

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

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

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

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

260 manual.

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

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

264 example:

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

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

268 proof goal_cases

269 case (1 x)

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

271 next

272 case (2 y z)

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

274 qed

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

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

278 proof goal_cases

279 case prems: 1

280 then show ?case using prems sorry

281 next

282 case prems: 2

283 then show ?case using prems sorry

284 qed

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

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

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

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

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

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

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

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

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

297 supply [simp] = a

298 proof

299 show A by simp

300 next

301 show A by simp

302 qed

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

305 occasionally useful for demonstration and testing purposes.

308 *** Pure ***

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

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

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

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

315 * Keyword 'rewrites' identifies rewrite morphisms in interpretation

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

318 * More gentle suppression of syntax along locale morphisms while

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

320 would be suppressed for morphisms except term identity. Now

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

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

323 help when working with complex locale hierarchies, because proof

324 states are displayed much more succinctly. It also means that only

325 notation needs to be redeclared if desired, as illustrated by this

326 example:

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

329 begin

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

331 end

333 locale morphism =

334 left: struct composition + right: struct composition'

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

336 begin

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

338 end

340 * Command 'sublocale' accepts mixin definitions after keyword

341 'defines'.

343 * Command 'permanent_interpretation' is available in Pure, without

344 need to load a separate theory. Keyword 'defines' identifies

345 mixin definitions, keyword 'rewrites' identifies rewrite morphisms.

346 INCOMPATIBILITY.

348 * Command 'print_definitions' prints dependencies of definitional

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

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

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

354 * Configuration option rule_insts_schematic has been discontinued

355 (intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.

357 * Abbreviations in type classes now carry proper sort constraint.

358 Rare INCOMPATIBILITY in situations where the previous misbehaviour

359 has been exploited.

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

362 operations behave more similar to abbreviations. Potential

363 INCOMPATIBILITY in exotic situations.

366 *** HOL ***

368 * Combinator to represent case distinction on products is named "case_prod",

369 uniformly, discontinuing any input aliasses. Very popular theorem aliasses

370 have been retained.

371 Consolidated facts:

372 PairE ~> prod.exhaust

373 Pair_eq ~> prod.inject

374 pair_collapse ~> prod.collapse

375 Pair_fst_snd_eq ~> prod_eq_iff

376 split_twice ~> prod.case_distrib

377 split_weak_cong ~> prod.case_cong_weak

378 split_split ~> prod.split

379 split_split_asm ~> prod.split_asm

380 splitI ~> case_prodI

381 splitD ~> case_prodD

382 splitI2 ~> case_prodI2

383 splitI2' ~> case_prodI2'

384 splitE ~> case_prodE

385 splitE' ~> case_prodE'

386 split_pair ~> case_prod_Pair

387 split_eta ~> case_prod_eta

388 split_comp ~> case_prod_comp

389 mem_splitI ~> mem_case_prodI

390 mem_splitI2 ~> mem_case_prodI2

391 mem_splitE ~> mem_case_prodE

392 The_split ~> The_case_prod

393 cond_split_eta ~> cond_case_prod_eta

394 Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE

395 Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI

396 in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq

397 Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD

398 Collect_split_Grp_inD ~> Collect_case_prod_Grp_in

399 Domain_Collect_split ~> Domain_Collect_case_prod

400 Image_Collect_split ~> Image_Collect_case_prod

401 Range_Collect_split ~> Range_Collect_case_prod

402 Eps_split ~> Eps_case_prod

403 Eps_split_eq ~> Eps_case_prod_eq

404 split_rsp ~> case_prod_rsp

405 curry_split ~> curry_case_prod

406 split_curry ~> case_prod_curry

407 Changes in structure HOLogic:

408 split_const ~> case_prod_const

409 mk_split ~> mk_case_prod

410 mk_psplits ~> mk_ptupleabs

411 strip_psplits ~> strip_ptupleabs

412 INCOMPATIBILITY.

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

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

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

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

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

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

421 global collection of overloaded constant / type definitions into

422 account. Type definitions with open dependencies on overloaded

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

424 provides extra robustness in theory construction. Rare INCOMPATIBILITY.

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

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

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

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

430 Option.is_none_def. Occasional INCOMPATIBILITY in applications.

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

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

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

435 of_int for that type. Other overloaded instances of 'real' have been

436 replaced by 'real_of_ereal' and 'real_of_float'.

437 Consolidated facts (among others):

438 real_of_nat_le_iff -> of_nat_le_iff

439 real_of_nat_numeral of_nat_numeral

440 real_of_int_zero of_int_0

441 real_of_nat_zero of_nat_0

442 real_of_one of_int_1

443 real_of_int_add of_int_add

444 real_of_nat_add of_nat_add

445 real_of_int_diff of_int_diff

446 real_of_nat_diff of_nat_diff

447 floor_subtract floor_diff_of_int

448 real_of_int_inject of_int_eq_iff

449 real_of_int_gt_zero_cancel_iff of_int_0_less_iff

450 real_of_int_ge_zero_cancel_iff of_int_0_le_iff

451 real_of_nat_ge_zero of_nat_0_le_iff

452 real_of_int_ceiling_ge le_of_int_ceiling

453 ceiling_less_eq ceiling_less_iff

454 ceiling_le_eq ceiling_le_iff

455 less_floor_eq less_floor_iff

456 floor_less_eq floor_less_iff

457 floor_divide_eq_div floor_divide_of_int_eq

458 real_of_int_zero_cancel of_nat_eq_0_iff

459 ceiling_real_of_int ceiling_of_int

460 INCOMPATIBILITY.

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

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

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

465 simplify porting old theories:

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

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

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

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

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

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

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

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

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

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

482 INCOMPATIBILITY, use plain "::" instead.

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

485 been removed. INCOMPATIBILITY.

487 * Quickcheck setup for finite sets.

489 * Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.

491 * Sledgehammer:

492 - The MaSh relevance filter has been sped up.

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

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

495 - Auto Sledgehammer now minimizes and preplays the results.

496 - Handle Vampire 4.0 proof output without raising exception.

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

498 Isabelle/jEdit instead. INCOMPATIBILITY.

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

501 * Nitpick:

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

503 - Fixed soundness bug in "destroy_constrs" optimization.

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

505 - Eliminated obsolete "blocking" option.

507 * New (co)datatype package:

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

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

510 - Always generate "case_transfer" theorem.

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

512 being defined.

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

515 * Transfer:

516 - new methods for interactive debugging of 'transfer' and

517 'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',

518 'transfer_prover_start' and 'transfer_prover_end'.

520 * Division on integers is bootstrapped directly from division on

521 naturals and uses generic numeral algorithm for computations.

522 Slight INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes

523 former simprocs binary_int_div and binary_int_mod

525 * Tightened specification of class semiring_no_zero_divisors. Slight

526 INCOMPATIBILITY.

528 * Class algebraic_semidom introduces common algebraic notions of

529 integral (semi)domains, particularly units. Although

530 logically subsumed by fields, is is not a super class of these

531 in order not to burden fields with notions that are trivial there.

533 * Class normalization_semidom specifies canonical representants

534 for equivalence classes of associated elements in an integral

535 (semi)domain. This formalizes associated elements as well.

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

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

539 and gcd_int.commute are subsumed by gcd.commute, as well as gcd_nat.assoc

540 and gcd_int.assoc by gcd.assoc.

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

543 are logically unified to Rings.divide in syntactic type class

544 Rings.divide, with infix syntax (_ div _). Infix syntax (_ / _)

545 for field division is added later as abbreviation in class Fields.inverse.

546 INCOMPATIBILITY, instantiations must refer to Rings.divide rather

547 than the former separate constants, hence infix syntax (_ / _) is usually

548 not available during instantiation.

550 * New cancellation simprocs for boolean algebras to cancel

551 complementary terms for sup and inf. For example, "sup x (sup y (- x))"

552 simplifies to "top". INCOMPATIBILITY.

554 * Library/Multiset:

555 - Renamed multiset inclusion operators:

556 < ~> <#

557 \<subset> ~> \<subset>#

558 <= ~> <=#

559 \<le> ~> \<le>#

560 \<subseteq> ~> \<subseteq>#

561 INCOMPATIBILITY.

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

563 "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",

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

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

566 are now available through the "subset_mset" interpretation

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

568 INCOMPATIBILITY.

569 - Renamed conversions:

570 multiset_of ~> mset

571 multiset_of_set ~> mset_set

572 set_of ~> set_mset

573 INCOMPATIBILITY

574 - Renamed lemmas:

575 mset_le_def ~> subseteq_mset_def

576 mset_less_def ~> subset_mset_def

577 less_eq_multiset.rep_eq ~> subseteq_mset_def

578 INCOMPATIBILITY

579 - Removed lemmas generated by lift_definition:

580 less_eq_multiset.abs_eq, less_eq_multiset.rsp less_eq_multiset.transfer

581 less_eq_multiset_def

582 INCOMPATIBILITY

584 * Multivariate_Analysis/Cauchy_Integral_Thm: Complex path integrals, Cauchy's

585 integral theorem, winding numbers and Cauchy's integral formula, ported from HOL Light

587 * Multivariate_Analysis: Added topological concepts such as connected components

588 and the inside or outside of a set.

590 * Theory Library/Old_Recdef: discontinued obsolete 'defer_recdef'

591 command. Minor INCOMPATIBILITY, use 'function' instead.

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

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

595 "inductive_defs" is enabled. This refers to the internal predicate

596 definition and its monotonicity result. Rare INCOMPATIBILITY.

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

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

600 "function_defs" is enabled. Rare INCOMPATIBILITY.

602 * Data_Structures: new and growing session of standard data structures.

604 * Imperative_HOL: obsolete theory Legacy_Mrec has been removed.

606 * Library/Omega_Words_Fun: Infinite words modeled as functions nat =>

607 'a.

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

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

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

614 *** ML ***

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

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

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

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

622 * Simproc programming interfaces have been simplified:

623 Simplifier.make_simproc and Simplifier.define_simproc supersede various

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

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

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

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

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

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

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

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

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

637 Old cterm_instantiate is superseded by infer_instantiate.

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

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

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

642 instead (with proper context).

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

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

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

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

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

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

651 the proof context discipline.

654 *** System ***

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

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

658 performance.

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

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

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

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

666 conflations:

668 hence ~> then have

669 thus ~> then show

671 This syntax is more orthogonal and improves readability and

672 maintainability of proofs.

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

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

676 is required after change.

678 * Poly/ML 5.5.3 runs natively on x86-windows and x86_64-windows,

679 which both allow larger heap space than former x86-cygwin.

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

682 space.

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

685 platforms as follows.

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

688 associated with the main app bundle

690 - isabelle jedit: settings

691 JEDIT_JAVA_SYSTEM_OPTIONS

692 JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64

694 - isabelle build: settings

695 ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64

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

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

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

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

705 New in Isabelle2015 (May 2015)

706 ------------------------------

708 *** General ***

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

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

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

714 context

715 begin

717 private definition ...

718 private lemma ...

720 qualified definition ...

721 qualified lemma ...

723 lemma ...

724 theorem ...

726 end

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

729 naming policy.

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

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

733 INCOMPATIBILITY, use 'sorry' instead.

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

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

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

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

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

741 schematically expanded before search. Search results match the naive

742 expectation more closely, particularly wrt. abbreviations.

743 INCOMPATIBILITY.

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

746 theory context.

748 * Outer syntax commands are managed authentically within the theory

749 context, without implicit global state. Potential for accidental

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

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

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

754 update_semicolons" to remove obsolete semicolons from old theory

755 sources.

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

758 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.

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

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

762 method provides basic fact/term matching in addition to

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

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

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

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

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

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

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

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

775 option jedit_structure_limit determines maximum number of lines to scan

776 in the buffer.

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

779 marker, SideKick parser.

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

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

783 the editor (hyperlinks, completion etc.).

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

786 Options / Text Area).

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

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

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

792 restrict the visualized hierarchy.

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

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

798 *** Document preparation ***

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

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

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

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

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

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

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

807 update_header"). Minor INCOMPATIBILITY.

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

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

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

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

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

815 style.

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

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

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

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

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

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

824 tags. Potential INCOMPATIBILITY in exotic situations.

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

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

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

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

830 dynamically in GUI front-ends. Implementations of document

831 antiquotations need to observe the margin explicitly according to

832 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.

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

835 mandatory for document preparation. The legacy mode with implicit

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

837 INCOMPATIBILITY.

840 *** Pure ***

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

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

844 these variables become schematic in the instantiated theorem; this

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

846 Configuration option rule_insts_schematic (default false) controls use

847 of schematic variables outside the context. Minor INCOMPATIBILITY,

848 declare rule_insts_schematic = true temporarily and update to use local

849 variable declarations or dummy patterns instead.

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

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

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

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

856 incremented to avoid material in the proof context. Rare

857 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to

858 different index.

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

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

862 of numeral signs, particularly in expressions involving infix syntax

863 like "(- 1) ^ n".

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

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

867 token category instead.

870 *** HOL ***

872 * New (co)datatype package:

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

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

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

876 'isabelle doc datatypes' for information on porting.

877 INCOMPATIBILITY.

878 - Renamed theorems:

879 disc_corec ~> corec_disc

880 disc_corec_iff ~> corec_disc_iff

881 disc_exclude ~> distinct_disc

882 disc_exhaust ~> exhaust_disc

883 disc_map_iff ~> map_disc_iff

884 sel_corec ~> corec_sel

885 sel_exhaust ~> exhaust_sel

886 sel_map ~> map_sel

887 sel_set ~> set_sel

888 sel_split ~> split_sel

889 sel_split_asm ~> split_sel_asm

890 strong_coinduct ~> coinduct_strong

891 weak_case_cong ~> case_cong_weak

892 INCOMPATIBILITY.

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

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

895 INCOMPATIBILITY.

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

897 consequences of other set rules "by auto".

898 INCOMPATIBILITY.

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

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

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

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

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

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

905 INCOMPATIBILITY.

906 - Renamed theories:

907 BNF_Comp ~> BNF_Composition

908 BNF_FP_Base ~> BNF_Fixpoint_Base

909 BNF_GFP ~> BNF_Greatest_Fixpoint

910 BNF_LFP ~> BNF_Least_Fixpoint

911 BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions

912 Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions

913 INCOMPATIBILITY.

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

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

916 Lifting_Product and Lifting_Option from Main became obsolete and

917 were removed. Changed definitions of the relators rel_prod and

918 rel_sum (using inductive).

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

920 of rel_prod_def and rel_sum_def.

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

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

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

924 constructors, case combinators, discriminators, selectors and

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

926 rules.

928 * Old datatype package:

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

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

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

932 'isabelle doc datatypes' for information on porting.

933 INCOMPATIBILITY.

934 - Renamed theorems:

935 weak_case_cong ~> case_cong_weak

936 INCOMPATIBILITY.

937 - Renamed theory:

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

939 INCOMPATIBILITY.

941 * Nitpick:

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

943 operations.

945 * Sledgehammer:

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

947 default.

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

949 source. The "z3_non_commercial" option is discontinued.

950 - Minimization is now always enabled by default.

951 Removed sub-command:

952 min

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

954 dramatically improved.

955 - Improved support for CVC4 and veriT.

957 * Old and new SMT modules:

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

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

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

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

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

963 point to it.

964 INCOMPATIBILITY.

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

966 INCOMPATIBILITY.

967 - New option 'smt_reconstruction_step_timeout' to limit the

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

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

970 method, especially runtime statistics of Z3 proof reconstruction.

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

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

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

975 lifting, and avoids tedious workarounds.

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

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

979 Minor INCOMPATIBILITY.

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

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

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

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

986 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.

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

989 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.

991 * Class linordered_semidom really requires no zero divisors.

992 INCOMPATIBILITY.

994 * Classes division_ring, field and linordered_field always demand

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

996 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.

998 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit

999 additive inverse operation. INCOMPATIBILITY.

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

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

1003 INCOMPATIBILITY: type constraints may be necessary.

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

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

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

1008 needed.

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

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

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

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

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

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

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

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

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

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

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

1023 "nat_floor"/"nat_ceiling".

1025 * Qualified some duplicated fact names required for boostrapping the

1026 type class hierarchy:

1027 ab_add_uminus_conv_diff ~> diff_conv_add_uminus

1028 field_inverse_zero ~> inverse_zero

1029 field_divide_inverse ~> divide_inverse

1030 field_inverse ~> left_inverse

1031 Minor INCOMPATIBILITY.

1033 * Eliminated fact duplicates:

1034 mult_less_imp_less_right ~> mult_right_less_imp_less

1035 mult_less_imp_less_left ~> mult_left_less_imp_less

1036 Minor INCOMPATIBILITY.

1038 * Fact consolidation: even_less_0_iff is subsumed by

1039 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).

1041 * Generalized and consolidated some theorems concerning divsibility:

1042 dvd_reduce ~> dvd_add_triv_right_iff

1043 dvd_plus_eq_right ~> dvd_add_right_iff

1044 dvd_plus_eq_left ~> dvd_add_left_iff

1045 Minor INCOMPATIBILITY.

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

1048 and part of theory Main.

1049 even_def ~> even_iff_mod_2_eq_zero

1050 INCOMPATIBILITY.

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

1053 INCOMPATIBILITY.

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

1056 Fact rename:

1057 listsum_def ~> listsum.eq_foldr

1058 INCOMPATIBILITY.

1060 * Product over lists via constant "listprod".

1062 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to

1063 Cons_nth_drop_Suc.

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

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

1067 HOL/Codegenerator_Test/Code_Test* for examples.

1069 * Library/Multiset:

1070 - Introduced "replicate_mset" operation.

1071 - Introduced alternative characterizations of the multiset ordering in

1072 "Library/Multiset_Order".

1073 - Renamed multiset ordering:

1074 <# ~> #<#

1075 <=# ~> #<=#

1076 \<subset># ~> #\<subset>#

1077 \<subseteq># ~> #\<subseteq>#

1078 INCOMPATIBILITY.

1079 - Introduced abbreviations for ill-named multiset operations:

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

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

1082 INCOMPATIBILITY.

1083 - Renamed

1084 in_multiset_of ~> in_multiset_in_set

1085 Multiset.fold ~> fold_mset

1086 Multiset.filter ~> filter_mset

1087 INCOMPATIBILITY.

1088 - Removed mcard, is equal to size.

1089 - Added attributes:

1090 image_mset.id [simp]

1091 image_mset_id [simp]

1092 elem_multiset_of_set [simp, intro]

1093 comp_fun_commute_plus_mset [simp]

1094 comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]

1095 in_mset_fold_plus_iff [iff]

1096 set_of_Union_mset [simp]

1097 in_Union_mset_iff [iff]

1098 INCOMPATIBILITY.

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

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

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

1103 argument. Minor INCOMPATIBILITY.

1105 * HOL-Decision_Procs: New counterexample generator quickcheck

1106 [approximation] for inequalities of transcendental functions. Uses

1107 hardware floating point arithmetic to randomly discover potential

1108 counterexamples. Counterexamples are certified with the "approximation"

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

1110 examples.

1112 * HOL-Probability: Reworked measurability prover

1113 - applies destructor rules repeatedly

1114 - removed application splitting (replaced by destructor rule)

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

1116 projection

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

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

1122 *** ML ***

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

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

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

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

1128 contemporary applications use the strict Name_Space.check (and

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

1130 INCOMPATIBILITY in rare applications of Name_Space.intern.

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

1133 ERROR instead of internal Toplevel.UNDEF.

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

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

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

1139 INCOMPATIBILITY.

1141 * Former combinators NAMED_CRITICAL and CRITICAL for central critical

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

1143 Multithreading.synchronized and its high-level derivative

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

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

1146 nested.

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

1149 change of semantics with minimal potential for INCOMPATIBILITY.

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

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

1153 available as Thm.global_ctyp_of and Thm.global_cterm_of.

1154 INCOMPATIBILITY.

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

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

1158 Thm.term_of etc.

1160 * Proper context for various elementary tactics: assume_tac,

1161 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,

1162 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.

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

1165 PARALLEL_GOALS.

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

1168 which also allows to specify a fork priority.

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

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

1172 markup). Minor INCOMPATIBILITY.

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

1175 Input.source (with formal position information).

1178 *** System ***

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

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

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

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

1186 be externally triggered using an appropriate ROOT file plus a

1187 corresponding theory. Parametrization is possible using environment

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

1189 INCOMPATIBILITY.

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

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

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

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

1196 menu Global Options / Appearance.

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

1199 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.

1203 New in Isabelle2014 (August 2014)

1204 ---------------------------------

1206 *** General ***

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

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

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

1211 environment is restricted to the Standard ML implementation of

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

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

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

1215 some examples.

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

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

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

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

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

1222 restore the previous behavior. INCOMPATIBILITY, especially where

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

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

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

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

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

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

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

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

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

1233 exception. Potential INCOMPATIBILITY for non-conformant tactical

1234 proof tools.

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

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

1238 supports input via ` (backquote).

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

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

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

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

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

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

1247 Minor INCOMPATIBILITY.

1249 * Discontinued legacy_isub_isup, which was a temporary workaround for

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

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

1252 INCOMPATIBILITY.

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

1255 which results in an active hyperlink within the text.

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

1258 not check existence within the file-system.

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

1261 isar-ref, jedit, system.

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

1266 * Improved Document panel: simplified interaction where every single

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

1268 buffer.

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

1271 to PIDE hyperlinks.

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

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

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

1277 auxiliary ML files.

1279 * Improved syntactic and semantic completion mechanism, with simple

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

1281 file-name completion, spell-checker completion.

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

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

1285 keystrokes with slow / remote graphics displays.

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

1288 item, depending on Isabelle options.

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

1291 selections, rectangular selections, rectangular selection as "tall

1292 caret".

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

1295 completion popup and context-menu.

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

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

1299 operations for the context. Minor incompatibility in keyboard

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

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

1303 to highlight text via regular expression.

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

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

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

1308 "isabelle jedit -m MODE".

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

1311 networking operations instead of jEdit virtual file-systems.

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

1314 imports) are automatically removed from the document model.

1316 * Improved monitor panel.

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

1319 more robust treatment of threads and interrupts.

1321 * Improved management of dockable windows: clarified keyboard focus

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

1323 "Detach" a copy where this makes sense.

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

1326 simplification process, enabled by the "simp_trace_new" attribute

1327 within the context.

1330 *** Pure ***

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

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

1334 that is not immediately visible. INCOMPATIBILITY, use regular

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

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

1337 finished trivially if the underlying class definition is made vacuous

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

1339 Axclass.class_axiomatization, Axclass.classrel_axiomatization,

1340 Axclass.arity_axiomatization.

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

1343 qualified. Rare INCOMPATIBILITY, but with potentially serious

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

1345 renaming needs to be applied:

1347 == ~> Pure.eq

1348 ==> ~> Pure.imp

1349 all ~> Pure.all

1350 TYPE ~> Pure.type

1351 dummy_pattern ~> Pure.dummy_pattern

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

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

1355 old constants:

1357 setup {*

1358 fn thy => thy

1359 |> Sign.root_path

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

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

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

1363 |> Sign.restore_naming thy

1364 *}

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

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

1368 the auxiliary aliases are deleted.

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

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

1372 instantiated theorem.

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

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

1376 where instantiations with schematic variables are intended (for

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

1378 following temporary definition may help to port old applications:

1380 attribute_setup standard =

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

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

1384 attributed fact expressions (concerning background theory, declared

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

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

1387 primitive Thm.assume_hyps.

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

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

1391 differently, e.g. via cartouches).

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

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

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

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

1400 *** HOL ***

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

1403 language requirements. INCOMPATIBILITY.

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

1406 INCOMPATIBILITY.

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

1409 INCOMPATIBILITY.

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

1412 option. Minor INCOMPATIBILITY.

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

1415 INCOMPATIBILITY.

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

1418 with the given constants.

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

1421 operations on records.

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

1424 ML. Minor INCOMPATIBILITY.

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

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

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

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

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

1434 now deal with conjunctions. For help with converting proofs, the old

1435 behaviour of the simplifier can be restored like this: declare/using

1436 [[simp_legacy_precond]]. This configuration option will disappear

1437 again in the future. INCOMPATIBILITY.

1439 * Simproc "finite_Collect" is no longer enabled by default, due to

1440 spurious crashes and other surprises. Potential INCOMPATIBILITY.

1442 * Moved new (co)datatype package and its dependencies from session

1443 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',

1444 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now

1445 part of theory "Main".

1447 Theory renamings:

1448 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)

1449 Library/Wfrec.thy ~> Wfrec.thy

1450 Library/Zorn.thy ~> Zorn.thy

1451 Cardinals/Order_Relation.thy ~> Order_Relation.thy

1452 Library/Order_Union.thy ~> Cardinals/Order_Union.thy

1453 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy

1454 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy

1455 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy

1456 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy

1457 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy

1458 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy

1459 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy

1460 BNF/BNF_Comp.thy ~> BNF_Comp.thy

1461 BNF/BNF_Def.thy ~> BNF_Def.thy

1462 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy

1463 BNF/BNF_GFP.thy ~> BNF_GFP.thy

1464 BNF/BNF_LFP.thy ~> BNF_LFP.thy

1465 BNF/BNF_Util.thy ~> BNF_Util.thy

1466 BNF/Coinduction.thy ~> Coinduction.thy

1467 BNF/More_BNFs.thy ~> Library/More_BNFs.thy

1468 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy

1469 BNF/Examples/* ~> BNF_Examples/*

1471 New theories:

1472 Wellorder_Extension.thy (split from Zorn.thy)

1473 Library/Cardinal_Notations.thy

1474 Library/BNF_Axomatization.thy

1475 BNF_Examples/Misc_Primcorec.thy

1476 BNF_Examples/Stream_Processor.thy

1478 Discontinued theories:

1479 BNF/BNF.thy

1480 BNF/Equiv_Relations_More.thy

1482 INCOMPATIBILITY.

1484 * New (co)datatype package:

1485 - Command 'primcorec' is fully implemented.

1486 - Command 'datatype_new' generates size functions ("size_xxx" and

1487 "size") as required by 'fun'.

1488 - BNFs are integrated with the Lifting tool and new-style

1489 (co)datatypes with Transfer.

1490 - Renamed commands:

1491 datatype_new_compat ~> datatype_compat

1492 primrec_new ~> primrec

1493 wrap_free_constructors ~> free_constructors

1494 INCOMPATIBILITY.

1495 - The generated constants "xxx_case" and "xxx_rec" have been renamed

1496 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").

1497 INCOMPATIBILITY.

1498 - The constant "xxx_(un)fold" and related theorems are no longer

1499 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually

1500 using "prim(co)rec".

1501 INCOMPATIBILITY.

1502 - No discriminators are generated for nullary constructors by

1503 default, eliminating the need for the odd "=:" syntax.

1504 INCOMPATIBILITY.

1505 - No discriminators or selectors are generated by default by

1506 "datatype_new", unless custom names are specified or the new

1507 "discs_sels" option is passed.

1508 INCOMPATIBILITY.

1510 * Old datatype package:

1511 - The generated theorems "xxx.cases" and "xxx.recs" have been

1512 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->

1513 "sum.case"). INCOMPATIBILITY.

1514 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have

1515 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,

1516 "prod_case" ~> "case_prod"). INCOMPATIBILITY.

1518 * The types "'a list" and "'a option", their set and map functions,

1519 their relators, and their selectors are now produced using the new

1520 BNF-based datatype package.

1522 Renamed constants:

1523 Option.set ~> set_option

1524 Option.map ~> map_option

1525 option_rel ~> rel_option

1527 Renamed theorems:

1528 set_def ~> set_rec[abs_def]

1529 map_def ~> map_rec[abs_def]

1530 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")

1531 option.recs ~> option.rec

1532 list_all2_def ~> list_all2_iff

1533 set.simps ~> set_simps (or the slightly different "list.set")

1534 map.simps ~> list.map

1535 hd.simps ~> list.sel(1)

1536 tl.simps ~> list.sel(2-3)

1537 the.simps ~> option.sel

1539 INCOMPATIBILITY.

1541 * The following map functions and relators have been renamed:

1542 sum_map ~> map_sum

1543 map_pair ~> map_prod

1544 prod_rel ~> rel_prod

1545 sum_rel ~> rel_sum

1546 fun_rel ~> rel_fun

1547 set_rel ~> rel_set

1548 filter_rel ~> rel_filter

1549 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")

1550 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")

1551 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")

1553 INCOMPATIBILITY.

1555 * Lifting and Transfer:

1556 - a type variable as a raw type is supported

1557 - stronger reflexivity prover

1558 - rep_eq is always generated by lift_definition

1559 - setup for Lifting/Transfer is now automated for BNFs

1560 + holds for BNFs that do not contain a dead variable

1561 + relator_eq, relator_mono, relator_distr, relator_domain,

1562 relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,

1563 right_unique, right_total, left_unique, left_total are proved

1564 automatically

1565 + definition of a predicator is generated automatically

1566 + simplification rules for a predicator definition are proved

1567 automatically for datatypes

1568 - consolidation of the setup of Lifting/Transfer

1569 + property that a relator preservers reflexivity is not needed any

1570 more

1571 Minor INCOMPATIBILITY.

1572 + left_total and left_unique rules are now transfer rules

1573 (reflexivity_rule attribute not needed anymore)

1574 INCOMPATIBILITY.

1575 + Domainp does not have to be a separate assumption in

1576 relator_domain theorems (=> more natural statement)

1577 INCOMPATIBILITY.

1578 - registration of code equations is more robust

1579 Potential INCOMPATIBILITY.

1580 - respectfulness proof obligation is preprocessed to a more readable

1581 form

1582 Potential INCOMPATIBILITY.

1583 - eq_onp is always unfolded in respectfulness proof obligation

1584 Potential INCOMPATIBILITY.

1585 - unregister lifting setup for Code_Numeral.integer and

1586 Code_Numeral.natural

1587 Potential INCOMPATIBILITY.

1588 - Lifting.invariant -> eq_onp

1589 INCOMPATIBILITY.

1591 * New internal SAT solver "cdclite" that produces models and proof

1592 traces. This solver replaces the internal SAT solvers "enumerate" and

1593 "dpll". Applications that explicitly used one of these two SAT

1594 solvers should use "cdclite" instead. In addition, "cdclite" is now

1595 the default SAT solver for the "sat" and "satx" proof methods and

1596 corresponding tactics; the old default can be restored using "declare

1597 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.

1599 * SMT module: A new version of the SMT module, temporarily called

1600 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,

1601 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also

1602 supported as oracles. Yices is no longer supported, because no version

1603 of the solver can handle both SMT-LIB 2 and quantifiers.

1605 * Activation of Z3 now works via "z3_non_commercial" system option

1606 (without requiring restart), instead of former settings variable

1607 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu

1608 Plugin Options / Isabelle / General.

1610 * Sledgehammer:

1611 - Z3 can now produce Isar proofs.

1612 - MaSh overhaul:

1613 . New SML-based learning algorithms eliminate the dependency on

1614 Python and increase performance and reliability.

1615 . MaSh and MeSh are now used by default together with the

1616 traditional MePo (Meng-Paulson) relevance filter. To disable

1617 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin

1618 Options / Isabelle / General to "none".

1619 - New option:

1620 smt_proofs

1621 - Renamed options:

1622 isar_compress ~> compress

1623 isar_try0 ~> try0

1625 INCOMPATIBILITY.

1627 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.

1629 * Nitpick:

1630 - Fixed soundness bug whereby mutually recursive datatypes could

1631 take infinite values.

1632 - Fixed soundness bug with low-level number functions such as

1633 "Abs_Integ" and "Rep_Integ".

1634 - Removed "std" option.

1635 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to

1636 "hide_types".

1638 * Metis: Removed legacy proof method 'metisFT'. Use 'metis

1639 (full_types)' instead. INCOMPATIBILITY.

1641 * Try0: Added 'algebra' and 'meson' to the set of proof methods.

1643 * Adjustion of INF and SUP operations:

1644 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.

1645 - Consolidated theorem names containing INFI and SUPR: have INF and

1646 SUP instead uniformly.

1647 - More aggressive normalization of expressions involving INF and Inf

1648 or SUP and Sup.

1649 - INF_image and SUP_image do not unfold composition.

1650 - Dropped facts INF_comp, SUP_comp.

1651 - Default congruence rules strong_INF_cong and strong_SUP_cong, with

1652 simplifier implication in premises. Generalize and replace former

1653 INT_cong, SUP_cong

1655 INCOMPATIBILITY.

1657 * SUP and INF generalized to conditionally_complete_lattice.

1659 * Swapped orientation of facts image_comp and vimage_comp:

1661 image_compose ~> image_comp [symmetric]

1662 image_comp ~> image_comp [symmetric]

1663 vimage_compose ~> vimage_comp [symmetric]

1664 vimage_comp ~> vimage_comp [symmetric]

1666 INCOMPATIBILITY.

1668 * Theory reorganization: split of Big_Operators.thy into

1669 Groups_Big.thy and Lattices_Big.thy.

1671 * Consolidated some facts about big group operators:

1673 setsum_0' ~> setsum.neutral

1674 setsum_0 ~> setsum.neutral_const

1675 setsum_addf ~> setsum.distrib

1676 setsum_cartesian_product ~> setsum.cartesian_product

1677 setsum_cases ~> setsum.If_cases

1678 setsum_commute ~> setsum.commute

1679 setsum_cong ~> setsum.cong

1680 setsum_delta ~> setsum.delta

1681 setsum_delta' ~> setsum.delta'

1682 setsum_diff1' ~> setsum.remove

1683 setsum_empty ~> setsum.empty

1684 setsum_infinite ~> setsum.infinite

1685 setsum_insert ~> setsum.insert

1686 setsum_inter_restrict'' ~> setsum.inter_filter

1687 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left

1688 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right

1689 setsum_mono_zero_left ~> setsum.mono_neutral_left

1690 setsum_mono_zero_right ~> setsum.mono_neutral_right

1691 setsum_reindex ~> setsum.reindex

1692 setsum_reindex_cong ~> setsum.reindex_cong

1693 setsum_reindex_nonzero ~> setsum.reindex_nontrivial

1694 setsum_restrict_set ~> setsum.inter_restrict

1695 setsum_Plus ~> setsum.Plus

1696 setsum_setsum_restrict ~> setsum.commute_restrict

1697 setsum_Sigma ~> setsum.Sigma

1698 setsum_subset_diff ~> setsum.subset_diff

1699 setsum_Un_disjoint ~> setsum.union_disjoint

1700 setsum_UN_disjoint ~> setsum.UNION_disjoint

1701 setsum_Un_Int ~> setsum.union_inter

1702 setsum_Union_disjoint ~> setsum.Union_disjoint

1703 setsum_UNION_zero ~> setsum.Union_comp

1704 setsum_Un_zero ~> setsum.union_inter_neutral

1705 strong_setprod_cong ~> setprod.strong_cong

1706 strong_setsum_cong ~> setsum.strong_cong

1707 setprod_1' ~> setprod.neutral

1708 setprod_1 ~> setprod.neutral_const

1709 setprod_cartesian_product ~> setprod.cartesian_product

1710 setprod_cong ~> setprod.cong

1711 setprod_delta ~> setprod.delta

1712 setprod_delta' ~> setprod.delta'

1713 setprod_empty ~> setprod.empty

1714 setprod_infinite ~> setprod.infinite

1715 setprod_insert ~> setprod.insert

1716 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left

1717 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right

1718 setprod_mono_one_left ~> setprod.mono_neutral_left

1719 setprod_mono_one_right ~> setprod.mono_neutral_right

1720 setprod_reindex ~> setprod.reindex

1721 setprod_reindex_cong ~> setprod.reindex_cong

1722 setprod_reindex_nonzero ~> setprod.reindex_nontrivial

1723 setprod_Sigma ~> setprod.Sigma

1724 setprod_subset_diff ~> setprod.subset_diff

1725 setprod_timesf ~> setprod.distrib

1726 setprod_Un2 ~> setprod.union_diff2

1727 setprod_Un_disjoint ~> setprod.union_disjoint

1728 setprod_UN_disjoint ~> setprod.UNION_disjoint

1729 setprod_Un_Int ~> setprod.union_inter

1730 setprod_Union_disjoint ~> setprod.Union_disjoint

1731 setprod_Un_one ~> setprod.union_inter_neutral

1733 Dropped setsum_cong2 (simple variant of setsum.cong).

1734 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)

1735 Dropped setsum_reindex_id, setprod_reindex_id

1736 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).

1738 INCOMPATIBILITY.

1740 * Abolished slightly odd global lattice interpretation for min/max.

1742 Fact consolidations:

1743 min_max.inf_assoc ~> min.assoc

1744 min_max.inf_commute ~> min.commute

1745 min_max.inf_left_commute ~> min.left_commute

1746 min_max.inf_idem ~> min.idem

1747 min_max.inf_left_idem ~> min.left_idem

1748 min_max.inf_right_idem ~> min.right_idem

1749 min_max.sup_assoc ~> max.assoc

1750 min_max.sup_commute ~> max.commute

1751 min_max.sup_left_commute ~> max.left_commute

1752 min_max.sup_idem ~> max.idem

1753 min_max.sup_left_idem ~> max.left_idem

1754 min_max.sup_inf_distrib1 ~> max_min_distrib2

1755 min_max.sup_inf_distrib2 ~> max_min_distrib1

1756 min_max.inf_sup_distrib1 ~> min_max_distrib2

1757 min_max.inf_sup_distrib2 ~> min_max_distrib1

1758 min_max.distrib ~> min_max_distribs

1759 min_max.inf_absorb1 ~> min.absorb1

1760 min_max.inf_absorb2 ~> min.absorb2

1761 min_max.sup_absorb1 ~> max.absorb1

1762 min_max.sup_absorb2 ~> max.absorb2

1763 min_max.le_iff_inf ~> min.absorb_iff1

1764 min_max.le_iff_sup ~> max.absorb_iff2

1765 min_max.inf_le1 ~> min.cobounded1

1766 min_max.inf_le2 ~> min.cobounded2

1767 le_maxI1, min_max.sup_ge1 ~> max.cobounded1

1768 le_maxI2, min_max.sup_ge2 ~> max.cobounded2

1769 min_max.le_infI1 ~> min.coboundedI1

1770 min_max.le_infI2 ~> min.coboundedI2

1771 min_max.le_supI1 ~> max.coboundedI1

1772 min_max.le_supI2 ~> max.coboundedI2

1773 min_max.less_infI1 ~> min.strict_coboundedI1

1774 min_max.less_infI2 ~> min.strict_coboundedI2

1775 min_max.less_supI1 ~> max.strict_coboundedI1

1776 min_max.less_supI2 ~> max.strict_coboundedI2

1777 min_max.inf_mono ~> min.mono

1778 min_max.sup_mono ~> max.mono

1779 min_max.le_infI, min_max.inf_greatest ~> min.boundedI

1780 min_max.le_supI, min_max.sup_least ~> max.boundedI

1781 min_max.le_inf_iff ~> min.bounded_iff

1782 min_max.le_sup_iff ~> max.bounded_iff

1784 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,

1785 min.left_commute, min.left_idem, max.commute, max.assoc,

1786 max.left_commute, max.left_idem directly.

1788 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,

1789 min.cobounded2, max.cobounded1m max.cobounded2 directly.

1791 For min_ac or max_ac, prefer more general collection ac_simps.

1793 INCOMPATIBILITY.

1795 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>

1796 Inf_fin_le_Sup_fin. INCOMPATIBILITY.

1798 * Qualified constant names Wellfounded.acc, Wellfounded.accp.

1799 INCOMPATIBILITY.

1801 * Fact generalization and consolidation:

1802 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1

1804 INCOMPATIBILITY.

1806 * Purely algebraic definition of even. Fact generalization and

1807 consolidation:

1808 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd

1809 even_zero_(nat|int) ~> even_zero

1811 INCOMPATIBILITY.

1813 * Abolished neg_numeral.

1814 - Canonical representation for minus one is "- 1".

1815 - Canonical representation for other negative numbers is "- (numeral _)".

1816 - When devising rule sets for number calculation, consider the

1817 following canonical cases: 0, 1, numeral _, - 1, - numeral _.

1818 - HOLogic.dest_number also recognizes numerals in non-canonical forms

1819 like "numeral One", "- numeral One", "- 0" and even "- ... - _".

1820 - Syntax for negative numerals is mere input syntax.

1822 INCOMPATIBILITY.

1824 * Reduced name variants for rules on associativity and commutativity:

1826 add_assoc ~> add.assoc

1827 add_commute ~> add.commute

1828 add_left_commute ~> add.left_commute

1829 mult_assoc ~> mult.assoc

1830 mult_commute ~> mult.commute

1831 mult_left_commute ~> mult.left_commute

1832 nat_add_assoc ~> add.assoc

1833 nat_add_commute ~> add.commute

1834 nat_add_left_commute ~> add.left_commute

1835 nat_mult_assoc ~> mult.assoc

1836 nat_mult_commute ~> mult.commute

1837 eq_assoc ~> iff_assoc

1838 eq_left_commute ~> iff_left_commute

1840 INCOMPATIBILITY.

1842 * Fact collections add_ac and mult_ac are considered old-fashioned.

1843 Prefer ac_simps instead, or specify rules

1844 (add|mult).(assoc|commute|left_commute) individually.

1846 * Elimination of fact duplicates:

1847 equals_zero_I ~> minus_unique

1848 diff_eq_0_iff_eq ~> right_minus_eq

1849 nat_infinite ~> infinite_UNIV_nat

1850 int_infinite ~> infinite_UNIV_int

1852 INCOMPATIBILITY.

1854 * Fact name consolidation:

1855 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus

1856 minus_le_self_iff ~> neg_less_eq_nonneg

1857 le_minus_self_iff ~> less_eq_neg_nonpos

1858 neg_less_nonneg ~> neg_less_pos

1859 less_minus_self_iff ~> less_neg_neg [simp]

1861 INCOMPATIBILITY.

1863 * More simplification rules on unary and binary minus:

1864 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,

1865 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,

1866 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,

1867 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,

1868 minus_add_cancel, uminus_add_conv_diff. These correspondingly have

1869 been taken away from fact collections algebra_simps and field_simps.

1870 INCOMPATIBILITY.

1872 To restore proofs, the following patterns are helpful:

1874 a) Arbitrary failing proof not involving "diff_def":

1875 Consider simplification with algebra_simps or field_simps.

1877 b) Lifting rules from addition to subtraction:

1878 Try with "using <rule for addition> of [... "- _" ...]" by simp".

1880 c) Simplification with "diff_def": just drop "diff_def".

1881 Consider simplification with algebra_simps or field_simps;

1882 or the brute way with

1883 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".

1885 * Introduce bdd_above and bdd_below in theory

1886 Conditionally_Complete_Lattices, use them instead of explicitly

1887 stating boundedness of sets.

1889 * ccpo.admissible quantifies only over non-empty chains to allow more

1890 syntax-directed proof rules; the case of the empty chain shows up as

1891 additional case in fixpoint induction proofs. INCOMPATIBILITY.

1893 * Removed and renamed theorems in Series:

1894 summable_le ~> suminf_le

1895 suminf_le ~> suminf_le_const

1896 series_pos_le ~> setsum_le_suminf

1897 series_pos_less ~> setsum_less_suminf

1898 suminf_ge_zero ~> suminf_nonneg

1899 suminf_gt_zero ~> suminf_pos

1900 suminf_gt_zero_iff ~> suminf_pos_iff

1901 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ

1902 suminf_0_le ~> suminf_nonneg [rotate]

1903 pos_summable ~> summableI_nonneg_bounded

1904 ratio_test ~> summable_ratio_test

1906 removed series_zero, replaced by sums_finite

1908 removed auxiliary lemmas:

1910 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,

1911 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,

1912 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,

1913 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,

1914 summable_convergent_sumr_iff, sumr_diff_mult_const

1916 INCOMPATIBILITY.

1918 * Replace (F)DERIV syntax by has_derivative:

1919 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"

1921 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"

1923 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax

1925 - removed constant isDiff

1927 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as

1928 input syntax.

1930 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.

1932 - Renamed FDERIV_... lemmas to has_derivative_...

1934 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV

1936 - removed DERIV_intros, has_derivative_eq_intros

1938 - introduced derivative_intros and deriative_eq_intros which

1939 includes now rules for DERIV, has_derivative and

1940 has_vector_derivative.

1942 - Other renamings:

1943 differentiable_def ~> real_differentiable_def

1944 differentiableE ~> real_differentiableE

1945 fderiv_def ~> has_derivative_at

1946 field_fderiv_def ~> field_has_derivative_at

1947 isDiff_der ~> differentiable_def

1948 deriv_fderiv ~> has_field_derivative_def

1949 deriv_def ~> DERIV_def

1951 INCOMPATIBILITY.

1953 * Include more theorems in continuous_intros. Remove the

1954 continuous_on_intros, isCont_intros collections, these facts are now

1955 in continuous_intros.

1957 * Theorems about complex numbers are now stated only using Re and Im,

1958 the Complex constructor is not used anymore. It is possible to use

1959 primcorec to defined the behaviour of a complex-valued function.

1961 Removed theorems about the Complex constructor from the simpset, they

1962 are available as the lemma collection legacy_Complex_simps. This

1963 especially removes

1965 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".

1967 Instead the reverse direction is supported with

1968 Complex_eq: "Complex a b = a + \<i> * b"

1970 Moved csqrt from Fundamental_Algebra_Theorem to Complex.

1972 Renamings:

1973 Re/Im ~> complex.sel

1974 complex_Re/Im_zero ~> zero_complex.sel

1975 complex_Re/Im_add ~> plus_complex.sel

1976 complex_Re/Im_minus ~> uminus_complex.sel

1977 complex_Re/Im_diff ~> minus_complex.sel

1978 complex_Re/Im_one ~> one_complex.sel

1979 complex_Re/Im_mult ~> times_complex.sel

1980 complex_Re/Im_inverse ~> inverse_complex.sel

1981 complex_Re/Im_scaleR ~> scaleR_complex.sel

1982 complex_Re/Im_i ~> ii.sel

1983 complex_Re/Im_cnj ~> cnj.sel

1984 Re/Im_cis ~> cis.sel

1986 complex_divide_def ~> divide_complex_def

1987 complex_norm_def ~> norm_complex_def

1988 cmod_def ~> norm_complex_de

1990 Removed theorems:

1991 complex_zero_def

1992 complex_add_def

1993 complex_minus_def

1994 complex_diff_def

1995 complex_one_def

1996 complex_mult_def

1997 complex_inverse_def

1998 complex_scaleR_def

2000 INCOMPATIBILITY.

2002 * Theory Lubs moved HOL image to HOL-Library. It is replaced by

2003 Conditionally_Complete_Lattices. INCOMPATIBILITY.

2005 * HOL-Library: new theory src/HOL/Library/Tree.thy.

2007 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it

2008 is subsumed by session Kleene_Algebra in AFP.

2010 * HOL-Library / theory RBT: various constants and facts are hidden;

2011 lifting setup is unregistered. INCOMPATIBILITY.

2013 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.

2015 * HOL-Word: bit representations prefer type bool over type bit.

2016 INCOMPATIBILITY.

2018 * HOL-Word:

2019 - Abandoned fact collection "word_arith_alts", which is a duplicate

2020 of "word_arith_wis".

2021 - Dropped first (duplicated) element in fact collections

2022 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",

2023 "uint_word_arith_bintrs".

2025 * HOL-Number_Theory:

2026 - consolidated the proofs of the binomial theorem

2027 - the function fib is again of type nat => nat and not overloaded

2028 - no more references to Old_Number_Theory in the HOL libraries

2029 (except the AFP)

2031 INCOMPATIBILITY.

2033 * HOL-Multivariate_Analysis:

2034 - Type class ordered_real_vector for ordered vector spaces.

2035 - New theory Complex_Basic_Analysis defining complex derivatives,

2036 holomorphic functions, etc., ported from HOL Light's canal.ml.

2037 - Changed order of ordered_euclidean_space to be compatible with

2038 pointwise ordering on products. Therefore instance of

2039 conditionally_complete_lattice and ordered_real_vector.

2040 INCOMPATIBILITY: use box instead of greaterThanLessThan or

2041 explicit set-comprehensions with eucl_less for other (half-)open

2042 intervals.

2043 - removed dependencies on type class ordered_euclidean_space with

2044 introduction of "cbox" on euclidean_space

2045 - renamed theorems:

2046 interval ~> box

2047 mem_interval ~> mem_box

2048 interval_eq_empty ~> box_eq_empty

2049 interval_ne_empty ~> box_ne_empty

2050 interval_sing(1) ~> cbox_sing

2051 interval_sing(2) ~> box_sing

2052 subset_interval_imp ~> subset_box_imp

2053 subset_interval ~> subset_box

2054 open_interval ~> open_box

2055 closed_interval ~> closed_cbox

2056 interior_closed_interval ~> interior_cbox

2057 bounded_closed_interval ~> bounded_cbox

2058 compact_interval ~> compact_cbox

2059 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric

2060 bounded_subset_closed_interval ~> bounded_subset_cbox

2061 mem_interval_componentwiseI ~> mem_box_componentwiseI

2062 convex_box ~> convex_prod

2063 rel_interior_real_interval ~> rel_interior_real_box

2064 convex_interval ~> convex_box

2065 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox

2066 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox

2067 content_closed_interval' ~> content_cbox'

2068 elementary_subset_interval ~> elementary_subset_box

2069 diameter_closed_interval ~> diameter_cbox

2070 frontier_closed_interval ~> frontier_cbox

2071 frontier_open_interval ~> frontier_box

2072 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric

2073 closure_open_interval ~> closure_box

2074 open_closed_interval_convex ~> open_cbox_convex

2075 open_interval_midpoint ~> box_midpoint

2076 content_image_affinity_interval ~> content_image_affinity_cbox

2077 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval

2078 bounded_interval ~> bounded_closed_interval + bounded_boxes

2080 - respective theorems for intervals over the reals:

2081 content_closed_interval + content_cbox

2082 has_integral + has_integral_real

2083 fine_division_exists + fine_division_exists_real

2084 has_integral_null + has_integral_null_real

2085 tagged_division_union_interval + tagged_division_union_interval_real

2086 has_integral_const + has_integral_const_real

2087 integral_const + integral_const_real

2088 has_integral_bound + has_integral_bound_real

2089 integrable_continuous + integrable_continuous_real

2090 integrable_subinterval + integrable_subinterval_real

2091 has_integral_reflect_lemma + has_integral_reflect_lemma_real

2092 integrable_reflect + integrable_reflect_real

2093 integral_reflect + integral_reflect_real

2094 image_affinity_interval + image_affinity_cbox

2095 image_smult_interval + image_smult_cbox

2096 integrable_const + integrable_const_ivl

2097 integrable_on_subinterval + integrable_on_subcbox

2099 - renamed theorems:

2100 derivative_linear ~> has_derivative_bounded_linear

2101 derivative_is_linear ~> has_derivative_linear

2102 bounded_linear_imp_linear ~> bounded_linear.linear

2104 * HOL-Probability:

2105 - Renamed positive_integral to nn_integral:

2107 . Renamed all lemmas "*positive_integral*" to *nn_integral*"

2108 positive_integral_positive ~> nn_integral_nonneg

2110 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.

2112 - replaced the Lebesgue integral on real numbers by the more general

2113 Bochner integral for functions into a real-normed vector space.

2115 integral_zero ~> integral_zero / integrable_zero

2116 integral_minus ~> integral_minus / integrable_minus

2117 integral_add ~> integral_add / integrable_add

2118 integral_diff ~> integral_diff / integrable_diff

2119 integral_setsum ~> integral_setsum / integrable_setsum

2120 integral_multc ~> integral_mult_left / integrable_mult_left

2121 integral_cmult ~> integral_mult_right / integrable_mult_right

2122 integral_triangle_inequality~> integral_norm_bound

2123 integrable_nonneg ~> integrableI_nonneg

2124 integral_positive ~> integral_nonneg_AE

2125 integrable_abs_iff ~> integrable_abs_cancel

2126 positive_integral_lim_INF ~> nn_integral_liminf

2127 lebesgue_real_affine ~> lborel_real_affine

2128 borel_integral_has_integral ~> has_integral_lebesgue_integral

2129 integral_indicator ~>

2130 integral_real_indicator / integrable_real_indicator

2131 positive_integral_fst ~> nn_integral_fst'

2132 positive_integral_fst_measurable ~> nn_integral_fst

2133 positive_integral_snd_measurable ~> nn_integral_snd

2135 integrable_fst_measurable ~>

2136 integral_fst / integrable_fst / AE_integrable_fst

2138 integrable_snd_measurable ~>

2139 integral_snd / integrable_snd / AE_integrable_snd

2141 integral_monotone_convergence ~>

2142 integral_monotone_convergence / integrable_monotone_convergence

2144 integral_monotone_convergence_at_top ~>

2145 integral_monotone_convergence_at_top /

2146 integrable_monotone_convergence_at_top

2148 has_integral_iff_positive_integral_lebesgue ~>

2149 has_integral_iff_has_bochner_integral_lebesgue_nonneg

2151 lebesgue_integral_has_integral ~>

2152 has_integral_integrable_lebesgue_nonneg

2154 positive_integral_lebesgue_has_integral ~>

2155 integral_has_integral_lebesgue_nonneg /

2156 integrable_has_integral_lebesgue_nonneg

2158 lebesgue_integral_real_affine ~>

2159 nn_integral_real_affine

2161 has_integral_iff_positive_integral_lborel ~>

2162 integral_has_integral_nonneg / integrable_has_integral_nonneg

2164 The following theorems where removed:

2166 lebesgue_integral_nonneg

2167 lebesgue_integral_uminus

2168 lebesgue_integral_cmult

2169 lebesgue_integral_multc

2170 lebesgue_integral_cmult_nonneg

2171 integral_cmul_indicator

2172 integral_real

2174 - Formalized properties about exponentially, Erlang, and normal

2175 distributed random variables.

2177 * HOL-Decision_Procs: Separate command 'approximate' for approximative

2178 computation in src/HOL/Decision_Procs/Approximation. Minor

2179 INCOMPATIBILITY.

2182 *** Scala ***

2184 * The signature and semantics of Document.Snapshot.cumulate_markup /

2185 select_markup have been clarified. Markup is now traversed in the

2186 order of reports given by the prover: later markup is usually more

2187 specific and may override results accumulated so far. The elements

2188 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.

2190 * Substantial reworking of internal PIDE protocol communication

2191 channels. INCOMPATIBILITY.

2194 *** ML ***

2196 * Subtle change of semantics of Thm.eq_thm: theory stamps are not

2197 compared (according to Thm.thm_ord), but assumed to be covered by the

2198 current background theory. Thus equivalent data produced in different

2199 branches of the theory graph usually coincides (e.g. relevant for

2200 theory merge). Note that the softer Thm.eq_thm_prop is often more

2201 appropriate than Thm.eq_thm.

2203 * Proper context for basic Simplifier operations: rewrite_rule,

2204 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to

2205 pass runtime Proof.context (and ensure that the simplified entity

2206 actually belongs to it).

2208 * Proper context discipline for read_instantiate and instantiate_tac:

2209 variables that are meant to become schematic need to be given as

2210 fixed, and are generalized by the explicit context of local variables.

2211 This corresponds to Isar attributes "where" and "of" with 'for'

2212 declaration. INCOMPATIBILITY, also due to potential change of indices

2213 of schematic variables.

2215 * Moved ML_Compiler.exn_trace and other operations on exceptions to

2216 structure Runtime. Minor INCOMPATIBILITY.

2218 * Discontinued old Toplevel.debug in favour of system option

2219 "ML_exception_trace", which may be also declared within the context

2220 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.

2222 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor

2223 INCOMPATIBILITY.

2225 * Configuration option "ML_print_depth" controls the pretty-printing

2226 depth of the ML compiler within the context. The old print_depth in

2227 ML is still available as default_print_depth, but rarely used. Minor

2228 INCOMPATIBILITY.

2230 * Toplevel function "use" refers to raw ML bootstrap environment,

2231 without Isar context nor antiquotations. Potential INCOMPATIBILITY.

2232 Note that 'ML_file' is the canonical command to load ML files into the

2233 formal context.

2235 * Simplified programming interface to define ML antiquotations, see

2236 structure ML_Antiquotation. Minor INCOMPATIBILITY.

2238 * ML antiquotation @{here} refers to its source position, which is

2239 occasionally useful for experimentation and diagnostic purposes.

2241 * ML antiquotation @{path} produces a Path.T value, similarly to

2242 Path.explode, but with compile-time check against the file-system and

2243 some PIDE markup. Note that unlike theory source, ML does not have a

2244 well-defined master directory, so an absolute symbolic path

2245 specification is usually required, e.g. "~~/src/HOL".

2247 * ML antiquotation @{print} inlines a function to print an arbitrary

2248 ML value, which is occasionally useful for diagnostic or demonstration

2249 purposes.

2252 *** System ***

2254 * Proof General with its traditional helper scripts is now an optional

2255 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle

2256 component repository http://isabelle.in.tum.de/components/. Note that

2257 the "system" manual provides general explanations about add-on

2258 components, especially those that are not bundled with the release.

2260 * The raw Isabelle process executable has been renamed from

2261 "isabelle-process" to "isabelle_process", which conforms to common

2262 shell naming conventions, and allows to define a shell function within

2263 the Isabelle environment to avoid dynamic path lookup. Rare

2264 incompatibility for old tools that do not use the ISABELLE_PROCESS

2265 settings variable.

2267 * Former "isabelle tty" has been superseded by "isabelle console",

2268 with implicit build like "isabelle jedit", and without the mostly

2269 obsolete Isar TTY loop.

2271 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER

2272 and PDF_VIEWER now refer to the actual programs, not shell

2273 command-lines. Discontinued option -c: invocation may be asynchronous

2274 via desktop environment, without any special precautions. Potential

2275 INCOMPATIBILITY with ambitious private settings.

2277 * Removed obsolete "isabelle unsymbolize". Note that the usual format

2278 for email communication is the Unicode rendering of Isabelle symbols,

2279 as produced by Isabelle/jEdit, for example.

2281 * Removed obsolete tool "wwwfind". Similar functionality may be

2282 integrated into Isabelle/jEdit eventually.

2284 * Improved 'display_drafts' concerning desktop integration and

2285 repeated invocation in PIDE front-end: re-use single file

2286 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.

2288 * Session ROOT specifications require explicit 'document_files' for

2289 robust dependencies on LaTeX sources. Only these explicitly given

2290 files are copied to the document output directory, before document

2291 processing is started.

2293 * Windows: support for regular TeX installation (e.g. MiKTeX) instead

2294 of TeX Live from Cygwin.

2298 New in Isabelle2013-2 (December 2013)

2299 -------------------------------------

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

2303 * More robust editing of running commands with internal forks,

2304 e.g. non-terminating 'by' steps.

2306 * More relaxed Sledgehammer panel: avoid repeated application of query

2307 after edits surrounding the command location.

2309 * More status information about commands that are interrupted

2310 accidentally (via physical event or Poly/ML runtime system signal,

2311 e.g. out-of-memory).

2314 *** System ***

2316 * More robust termination of external processes managed by

2317 Isabelle/ML: support cancellation of tasks within the range of

2318 milliseconds, as required for PIDE document editing with automatically

2319 tried tools (e.g. Sledgehammer).

2321 * Reactivated Isabelle/Scala kill command for external processes on

2322 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a

2323 workaround for some Debian/Ubuntu Linux versions from 2013.

2327 New in Isabelle2013-1 (November 2013)

2328 -------------------------------------

2330 *** General ***

2332 * Discontinued obsolete 'uses' within theory header. Note that

2333 commands like 'ML_file' work without separate declaration of file

2334 dependencies. Minor INCOMPATIBILITY.

2336 * Discontinued redundant 'use' command, which was superseded by

2337 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.

2339 * Simplified subscripts within identifiers, using plain \<^sub>

2340 instead of the second copy \<^isub> and \<^isup>. Superscripts are

2341 only for literal tokens within notation; explicit mixfix annotations

2342 for consts or fixed variables may be used as fall-back for unusual

2343 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in

2344 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to

2345 standardize symbols as a starting point for further manual cleanup.

2346 The ML reference variable "legacy_isub_isup" may be set as temporary

2347 workaround, to make the prover accept a subset of the old identifier

2348 syntax.

2350 * Document antiquotations: term style "isub" has been renamed to

2351 "sub". Minor INCOMPATIBILITY.

2353 * Uniform management of "quick_and_dirty" as system option (see also

2354 "isabelle options"), configuration option within the context (see also

2355 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor

2356 INCOMPATIBILITY, need to use more official Isabelle means to access

2357 quick_and_dirty, instead of historical poking into mutable reference.

2359 * Renamed command 'print_configs' to 'print_options'. Minor

2360 INCOMPATIBILITY.

2362 * Proper diagnostic command 'print_state'. Old 'pr' (with its

2363 implicit change of some global references) is retained for now as

2364 control command, e.g. for ProofGeneral 3.7.x.

2366 * Discontinued 'print_drafts' command with its old-fashioned PS output

2367 and Unix command-line print spooling. Minor INCOMPATIBILITY: use

2368 'display_drafts' instead and print via the regular document viewer.

2370 * Updated and extended "isar-ref" and "implementation" manual,

2371 eliminated old "ref" manual.

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

2376 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or

2377 Documentation panel.

2379 * Dockable window "Documentation" provides access to Isabelle

2380 documentation.

2382 * Dockable window "Find" provides query operations for formal entities

2383 (GUI front-end to 'find_theorems' command).

2385 * Dockable window "Sledgehammer" manages asynchronous / parallel

2386 sledgehammer runs over existing document sources, independently of

2387 normal editing and checking process.

2389 * Dockable window "Timing" provides an overview of relevant command

2390 timing information, depending on option jedit_timing_threshold. The

2391 same timing information is shown in the extended tooltip of the

2392 command keyword, when hovering the mouse over it while the CONTROL or

2393 COMMAND modifier is pressed.

2395 * Improved dockable window "Theories": Continuous checking of proof

2396 document (visible and required parts) may be controlled explicitly,

2397 using check box or shortcut "C+e ENTER". Individual theory nodes may

2398 be marked explicitly as required and checked in full, using check box

2399 or shortcut "C+e SPACE".

2401 * Improved completion mechanism, which is now managed by the

2402 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle

2403 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).

2405 * Standard jEdit keyboard shortcut C+b complete-word is remapped to

2406 isabelle.complete for explicit completion in Isabelle sources.

2407 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts

2408 to resolve conflict.

2410 * Improved support of various "minor modes" for Isabelle NEWS,

2411 options, session ROOT etc., with completion and SideKick tree view.

2413 * Strictly monotonic document update, without premature cancellation of

2414 running transactions that are still needed: avoid reset/restart of

2415 such command executions while editing.

2417 * Support for asynchronous print functions, as overlay to existing

2418 document content.

2420 * Support for automatic tools in HOL, which try to prove or disprove

2421 toplevel theorem statements.

2423 * Action isabelle.reset-font-size resets main text area font size

2424 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see

2425 also "Plugin Options / Isabelle / General"). It can be bound to some

2426 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).

2428 * File specifications in jEdit (e.g. file browser) may refer to

2429 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued

2430 obsolete $ISABELLE_HOME_WINDOWS variable.

2432 * Improved support for Linux look-and-feel "GTK+", see also "Utilities

2433 / Global Options / Appearance".

2435 * Improved support of native Mac OS X functionality via "MacOSX"

2436 plugin, which is now enabled by default.

2439 *** Pure ***

2441 * Commands 'interpretation' and 'sublocale' are now target-sensitive.

2442 In particular, 'interpretation' allows for non-persistent

2443 interpretation within "context ... begin ... end" blocks offering a

2444 light-weight alternative to 'sublocale'. See "isar-ref" manual for

2445 details.

2447 * Improved locales diagnostic command 'print_dependencies'.

2449 * Discontinued obsolete 'axioms' command, which has been marked as

2450 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'

2451 instead, while observing its uniform scope for polymorphism.

2453 * Discontinued empty name bindings in 'axiomatization'.

2454 INCOMPATIBILITY.

2456 * System option "proofs" has been discontinued. Instead the global

2457 state of Proofterm.proofs is persistently compiled into logic images

2458 as required, notably HOL-Proofs. Users no longer need to change

2459 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.

2461 * Syntax translation functions (print_translation etc.) always depend

2462 on Proof.context. Discontinued former "(advanced)" option -- this is

2463 now the default. Minor INCOMPATIBILITY.

2465 * Former global reference trace_unify_fail is now available as

2466 configuration option "unify_trace_failure" (global context only).

2468 * SELECT_GOAL now retains the syntactic context of the overall goal

2469 state (schematic variables etc.). Potential INCOMPATIBILITY in rare

2470 situations.

2473 *** HOL ***

2475 * Stronger precedence of syntax for big intersection and union on

2476 sets, in accordance with corresponding lattice operations.

2477 INCOMPATIBILITY.

2479 * Notation "{p:A. P}" now allows tuple patterns as well.

2481 * Nested case expressions are now translated in a separate check phase

2482 rather than during parsing. The data for case combinators is separated

2483 from the datatype package. The declaration attribute

2484 "case_translation" can be used to register new case combinators:

2486 declare [[case_translation case_combinator constructor1 ... constructorN]]

2488 * Code generator:

2489 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /

2490 'code_instance'.

2491 - 'code_identifier' declares name hints for arbitrary identifiers in

2492 generated code, subsuming 'code_modulename'.

2494 See the isar-ref manual for syntax diagrams, and the HOL theories for

2495 examples.

2497 * Attibute 'code': 'code' now declares concrete and abstract code

2498 equations uniformly. Use explicit 'code equation' and 'code abstract'

2499 to distinguish both when desired.

2501 * Discontinued theories Code_Integer and Efficient_Nat by a more

2502 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,

2503 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code

2504 generation for details. INCOMPATIBILITY.

2506 * Numeric types are mapped by default to target language numerals:

2507 natural (replaces former code_numeral) and integer (replaces former

2508 code_int). Conversions are available as integer_of_natural /

2509 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and

2510 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in

2511 ML). INCOMPATIBILITY.

2513 * Function package: For mutually recursive functions f and g, separate

2514 cases rules f.cases and g.cases are generated instead of unusable

2515 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,

2516 in the case that the unusable rule was used nevertheless.

2518 * Function package: For each function f, new rules f.elims are

2519 generated, which eliminate equalities of the form "f x = t".

2521 * New command 'fun_cases' derives ad-hoc elimination rules for

2522 function equations as simplified instances of f.elims, analogous to

2523 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.

2525 * Lifting:

2526 - parametrized correspondence relations are now supported:

2527 + parametricity theorems for the raw term can be specified in

2528 the command lift_definition, which allow us to generate stronger

2529 transfer rules

2530 + setup_lifting generates stronger transfer rules if parametric

2531 correspondence relation can be generated

2532 + various new properties of the relator must be specified to support

2533 parametricity

2534 + parametricity theorem for the Quotient relation can be specified

2535 - setup_lifting generates domain rules for the Transfer package

2536 - stronger reflexivity prover of respectfulness theorems for type

2537 copies

2538 - ===> and --> are now local. The symbols can be introduced

2539 by interpreting the locale lifting_syntax (typically in an

2540 anonymous context)

2541 - Lifting/Transfer relevant parts of Library/Quotient_* are now in

2542 Main. Potential INCOMPATIBILITY

2543 - new commands for restoring and deleting Lifting/Transfer context:

2544 lifting_forget, lifting_update

2545 - the command print_quotmaps was renamed to print_quot_maps.

2546 INCOMPATIBILITY

2548 * Transfer:

2549 - better support for domains in Transfer: replace Domainp T

2550 by the actual invariant in a transferred goal

2551 - transfer rules can have as assumptions other transfer rules

2552 - Experimental support for transferring from the raw level to the

2553 abstract level: Transfer.transferred attribute

2554 - Attribute version of the transfer method: untransferred attribute

2556 * Reification and reflection:

2557 - Reification is now directly available in HOL-Main in structure

2558 "Reification".

2559 - Reflection now handles multiple lists with variables also.

2560 - The whole reflection stack has been decomposed into conversions.

2561 INCOMPATIBILITY.

2563 * Revised devices for recursive definitions over finite sets:

2564 - Only one fundamental fold combinator on finite set remains:

2565 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b

2566 This is now identity on infinite sets.

2567 - Locales ("mini packages") for fundamental definitions with

2568 Finite_Set.fold: folding, folding_idem.

2569 - Locales comm_monoid_set, semilattice_order_set and

2570 semilattice_neutr_order_set for big operators on sets.

2571 See theory Big_Operators for canonical examples.

2572 Note that foundational constants comm_monoid_set.F and

2573 semilattice_set.F correspond to former combinators fold_image

2574 and fold1 respectively. These are now gone. You may use

2575 those foundational constants as substitutes, but it is

2576 preferable to interpret the above locales accordingly.

2577 - Dropped class ab_semigroup_idem_mult (special case of lattice,

2578 no longer needed in connection with Finite_Set.fold etc.)

2579 - Fact renames:

2580 card.union_inter ~> card_Un_Int [symmetric]

2581 card.union_disjoint ~> card_Un_disjoint

2582 INCOMPATIBILITY.

2584 * Locale hierarchy for abstract orderings and (semi)lattices.

2586 * Complete_Partial_Order.admissible is defined outside the type class

2587 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the

2588 class predicate assumption or sort constraint when possible.

2589 INCOMPATIBILITY.

2591 * Introduce type class "conditionally_complete_lattice": Like a

2592 complete lattice but does not assume the existence of the top and

2593 bottom elements. Allows to generalize some lemmas about reals and

2594 extended reals. Removed SupInf and replaced it by the instantiation

2595 of conditionally_complete_lattice for real. Renamed lemmas about

2596 conditionally-complete lattice from Sup_... to cSup_... and from

2597 Inf_... to cInf_... to avoid hidding of similar complete lattice

2598 lemmas.

2600 * Introduce type class linear_continuum as combination of

2601 conditionally-complete lattices and inner dense linorders which have

2602 more than one element. INCOMPATIBILITY.

2604 * Introduced type classes order_top and order_bot. The old classes top

2605 and bot only contain the syntax without assumptions. INCOMPATIBILITY:

2606 Rename bot -> order_bot, top -> order_top

2608 * Introduce type classes "no_top" and "no_bot" for orderings without

2609 top and bottom elements.

2611 * Split dense_linorder into inner_dense_order and no_top, no_bot.

2613 * Complex_Main: Unify and move various concepts from

2614 HOL-Multivariate_Analysis to HOL-Complex_Main.

2616 - Introduce type class (lin)order_topology and

2617 linear_continuum_topology. Allows to generalize theorems about

2618 limits and order. Instances are reals and extended reals.

2620 - continuous and continuos_on from Multivariate_Analysis:

2621 "continuous" is the continuity of a function at a filter. "isCont"

2622 is now an abbrevitation: "isCont x f == continuous (at _) f".

2624 Generalized continuity lemmas from isCont to continuous on an

2625 arbitrary filter.

2627 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove

2628 compactness of closed intervals on reals. Continuous functions

2629 attain infimum and supremum on compact sets. The inverse of a

2630 continuous function is continuous, when the function is continuous

2631 on a compact set.

2633 - connected from Multivariate_Analysis. Use it to prove the

2634 intermediate value theorem. Show connectedness of intervals on

2635 linear_continuum_topology).

2637 - first_countable_topology from Multivariate_Analysis. Is used to

2638 show equivalence of properties on the neighbourhood filter of x and

2639 on all sequences converging to x.

2641 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved

2642 theorems from Library/FDERIV.thy to Deriv.thy and base the

2643 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV

2644 which are restricted to sets, i.e. to represent derivatives from

2645 left or right.

2647 - Removed the within-filter. It is replaced by the principal filter:

2649 F within X = inf F (principal X)

2651 - Introduce "at x within U" as a single constant, "at x" is now an

2652 abbreviation for "at x within UNIV"

2654 - Introduce named theorem collections tendsto_intros,

2655 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems

2656 in tendsto_intros (or FDERIV_intros) are also available as

2657 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side

2658 is replaced by a congruence rule. This allows to apply them as

2659 intro rules and then proving equivalence by the simplifier.

2661 - Restructured theories in HOL-Complex_Main:

2663 + Moved RealDef and RComplete into Real

2665 + Introduced Topological_Spaces and moved theorems about

2666 topological spaces, filters, limits and continuity to it

2668 + Renamed RealVector to Real_Vector_Spaces

2670 + Split Lim, SEQ, Series into Topological_Spaces,

2671 Real_Vector_Spaces, and Limits

2673 + Moved Ln and Log to Transcendental

2675 + Moved theorems about continuity from Deriv to Topological_Spaces

2677 - Remove various auxiliary lemmas.

2679 INCOMPATIBILITY.

2681 * Nitpick:

2682 - Added option "spy".

2683 - Reduce incidence of "too high arity" errors.

2685 * Sledgehammer:

2686 - Renamed option:

2687 isar_shrink ~> isar_compress

2688 INCOMPATIBILITY.

2689 - Added options "isar_try0", "spy".

2690 - Better support for "isar_proofs".

2691 - MaSh has been fined-tuned and now runs as a local server.

2693 * Improved support for ad hoc overloading of constants (see also

2694 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).

2696 * Library/Polynomial.thy:

2697 - Use lifting for primitive definitions.

2698 - Explicit conversions from and to lists of coefficients, used for

2699 generated code.

2700 - Replaced recursion operator poly_rec by fold_coeffs.

2701 - Prefer pre-existing gcd operation for gcd.

2702 - Fact renames:

2703 poly_eq_iff ~> poly_eq_poly_eq_iff

2704 poly_ext ~> poly_eqI

2705 expand_poly_eq ~> poly_eq_iff

2706 IMCOMPATIBILITY.

2708 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and

2709 case_of_simps to convert function definitions between a list of

2710 equations with patterns on the lhs and a single equation with case

2711 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.

2713 * New Library/FSet.thy: type of finite sets defined as a subtype of

2714 sets defined by Lifting/Transfer.

2716 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.

2718 * Consolidation of library theories on product orders:

2720 Product_Lattice ~> Product_Order -- pointwise order on products

2721 Product_ord ~> Product_Lexorder -- lexicographic order on products

2723 INCOMPATIBILITY.

2725 * Imperative-HOL: The MREC combinator is considered legacy and no

2726 longer included by default. INCOMPATIBILITY, use partial_function

2727 instead, or import theory Legacy_Mrec as a fallback.

2729 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and

2730 ~~/src/HOL/Algebra/poly. Existing theories should be based on

2731 ~~/src/HOL/Library/Polynomial instead. The latter provides

2732 integration with HOL's type classes for rings. INCOMPATIBILITY.

2734 * HOL-BNF:

2735 - Various improvements to BNF-based (co)datatype package, including

2736 new commands "primrec_new", "primcorec", and

2737 "datatype_new_compat", as well as documentation. See

2738 "datatypes.pdf" for details.

2739 - New "coinduction" method to avoid some boilerplate (compared to

2740 coinduct).

2741 - Renamed keywords:

2742 data ~> datatype_new

2743 codata ~> codatatype

2744 bnf_def ~> bnf

2745 - Renamed many generated theorems, including

2746 discs ~> disc

2747 map_comp' ~> map_comp

2748 map_id' ~> map_id

2749 sels ~> sel

2750 set_map' ~> set_map

2751 sets ~> set

2752 IMCOMPATIBILITY.

2755 *** ML ***

2757 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function

2758 "check_property" allows to check specifications of the form "ALL x y

2759 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its

2760 Examples.thy in particular.

2762 * Improved printing of exception trace in Poly/ML 5.5.1, with regular

2763 tracing output in the command transaction context instead of physical

2764 stdout. See also Toplevel.debug, Toplevel.debugging and

2765 ML_Compiler.exn_trace.

2767 * ML type "theory" is now immutable, without any special treatment of

2768 drafts or linear updates (which could lead to "stale theory" errors in

2769 the past). Discontinued obsolete operations like Theory.copy,

2770 Theory.checkpoint, and the auxiliary type theory_ref. Minor

2771 INCOMPATIBILITY.

2773 * More uniform naming of goal functions for skipped proofs:

2775 Skip_Proof.prove ~> Goal.prove_sorry

2776 Skip_Proof.prove_global ~> Goal.prove_sorry_global

2778 Minor INCOMPATIBILITY.

2780 * Simplifier tactics and tools use proper Proof.context instead of

2781 historic type simpset. Old-style declarations like addsimps,

2782 addsimprocs etc. operate directly on Proof.context. Raw type simpset

2783 retains its use as snapshot of the main Simplifier context, using

2784 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port

2785 old tools by making them depend on (ctxt : Proof.context) instead of

2786 (ss : simpset), then turn (simpset_of ctxt) into ctxt.

2788 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)

2789 operate on Proof.context instead of claset, for uniformity with addIs,

2790 addEs, addDs etc. Note that claset_of and put_claset allow to manage

2791 clasets separately from the context.

2793 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.

2794 INCOMPATIBILITY, use @{context} instead.

2796 * Antiquotation @{theory_context A} is similar to @{theory A}, but

2797 presents the result as initial Proof.context.

2800 *** System ***

2802 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by

2803 "isabelle build" in Isabelle2013. INCOMPATIBILITY.

2805 * Discontinued obsolete isabelle-process options -f and -u (former

2806 administrative aliases of option -e). Minor INCOMPATIBILITY.

2808 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND

2809 settings variable.

2811 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic

2812 document formats: dvi.gz, ps, ps.gz -- the default document format is

2813 always pdf.

2815 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to

2816 specify global resources of the JVM process run by isabelle build.

2818 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows

2819 to run Isabelle/Scala source files as standalone programs.

2821 * Improved "isabelle keywords" tool (for old-style ProofGeneral

2822 keyword tables): use Isabelle/Scala operations, which inspect outer

2823 syntax without requiring to build sessions first.

2825 * Sessions may be organized via 'chapter' specifications in the ROOT

2826 file, which determines a two-level hierarchy of browser info. The old

2827 tree-like organization via implicit sub-session relation (with its

2828 tendency towards erratic fluctuation of URLs) has been discontinued.

2829 The default chapter is called "Unsorted". Potential INCOMPATIBILITY

2830 for HTML presentation of theories.

2834 New in Isabelle2013 (February 2013)

2835 -----------------------------------

2837 *** General ***

2839 * Theorem status about oracles and unfinished/failed future proofs is

2840 no longer printed by default, since it is incompatible with

2841 incremental / parallel checking of the persistent document model. ML

2842 function Thm.peek_status may be used to inspect a snapshot of the

2843 ongoing evaluation process. Note that in batch mode --- notably

2844 isabelle build --- the system ensures that future proofs of all

2845 accessible theorems in the theory context are finished (as before).

2847 * Configuration option show_markup controls direct inlining of markup

2848 into the printed representation of formal entities --- notably type

2849 and sort constraints. This enables Prover IDE users to retrieve that

2850 information via tooltips in the output window, for example.

2852 * Command 'ML_file' evaluates ML text from a file directly within the

2853 theory, without any predeclaration via 'uses' in the theory header.

2855 * Old command 'use' command and corresponding keyword 'uses' in the

2856 theory header are legacy features and will be discontinued soon.

2857 Tools that load their additional source files may imitate the

2858 'ML_file' implementation, such that the system can take care of

2859 dependencies properly.

2861 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which

2862 is called fastforce / fast_force_tac already since Isabelle2011-1.

2864 * Updated and extended "isar-ref" and "implementation" manual, reduced

2865 remaining material in old "ref" manual.

2867 * Improved support for auxiliary contexts that indicate block structure

2868 for specifications. Nesting of "context fixes ... context assumes ..."

2869 and "class ... context ...".

2871 * Attribute "consumes" allows a negative value as well, which is

2872 interpreted relatively to the total number of premises of the rule in

2873 the target context. This form of declaration is stable when exported

2874 from a nested 'context' with additional assumptions. It is the

2875 preferred form for definitional packages, notably cases/rules produced

2876 in HOL/inductive and HOL/function.

2878 * More informative error messages for Isar proof commands involving

2879 lazy enumerations (method applications etc.).

2881 * Refined 'help' command to retrieve outer syntax commands according

2882 to name patterns (with clickable results).

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

2887 * Parallel terminal proofs ('by') are enabled by default, likewise

2888 proofs that are built into packages like 'datatype', 'function'. This

2889 allows to "run ahead" checking the theory specifications on the

2890 surface, while the prover is still crunching on internal

2891 justifications. Unfinished / cancelled proofs are restarted as

2892 required to complete full proof checking eventually.

2894 * Improved output panel with tooltips, hyperlinks etc. based on the

2895 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of

2896 tooltips leads to some window that supports the same recursively,

2897 which can lead to stacks of tooltips as the semantic document content

2898 is explored. ESCAPE closes the whole stack, individual windows may be

2899 closed separately, or detached to become independent jEdit dockables.

2901 * Improved support for commands that produce graph output: the text

2902 message contains a clickable area to open a new instance of the graph

2903 browser on demand.

2905 * More robust incremental parsing of outer syntax (partial comments,

2906 malformed symbols). Changing the balance of open/close quotes and

2907 comment delimiters works more conveniently with unfinished situations

2908 that frequently occur in user interaction.

2910 * More efficient painting and improved reactivity when editing large

2911 files. More scalable management of formal document content.

2913 * Smarter handling of tracing messages: prover process pauses after

2914 certain number of messages per command transaction, with some user

2915 dialog to stop or continue. This avoids swamping the front-end with

2916 potentially infinite message streams.

2918 * More plugin options and preferences, based on Isabelle/Scala. The

2919 jEdit plugin option panel provides access to some Isabelle/Scala

2920 options, including tuning parameters for editor reactivity and color

2921 schemes.

2923 * Dockable window "Symbols" provides some editing support for Isabelle

2924 symbols.

2926 * Dockable window "Monitor" shows ML runtime statistics. Note that

2927 continuous display of the chart slows down the system.

2929 * Improved editing support for control styles: subscript, superscript,

2930 bold, reset of style -- operating on single symbols or text

2931 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.

2933 * Actions isabelle.increase-font-size and isabelle.decrease-font-size

2934 adjust the main text area font size, and its derivatives for output,

2935 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often

2936 need to be adapted to local keyboard layouts.

2938 * More reactive completion popup by default: use \t (TAB) instead of

2939 \n (NEWLINE) to minimize intrusion into regular flow of editing. See

2940 also "Plugin Options / SideKick / General / Code Completion Options".

2942 * Implicit check and build dialog of the specified logic session

2943 image. For example, HOL, HOLCF, HOL-Nominal can be produced on

2944 demand, without bundling big platform-dependent heap images in the

2945 Isabelle distribution.

2947 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates

2948 from Oracle provide better multi-platform experience. This version is

2949 now bundled exclusively with Isabelle.

2952 *** Pure ***

2954 * Code generation for Haskell: restrict unqualified imports from

2955 Haskell Prelude to a small set of fundamental operations.

2957 * Command 'export_code': relative file names are interpreted

2958 relatively to master directory of current theory rather than the

2959 rather arbitrary current working directory. INCOMPATIBILITY.

2961 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,

2962 use regular rule composition via "OF" / "THEN", or explicit proof

2963 structure instead. Note that Isabelle/ML provides a variety of

2964 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied

2965 with some care where this is really required.

2967 * Command 'typ' supports an additional variant with explicit sort

2968 constraint, to infer and check the most general type conforming to a

2969 given sort. Example (in HOL):

2971 typ "_ * _ * bool * unit" :: finite

2973 * Command 'locale_deps' visualizes all locales and their relations as

2974 a Hasse diagram.

2977 *** HOL ***

2979 * Sledgehammer:

2981 - Added MaSh relevance filter based on machine-learning; see the

2982 Sledgehammer manual for details.

2983 - Polished Isar proofs generated with "isar_proofs" option.

2984 - Rationalized type encodings ("type_enc" option).

2985 - Renamed "kill_provers" subcommand to "kill_all".

2986 - Renamed options:

2987 isar_proof ~> isar_proofs

2988 isar_shrink_factor ~> isar_shrink

2989 max_relevant ~> max_facts

2990 relevance_thresholds ~> fact_thresholds

2992 * Quickcheck: added an optimisation for equality premises. It is

2993 switched on by default, and can be switched off by setting the

2994 configuration quickcheck_optimise_equality to false.

2996 * Quotient: only one quotient can be defined by quotient_type

2997 INCOMPATIBILITY.

2999 * Lifting:

3000 - generation of an abstraction function equation in lift_definition

3001 - quot_del attribute

3002 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)

3004 * Simproc "finite_Collect" rewrites set comprehensions into pointfree

3005 expressions.

3007 * Preprocessing of the code generator rewrites set comprehensions into

3008 pointfree expressions.

3010 * The SMT solver Z3 has now by default a restricted set of directly

3011 supported features. For the full set of features (div/mod, nonlinear

3012 arithmetic, datatypes/records) with potential proof reconstruction

3013 failures, enable the configuration option "z3_with_extensions". Minor

3014 INCOMPATIBILITY.

3016 * Simplified 'typedef' specifications: historical options for implicit

3017 set definition and alternative name have been discontinued. The

3018 former behavior of "typedef (open) t = A" is now the default, but

3019 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories

3020 accordingly.

3022 * Removed constant "chars"; prefer "Enum.enum" on type "char"

3023 directly. INCOMPATIBILITY.

3025 * Moved operation product, sublists and n_lists from theory Enum to

3026 List. INCOMPATIBILITY.

3028 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.

3030 * Class "comm_monoid_diff" formalises properties of bounded

3031 subtraction, with natural numbers and multisets as typical instances.

3033 * Added combinator "Option.these" with type "'a option set => 'a set".

3035 * Theory "Transitive_Closure": renamed lemmas

3037 reflcl_tranclp -> reflclp_tranclp

3038 rtranclp_reflcl -> rtranclp_reflclp

3040 INCOMPATIBILITY.

3042 * Theory "Rings": renamed lemmas (in class semiring)

3044 left_distrib ~> distrib_right

3045 right_distrib ~> distrib_left

3047 INCOMPATIBILITY.

3049 * Generalized the definition of limits:

3051 - Introduced the predicate filterlim (LIM x F. f x :> G) which

3052 expresses that when the input values x converge to F then the

3053 output f x converges to G.

3055 - Added filters for convergence to positive (at_top) and negative

3056 infinity (at_bot).

3058 - Moved infinity in the norm (at_infinity) from

3059 Multivariate_Analysis to Complex_Main.

3061 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>

3062 at_top".

3064 INCOMPATIBILITY.

3066 * Theory "Library/Option_ord" provides instantiation of option type to

3067 lattice type classes.

3069 * Theory "Library/Multiset": renamed

3071 constant fold_mset ~> Multiset.fold

3072 fact fold_mset_commute ~> fold_mset_comm

3074 INCOMPATIBILITY.

3076 * Renamed theory Library/List_Prefix to Library/Sublist, with related

3077 changes as follows.

3079 - Renamed constants (and related lemmas)

3081 prefix ~> prefixeq

3082 strict_prefix ~> prefix

3084 - Replaced constant "postfix" by "suffixeq" with swapped argument

3085 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped

3086 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.

3087 Renamed lemmas accordingly.

3089 - Added constant "list_hembeq" for homeomorphic embedding on

3090 lists. Added abbreviation "sublisteq" for special case

3091 "list_hembeq (op =)".

3093 - Theory Library/Sublist no longer provides "order" and "bot" type

3094 class instances for the prefix order (merely corresponding locale

3095 interpretations). The type class instances are now in theory

3096 Library/Prefix_Order.

3098 - The sublist relation of theory Library/Sublist_Order is now based

3099 on "Sublist.sublisteq". Renamed lemmas accordingly:

3101 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff

3102 le_list_append_mono ~> Sublist.list_hembeq_append_mono

3103 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2

3104 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD

3105 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'

3106 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq

3107 le_list_drop_Cons ~> Sublist.sublisteq_Cons'

3108 le_list_drop_many ~> Sublist.sublisteq_drop_many

3109 le_list_filter_left ~> Sublist.sublisteq_filter_left

3110 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many

3111 le_list_rev_take_iff ~> Sublist.sublisteq_append

3112 le_list_same_length ~> Sublist.sublisteq_same_length

3113 le_list_take_many_iff ~> Sublist.sublisteq_append'

3114 less_eq_list.drop ~> less_eq_list_drop

3115 less_eq_list.induct ~> less_eq_list_induct

3116 not_le_list_length ~> Sublist.not_sublisteq_length

3118 INCOMPATIBILITY.

3120 * New theory Library/Countable_Set.

3122 * Theory Library/Debug and Library/Parallel provide debugging and

3123 parallel execution for code generated towards Isabelle/ML.

3125 * Theory Library/FuncSet: Extended support for Pi and extensional and

3126 introduce the extensional dependent function space "PiE". Replaced

3127 extensional_funcset by an abbreviation, and renamed lemmas from

3128 extensional_funcset to PiE as follows:

3130 extensional_empty ~> PiE_empty

3131 extensional_funcset_empty_domain ~> PiE_empty_domain

3132 extensional_funcset_empty_range ~> PiE_empty_range

3133 extensional_funcset_arb ~> PiE_arb

3134 extensional_funcset_mem ~> PiE_mem

3135 extensional_funcset_extend_domainI ~> PiE_fun_upd

3136 extensional_funcset_restrict_domain ~> fun_upd_in_PiE

3137 extensional_funcset_extend_domain_eq ~> PiE_insert_eq

3138 card_extensional_funcset ~> card_PiE

3139 finite_extensional_funcset ~> finite_PiE

3141 INCOMPATIBILITY.

3143 * Theory Library/FinFun: theory of almost everywhere constant

3144 functions (supersedes the AFP entry "Code Generation for Functions as

3145 Data").

3147 * Theory Library/Phantom: generic phantom type to make a type

3148 parameter appear in a constant's type. This alternative to adding

3149 TYPE('a) as another parameter avoids unnecessary closures in generated

3150 code.

3152 * Theory Library/RBT_Impl: efficient construction of red-black trees

3153 from sorted associative lists. Merging two trees with rbt_union may

3154 return a structurally different tree than before. Potential

3155 INCOMPATIBILITY.

3157 * Theory Library/IArray: immutable arrays with code generation.

3159 * Theory Library/Finite_Lattice: theory of finite lattices.

3161 * HOL/Multivariate_Analysis: replaced

3163 "basis :: 'a::euclidean_space => nat => real"

3164 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"

3166 on euclidean spaces by using the inner product "_ \<bullet> _" with

3167 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by

3168 "SUM i : Basis. f i * r i".

3170 With this change the following constants are also changed or removed:

3172 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)

3173 a $$ i ~> inner a i (where i : Basis)

3174 cart_base i removed

3175 \<pi>, \<pi>' removed

3177 Theorems about these constants where removed.

3179 Renamed lemmas:

3181 component_le_norm ~> Basis_le_norm

3182 euclidean_eq ~> euclidean_eq_iff

3183 differential_zero_maxmin_component ~> differential_zero_maxmin_cart

3184 euclidean_simps ~> inner_simps

3185 independent_basis ~> independent_Basis

3186 span_basis ~> span_Basis

3187 in_span_basis ~> in_span_Basis

3188 norm_bound_component_le ~> norm_boound_Basis_le

3189 norm_bound_component_lt ~> norm_boound_Basis_lt

3190 component_le_infnorm ~> Basis_le_infnorm

3192 INCOMPATIBILITY.

3194 * HOL/Probability:

3196 - Added simproc "measurable" to automatically prove measurability.

3198 - Added induction rules for sigma sets with disjoint union

3199 (sigma_sets_induct_disjoint) and for Borel-measurable functions

3200 (borel_measurable_induct).

3202 - Added the Daniell-Kolmogorov theorem (the existence the limit of a

3203 projective family).

3205 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the

3206 AFP entry "Ordinals_and_Cardinals").

3208 * HOL/BNF: New (co)datatype package based on bounded natural functors

3209 with support for mixed, nested recursion and interesting non-free

3210 datatypes.

3212 * HOL/Finite_Set and Relation: added new set and relation operations

3213 expressed by Finite_Set.fold.

3215 * New theory HOL/Library/RBT_Set: implementation of sets by red-black

3216 trees for the code generator.

3218 * HOL/Library/RBT and HOL/Library/Mapping have been converted to

3219 Lifting/Transfer.

3220 possible INCOMPATIBILITY.

3222 * HOL/Set: renamed Set.project -> Set.filter

3223 INCOMPATIBILITY.

3226 *** Document preparation ***

3228 * Dropped legacy antiquotations "term_style" and "thm_style", since

3229 styles may be given as arguments to "term" and "thm" already.

3230 Discontinued legacy styles "prem1" .. "prem19".

3232 * Default LaTeX rendering for \<euro> is now based on eurosym package,

3233 instead of slightly exotic babel/greek.

3235 * Document variant NAME may use different LaTeX entry point

3236 document/root_NAME.tex if that file exists, instead of the common

3237 document/root.tex.

3239 * Simplified custom document/build script, instead of old-style

3240 document/IsaMakefile. Minor INCOMPATIBILITY.

3243 *** ML ***

3245 * The default limit for maximum number of worker threads is now 8,

3246 instead of 4, in correspondence to capabilities of contemporary

3247 hardware and Poly/ML runtime system.

3249 * Type Seq.results and related operations support embedded error

3250 messages within lazy enumerations, and thus allow to provide

3251 informative errors in the absence of any usable results.

3253 * Renamed Position.str_of to Position.here to emphasize that this is a

3254 formal device to inline positions into message text, but not

3255 necessarily printing visible text.

3258 *** System ***

3260 * Advanced support for Isabelle sessions and build management, see

3261 "system" manual for the chapter of that name, especially the "isabelle

3262 build" tool and its examples. The "isabelle mkroot" tool prepares

3263 session root directories for use with "isabelle build", similar to

3264 former "isabelle mkdir" for "isabelle usedir". Note that this affects

3265 document preparation as well. INCOMPATIBILITY, isabelle usedir /

3266 mkdir / make are rendered obsolete.

3268 * Discontinued obsolete Isabelle/build script, it is superseded by the

3269 regular isabelle build tool. For example:

3271 isabelle build -s -b HOL

3273 * Discontinued obsolete "isabelle makeall".

3275 * Discontinued obsolete IsaMakefile and ROOT.ML files from the

3276 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that

3277 provides some traditional targets that invoke "isabelle build". Note

3278 that this is inefficient! Applications of Isabelle/HOL involving

3279 "isabelle make" should be upgraded to use "isabelle build" directly.

3281 * The "isabelle options" tool prints Isabelle system options, as

3282 required for "isabelle build", for example.

3284 * The "isabelle logo" tool produces EPS and PDF format simultaneously.

3285 Minor INCOMPATIBILITY in command-line options.

3287 * The "isabelle install" tool has now a simpler command-line. Minor

3288 INCOMPATIBILITY.

3290 * The "isabelle components" tool helps to resolve add-on components

3291 that are not bundled, or referenced from a bare-bones repository

3292 version of Isabelle.

3294 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general

3295 platform family: "linux", "macos", "windows".

3297 * The ML system is configured as regular component, and no longer

3298 picked up from some surrounding directory. Potential INCOMPATIBILITY

3299 for home-made settings.

3301 * Improved ML runtime statistics (heap, threads, future tasks etc.).

3303 * Discontinued support for Poly/ML 5.2.1, which was the last version

3304 without exception positions and advanced ML compiler/toplevel

3305 configuration.

3307 * Discontinued special treatment of Proof General -- no longer guess

3308 PROOFGENERAL_HOME based on accidental file-system layout. Minor

3309 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS

3310 settings manually, or use a Proof General version that has been

3311 bundled as Isabelle component.

3315 New in Isabelle2012 (May 2012)

3316 ------------------------------

3318 *** General ***

3320 * Prover IDE (PIDE) improvements:

3322 - more robust Sledgehammer integration (as before the sledgehammer

3323 command-line needs to be typed into the source buffer)

3324 - markup for bound variables

3325 - markup for types of term variables (displayed as tooltips)

3326 - support for user-defined Isar commands within the running session

3327 - improved support for Unicode outside original 16bit range

3328 e.g. glyph for \<A> (thanks to jEdit 4.5.1)

3330 * Forward declaration of outer syntax keywords within the theory

3331 header -- minor INCOMPATIBILITY for user-defined commands. Allow new

3332 commands to be used in the same theory where defined.

3334 * Auxiliary contexts indicate block structure for specifications with

3335 additional parameters and assumptions. Such unnamed contexts may be

3336 nested within other targets, like 'theory', 'locale', 'class',

3337 'instantiation' etc. Results from the local context are generalized

3338 accordingly and applied to the enclosing target context. Example:

3340 context

3341 fixes x y z :: 'a

3342 assumes xy: "x = y" and yz: "y = z"

3343 begin

3345 lemma my_trans: "x = z" using xy yz by simp

3347 end

3349 thm my_trans

3351 The most basic application is to factor-out context elements of

3352 several fixes/assumes/shows theorem statements, e.g. see

3353 ~~/src/HOL/Isar_Examples/Group_Context.thy

3355 Any other local theory specification element works within the "context

3356 ... begin ... end" block as well.

3358 * Bundled declarations associate attributed fact expressions with a

3359 given name in the context. These may be later included in other

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

3361 the logical dependencies of locales and locale interpretation. See

3362 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.

3364 * Commands 'lemmas' and 'theorems' allow local variables using 'for'

3365 declaration, and results are standardized before being stored. Thus

3366 old-style "standard" after instantiation or composition of facts

3367 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of

3368 indices of schematic variables.

3370 * Rule attributes in local theory declarations (e.g. locale or class)

3371 are now statically evaluated: the resulting theorem is stored instead

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

3373 the historic accident of dynamic re-evaluation in interpretations

3374 etc. was exploited.

3376 * New tutorial "Programming and Proving in Isabelle/HOL"

3377 ("prog-prove"). It completely supersedes "A Tutorial Introduction to

3378 Structured Isar Proofs" ("isar-overview"), which has been removed. It

3379 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order

3380 Logic" as the recommended beginners tutorial, but does not cover all

3381 of the material of that old tutorial.

3383 * Updated and extended reference manuals: "isar-ref",

3384 "implementation", "system"; reduced remaining material in old "ref"

3385 manual.

3388 *** Pure ***

3390 * Command 'definition' no longer exports the foundational "raw_def"

3391 into the user context. Minor INCOMPATIBILITY, may use the regular

3392 "def" result with attribute "abs_def" to imitate the old version.

3394 * Attribute "abs_def" turns an equation of the form "f x y == t" into

3395 "f == %x y. t", which ensures that "simp" or "unfold" steps always

3396 expand it. This also works for object-logic equality. (Formerly

3397 undocumented feature.)

3399 * Sort constraints are now propagated in simultaneous statements, just

3400 like type constraints. INCOMPATIBILITY in rare situations, where

3401 distinct sorts used to be assigned accidentally. For example:

3403 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"

3405 lemma "P (x::'a)" and "Q (y::'a::bar)"

3406 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"

3408 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more

3409 tolerant against multiple unifiers, as long as the final result is

3410 unique. (As before, rules are composed in canonical right-to-left

3411 order to accommodate newly introduced premises.)

3413 * Renamed some inner syntax categories:

3415 num ~> num_token

3416 xnum ~> xnum_token

3417 xstr ~> str_token

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

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

3421 position information via constraints).

3423 * Simplified configuration options for syntax ambiguity: see

3424 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref

3425 manual. Minor INCOMPATIBILITY.

3427 * Discontinued configuration option "syntax_positions": atomic terms

3428 in parse trees are always annotated by position constraints.

3430 * Old code generator for SML and its commands 'code_module',

3431 'code_library', 'consts_code', 'types_code' have been discontinued.

3432 Use commands of the generic code generator instead. INCOMPATIBILITY.

3434 * Redundant attribute "code_inline" has been discontinued. Use

3435 "code_unfold" instead. INCOMPATIBILITY.

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

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

3440 definition [code_abbrev]: "f = t"

3442 INCOMPATIBILITY.

3444 * Obsolete 'types' command has been discontinued. Use 'type_synonym'

3445 instead. INCOMPATIBILITY.

3447 * Discontinued old "prems" fact, which used to refer to the accidental

3448 collection of foundational premises in the context (already marked as

3449 legacy since Isabelle2011).

3452 *** HOL ***

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

3455 Isabelle2008). Definitions mem_def and Collect_def have disappeared.

3456 Non-trivial INCOMPATIBILITY. For developments keeping predicates and

3457 sets separate, it is often sufficient to rephrase some set S that has

3458 been accidentally used as predicates by "%x. x : S", and some

3459 predicate P that has been accidentally used as set by "{x. P x}".

3460 Corresponding proofs in a first step should be pruned from any

3461 tinkering with former theorems mem_def and Collect_def as far as

3462 possible.

3464 For developments which deliberately mix predicates and sets, a

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

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

3467 Isabelle2011-1 before jumping right into the current release.

3469 * Code generation by default implements sets as container type rather

3470 than predicates. INCOMPATIBILITY.

3472 * New type synonym 'a rel = ('a * 'a) set

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

3475 represents strictly positive binary numerals, along with functions

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

3477 positive and negated numeric literals, respectively. See also

3478 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some

3479 user theories may require adaptations as follows:

3481 - Theorems with number_ring or number_semiring constraints: These

3482 classes are gone; use comm_ring_1 or comm_semiring_1 instead.

3484 - Theories defining numeric types: Remove number, number_semiring,

3485 and number_ring instances. Defer all theorems about numerals until

3486 after classes one and semigroup_add have been instantiated.

3488 - Numeral-only simp rules: Replace each rule having a "number_of v"

3489 pattern with two copies, one for numeral and one for neg_numeral.

3491 - Theorems about subclasses of semiring_1 or ring_1: These classes

3492 automatically support numerals now, so more simp rules and

3493 simprocs may now apply within the proof.

3495 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:

3496 Redefine using other integer operations.

3498 * Transfer: New package intended to generalize the existing

3499 "descending" method and related theorem attributes from the Quotient

3500 package. (Not all functionality is implemented yet, but future

3501 development will focus on Transfer as an eventual replacement for the

3502 corresponding parts of the Quotient package.)

3504 - transfer_rule attribute: Maintains a collection of transfer rules,

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

3506 relate different type instances of the same polymorphic constant,

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

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

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

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

3513 - transfer method: Replaces a subgoal on abstract types with an

3514 equivalent subgoal on the corresponding raw types. Constants are

3515 replaced with corresponding ones according to the transfer rules.

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

3517 necessary for variables whose types change, but can be overridden

3518 for specific variables with e.g. "transfer fixing: x y z". The

3519 variant transfer' method allows replacing a subgoal with one that

3520 is logically stronger (rather than equivalent).

3522 - relator_eq attribute: Collects identity laws for relators of

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

3524 transfer method uses these lemmas to infer transfer rules for

3525 non-polymorphic constants on the fly.

3527 - transfer_prover method: Assists with proving a transfer rule for a

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

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

3530 after unfolding the constant definitions.

3532 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer

3533 from type nat to type int.

3535 * Lifting: New package intended to generalize the quotient_definition

3536 facility of the Quotient package; designed to work with Transfer.

3538 - lift_definition command: Defines operations on an abstract type in

3539 terms of a corresponding operation on a representation

3540 type. Example syntax:

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

3543 is List.insert

3545 Users must discharge a respectfulness proof obligation when each

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

3547 the proof is discharged automatically.) The obligation is

3548 presented in a user-friendly, readable form; a respectfulness

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

3550 by the package.

3552 - Integration with code_abstype: For typedefs (e.g. subtypes

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

3554 lift_definition generates a code certificate theorem and sets up

3555 code generation for each constant.

3557 - setup_lifting command: Sets up the Lifting package to work with a

3558 user-defined type. The user must provide either a quotient theorem

3559 or a type_definition theorem. The package configures transfer

3560 rules for equality and quantifiers on the type, and sets up the

3561 lift_definition command to work with the type.

3563 - Usage examples: See Quotient_Examples/Lift_DList.thy,

3564 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,

3565 Word/Word.thy and Library/Float.thy.

3567 * Quotient package:

3569 - The 'quotient_type' command now supports a 'morphisms' option with

3570 rep and abs functions, similar to typedef.

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

3573 Transfer packages, as with 'setup_lifting'.

3575 - The 'quotient_definition' command now requires the user to prove a

3576 respectfulness property at the point where the constant is

3577 defined, similar to lift_definition; INCOMPATIBILITY.

3579 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems

3580 accordingly, INCOMPATIBILITY.

3582 * New diagnostic command 'find_unused_assms' to find potentially

3583 superfluous assumptions in theorems using Quickcheck.

3585 * Quickcheck:

3587 - Quickcheck returns variable assignments as counterexamples, which

3588 allows to reveal the underspecification of functions under test.

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

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

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

3593 These counterexample are marked as potentially spurious, as

3594 Quickcheck also returns "xs = []" as a counterexample to the

3595 obvious theorem "hd xs = hd xs".

3597 After finding a potentially spurious counterexample, Quickcheck

3598 continues searching for genuine ones.

3600 By default, Quickcheck shows potentially spurious and genuine

3601 counterexamples. The option "genuine_only" sets quickcheck to only

3602 show genuine counterexamples.

3604 - The command 'quickcheck_generator' creates random and exhaustive

3605 value generators for a given type and operations.

3607 It generates values by using the operations as if they were

3608 constructors of that type.

3610 - Support for multisets.

3612 - Added "use_subtype" options.

3614 - Added "quickcheck_locale" configuration to specify how to process

3615 conjectures in a locale context.

3617 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option

3618 and affecting 'rat' and 'real'.

3620 * Sledgehammer:

3621 - Integrated more tightly with SPASS, as described in the ITP 2012

3622 paper "More SPASS with Isabelle".

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

3624 - Added support for the following provers: Alt-Ergo (via Why3 and

3625 TFF1), iProver, iProver-Eq.

3626 - Sped up the minimizer.

3627 - Added "lam_trans", "uncurry_aliases", and "minimize" options.

3628 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").

3629 - Renamed "sound" option to "strict".

3631 * Metis: Added possibility to specify lambda translations scheme as a

3632 parenthesized argument (e.g., "by (metis (lifting) ...)").

3634 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".

3636 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.

3638 * New "case_product" attribute to generate a case rule doing multiple

3639 case distinctions at the same time. E.g.

3641 list.exhaust [case_product nat.exhaust]

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

3644 a list and a nat.

3646 * New "eventually_elim" method as a generalized variant of the

3647 eventually_elim* rules. Supports structured proofs.

3649 * Typedef with implicit set definition is considered legacy. Use

3650 "typedef (open)" form instead, which will eventually become the

3651 default.

3653 * Record: code generation can be switched off manually with

3655 declare [[record_coden = false]] -- "default true"

3657 * Datatype: type parameters allow explicit sort constraints.

3659 * Concrete syntax for case expressions includes constraints for source

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

3661 INCOMPATIBILITY for old-style syntax translations that augment the

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

3663 one_case.

3665 * Clarified attribute "mono_set": pure declaration without modifying

3666 the result of the fact expression.

3668 * More default pred/set conversions on a couple of relation operations

3669 and predicates. Added powers of predicate relations. Consolidation

3670 of some relation theorems:

3672 converse_def ~> converse_unfold

3673 rel_comp_def ~> relcomp_unfold

3674 symp_def ~> (modified, use symp_def and sym_def instead)

3675 transp_def ~> transp_trans

3676 Domain_def ~> Domain_unfold

3677 Range_def ~> Domain_converse [symmetric]

3679 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.

3681 See theory "Relation" for examples for making use of pred/set

3682 conversions by means of attributes "to_set" and "to_pred".

3684 INCOMPATIBILITY.

3686 * Renamed facts about the power operation on relations, i.e., relpow

3687 to match the constant's name:

3689 rel_pow_1 ~> relpow_1

3690 rel_pow_0_I ~> relpow_0_I

3691 rel_pow_Suc_I ~> relpow_Suc_I

3692 rel_pow_Suc_I2 ~> relpow_Suc_I2

3693 rel_pow_0_E ~> relpow_0_E

3694 rel_pow_Suc_E ~> relpow_Suc_E

3695 rel_pow_E ~> relpow_E

3696 rel_pow_Suc_D2 ~> relpow_Suc_D2

3697 rel_pow_Suc_E2 ~> relpow_Suc_E2

3698 rel_pow_Suc_D2' ~> relpow_Suc_D2'

3699 rel_pow_E2 ~> relpow_E2

3700 rel_pow_add ~> relpow_add

3701 rel_pow_commute ~> relpow

3702 rel_pow_empty ~> relpow_empty:

3703 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow

3704 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl

3705 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow

3706 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow

3707 rel_pow_fun_conv ~> relpow_fun_conv

3708 rel_pow_finite_bounded1 ~> relpow_finite_bounded1

3709 rel_pow_finite_bounded ~> relpow_finite_bounded

3710 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow

3711 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow

3712 single_valued_rel_pow ~> single_valued_relpow

3714 INCOMPATIBILITY.

3716 * Theory Relation: Consolidated constant name for relation composition

3717 and corresponding theorem names:

3719 - Renamed constant rel_comp to relcomp.

3721 - Dropped abbreviation pred_comp. Use relcompp instead.

3723 - Renamed theorems:

3725 rel_compI ~> relcompI

3726 rel_compEpair ~> relcompEpair

3727 rel_compE ~> relcompE

3728 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq

3729 rel_comp_empty1 ~> relcomp_empty1

3730 rel_comp_mono ~> relcomp_mono

3731 rel_comp_subset_Sigma ~> relcomp_subset_Sigma

3732 rel_comp_distrib ~> relcomp_distrib

3733 rel_comp_distrib2 ~> relcomp_distrib2

3734 rel_comp_UNION_distrib ~> relcomp_UNION_distrib

3735 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2

3736 single_valued_rel_comp ~> single_valued_relcomp

3737 rel_comp_def ~> relcomp_unfold

3738 converse_rel_comp ~> converse_relcomp

3739 pred_compI ~> relcomppI

3740 pred_compE ~> relcomppE

3741 pred_comp_bot1 ~> relcompp_bot1

3742 pred_comp_bot2 ~> relcompp_bot2

3743 transp_pred_comp_less_eq ~> transp_relcompp_less_eq

3744 pred_comp_mono ~> relcompp_mono

3745 pred_comp_distrib ~> relcompp_distrib

3746 pred_comp_distrib2 ~> relcompp_distrib2

3747 converse_pred_comp ~> converse_relcompp

3749 finite_rel_comp ~> finite_relcomp

3751 set_rel_comp ~> set_relcomp

3753 INCOMPATIBILITY.

3755 * Theory Divides: Discontinued redundant theorems about div and mod.

3756 INCOMPATIBILITY, use the corresponding generic theorems instead.

3758 DIVISION_BY_ZERO ~> div_by_0, mod_by_0

3759 zdiv_self ~> div_self

3760 zmod_self ~> mod_self

3761 zdiv_zero ~> div_0

3762 zmod_zero ~> mod_0

3763 zdiv_zmod_equality ~> div_mod_equality2

3764 zdiv_zmod_equality2 ~> div_mod_equality

3765 zmod_zdiv_trivial ~> mod_div_trivial

3766 zdiv_zminus_zminus ~> div_minus_minus

3767 zmod_zminus_zminus ~> mod_minus_minus

3768 zdiv_zminus2 ~> div_minus_right

3769 zmod_zminus2 ~> mod_minus_right

3770 zdiv_minus1_right ~> div_minus1_right

3771 zmod_minus1_right ~> mod_minus1_right

3772 zdvd_mult_div_cancel ~> dvd_mult_div_cancel

3773 zmod_zmult1_eq ~> mod_mult_right_eq

3774 zpower_zmod ~> power_mod

3775 zdvd_zmod ~> dvd_mod

3776 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd

3777 mod_mult_distrib ~> mult_mod_left

3778 mod_mult_distrib2 ~> mult_mod_right

3780 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use

3781 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.

3783 * Finite_Set.fold now qualified. INCOMPATIBILITY.

3785 * Consolidated theorem names concerning fold combinators:

3787 inf_INFI_fold_inf ~> inf_INF_fold_inf

3788 sup_SUPR_fold_sup ~> sup_SUP_fold_sup

3789 INFI_fold_inf ~> INF_fold_inf

3790 SUPR_fold_sup ~> SUP_fold_sup

3791 union_set ~> union_set_fold

3792 minus_set ~> minus_set_fold

3793 INFI_set_fold ~> INF_set_fold

3794 SUPR_set_fold ~> SUP_set_fold

3795 INF_code ~> INF_set_foldr

3796 SUP_code ~> SUP_set_foldr

3797 foldr.simps ~> foldr.simps (in point-free formulation)

3798 foldr_fold_rev ~> foldr_conv_fold

3799 foldl_fold ~> foldl_conv_fold

3800 foldr_foldr ~> foldr_conv_foldl

3801 foldl_foldr ~> foldl_conv_foldr

3802 fold_set_remdups ~> fold_set_fold_remdups

3803 fold_set ~> fold_set_fold

3804 fold1_set ~> fold1_set_fold

3806 INCOMPATIBILITY.

3808 * Dropped rarely useful theorems concerning fold combinators:

3809 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,

3810 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,

3811 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,

3812 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,

3813 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,

3814 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.

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

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

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

3818 unfolding "foldr_conv_fold" and "foldl_conv_fold".

3820 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,

3821 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,

3822 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,

3823 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding

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

3825 fold_conv_foldr and fold_rev.

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

3828 through option types.

3830 * "Transitive_Closure.ntrancl": bounded transitive closure on

3831 relations.

3833 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.

3835 * Theory Int: Discontinued many legacy theorems specific to type int.

3836 INCOMPATIBILITY, use the corresponding generic theorems instead.

3838 zminus_zminus ~> minus_minus

3839 zminus_0 ~> minus_zero

3840 zminus_zadd_distrib ~> minus_add_distrib

3841 zadd_commute ~> add_commute

3842 zadd_assoc ~> add_assoc

3843 zadd_left_commute ~> add_left_commute

3844 zadd_ac ~> add_ac

3845 zmult_ac ~> mult_ac

3846 zadd_0 ~> add_0_left

3847 zadd_0_right ~> add_0_right

3848 zadd_zminus_inverse2 ~> left_minus

3849 zmult_zminus ~> mult_minus_left

3850 zmult_commute ~> mult_commute

3851 zmult_assoc ~> mult_assoc

3852 zadd_zmult_distrib ~> left_distrib

3853 zadd_zmult_distrib2 ~> right_distrib

3854 zdiff_zmult_distrib ~> left_diff_distrib

3855 zdiff_zmult_distrib2 ~> right_diff_distrib

3856 zmult_1 ~> mult_1_left

3857 zmult_1_right ~> mult_1_right

3858 zle_refl ~> order_refl

3859 zle_trans ~> order_trans

3860 zle_antisym ~> order_antisym

3861 zle_linear ~> linorder_linear

3862 zless_linear ~> linorder_less_linear

3863 zadd_left_mono ~> add_left_mono

3864 zadd_strict_right_mono ~> add_strict_right_mono

3865 zadd_zless_mono ~> add_less_le_mono

3866 int_0_less_1 ~> zero_less_one

3867 int_0_neq_1 ~> zero_neq_one

3868 zless_le ~> less_le

3869 zpower_zadd_distrib ~> power_add

3870 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff

3871 zero_le_zpower_abs ~> zero_le_power_abs

3873 * Theory Deriv: Renamed

3875 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing

3877 * Theory Library/Multiset: Improved code generation of multisets.

3879 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets

3880 are expressed via type classes again. The special syntax

3881 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant

3882 setsum_set, which is now subsumed by Big_Operators.setsum.

3883 INCOMPATIBILITY.

3885 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,

3886 use theory HOL/Library/Nat_Bijection instead.

3888 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black

3889 trees is now inside a type class context. Names of affected

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

3891 theories working directly with raw red-black trees, adapt the names as

3892 follows:

3894 Operations:

3895 bulkload -> rbt_bulkload

3896 del_from_left -> rbt_del_from_left

3897 del_from_right -> rbt_del_from_right

3898 del -> rbt_del

3899 delete -> rbt_delete

3900 ins -> rbt_ins

3901 insert -> rbt_insert

3902 insertw -> rbt_insert_with

3903 insert_with_key -> rbt_insert_with_key

3904 map_entry -> rbt_map_entry

3905 lookup -> rbt_lookup

3906 sorted -> rbt_sorted

3907 tree_greater -> rbt_greater

3908 tree_less -> rbt_less

3909 tree_less_symbol -> rbt_less_symbol

3910 union -> rbt_union

3911 union_with -> rbt_union_with

3912 union_with_key -> rbt_union_with_key

3914 Lemmas:

3915 balance_left_sorted -> balance_left_rbt_sorted

3916 balance_left_tree_greater -> balance_left_rbt_greater

3917 balance_left_tree_less -> balance_left_rbt_less

3918 balance_right_sorted -> balance_right_rbt_sorted

3919 balance_right_tree_greater -> balance_right_rbt_greater

3920 balance_right_tree_less -> balance_right_rbt_less

3921 balance_sorted -> balance_rbt_sorted

3922 balance_tree_greater -> balance_rbt_greater

3923 balance_tree_less -> balance_rbt_less

3924 bulkload_is_rbt -> rbt_bulkload_is_rbt

3925 combine_sorted -> combine_rbt_sorted

3926 combine_tree_greater -> combine_rbt_greater

3927 combine_tree_less -> combine_rbt_less

3928 delete_in_tree -> rbt_delete_in_tree

3929 delete_is_rbt -> rbt_delete_is_rbt

3930 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater

3931 del_from_left_tree_less -> rbt_del_from_left_rbt_less

3932 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater

3933 del_from_right_tree_less -> rbt_del_from_right_rbt_less

3934 del_in_tree -> rbt_del_in_tree

3935 del_inv1_inv2 -> rbt_del_inv1_inv2

3936 del_sorted -> rbt_del_rbt_sorted

3937 del_tree_greater -> rbt_del_rbt_greater

3938 del_tree_less -> rbt_del_rbt_less

3939 dom_lookup_Branch -> dom_rbt_lookup_Branch

3940 entries_lookup -> entries_rbt_lookup

3941 finite_dom_lookup -> finite_dom_rbt_lookup

3942 insert_sorted -> rbt_insert_rbt_sorted

3943 insertw_is_rbt -> rbt_insertw_is_rbt

3944 insertwk_is_rbt -> rbt_insertwk_is_rbt

3945 insertwk_sorted -> rbt_insertwk_rbt_sorted

3946 insertw_sorted -> rbt_insertw_rbt_sorted

3947 ins_sorted -> ins_rbt_sorted

3948 ins_tree_greater -> ins_rbt_greater

3949 ins_tree_less -> ins_rbt_less

3950 is_rbt_sorted -> is_rbt_rbt_sorted

3951 lookup_balance -> rbt_lookup_balance

3952 lookup_bulkload -> rbt_lookup_rbt_bulkload

3953 lookup_delete -> rbt_lookup_rbt_delete

3954 lookup_Empty -> rbt_lookup_Empty

3955 lookup_from_in_tree -> rbt_lookup_from_in_tree

3956 lookup_in_tree -> rbt_lookup_in_tree

3957 lookup_ins -> rbt_lookup_ins

3958 lookup_insert -> rbt_lookup_rbt_insert

3959 lookup_insertw -> rbt_lookup_rbt_insertw

3960 lookup_insertwk -> rbt_lookup_rbt_insertwk

3961 lookup_keys -> rbt_lookup_keys

3962 lookup_map -> rbt_lookup_map

3963 lookup_map_entry -> rbt_lookup_rbt_map_entry

3964 lookup_tree_greater -> rbt_lookup_rbt_greater

3965 lookup_tree_less -> rbt_lookup_rbt_less

3966 lookup_union -> rbt_lookup_rbt_union

3967 map_entry_color_of -> rbt_map_entry_color_of

3968 map_entry_inv1 -> rbt_map_entry_inv1

3969 map_entry_inv2 -> rbt_map_entry_inv2

3970 map_entry_is_rbt -> rbt_map_entry_is_rbt

3971 map_entry_sorted -> rbt_map_entry_rbt_sorted

3972 map_entry_tree_greater -> rbt_map_entry_rbt_greater

3973 map_entry_tree_less -> rbt_map_entry_rbt_less

3974 map_tree_greater -> map_rbt_greater

3975 map_tree_less -> map_rbt_less

3976 map_sorted -> map_rbt_sorted

3977 paint_sorted -> paint_rbt_sorted

3978 paint_lookup -> paint_rbt_lookup

3979 paint_tree_greater -> paint_rbt_greater

3980 paint_tree_less -> paint_rbt_less

3981 sorted_entries -> rbt_sorted_entries

3982 tree_greater_eq_trans -> rbt_greater_eq_trans

3983 tree_greater_nit -> rbt_greater_nit

3984 tree_greater_prop -> rbt_greater_prop

3985 tree_greater_simps -> rbt_greater_simps

3986 tree_greater_trans -> rbt_greater_trans

3987 tree_less_eq_trans -> rbt_less_eq_trans

3988 tree_less_nit -> rbt_less_nit

3989 tree_less_prop -> rbt_less_prop

3990 tree_less_simps -> rbt_less_simps

3991 tree_less_trans -> rbt_less_trans

3992 tree_ord_props -> rbt_ord_props

3993 union_Branch -> rbt_union_Branch

3994 union_is_rbt -> rbt_union_is_rbt

3995 unionw_is_rbt -> rbt_unionw_is_rbt

3996 unionwk_is_rbt -> rbt_unionwk_is_rbt

3997 unionwk_sorted -> rbt_unionwk_rbt_sorted

3999 * Theory HOL/Library/Float: Floating point numbers are now defined as

4000 a subset of the real numbers. All operations are defined using the

4001 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.

4003 Changed Operations:

4004 float_abs -> abs

4005 float_nprt -> nprt

4006 float_pprt -> pprt

4007 pow2 -> use powr

4008 round_down -> float_round_down

4009 round_up -> float_round_up

4010 scale -> exponent

4012 Removed Operations:

4013 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod

4015 Renamed Lemmas:

4016 abs_float_def -> Float.compute_float_abs

4017 bitlen_ge0 -> bitlen_nonneg

4018 bitlen.simps -> Float.compute_bitlen

4019 float_components -> Float_mantissa_exponent

4020 float_divl.simps -> Float.compute_float_divl

4021 float_divr.simps -> Float.compute_float_divr

4022 float_eq_odd -> mult_powr_eq_mult_powr_iff

4023 float_power -> real_of_float_power

4024 lapprox_posrat_def -> Float.compute_lapprox_posrat

4025 lapprox_rat.simps -> Float.compute_lapprox_rat

4026 le_float_def' -> Float.compute_float_le

4027 le_float_def -> less_eq_float.rep_eq

4028 less_float_def' -> Float.compute_float_less

4029 less_float_def -> less_float.rep_eq

4030 normfloat_def -> Float.compute_normfloat

4031 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0

4032 normfloat -> normfloat_def

4033 normfloat_unique -> use normfloat_def

4034 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral

4035 one_float_def -> Float.compute_float_one

4036 plus_float_def -> Float.compute_float_plus

4037 rapprox_posrat_def -> Float.compute_rapprox_posrat

4038 rapprox_rat.simps -> Float.compute_rapprox_rat

4039 real_of_float_0 -> zero_float.rep_eq

4040 real_of_float_1 -> one_float.rep_eq

4041 real_of_float_abs -> abs_float.rep_eq

4042 real_of_float_add -> plus_float.rep_eq

4043 real_of_float_minus -> uminus_float.rep_eq

4044 real_of_float_mult -> times_float.rep_eq

4045 real_of_float_simp -> Float.rep_eq

4046 real_of_float_sub -> minus_float.rep_eq

4047 round_down.simps -> Float.compute_float_round_down

4048 round_up.simps -> Float.compute_float_round_up

4049 times_float_def -> Float.compute_float_times

4050 uminus_float_def -> Float.compute_float_uminus

4051 zero_float_def -> Float.compute_float_zero

4053 Lemmas not necessary anymore, use the transfer method:

4054 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,

4055 float_divr, float_le_simp, float_less1_mantissa_bound,

4056 float_less_simp, float_less_zero, float_le_zero,

4057 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,

4058 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,

4059 lapprox_rat_bottom, normalized_float, rapprox_posrat,

4060 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,

4061 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,

4062 round_up, zero_le_float, zero_less_float

4064 * New theory HOL/Library/DAList provides an abstract type for

4065 association lists with distinct keys.

4067 * Session HOL/IMP: Added new theory of abstract interpretation of

4068 annotated commands.

4070 * Session HOL-Import: Re-implementation from scratch is faster,

4071 simpler, and more scalable. Requires a proof bundle, which is

4072 available as an external component. Discontinued old (and mostly

4073 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.

4075 * Session HOL-Word: Discontinued many redundant theorems specific to

4076 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems

4077 instead.

4079 word_sub_alt ~> word_sub_wi

4080 word_add_alt ~> word_add_def

4081 word_mult_alt ~> word_mult_def

4082 word_minus_alt ~> word_minus_def

4083 word_0_alt ~> word_0_wi

4084 word_1_alt ~> word_1_wi

4085 word_add_0 ~> add_0_left

4086 word_add_0_right ~> add_0_right

4087 word_mult_1 ~> mult_1_left

4088 word_mult_1_right ~> mult_1_right

4089 word_add_commute ~> add_commute

4090 word_add_assoc ~> add_assoc

4091 word_add_left_commute ~> add_left_commute

4092 word_mult_commute ~> mult_commute

4093 word_mult_assoc ~> mult_assoc

4094 word_mult_left_commute ~> mult_left_commute

4095 word_left_distrib ~> left_distrib

4096 word_right_distrib ~> right_distrib

4097 word_left_minus ~> left_minus

4098 word_diff_0_right ~> diff_0_right

4099 word_diff_self ~> diff_self

4100 word_sub_def ~> diff_minus

4101 word_diff_minus ~> diff_minus

4102 word_add_ac ~> add_ac

4103 word_mult_ac ~> mult_ac

4104 word_plus_ac0 ~> add_0_left add_0_right add_ac

4105 word_times_ac1 ~> mult_1_left mult_1_right mult_ac

4106 word_order_trans ~> order_trans

4107 word_order_refl ~> order_refl

4108 word_order_antisym ~> order_antisym

4109 word_order_linear ~> linorder_linear

4110 lenw1_zero_neq_one ~> zero_neq_one

4111 word_number_of_eq ~> number_of_eq

4112 word_of_int_add_hom ~> wi_hom_add

4113 word_of_int_sub_hom ~> wi_hom_sub

4114 word_of_int_mult_hom ~> wi_hom_mult

4115 word_of_int_minus_hom ~> wi_hom_neg

4116 word_of_int_succ_hom ~> wi_hom_succ

4117 word_of_int_pred_hom ~> wi_hom_pred

4118 word_of_int_0_hom ~> word_0_wi

4119 word_of_int_1_hom ~> word_1_wi

4121 * Session HOL-Word: New proof method "word_bitwise" for splitting

4122 machine word equalities and inequalities into logical circuits,

4123 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,

4124 multiplication, shifting by constants, bitwise operators and numeric

4125 constants. Requires fixed-length word types, not 'a word. Solves

4126 many standard word identities outright and converts more into first

4127 order problems amenable to blast or similar. See also examples in

4128 HOL/Word/Examples/WordExamples.thy.

4130 * Session HOL-Probability: Introduced the type "'a measure" to

4131 represent measures, this replaces the records 'a algebra and 'a

4132 measure_space. The locales based on subset_class now have two

4133 locale-parameters the space \<Omega> and the set of measurable sets M.

4134 The product of probability spaces uses now the same constant as the

4135 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)

4136 measure". Most constants are defined now outside of locales and gain

4137 an additional parameter, like null_sets, almost_eventually or \<mu>'.

4138 Measure space constructions for distributions and densities now got

4139 their own constants distr and density. Instead of using locales to

4140 describe measure spaces with a finite space, the measure count_space

4141 and point_measure is introduced. INCOMPATIBILITY.

4143 Renamed constants:

4144 measure -> emeasure

4145 finite_measure.\<mu>' -> measure

4146 product_algebra_generator -> prod_algebra

4147 product_prob_space.emb -> prod_emb

4148 product_prob_space.infprod_algebra -> PiM

4150 Removed locales:

4151 completeable_measure_space

4152 finite_measure_space

4153 finite_prob_space

4154 finite_product_finite_prob_space

4155 finite_product_sigma_algebra

4156 finite_sigma_algebra

4157 measure_space

4158 pair_finite_prob_space

4159 pair_finite_sigma_algebra

4160 pair_finite_space

4161 pair_sigma_algebra

4162 product_sigma_algebra

4164 Removed constants:

4165 conditional_space

4166 distribution -> use distr measure, or distributed predicate

4167 image_space

4168 joint_distribution -> use distr measure, or distributed predicate

4169 pair_measure_generator

4170 product_prob_space.infprod_algebra -> use PiM

4171 subvimage

4173 Replacement theorems:

4174 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite

4175 finite_measure.empty_measure -> measure_empty

4176 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq

4177 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq

4178 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably

4179 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure

4180 finite_measure.finite_measure -> finite_measure.emeasure_finite

4181 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton

4182 finite_measure.positive_measure' -> measure_nonneg

4183 finite_measure.real_measure -> finite_measure.emeasure_real

4184 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb

4185 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite

4186 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty

4187 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed

4188 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple

4189 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple

4190 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple

4191 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple

4192 information_space.entropy_commute -> information_space.entropy_commute_simple

4193 information_space.entropy_eq -> information_space.entropy_simple_distributed

4194 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed

4195 information_space.entropy_positive -> information_space.entropy_nonneg_simple

4196 information_space.entropy_uniform_max -> information_space.entropy_uniform

4197 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq

4198 information_space.KL_eq_0 -> information_space.KL_same_eq_0

4199 information_space.KL_ge_0 -> information_space.KL_nonneg

4200 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed

4201 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple

4202 Int_stable_cuboids -> Int_stable_atLeastAtMost

4203 Int_stable_product_algebra_generator -> positive_integral

4204 measure_preserving -> equality "distr M N f = N" "f : measurable M N"

4205 measure_space.additive -> emeasure_additive

4206 measure_space.AE_iff_null_set -> AE_iff_null

4207 measure_space.almost_everywhere_def -> eventually_ae_filter

4208 measure_space.almost_everywhere_vimage -> AE_distrD

4209 measure_space.continuity_from_above -> INF_emeasure_decseq

4210 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq

4211 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq

4212 measure_space.continuity_from_below -> SUP_emeasure_incseq

4213 measure_space_density -> emeasure_density

4214 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density

4215 measure_space.integrable_vimage -> integrable_distr

4216 measure_space.integral_translated_density -> integral_density

4217 measure_space.integral_vimage -> integral_distr

4218 measure_space.measure_additive -> plus_emeasure

4219 measure_space.measure_compl -> emeasure_compl

4220 measure_space.measure_countable_increasing -> emeasure_countable_increasing

4221 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably

4222 measure_space.measure_decseq -> decseq_emeasure

4223 measure_space.measure_Diff -> emeasure_Diff

4224 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set

4225 measure_space.measure_eq_0 -> emeasure_eq_0

4226 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite

4227 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton

4228 measure_space.measure_incseq -> incseq_emeasure

4229 measure_space.measure_insert -> emeasure_insert

4230 measure_space.measure_mono -> emeasure_mono

4231 measure_space.measure_not_negative -> emeasure_not_MInf

4232 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq

4233 measure_space.measure_setsum -> setsum_emeasure

4234 measure_space.measure_setsum_split -> setsum_emeasure_cover

4235 measure_space.measure_space_vimage -> emeasure_distr

4236 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite

4237 measure_space.measure_subadditive -> subadditive

4238 measure_space.measure_top -> emeasure_space

4239 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0

4240 measure_space.measure_Un_null_set -> emeasure_Un_null_set

4241 measure_space.positive_integral_translated_density -> positive_integral_density

4242 measure_space.positive_integral_vimage -> positive_integral_distr

4243 measure_space.real_continuity_from_above -> Lim_measure_decseq

4244 measure_space.real_continuity_from_below -> Lim_measure_incseq

4245 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably

4246 measure_space.real_measure_Diff -> measure_Diff

4247 measure_space.real_measure_finite_Union -> measure_finite_Union

4248 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton

4249 measure_space.real_measure_subadditive -> measure_subadditive

4250 measure_space.real_measure_Union -> measure_Union

4251 measure_space.real_measure_UNION -> measure_UNION

4252 measure_space.simple_function_vimage -> simple_function_comp

4253 measure_space.simple_integral_vimage -> simple_integral_distr

4254 measure_space.simple_integral_vimage -> simple_integral_distr

4255 measure_unique_Int_stable -> measure_eqI_generator_eq

4256 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq

4257 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1

4258 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2

4259 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1

4260 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2

4261 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff

4262 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap

4263 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'

4264 pair_sigma_algebra.sets_swap -> sets_pair_swap

4265 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1

4266 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2

4267 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap

4268 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2

4269 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt

4270 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times

4271 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM

4272 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq

4273 prob_space.measure_space_1 -> prob_space.emeasure_space_1

4274 prob_space.prob_space_vimage -> prob_space_distr

4275 prob_space.random_variable_restrict -> measurable_restrict

4276 prob_space_unique_Int_stable -> measure_eqI_prob_space

4277 product_algebraE -> prod_algebraE_all

4278 product_algebra_generator_der -> prod_algebra_eq_finite

4279 product_algebra_generator_into_space -> prod_algebra_sets_into_space

4280 product_algebraI -> sets_PiM_I_finite

4281 product_measure_exists -> product_sigma_finite.sigma_finite

4282 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator

4283 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb

4284 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty

4285 product_prob_space.measurable_component -> measurable_component_singleton

4286 product_prob_space.measurable_emb -> measurable_prod_emb

4287 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single

4288 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton

4289 product_prob_space.measure_emb -> emeasure_prod_emb

4290 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict

4291 product_sigma_algebra.product_algebra_into_space -> space_closed

4292 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge

4293 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton

4294 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge

4295 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable

4296 sets_product_algebra -> sets_PiM

4297 sigma_algebra.measurable_sigma -> measurable_measure_of

4298 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint

4299 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr

4300 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq

4301 space_product_algebra -> space_PiM

4303 * Session HOL-TPTP: support to parse and import TPTP problems (all

4304 languages) into Isabelle/HOL.

4307 *** FOL ***

4309 * New "case_product" attribute (see HOL).

4312 *** ZF ***

4314 * Greater support for structured proofs involving induction or case

4315 analysis.

4317 * Much greater use of mathematical symbols.

4319 * Removal of many ML theorem bindings. INCOMPATIBILITY.

4322 *** ML ***

4324 * Antiquotation @{keyword "name"} produces a parser for outer syntax

4325 from a minor keyword introduced via theory header declaration.

4327 * Antiquotation @{command_spec "name"} produces the

4328 Outer_Syntax.command_spec from a major keyword introduced via theory

4329 header declaration; it can be passed to Outer_Syntax.command etc.

4331 * Local_Theory.define no longer hard-wires default theorem name

4332 "foo_def", but retains the binding as given. If that is Binding.empty

4333 / Attrib.empty_binding, the result is not registered as user-level

4334 fact. The Local_Theory.define_internal variant allows to specify a

4335 non-empty name (used for the foundation in the background theory),

4336 while omitting the fact binding in the user-context. Potential

4337 INCOMPATIBILITY for derived definitional packages: need to specify

4338 naming policy for primitive definitions more explicitly.

4340 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in

4341 conformance with similar operations in structure Term and Logic.

4343 * Antiquotation @{attributes [...]} embeds attribute source

4344 representation into the ML text, which is particularly useful with

4345 declarations like Local_Theory.note.

4347 * Structure Proof_Context follows standard naming scheme. Old

4348 ProofContext has been discontinued. INCOMPATIBILITY.

4350 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle

4351 change of semantics: update is applied to auxiliary local theory

4352 context as well.

4354 * Modernized some old-style infix operations:

4356 addeqcongs ~> Simplifier.add_eqcong

4357 deleqcongs ~> Simplifier.del_eqcong

4358 addcongs ~> Simplifier.add_cong

4359 delcongs ~> Simplifier.del_cong

4360 setmksimps ~> Simplifier.set_mksimps

4361 setmkcong ~> Simplifier.set_mkcong

4362 setmksym ~> Simplifier.set_mksym

4363 setmkeqTrue ~> Simplifier.set_mkeqTrue

4364 settermless ~> Simplifier.set_termless

4365 setsubgoaler ~> Simplifier.set_subgoaler

4366 addsplits ~> Splitter.add_split

4367 delsplits ~> Splitter.del_split

4370 *** System ***

4372 * USER_HOME settings variable points to cross-platform user home

4373 directory, which coincides with HOME on POSIX systems only. Likewise,

4374 the Isabelle path specification "~" now expands to $USER_HOME, instead

4375 of former $HOME. A different default for USER_HOME may be set

4376 explicitly in shell environment, before Isabelle settings are

4377 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where

4378 the generic user home was intended.

4380 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name

4381 notation, which is useful for the jEdit file browser, for example.

4383 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar

4384 (not just JRE).

4388 New in Isabelle2011-1 (October 2011)

4389 ------------------------------------

4391 *** General ***

4393 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as

4394 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.

4396 - Management of multiple theory files directly from the editor

4397 buffer store -- bypassing the file-system (no requirement to save

4398 files for checking).

4400 - Markup of formal entities within the text buffer, with semantic

4401 highlighting, tooltips and hyperlinks to jump to defining source

4402 positions.

4404 - Improved text rendering, with sub/superscripts in the source

4405 buffer (including support for copy/paste wrt. output panel, HTML

4406 theory output and other non-Isabelle text boxes).

4408 - Refined scheduling of proof checking and printing of results,

4409 based on interactive editor view. (Note: jEdit folding and

4410 narrowing allows to restrict buffer perspectives explicitly.)

4412 - Reduced CPU performance requirements, usable on machines with few

4413 cores.

4415 - Reduced memory requirements due to pruning of unused document

4416 versions (garbage collection).

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

4419 including some remaining limitations.

4421 * Theory loader: source files are exclusively located via the master

4422 directory of each theory node (where the .thy file itself resides).

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

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

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

4426 INCOMPATIBILITY.

4428 * Theory loader: source files are identified by content via SHA1

4429 digests. Discontinued former path/modtime identification and optional

4430 ISABELLE_FILE_IDENT plugin scripts.

4432 * Parallelization of nested Isar proofs is subject to

4433 Goal.parallel_proofs_threshold (default 100). See also isabelle

4434 usedir option -Q.

4436 * Name space: former unsynchronized references are now proper

4437 configuration options, with more conventional names:

4439 long_names ~> names_long

4440 short_names ~> names_short

4441 unique_names ~> names_unique

4443 Minor INCOMPATIBILITY, need to declare options in context like this:

4445 declare [[names_unique = false]]

4447 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note

4448 that the result needs to be unique, which means fact specifications

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

4451 * Attribute "case_names" has been refined: the assumptions in each case

4452 can be named now by following the case name with [name1 name2 ...].

4454 * Isabelle/Isar reference manual has been updated and extended:

4455 - "Synopsis" provides a catalog of main Isar language concepts.

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

4457 - Updated material from classic "ref" manual, notably about

4458 "Classical Reasoner".

4461 *** HOL ***

4463 * Class bot and top require underlying partial order rather than

4464 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.

4466 * Class complete_lattice: generalized a couple of lemmas from sets;

4467 generalized theorems INF_cong and SUP_cong. New type classes for

4468 complete boolean algebras and complete linear orders. Lemmas

4469 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in

4470 class complete_linorder.

4472 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,

4473 Sup_fun_def, Inf_apply, Sup_apply.

4475 Removed redundant lemmas (the right hand side gives hints how to

4476 replace them for (metis ...), or (simp only: ...) proofs):

4478 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]

4479 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]

4480 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right

4481 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right

4482 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right

4483 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right

4484 Inter_def ~> INF_def, image_def

4485 Union_def ~> SUP_def, image_def

4486 INT_eq ~> INF_def, and image_def

4487 UN_eq ~> SUP_def, and image_def

4488 INF_subset ~> INF_superset_mono [OF _ order_refl]

4490 More consistent and comprehensive names:

4492 INTER_eq_Inter_image ~> INF_def

4493 UNION_eq_Union_image ~> SUP_def

4494 INFI_def ~> INF_def

4495 SUPR_def ~> SUP_def

4496 INF_leI ~> INF_lower

4497 INF_leI2 ~> INF_lower2

4498 le_INFI ~> INF_greatest

4499 le_SUPI ~> SUP_upper

4500 le_SUPI2 ~> SUP_upper2

4501 SUP_leI ~> SUP_least

4502 INFI_bool_eq ~> INF_bool_eq

4503 SUPR_bool_eq ~> SUP_bool_eq

4504 INFI_apply ~> INF_apply

4505 SUPR_apply ~> SUP_apply

4506 INTER_def ~> INTER_eq

4507 UNION_def ~> UNION_eq

4509 INCOMPATIBILITY.

4511 * Renamed theory Complete_Lattice to Complete_Lattices.

4512 INCOMPATIBILITY.

4514 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,

4515 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,

4516 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,

4517 Sup_insert are now declared as [simp]. INCOMPATIBILITY.

4519 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,

4520 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,

4521 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor

4522 INCOMPATIBILITY.

4524 * Added syntactic classes "inf" and "sup" for the respective

4525 constants. INCOMPATIBILITY: Changes in the argument order of the

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

4528 * Theorem collections ball_simps and bex_simps do not contain theorems

4529 referring to UNION any longer; these have been moved to collection

4530 UN_ball_bex_simps. INCOMPATIBILITY.

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

4533 separate type class floor_ceiling.

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

4537 locale fun_left_comm ~> locale comp_fun_commute

4538 locale fun_left_comm_idem ~> locale comp_fun_idem

4540 Both use point-free characterization; interpretation proofs may need

4541 adjustment. INCOMPATIBILITY.

4543 * Theory Limits: Type "'a net" has been renamed to "'a filter", in

4544 accordance with standard mathematical terminology. INCOMPATIBILITY.

4546 * Theory Complex_Main: The locale interpretations for the

4547 bounded_linear and bounded_bilinear locales have been removed, in

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

4549 original names for distributivity theorems, potential INCOMPATIBILITY.

4551 divide.add ~> add_divide_distrib

4552 divide.diff ~> diff_divide_distrib

4553 divide.setsum ~> setsum_divide_distrib

4554 mult.add_right ~> right_distrib

4555 mult.diff_right ~> right_diff_distrib

4556 mult_right.setsum ~> setsum_right_distrib

4557 mult_left.diff ~> left_diff_distrib

4559 * Theory Complex_Main: Several redundant theorems have been removed or

4560 replaced by more general versions. INCOMPATIBILITY.

4562 real_diff_def ~> minus_real_def

4563 real_divide_def ~> divide_real_def

4564 real_less_def ~> less_le

4565 real_abs_def ~> abs_real_def

4566 real_sgn_def ~> sgn_real_def

4567 real_mult_commute ~> mult_commute

4568 real_mult_assoc ~> mult_assoc

4569 real_mult_1 ~> mult_1_left

4570 real_add_mult_distrib ~> left_distrib

4571 real_zero_not_eq_one ~> zero_neq_one

4572 real_mult_inverse_left ~> left_inverse

4573 INVERSE_ZERO ~> inverse_zero

4574 real_le_refl ~> order_refl

4575 real_le_antisym ~> order_antisym

4576 real_le_trans ~> order_trans

4577 real_le_linear ~> linear

4578 real_le_eq_diff ~> le_iff_diff_le_0

4579 real_add_left_mono ~> add_left_mono

4580 real_mult_order ~> mult_pos_pos

4581 real_mult_less_mono2 ~> mult_strict_left_mono

4582 real_of_int_real_of_nat ~> real_of_int_of_nat_eq

4583 real_0_le_divide_iff ~> zero_le_divide_iff

4584 realpow_two_disj ~> power2_eq_iff

4585 real_squared_diff_one_factored ~> square_diff_one_factored

4586 realpow_two_diff ~> square_diff_square_factored

4587 reals_complete2 ~> complete_real

4588 real_sum_squared_expand ~> power2_sum

4589 exp_ln_eq ~> ln_unique

4590 expi_add ~> exp_add

4591 expi_zero ~> exp_zero

4592 lemma_DERIV_subst ~> DERIV_cong

4593 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff

4594 LIMSEQ_const ~> tendsto_const

4595 LIMSEQ_norm ~> tendsto_norm

4596 LIMSEQ_add ~> tendsto_add

4597 LIMSEQ_minus ~> tendsto_minus

4598 LIMSEQ_minus_cancel ~> tendsto_minus_cancel

4599 LIMSEQ_diff ~> tendsto_diff

4600 bounded_linear.LIMSEQ ~> bounded_linear.tendsto

4601 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto

4602 LIMSEQ_mult ~> tendsto_mult

4603 LIMSEQ_inverse ~> tendsto_inverse

4604 LIMSEQ_divide ~> tendsto_divide

4605 LIMSEQ_pow ~> tendsto_power

4606 LIMSEQ_setsum ~> tendsto_setsum

4607 LIMSEQ_setprod ~> tendsto_setprod

4608 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff

4609 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff

4610 LIMSEQ_imp_rabs ~> tendsto_rabs

4611 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]

4612 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]

4613 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]

4614 LIMSEQ_Complex ~> tendsto_Complex

4615 LIM_ident ~> tendsto_ident_at

4616 LIM_const ~> tendsto_const

4617 LIM_add ~> tendsto_add

4618 LIM_add_zero ~> tendsto_add_zero

4619 LIM_minus ~> tendsto_minus

4620 LIM_diff ~> tendsto_diff

4621 LIM_norm ~> tendsto_norm

4622 LIM_norm_zero ~> tendsto_norm_zero

4623 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel

4624 LIM_norm_zero_iff ~> tendsto_norm_zero_iff

4625 LIM_rabs ~> tendsto_rabs

4626 LIM_rabs_zero ~> tendsto_rabs_zero

4627 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel

4628 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff

4629 LIM_compose ~> tendsto_compose

4630 LIM_mult ~> tendsto_mult

4631 LIM_scaleR ~> tendsto_scaleR

4632 LIM_of_real ~> tendsto_of_real

4633 LIM_power ~> tendsto_power

4634 LIM_inverse ~> tendsto_inverse

4635 LIM_sgn ~> tendsto_sgn

4636 isCont_LIM_compose ~> isCont_tendsto_compose

4637 bounded_linear.LIM ~> bounded_linear.tendsto

4638 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero

4639 bounded_bilinear.LIM ~> bounded_bilinear.tendsto

4640 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero

4641 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero

4642 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero

4643 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]

4645 * Theory Complex_Main: The definition of infinite series was

4646 generalized. Now it is defined on the type class {topological_space,

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

4649 * Theory Complex_Main: The complex exponential function "expi" is now

4650 a type-constrained abbreviation for "exp :: complex => complex"; thus

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

4653 * Code generation:

4655 - Theory Library/Code_Char_ord provides native ordering of

4656 characters in the target language.

4658 - Commands code_module and code_library are legacy, use export_code

4659 instead.

4661 - Method "evaluation" is legacy, use method "eval" instead.

4663 - Legacy evaluator "SML" is deactivated by default. May be

4664 reactivated by the following theory command:

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

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

4670 * New proof method "induction" that gives induction hypotheses the

4671 name "IH", thus distinguishing them from further hypotheses that come

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

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

4674 syntax.

4676 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is

4677 still available as a legacy feature for some time.

4679 * Nitpick:

4680 - Added "need" and "total_consts" options.

4681 - Reintroduced "show_skolems" option by popular demand.

4682 - Renamed attribute: nitpick_def ~> nitpick_unfold.

4683 INCOMPATIBILITY.

4685 * Sledgehammer:

4686 - Use quasi-sound (and efficient) translations by default.

4687 - Added support for the following provers: E-ToFoF, LEO-II,

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

4689 - Automatically preplay and minimize proofs before showing them if

4690 this can be done within reasonable time.

4691 - sledgehammer available_provers ~> sledgehammer supported_provers.

4692 INCOMPATIBILITY.

4693 - Added "preplay_timeout", "slicing", "type_enc", "sound",

4694 "max_mono_iters", and "max_new_mono_instances" options.

4695 - Removed "explicit_apply" and "full_types" options as well as "Full

4696 Types" Proof General menu item. INCOMPATIBILITY.

4698 * Metis:

4699 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.

4700 - Obsoleted "metisFT" -- use "metis (full_types)" instead.

4701 INCOMPATIBILITY.

4703 * Command 'try':

4704 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and

4705 "elim:" options. INCOMPATIBILITY.

4706 - Introduced 'try' that not only runs 'try_methods' but also

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

4709 * Quickcheck:

4710 - Added "eval" option to evaluate terms for the found counterexample

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

4712 - Added post-processing of terms to obtain readable counterexamples

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

4714 - New counterexample generator quickcheck[narrowing] enables

4715 narrowing-based testing. Requires the Glasgow Haskell compiler

4716 with its installation location defined in the Isabelle settings

4717 environment as ISABELLE_GHC.

4718 - Removed quickcheck tester "SML" based on the SML code generator

4719 (formly in HOL/Library).

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

4722 use 'partial_function' instead.

4724 * Theory Library/Extended_Reals replaces now the positive extended

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

4726 Multivariate_Analysis/Extended_Real_Limits.

4728 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,

4729 from where it must be imported explicitly if it is really required.

4730 INCOMPATIBILITY.

4732 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has

4733 been moved here. INCOMPATIBILITY.

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

4736 arithmetic.

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

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

4740 and lattice type classes.

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

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

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

4746 (cset) via the generic monad ad-hoc overloading facility.

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

4749 for implementation, an invariant-ensuring type, and connection to an

4750 abstract type. INCOMPATIBILITY.

4752 - RBT is split into RBT and RBT_Mapping.

4753 - AssocList is split and renamed into AList and AList_Mapping.

4754 - DList is split into DList_Impl, DList, and DList_Cset.

4755 - Cset is split into Cset and List_Cset.

4757 * Theory Library/Nat_Infinity has been renamed to

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

4759 constants:

4761 type inat ~> type enat

4762 Fin ~> enat

4763 Infty ~> infinity (overloaded)

4764 iSuc ~> eSuc

4765 the_Fin ~> the_enat

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

4768 been renamed accordingly. INCOMPATIBILITY.

4770 * Session Multivariate_Analysis: The euclidean_space type class now

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

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

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

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

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

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

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

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

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

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

4782 been renamed as follows (INCOMPATIBILITY):

4784 Cart_eq ~> vec_eq_iff

4785 dist_nth_le_cart ~> dist_vec_nth_le

4786 tendsto_vector ~> vec_tendstoI

4787 Cauchy_vector ~> vec_CauchyI

4789 * Session Multivariate_Analysis: Several duplicate theorems have been

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

4791 general versions. INCOMPATIBILITY.

4793 finite_choice ~> finite_set_choice

4794 eventually_conjI ~> eventually_conj

4795 eventually_and ~> eventually_conj_iff

4796 eventually_false ~> eventually_False

4797 setsum_norm ~> norm_setsum

4798 Lim_sequentially ~> LIMSEQ_def

4799 Lim_ident_at ~> LIM_ident

4800 Lim_const ~> tendsto_const

4801 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]

4802 Lim_neg ~> tendsto_minus

4803 Lim_add ~> tendsto_add

4804 Lim_sub ~> tendsto_diff

4805 Lim_mul ~> tendsto_scaleR

4806 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]

4807 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]

4808 Lim_linear ~> bounded_linear.tendsto

4809 Lim_component ~> tendsto_euclidean_component

4810 Lim_component_cart ~> tendsto_vec_nth

4811 Lim_inner ~> tendsto_inner [OF tendsto_const]

4812 dot_lsum ~> inner_setsum_left

4813 dot_rsum ~> inner_setsum_right

4814 continuous_cmul ~> continuous_scaleR [OF continuous_const]

4815 continuous_neg ~> continuous_minus

4816 continuous_sub ~> continuous_diff

4817 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]

4818 continuous_mul ~> continuous_scaleR

4819 continuous_inv ~> continuous_inverse

4820 continuous_at_within_inv ~> continuous_at_within_inverse

4821 continuous_at_inv ~> continuous_at_inverse

4822 continuous_at_norm ~> continuous_norm [OF continuous_at_id]

4823 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]

4824 continuous_at_component ~> continuous_component [OF continuous_at_id]

4825 continuous_on_neg ~> continuous_on_minus

4826 continuous_on_sub ~> continuous_on_diff

4827 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]

4828 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]

4829 continuous_on_mul ~> continuous_on_scaleR

4830 continuous_on_mul_real ~> continuous_on_mult

4831 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]

4832 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]

4833 continuous_on_inverse ~> continuous_on_inv

4834 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus

4835 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff

4836 subset_interior ~> interior_mono

4837 subset_closure ~> closure_mono

4838 closure_univ ~> closure_UNIV

4839 real_arch_lt ~> reals_Archimedean2

4840 real_arch ~> reals_Archimedean3

4841 real_abs_norm ~> abs_norm_cancel

4842 real_abs_sub_norm ~> norm_triangle_ineq3

4843 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2

4845 * Session HOL-Probability:

4846 - Caratheodory's extension lemma is now proved for ring_of_sets.

4847 - Infinite products of probability measures are now available.

4848 - Sigma closure is independent, if the generator is independent

4849 - Use extended reals instead of positive extended

4850 reals. INCOMPATIBILITY.

4852 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.

4854 expand_fun_below ~> fun_below_iff

4855 below_fun_ext ~> fun_belowI

4856 expand_cfun_eq ~> cfun_eq_iff

4857 ext_cfun ~> cfun_eqI

4858 expand_cfun_below ~> cfun_below_iff

4859 below_cfun_ext ~> cfun_belowI

4860 monofun_fun_fun ~> fun_belowD

4861 monofun_fun_arg ~> monofunE

4862 monofun_lub_fun ~> adm_monofun [THEN admD]

4863 cont_lub_fun ~> adm_cont [THEN admD]

4864 cont2cont_Rep_CFun ~> cont2cont_APP

4865 cont_Rep_CFun_app ~> cont_APP_app

4866 cont_Rep_CFun_app_app ~> cont_APP_app_app

4867 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]

4868 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]

4869 contlub_cfun ~> lub_APP [symmetric]

4870 contlub_LAM ~> lub_LAM [symmetric]

4871 thelubI ~> lub_eqI

4872 UU_I ~> bottomI

4873 lift_distinct1 ~> lift.distinct(1)

4874 lift_distinct2 ~> lift.distinct(2)

4875 Def_not_UU ~> lift.distinct(2)

4876 Def_inject ~> lift.inject

4877 below_UU_iff ~> below_bottom_iff

4878 eq_UU_iff ~> eq_bottom_iff

4881 *** Document preparation ***

4883 * Antiquotation @{rail} layouts railroad syntax diagrams, see also

4884 isar-ref manual, both for description and actual application of the

4885 same.

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

4888 result.

4890 * Antiquotations: term style "isub" provides ad-hoc conversion of

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

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

4894 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>

4895 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).

4897 * Localized \isabellestyle switch can be used within blocks or groups

4898 like this:

4900 \isabellestyle{it} %preferred default

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

4903 * Discontinued special treatment of hard tabulators. Implicit

4904 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual

4905 layouts.

4908 *** ML ***

4910 * The inner syntax of sort/type/term/prop supports inlined YXML

4911 representations within quoted string tokens. By encoding logical

4912 entities via Term_XML (in ML or Scala) concrete syntax can be

4913 bypassed, which is particularly useful for producing bits of text

4914 under external program control.

4916 * Antiquotations for ML and document preparation are managed as theory

4917 data, which requires explicit setup.

4919 * Isabelle_Process.is_active allows tools to check if the official

4920 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop

4921 (better known as Proof General).

4923 * Structure Proof_Context follows standard naming scheme. Old

4924 ProofContext is still available for some time as legacy alias.

4926 * Structure Timing provides various operations for timing; supersedes

4927 former start_timing/end_timing etc.

4929 * Path.print is the official way to show file-system paths to users

4930 (including quotes etc.).

4932 * Inner syntax: identifiers in parse trees of generic categories

4933 "logic", "aprop", "idt" etc. carry position information (disguised as

4934 type constraints). Occasional INCOMPATIBILITY with non-compliant

4935 translations that choke on unexpected type constraints. Positions can

4936 be stripped in ML translations via Syntax.strip_positions /

4937 Syntax.strip_positions_ast, or via the syntax constant

4938 "_strip_positions" within parse trees. As last resort, positions can

4939 be disabled via the configuration option Syntax.positions, which is

4940 called "syntax_positions" in Isar attribute syntax.

4942 * Discontinued special status of various ML structures that contribute

4943 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less

4944 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,

4945 refer directly to Ast.Constant, Lexicon.is_identifier,

4946 Syntax_Trans.mk_binder_tr etc.

4948 * Typed print translation: discontinued show_sorts argument, which is

4949 already available via context of "advanced" translation.

4951 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic

4952 goal states; body tactic needs to address all subgoals uniformly.

4954 * Slightly more special eq_list/eq_set, with shortcut involving

4955 pointer equality (assumes that eq relation is reflexive).

4957 * Classical tactics use proper Proof.context instead of historic types

4958 claset/clasimpset. Old-style declarations like addIs, addEs, addDs

4959 operate directly on Proof.context. Raw type claset retains its use as

4960 snapshot of the classical context, which can be recovered via

4961 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.

4962 INCOMPATIBILITY, classical tactics and derived proof methods require

4963 proper Proof.context.

4966 *** System ***

4968 * Discontinued support for Poly/ML 5.2, which was the last version

4969 without proper multithreading and TimeLimit implementation.

4971 * Discontinued old lib/scripts/polyml-platform, which has been

4972 obsolete since Isabelle2009-2.

4974 * Various optional external tools are referenced more robustly and

4975 uniformly by explicit Isabelle settings as follows:

4977 ISABELLE_CSDP (formerly CSDP_EXE)

4978 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)

4979 ISABELLE_OCAML (formerly EXEC_OCAML)

4980 ISABELLE_SWIPL (formerly EXEC_SWIPL)

4981 ISABELLE_YAP (formerly EXEC_YAP)

4983 Note that automated detection from the file-system or search path has

4984 been discontinued. INCOMPATIBILITY.

4986 * Scala layer provides JVM method invocation service for static

4987 methods of type (String)String, see Invoke_Scala.method in ML. For

4988 example:

4990 Invoke_Scala.method "java.lang.System.getProperty" "java.home"

4992 Together with YXML.string_of_body/parse_body and XML.Encode/Decode

4993 this allows to pass structured values between ML and Scala.

4995 * The IsabelleText fonts includes some further glyphs to support the

4996 Prover IDE. Potential INCOMPATIBILITY: users who happen to have

4997 installed a local copy (which is normally *not* required) need to

4998 delete or update it from ~~/lib/fonts/.

5002 New in Isabelle2011 (January 2011)

5003 ----------------------------------

5005 *** General ***

5007 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see

5008 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with

5009 useful tooltips and hyperlinks produced from its static analysis. The

5010 bundled component provides an executable Isabelle tool that can be run

5011 like this:

5013 Isabelle2011/bin/isabelle jedit

5015 * Significantly improved Isabelle/Isar implementation manual.

5017 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER

5018 (and thus refers to something like $HOME/.isabelle/Isabelle2011),

5019 while the default heap location within that directory lacks that extra

5020 suffix. This isolates multiple Isabelle installations from each

5021 other, avoiding problems with old settings in new versions.

5022 INCOMPATIBILITY, need to copy/upgrade old user settings manually.

5024 * Source files are always encoded as UTF-8, instead of old-fashioned

5025 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require

5026 the following package declarations:

5028 \usepackage[utf8]{inputenc}

5029 \usepackage{textcomp}

5031 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that

5032 a Unicode character is treated as a single symbol, not a sequence of

5033 non-ASCII bytes as before. Since Isabelle/ML string literals may

5034 contain symbols without further backslash escapes, Unicode can now be

5035 used here as well. Recall that Symbol.explode in ML provides a

5036 consistent view on symbols, while raw explode (or String.explode)

5037 merely give a byte-oriented representation.

5039 * Theory loader: source files are primarily located via the master

5040 directory of each theory node (where the .thy file itself resides).

5041 The global load path is still partially available as legacy feature.

5042 Minor INCOMPATIBILITY due to subtle change in file lookup: use

5043 explicit paths, relatively to the theory.

5045 * Special treatment of ML file names has been discontinued.

5046 Historically, optional extensions .ML or .sml were added on demand --

5047 at the cost of clarity of file dependencies. Recall that Isabelle/ML

5048 files exclusively use the .ML extension. Minor INCOMPATIBILITY.

5050 * Various options that affect pretty printing etc. are now properly

5051 handled within the context via configuration options, instead of

5052 unsynchronized references or print modes. There are both ML Config.T

5053 entities and Isar declaration attributes to access these.

5055 ML (Config.T) Isar (attribute)

5057 eta_contract eta_contract

5058 show_brackets show_brackets

5059 show_sorts show_sorts

5060 show_types show_types

5061 show_question_marks show_question_marks

5062 show_consts show_consts

5063 show_abbrevs show_abbrevs

5065 Syntax.ast_trace syntax_ast_trace

5066 Syntax.ast_stat syntax_ast_stat

5067 Syntax.ambiguity_level syntax_ambiguity_level

5069 Goal_Display.goals_limit goals_limit

5070 Goal_Display.show_main_goal show_main_goal

5072 Method.rule_trace rule_trace

5074 Thy_Output.display thy_output_display

5075 Thy_Output.quotes thy_output_quotes

5076 Thy_Output.indent thy_output_indent

5077 Thy_Output.source thy_output_source

5078 Thy_Output.break thy_output_break

5080 Note that corresponding "..._default" references in ML may only be

5081 changed globally at the ROOT session setup, but *not* within a theory.

5082 The option "show_abbrevs" supersedes the former print mode

5083 "no_abbrevs" with inverted meaning.

5085 * More systematic naming of some configuration options.

5086 INCOMPATIBILITY.

5088 trace_simp ~> simp_trace

5089 debug_simp ~> simp_debug

5091 * Support for real valued configuration options, using simplistic

5092 floating-point notation that coincides with the inner syntax for

5093 float_token.

5095 * Support for real valued preferences (with approximative PGIP type):

5096 front-ends need to accept "pgint" values in float notation.

5097 INCOMPATIBILITY.

5099 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from

5100 DejaVu Sans.

5102 * Discontinued support for Poly/ML 5.0 and 5.1 versions.

5105 *** Pure ***

5107 * Command 'type_synonym' (with single argument) replaces somewhat

5108 outdated 'types', which is still available as legacy feature for some

5109 time.

5111 * Command 'nonterminal' (with 'and' separated list of arguments)

5112 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.

5114 * Command 'notepad' replaces former 'example_proof' for

5115 experimentation in Isar without any result. INCOMPATIBILITY.

5117 * Locale interpretation commands 'interpret' and 'sublocale' accept

5118 lists of equations to map definitions in a locale to appropriate

5119 entities in the context of the interpretation. The 'interpretation'

5120 command already provided this functionality.

5122 * Diagnostic command 'print_dependencies' prints the locale instances

5123 that would be activated if the specified expression was interpreted in

5124 the current context. Variant "print_dependencies!" assumes a context

5125 without interpretations.

5127 * Diagnostic command 'print_interps' prints interpretations in proofs

5128 in addition to interpretations in theories.

5130 * Discontinued obsolete 'global' and 'local' commands to manipulate

5131 the theory name space. Rare INCOMPATIBILITY. The ML functions

5132 Sign.root_path and Sign.local_path may be applied directly where this

5133 feature is still required for historical reasons.

5135 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use

5136 'definition' instead.

5138 * The "prems" fact, which refers to the accidental collection of

5139 foundational premises in the context, is now explicitly marked as

5140 legacy feature and will be discontinued soon. Consider using "assms"

5141 of the head statement or reference facts by explicit names.

5143 * Document antiquotations @{class} and @{type} print classes and type

5144 constructors.

5146 * Document antiquotation @{file} checks file/directory entries within

5147 the local file system.

5150 *** HOL ***

5152 * Coercive subtyping: functions can be declared as coercions and type

5153 inference will add them as necessary upon input of a term. Theory

5154 Complex_Main declares real :: nat => real and real :: int => real as

5155 coercions. A coercion function f is declared like this:

5157 declare [[coercion f]]

5159 To lift coercions through type constructors (e.g. from nat => real to

5160 nat list => real list), map functions can be declared, e.g.

5162 declare [[coercion_map map]]

5164 Currently coercion inference is activated only in theories including

5165 real numbers, i.e. descendants of Complex_Main. This is controlled by

5166 the configuration option "coercion_enabled", e.g. it can be enabled in

5167 other theories like this:

5169 declare [[coercion_enabled]]

5171 * Command 'partial_function' provides basic support for recursive

5172 function definitions over complete partial orders. Concrete instances

5173 are provided for i) the option type, ii) tail recursion on arbitrary

5174 types, and iii) the heap monad of Imperative_HOL. See

5175 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy

5176 for examples.

5178 * Function package: f.psimps rules are no longer implicitly declared

5179 as [simp]. INCOMPATIBILITY.

5181 * Datatype package: theorems generated for executable equality (class

5182 "eq") carry proper names and are treated as default code equations.

5184 * Inductive package: now offers command 'inductive_simps' to

5185 automatically derive instantiated and simplified equations for

5186 inductive predicates, similar to 'inductive_cases'.

5188 * Command 'enriched_type' allows to register properties of the

5189 functorial structure of types.

5191 * Improved infrastructure for term evaluation using code generator

5192 techniques, in particular static evaluation conversions.

5194 * Code generator: Scala (2.8 or higher) has been added to the target

5195 languages.

5197 * Code generator: globbing constant expressions "*" and "Theory.*"

5198 have been replaced by the more idiomatic "_" and "Theory._".

5199 INCOMPATIBILITY.

5201 * Code generator: export_code without explicit file declaration prints

5202 to standard output. INCOMPATIBILITY.

5204 * Code generator: do not print function definitions for case

5205 combinators any longer.

5207 * Code generator: simplification with rules determined with

5208 src/Tools/Code/code_simp.ML and method "code_simp".

5210 * Code generator for records: more idiomatic representation of record

5211 types. Warning: records are not covered by ancient SML code

5212 generation any longer. INCOMPATIBILITY. In cases of need, a suitable

5213 rep_datatype declaration helps to succeed then:

5215 record 'a foo = ...

5216 ...

5217 rep_datatype foo_ext ...

5219 * Records: logical foundation type for records does not carry a

5220 '_type' suffix any longer (obsolete due to authentic syntax).

5221 INCOMPATIBILITY.

5223 * Quickcheck now by default uses exhaustive testing instead of random

5224 testing. Random testing can be invoked by "quickcheck [random]",

5225 exhaustive testing by "quickcheck [exhaustive]".

5227 * Quickcheck instantiates polymorphic types with small finite

5228 datatypes by default. This enables a simple execution mechanism to

5229 handle quantifiers and function equality over the finite datatypes.

5231 * Quickcheck random generator has been renamed from "code" to

5232 "random". INCOMPATIBILITY.

5234 * Quickcheck now has a configurable time limit which is set to 30

5235 seconds by default. This can be changed by adding [timeout = n] to the

5236 quickcheck command. The time limit for Auto Quickcheck is still set

5237 independently.

5239 * Quickcheck in locales considers interpretations of that locale for

5240 counter example search.

5242 * Sledgehammer:

5243 - Added "smt" and "remote_smt" provers based on the "smt" proof

5244 method. See the Sledgehammer manual for details ("isabelle doc

5245 sledgehammer").

5246 - Renamed commands:

5247 sledgehammer atp_info ~> sledgehammer running_provers

5248 sledgehammer atp_kill ~> sledgehammer kill_provers

5249 sledgehammer available_atps ~> sledgehammer available_provers

5250 INCOMPATIBILITY.

5251 - Renamed options:

5252 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]

5253 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]

5254 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]

5255 (and "ms" and "min" are no longer supported)

5256 INCOMPATIBILITY.

5258 * Nitpick:

5259 - Renamed options:

5260 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]

5261 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]

5262 INCOMPATIBILITY.

5263 - Added support for partial quotient types.

5264 - Added local versions of the "Nitpick.register_xxx" functions.

5265 - Added "whack" option.

5266 - Allow registration of quotient types as codatatypes.

5267 - Improved "merge_type_vars" option to merge more types.

5268 - Removed unsound "fast_descrs" option.

5269 - Added custom symmetry breaking for datatypes, making it possible to reach

5270 higher cardinalities.

5271 - Prevent the expansion of too large definitions.

5273 * Proof methods "metis" and "meson" now have configuration options

5274 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled

5275 to diagnose these tools. E.g.

5277 using [[metis_trace = true]]

5279 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available

5280 manually as command 'solve_direct'.

5282 * The default SMT solver Z3 must be enabled explicitly (due to

5283 licensing issues) by setting the environment variable

5284 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For

5285 commercial applications, the SMT solver CVC3 is provided as fall-back;

5286 changing the SMT solver is done via the configuration option

5287 "smt_solver".

5289 * Remote SMT solvers need to be referred to by the "remote_" prefix,

5290 i.e. "remote_cvc3" and "remote_z3".

5292 * Added basic SMT support for datatypes, records, and typedefs using

5293 the oracle mode (no proofs). Direct support of pairs has been dropped

5294 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT

5295 support for a similar behavior). Minor INCOMPATIBILITY.

5297 * Changed SMT configuration options:

5298 - Renamed:

5299 z3_proofs ~> smt_oracle (with inverted meaning)

5300 z3_trace_assms ~> smt_trace_used_facts

5301 INCOMPATIBILITY.

5302 - Added:

5303 smt_verbose

5304 smt_random_seed

5305 smt_datatypes

5306 smt_infer_triggers

5307 smt_monomorph_limit

5308 cvc3_options

5309 remote_cvc3_options

5310 remote_z3_options

5311 yices_options

5313 * Boogie output files (.b2i files) need to be declared in the theory

5314 header.

5316 * Simplification procedure "list_to_set_comprehension" rewrites list

5317 comprehensions applied to List.set to set comprehensions. Occasional

5318 INCOMPATIBILITY, may be deactivated like this:

5320 declare [[simproc del: list_to_set_comprehension]]

5322 * Removed old version of primrec package. INCOMPATIBILITY.

5324 * Removed simplifier congruence rule of "prod_case", as has for long

5325 been the case with "split". INCOMPATIBILITY.

5327 * String.literal is a type, but not a datatype. INCOMPATIBILITY.

5329 * Removed [split_format ... and ... and ...] version of

5330 [split_format]. Potential INCOMPATIBILITY.

5332 * Predicate "sorted" now defined inductively, with nice induction

5333 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.

5335 * Constant "contents" renamed to "the_elem", to free the generic name

5336 contents for other uses. INCOMPATIBILITY.

5338 * Renamed class eq and constant eq (for code generation) to class

5339 equal and constant equal, plus renaming of related facts and various

5340 tuning. INCOMPATIBILITY.

5342 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.

5344 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".

5345 INCOMPATIBILITY.

5347 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to

5348 avoid confusion with finite sets. INCOMPATIBILITY.

5350 * Abandoned locales equiv, congruent and congruent2 for equivalence

5351 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same

5352 for congruent(2)).

5354 * Some previously unqualified names have been qualified:

5356 types

5357 bool ~> HOL.bool

5358 nat ~> Nat.nat

5360 constants

5361 Trueprop ~> HOL.Trueprop

5362 True ~> HOL.True

5363 False ~> HOL.False

5364 op & ~> HOL.conj

5365 op | ~> HOL.disj

5366 op --> ~> HOL.implies

5367 op = ~> HOL.eq

5368 Not ~> HOL.Not

5369 The ~> HOL.The

5370 All ~> HOL.All

5371 Ex ~> HOL.Ex

5372 Ex1 ~> HOL.Ex1

5373 Let ~> HOL.Let

5374 If ~> HOL.If

5375 Ball ~> Set.Ball

5376 Bex ~> Set.Bex

5377 Suc ~> Nat.Suc

5378 Pair ~> Product_Type.Pair

5379 fst ~> Product_Type.fst

5380 snd ~> Product_Type.snd

5381 curry ~> Product_Type.curry

5382 op : ~> Set.member

5383 Collect ~> Set.Collect

5385 INCOMPATIBILITY.

5387 * More canonical naming convention for some fundamental definitions:

5389 bot_bool_eq ~> bot_bool_def

5390 top_bool_eq ~> top_bool_def

5391 inf_bool_eq ~> inf_bool_def

5392 sup_bool_eq ~> sup_bool_def

5393 bot_fun_eq ~> bot_fun_def

5394 top_fun_eq ~> top_fun_def

5395 inf_fun_eq ~> inf_fun_def

5396 sup_fun_eq ~> sup_fun_def

5398 INCOMPATIBILITY.

5400 * More stylized fact names:

5402 expand_fun_eq ~> fun_eq_iff

5403 expand_set_eq ~> set_eq_iff

5404 set_ext ~> set_eqI

5405 nat_number ~> eval_nat_numeral

5407 INCOMPATIBILITY.

5409 * Refactoring of code-generation specific operations in theory List:

5411 constants

5412 null ~> List.null

5414 facts

5415 mem_iff ~> member_def

5416 null_empty ~> null_def

5418 INCOMPATIBILITY. Note that these were not supposed to be used

5419 regularly unless for striking reasons; their main purpose was code

5420 generation.

5422 Various operations from the Haskell prelude are used for generating

5423 Haskell code.

5425 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term

5426 "surj f" is now an abbreviation of "range f = UNIV". The theorems

5427 bij_def and surj_def are unchanged. INCOMPATIBILITY.

5429 * Abolished some non-alphabetic type names: "prod" and "sum" replace

5430 "*" and "+" respectively. INCOMPATIBILITY.

5432 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write

5433 "Sum_Type.Plus" instead.

5435 * Constant "split" has been merged with constant "prod_case"; names of

5436 ML functions, facts etc. involving split have been retained so far,

5437 though. INCOMPATIBILITY.

5439 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"

5440 instead. INCOMPATIBILITY.

5442 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".

5443 INCOMPATIBILITY.

5445 * Former theory Library/Enum is now part of the HOL-Main image.

5446 INCOMPATIBILITY: all constants of the Enum theory now have to be

5447 referred to by its qualified name.

5449 enum ~> Enum.enum

5450 nlists ~> Enum.nlists

5451 product ~> Enum.product

5453 * Theory Library/Monad_Syntax provides do-syntax for monad types.

5454 Syntax in Library/State_Monad has been changed to avoid ambiguities.

5455 INCOMPATIBILITY.

5457 * Theory Library/SetsAndFunctions has been split into

5458 Library/Function_Algebras and Library/Set_Algebras; canonical names

5459 for instance definitions for functions; various improvements.

5460 INCOMPATIBILITY.

5462 * Theory Library/Multiset provides stable quicksort implementation of

5463 sort_key.

5465 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.

5466 INCOMPATIBILITY.

5468 * Session Multivariate_Analysis: introduced a type class for euclidean

5469 space. Most theorems are now stated in terms of euclidean spaces

5470 instead of finite cartesian products.

5472 types

5473 real ^ 'n ~> 'a::real_vector

5474 ~> 'a::euclidean_space

5475 ~> 'a::ordered_euclidean_space

5476 (depends on your needs)

5478 constants

5479 _ $ _ ~> _ $$ _

5480 \<chi> x. _ ~> \<chi>\<chi> x. _

5481 CARD('n) ~> DIM('a)

5483 Also note that the indices are now natural numbers and not from some

5484 finite type. Finite cartesian products of euclidean spaces, products

5485 of euclidean spaces the real and complex numbers are instantiated to

5486 be euclidean_spaces. INCOMPATIBILITY.

5488 * Session Probability: introduced pextreal as positive extended real

5489 numbers. Use pextreal as value for measures. Introduce the

5490 Radon-Nikodym derivative, product spaces and Fubini's theorem for

5491 arbitrary sigma finite measures. Introduces Lebesgue measure based on

5492 the integral in Multivariate Analysis. INCOMPATIBILITY.

5494 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.

5495 INCOMPATIBILITY.

5497 * Session SPARK (with image HOL-SPARK) provides commands to load and

5498 prove verification conditions generated by the SPARK Ada program

5499 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.

5502 *** HOL-Algebra ***

5504 * Theorems for additive ring operations (locale abelian_monoid and

5505 descendants) are generated by interpretation from their multiplicative

5506 counterparts. Names (in particular theorem names) have the mandatory

5507 qualifier 'add'. Previous theorem names are redeclared for

5508 compatibility.

5510 * Structure "int_ring" is now an abbreviation (previously a

5511 definition). This fits more natural with advanced interpretations.

5514 *** HOLCF ***

5516 * The domain package now runs in definitional mode by default: The

5517 former command 'new_domain' is now called 'domain'. To use the domain

5518 package in its original axiomatic mode, use 'domain (unsafe)'.

5519 INCOMPATIBILITY.

5521 * The new class "domain" is now the default sort. Class "predomain"

5522 is an unpointed version of "domain". Theories can be updated by

5523 replacing sort annotations as shown below. INCOMPATIBILITY.

5525 'a::type ~> 'a::countable

5526 'a::cpo ~> 'a::predomain

5527 'a::pcpo ~> 'a::domain

5529 * The old type class "rep" has been superseded by class "domain".

5530 Accordingly, users of the definitional package must remove any

5531 "default_sort rep" declarations. INCOMPATIBILITY.

5533 * The domain package (definitional mode) now supports unpointed

5534 predomain argument types, as long as they are marked 'lazy'. (Strict

5535 arguments must be in class "domain".) For example, the following

5536 domain definition now works:

5538 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")

5540 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class

5541 instances for types from main HOL: bool, nat, int, char, 'a + 'b,

5542 'a option, and 'a list. Additionally, it configures fixrec and the

5543 domain package to work with these types. For example:

5545 fixrec isInl :: "('a + 'b) u -> tr"

5546 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"

5548 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")

5550 * The "(permissive)" option of fixrec has been replaced with a

5551 per-equation "(unchecked)" option. See

5552 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.

5554 * The "bifinite" class no longer fixes a constant "approx"; the class

5555 now just asserts that such a function exists. INCOMPATIBILITY.

5557 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer

5558 defines an embedding of type 'a defl into udom by default; instances

5559 of "bifinite" and "domain" classes are available in

5560 src/HOL/HOLCF/Library/Defl_Bifinite.thy.

5562 * The syntax "REP('a)" has been replaced with "DEFL('a)".

5564 * The predicate "directed" has been removed. INCOMPATIBILITY.

5566 * The type class "finite_po" has been removed. INCOMPATIBILITY.

5568 * The function "cprod_map" has been renamed to "prod_map".

5569 INCOMPATIBILITY.

5571 * The monadic bind operator on each powerdomain has new binder syntax

5572 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents

5573 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".

5575 * The infix syntax for binary union on each powerdomain has changed

5576 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set

5577 syntax. INCOMPATIBILITY.

5579 * The constant "UU" has been renamed to "bottom". The syntax "UU" is

5580 still supported as an input translation.

5582 * Renamed some theorems (the original names are also still available).

5584 expand_fun_below ~> fun_below_iff

5585 below_fun_ext ~> fun_belowI

5586 expand_cfun_eq ~> cfun_eq_iff

5587 ext_cfun ~> cfun_eqI

5588 expand_cfun_below ~> cfun_below_iff

5589 below_cfun_ext ~> cfun_belowI

5590 cont2cont_Rep_CFun ~> cont2cont_APP

5592 * The Abs and Rep functions for various types have changed names.

5593 Related theorem names have also changed to match. INCOMPATIBILITY.

5595 Rep_CFun ~> Rep_cfun

5596 Abs_CFun ~> Abs_cfun

5597 Rep_Sprod ~> Rep_sprod

5598 Abs_Sprod ~> Abs_sprod

5599 Rep_Ssum ~> Rep_ssum

5600 Abs_Ssum ~> Abs_ssum

5602 * Lemmas with names of the form *_defined_iff or *_strict_iff have

5603 been renamed to *_bottom_iff. INCOMPATIBILITY.

5605 * Various changes to bisimulation/coinduction with domain package:

5607 - Definitions of "bisim" constants no longer mention definedness.

5608 - With mutual recursion, "bisim" predicate is now curried.

5609 - With mutual recursion, each type gets a separate coind theorem.

5610 - Variable names in bisim_def and coinduct rules have changed.

5612 INCOMPATIBILITY.

5614 * Case combinators generated by the domain package for type "foo" are

5615 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.

5617 * Several theorems have been renamed to more accurately reflect the

5618 names of constants and types involved. INCOMPATIBILITY.

5620 thelub_const ~> lub_const

5621 lub_const ~> is_lub_const

5622 thelubI ~> lub_eqI

5623 is_lub_lub ~> is_lubD2

5624 lubI ~> is_lub_lub

5625 unique_lub ~> is_lub_unique

5626 is_ub_lub ~> is_lub_rangeD1

5627 lub_bin_chain ~> is_lub_bin_chain

5628 lub_fun ~> is_lub_fun

5629 thelub_fun ~> lub_fun

5630 thelub_cfun ~> lub_cfun

5631 thelub_Pair ~> lub_Pair

5632 lub_cprod ~> is_lub_prod

5633 thelub_cprod ~> lub_prod

5634 minimal_cprod ~> minimal_prod

5635 inst_cprod_pcpo ~> inst_prod_pcpo

5636 UU_I ~> bottomI

5637 compact_UU ~> compact_bottom

5638 deflation_UU ~> deflation_bottom

5639 finite_deflation_UU ~> finite_deflation_bottom

5641 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.

5643 sq_ord_less_eq_trans ~> below_eq_trans

5644 sq_ord_eq_less_trans ~> eq_below_trans

5645 refl_less ~> below_refl

5646 trans_less ~> below_trans

5647 antisym_less ~> below_antisym

5648 antisym_less_inverse ~> po_eq_conv [THEN iffD1]

5649 box_less ~> box_below

5650 rev_trans_less ~> rev_below_trans

5651 not_less2not_eq ~> not_below2not_eq

5652 less_UU_iff ~> below_UU_iff

5653 flat_less_iff ~> flat_below_iff

5654 adm_less ~> adm_below

5655 adm_not_less ~> adm_not_below

5656 adm_compact_not_less ~> adm_compact_not_below

5657 less_fun_def ~> below_fun_def

5658 expand_fun_less ~> fun_below_iff

5659 less_fun_ext ~> fun_belowI

5660 less_discr_def ~> below_discr_def

5661 discr_less_eq ~> discr_below_eq

5662 less_unit_def ~> below_unit_def

5663 less_cprod_def ~> below_prod_def

5664 prod_lessI ~> prod_belowI

5665 Pair_less_iff ~> Pair_below_iff

5666 fst_less_iff ~> fst_below_iff

5667 snd_less_iff ~> snd_below_iff

5668 expand_cfun_less ~> cfun_below_iff

5669 less_cfun_ext ~> cfun_belowI

5670 injection_less ~> injection_below

5671 less_up_def ~> below_up_def

5672 not_Iup_less ~> not_Iup_below

5673 Iup_less ~> Iup_below

5674 up_less ~> up_below

5675 Def_inject_less_eq ~> Def_below_Def

5676 Def_less_is_eq ~> Def_below_iff

5677 spair_less_iff ~> spair_below_iff

5678 less_sprod ~> below_sprod

5679 spair_less ~> spair_below

5680 sfst_less_iff ~> sfst_below_iff

5681 ssnd_less_iff ~> ssnd_below_iff

5682 fix_least_less ~> fix_least_below

5683 dist_less_one ~> dist_below_one

5684 less_ONE ~> below_ONE

5685 ONE_less_iff ~> ONE_below_iff

5686 less_sinlD ~> below_sinlD

5687 less_sinrD ~> below_sinrD

5690 *** FOL and ZF ***

5692 * All constant names are now qualified internally and use proper

5693 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.

5696 *** ML ***

5698 * Antiquotation @{assert} inlines a function bool -> unit that raises

5699 Fail if the argument is false. Due to inlining the source position of

5700 failed assertions is included in the error output.

5702 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML

5703 text is in practice always evaluated with a stable theory checkpoint.

5704 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.

5706 * Antiquotation @{theory A} refers to theory A from the ancestry of

5707 the current context, not any accidental theory loader state as before.

5708 Potential INCOMPATIBILITY, subtle change in semantics.

5710 * Syntax.pretty_priority (default 0) configures the required priority

5711 of pretty-printed output and thus affects insertion of parentheses.

5713 * Syntax.default_root (default "any") configures the inner syntax

5714 category (nonterminal symbol) for parsing of terms.

5716 * Former exception Library.UnequalLengths now coincides with

5717 ListPair.UnequalLengths.

5719 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the

5720 main functionality is provided by structure Simplifier.

5722 * Renamed raw "explode" function to "raw_explode" to emphasize its

5723 meaning. Note that internally to Isabelle, Symbol.explode is used in

5724 almost all situations.

5726 * Discontinued obsolete function sys_error and exception SYS_ERROR.

5727 See implementation manual for further details on exceptions in

5728 Isabelle/ML.

5730 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its

5731 meaning.

5733 * Renamed structure PureThy to Pure_Thy and moved most of its

5734 operations to structure Global_Theory, to emphasize that this is

5735 rarely-used global-only stuff.

5737 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln

5738 instead (or tracing for high-volume output).

5740 * Configuration option show_question_marks only affects regular pretty

5741 printing of types and terms, not raw Term.string_of_vname.

5743 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare

5744 INCOMPATIBILITY, superseded by static antiquotations @{thm} and

5745 @{thms} for most purposes.

5747 * ML structure Unsynchronized is never opened, not even in Isar

5748 interaction mode as before. Old Unsynchronized.set etc. have been

5749 discontinued -- use plain := instead. This should be *rare* anyway,

5750 since modern tools always work via official context data, notably

5751 configuration options.

5753 * Parallel and asynchronous execution requires special care concerning

5754 interrupts. Structure Exn provides some convenience functions that

5755 avoid working directly with raw Interrupt. User code must not absorb

5756 interrupts -- intermediate handling (for cleanup etc.) needs to be

5757 followed by re-raising of the original exception. Another common

5758 source of mistakes are "handle _" patterns, which make the meaning of

5759 the program subject to physical effects of the environment.

5763 New in Isabelle2009-2 (June 2010)

5764 ---------------------------------

5766 *** General ***

5768 * Authentic syntax for *all* logical entities (type classes, type

5769 constructors, term constants): provides simple and robust

5770 correspondence between formal entities and concrete syntax. Within

5771 the parse tree / AST representations, "constants" are decorated by

5772 their category (class, type, const) and spelled out explicitly with

5773 their full internal name.

5775 Substantial INCOMPATIBILITY concerning low-level syntax declarations

5776 and translations (translation rules and translation functions in ML).

5777 Some hints on upgrading:

5779 - Many existing uses of 'syntax' and 'translations' can be replaced

5780 by more modern 'type_notation', 'notation' and 'abbreviation',

5781 which are independent of this issue.

5783 - 'translations' require markup within the AST; the term syntax

5784 provides the following special forms:

5786 CONST c -- produces syntax version of constant c from context

5787 XCONST c -- literally c, checked as constant from context

5788 c -- literally c, if declared by 'syntax'

5790 Plain identifiers are treated as AST variables -- occasionally the

5791 system indicates accidental variables via the error "rhs contains

5792 extra variables".

5794 Type classes and type constructors are marked according to their

5795 concrete syntax. Some old translations rules need to be written

5796 for the "type" category, using type constructor application

5797 instead of pseudo-term application of the default category

5798 "logic".

5800 - 'parse_translation' etc. in ML may use the following

5801 antiquotations:

5803 @{class_syntax c} -- type class c within parse tree / AST

5804 @{term_syntax c} -- type constructor c within parse tree / AST

5805 @{const_syntax c} -- ML version of "CONST c" above

5806 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)

5808 - Literal types within 'typed_print_translations', i.e. those *not*

5809 represented as pseudo-terms are represented verbatim. Use @{class

5810 c} or @{type_name c} here instead of the above syntax

5811 antiquotations.

5813 Note that old non-authentic syntax was based on unqualified base

5814 names, so all of the above "constant" names would coincide. Recall

5815 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to

5816 diagnose syntax problems.

5818 * Type constructors admit general mixfix syntax, not just infix.

5820 * Concrete syntax may be attached to local entities without a proof

5821 body, too. This works via regular mixfix annotations for 'fix',

5822 'def', 'obtain' etc. or via the explicit 'write' command, which is

5823 similar to the 'notation' command in theory specifications.

5825 * Discontinued unnamed infix syntax (legacy feature for many years) --

5826 need to specify constant name and syntax separately. Internal ML

5827 datatype constructors have been renamed from InfixName to Infix etc.

5828 Minor INCOMPATIBILITY.

5830 * Schematic theorem statements need to be explicitly markup as such,

5831 via commands 'schematic_lemma', 'schematic_theorem',

5832 'schematic_corollary'. Thus the relevance of the proof is made

5833 syntactically clear, which impacts performance in a parallel or

5834 asynchronous interactive environment. Minor INCOMPATIBILITY.

5836 * Use of cumulative prems via "!" in some proof methods has been

5837 discontinued (old legacy feature).

5839 * References 'trace_simp' and 'debug_simp' have been replaced by

5840 configuration options stored in the context. Enabling tracing (the

5841 case of debugging is similar) in proofs works via

5843 using [[trace_simp = true]]

5845 Tracing is then active for all invocations of the simplifier in

5846 subsequent goal refinement steps. Tracing may also still be enabled or

5847 disabled via the ProofGeneral settings menu.

5849 * Separate commands 'hide_class', 'hide_type', 'hide_const',

5850 'hide_fact' replace the former 'hide' KIND command. Minor

5851 INCOMPATIBILITY.

5853 * Improved parallelism of proof term normalization: usedir -p2 -q0 is

5854 more efficient than combinations with -q1 or -q2.

5857 *** Pure ***

5859 * Proofterms record type-class reasoning explicitly, using the

5860 "unconstrain" operation internally. This eliminates all sort

5861 constraints from a theorem and proof, introducing explicit

5862 OFCLASS-premises. On the proof term level, this operation is

5863 automatically applied at theorem boundaries, such that closed proofs

5864 are always free of sort constraints. INCOMPATIBILITY for tools that

5865 inspect proof terms.

5867 * Local theory specifications may depend on extra type variables that

5868 are not present in the result type -- arguments TYPE('a) :: 'a itself

5869 are added internally. For example:

5871 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"

5873 * Predicates of locales introduced by classes carry a mandatory

5874 "class" prefix. INCOMPATIBILITY.

5876 * Vacuous class specifications observe default sort. INCOMPATIBILITY.

5878 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use

5879 'class' instead.

5881 * Command 'code_reflect' allows to incorporate generated ML code into

5882 runtime environment; replaces immature code_datatype antiquotation.

5883 INCOMPATIBILITY.

5885 * Code generator: simple concept for abstract datatypes obeying

5886 invariants.

5888 * Code generator: details of internal data cache have no impact on the

5889 user space functionality any longer.

5891 * Methods "unfold_locales" and "intro_locales" ignore non-locale

5892 subgoals. This is more appropriate for interpretations with 'where'.

5893 INCOMPATIBILITY.

5895 * Command 'example_proof' opens an empty proof body. This allows to

5896 experiment with Isar, without producing any persistent result.

5898 * Commands 'type_notation' and 'no_type_notation' declare type syntax

5899 within a local theory context, with explicit checking of the

5900 constructors involved (in contrast to the raw 'syntax' versions).

5902 * Commands 'types' and 'typedecl' now work within a local theory

5903 context -- without introducing dependencies on parameters or

5904 assumptions, which is not possible in Isabelle/Pure.

5906 * Command 'defaultsort' has been renamed to 'default_sort', it works

5907 within a local theory context. Minor INCOMPATIBILITY.

5910 *** HOL ***

5912 * Command 'typedef' now works within a local theory context -- without

5913 introducing dependencies on parameters or assumptions, which is not

5914 possible in Isabelle/Pure/HOL. Note that the logical environment may

5915 contain multiple interpretations of local typedefs (with different

5916 non-emptiness proofs), even in a global theory context.

5918 * New package for quotient types. Commands 'quotient_type' and

5919 'quotient_definition' may be used for defining types and constants by

5920 quotient constructions. An example is the type of integers created by

5921 quotienting pairs of natural numbers:

5923 fun

5924 intrel :: "(nat * nat) => (nat * nat) => bool"

5925 where

5926 "intrel (x, y) (u, v) = (x + v = u + y)"

5928 quotient_type int = "nat * nat" / intrel

5929 by (auto simp add: equivp_def expand_fun_eq)

5931 quotient_definition

5932 "0::int" is "(0::nat, 0::nat)"

5934 The method "lifting" can be used to lift of theorems from the

5935 underlying "raw" type to the quotient type. The example

5936 src/HOL/Quotient_Examples/FSet.thy includes such a quotient

5937 construction and provides a reasoning infrastructure for finite sets.

5939 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid

5940 clash with new theory Quotient in Main HOL.

5942 * Moved the SMT binding into the main HOL session, eliminating

5943 separate HOL-SMT session.

5945 * List membership infix mem operation is only an input abbreviation.

5946 INCOMPATIBILITY.

5948 * Theory Library/Word.thy has been removed. Use library Word/Word.thy

5949 for future developements; former Library/Word.thy is still present in

5950 the AFP entry RSAPPS.

5952 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no

5953 longer shadowed. INCOMPATIBILITY.

5955 * Dropped theorem duplicate comp_arith; use semiring_norm instead.

5956 INCOMPATIBILITY.

5958 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.

5959 INCOMPATIBILITY.

5961 * Dropped normalizing_semiring etc; use the facts in semiring classes

5962 instead. INCOMPATIBILITY.

5964 * Dropped several real-specific versions of lemmas about floor and

5965 ceiling; use the generic lemmas from theory "Archimedean_Field"

5966 instead. INCOMPATIBILITY.

5968 floor_number_of_eq ~> floor_number_of

5969 le_floor_eq_number_of ~> number_of_le_floor

5970 le_floor_eq_zero ~> zero_le_floor

5971 le_floor_eq_one ~> one_le_floor

5972 floor_less_eq_number_of ~> floor_less_number_of

5973 floor_less_eq_zero ~> floor_less_zero

5974 floor_less_eq_one ~> floor_less_one

5975 less_floor_eq_number_of ~> number_of_less_floor

5976 less_floor_eq_zero ~> zero_less_floor

5977 less_floor_eq_one ~> one_less_floor

5978 floor_le_eq_number_of ~> floor_le_number_of

5979 floor_le_eq_zero ~> floor_le_zero

5980 floor_le_eq_one ~> floor_le_one

5981 floor_subtract_number_of ~> floor_diff_number_of

5982 floor_subtract_one ~> floor_diff_one

5983 ceiling_number_of_eq ~> ceiling_number_of

5984 ceiling_le_eq_number_of ~> ceiling_le_number_of

5985 ceiling_le_zero_eq ~> ceiling_le_zero

5986 ceiling_le_eq_one ~> ceiling_le_one

5987 less_ceiling_eq_number_of ~> number_of_less_ceiling

5988 less_ceiling_eq_zero ~> zero_less_ceiling

5989 less_ceiling_eq_one ~> one_less_ceiling

5990 ceiling_less_eq_number_of ~> ceiling_less_number_of

5991 ceiling_less_eq_zero ~> ceiling_less_zero

5992 ceiling_less_eq_one ~> ceiling_less_one

5993 le_ceiling_eq_number_of ~> number_of_le_ceiling

5994 le_ceiling_eq_zero ~> zero_le_ceiling

5995 le_ceiling_eq_one ~> one_le_ceiling

5996 ceiling_subtract_number_of ~> ceiling_diff_number_of

5997 ceiling_subtract_one ~> ceiling_diff_one

5999 * Theory "Finite_Set": various folding_XXX locales facilitate the

6000 application of the various fold combinators on finite sets.

6002 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"

6003 provides abstract red-black tree type which is backed by "RBT_Impl" as

6004 implementation. INCOMPATIBILITY.

6006 * Theory Library/Coinductive_List has been removed -- superseded by

6007 AFP/thys/Coinductive.

6009 * Theory PReal, including the type "preal" and related operations, has

6010 been removed. INCOMPATIBILITY.

6012 * Real: new development using Cauchy Sequences.

6014 * Split off theory "Big_Operators" containing setsum, setprod,

6015 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.

6017 * Theory "Rational" renamed to "Rat", for consistency with "Nat",

6018 "Int" etc. INCOMPATIBILITY.

6020 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.

6022 * New set of rules "ac_simps" provides combined assoc / commute

6023 rewrites for all interpretations of the appropriate generic locales.

6025 * Renamed theory "OrderedGroup" to "Groups" and split theory

6026 "Ring_and_Field" into theories "Rings" and "Fields"; for more

6027 appropriate and more consistent names suitable for name prefixes

6028 within the HOL theories. INCOMPATIBILITY.

6030 * Some generic constants have been put to appropriate theories:

6031 - less_eq, less: Orderings

6032 - zero, one, plus, minus, uminus, times, abs, sgn: Groups

6033 - inverse, divide: Rings

6034 INCOMPATIBILITY.

6036 * More consistent naming of type classes involving orderings (and

6037 lattices):

6039 lower_semilattice ~> semilattice_inf

6040 upper_semilattice ~> semilattice_sup

6042 dense_linear_order ~> dense_linorder

6044 pordered_ab_group_add ~> ordered_ab_group_add

6045 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs

6046 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add

6047 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le

6048 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add

6049 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring

6050 pordered_cancel_semiring ~> ordered_cancel_semiring

6051 pordered_comm_monoid_add ~> ordered_comm_monoid_add

6052 pordered_comm_ring ~> ordered_comm_ring

6053 pordered_comm_semiring ~> ordered_comm_semiring

6054 pordered_ring ~> ordered_ring

6055 pordered_ring_abs ~> ordered_ring_abs

6056 pordered_semiring ~> ordered_semiring

6058 ordered_ab_group_add ~> linordered_ab_group_add

6059 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add

6060 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add

6061 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict

6062 ordered_field ~> linordered_field

6063 ordered_field_no_lb ~> linordered_field_no_lb

6064 ordered_field_no_ub ~> linordered_field_no_ub

6065 ordered_field_dense_linear_order ~> dense_linordered_field

6066 ordered_idom ~> linordered_idom

6067 ordered_ring ~> linordered_ring

6068 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor

6069 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor

6070 ordered_ring_strict ~> linordered_ring_strict

6071 ordered_semidom ~> linordered_semidom

6072 ordered_semiring ~> linordered_semiring

6073 ordered_semiring_1 ~> linordered_semiring_1

6074 ordered_semiring_1_strict ~> linordered_semiring_1_strict

6075 ordered_semiring_strict ~> linordered_semiring_strict

6077 The following slightly odd type classes have been moved to a

6078 separate theory Library/Lattice_Algebras:

6080 lordered_ab_group_add ~> lattice_ab_group_add

6081 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs

6082 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add

6083 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add

6084 lordered_ring ~> lattice_ring

6086 INCOMPATIBILITY.

6088 * Refined field classes:

6089 - classes division_ring_inverse_zero, field_inverse_zero,

6090 linordered_field_inverse_zero include rule inverse 0 = 0 --

6091 subsumes former division_by_zero class;

6092 - numerous lemmas have been ported from field to division_ring.

6093 INCOMPATIBILITY.

6095 * Refined algebra theorem collections:

6096 - dropped theorem group group_simps, use algebra_simps instead;

6097 - dropped theorem group ring_simps, use field_simps instead;

6098 - proper theorem collection field_simps subsumes former theorem

6099 groups field_eq_simps and field_simps;

6100 - dropped lemma eq_minus_self_iff which is a duplicate for

6101 equal_neg_zero.

6102 INCOMPATIBILITY.

6104 * Theory Finite_Set and List: some lemmas have been generalized from

6105 sets to lattices:

6107 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf

6108 fun_left_comm_idem_union ~> fun_left_comm_idem_sup

6109 inter_Inter_fold_inter ~> inf_Inf_fold_inf

6110 union_Union_fold_union ~> sup_Sup_fold_sup

6111 Inter_fold_inter ~> Inf_fold_inf

6112 Union_fold_union ~> Sup_fold_sup

6113 inter_INTER_fold_inter ~> inf_INFI_fold_inf

6114 union_UNION_fold_union ~> sup_SUPR_fold_sup

6115 INTER_fold_inter ~> INFI_fold_inf

6116 UNION_fold_union ~> SUPR_fold_sup

6118 * Theory "Complete_Lattice": lemmas top_def and bot_def have been

6119 replaced by the more convenient lemmas Inf_empty and Sup_empty.

6120 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed

6121 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace

6122 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right

6123 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.

6125 * Reorganized theory Multiset: swapped notation of pointwise and

6126 multiset order:

6128 - pointwise ordering is instance of class order with standard syntax

6129 <= and <;

6130 - multiset ordering has syntax <=# and <#; partial order properties

6131 are provided by means of interpretation with prefix

6132 multiset_order;

6133 - less duplication, less historical organization of sections,

6134 conversion from associations lists to multisets, rudimentary code

6135 generation;

6136 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,

6137 if needed.

6139 Renamed:

6141 multiset_eq_conv_count_eq ~> multiset_ext_iff

6142 multi_count_ext ~> multiset_ext

6143 diff_union_inverse2 ~> diff_union_cancelR

6145 INCOMPATIBILITY.

6147 * Theory Permutation: replaced local "remove" by List.remove1.

6149 * Code generation: ML and OCaml code is decorated with signatures.

6151 * Theory List: added transpose.

6153 * Library/Nat_Bijection.thy is a collection of bijective functions

6154 between nat and other types, which supersedes the older libraries

6155 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.

6157 Constants:

6158 Nat_Int_Bij.nat2_to_nat ~> prod_encode

6159 Nat_Int_Bij.nat_to_nat2 ~> prod_decode

6160 Nat_Int_Bij.int_to_nat_bij ~> int_encode

6161 Nat_Int_Bij.nat_to_int_bij ~> int_decode

6162 Countable.pair_encode ~> prod_encode

6163 NatIso.prod2nat ~> prod_encode

6164 NatIso.nat2prod ~> prod_decode

6165 NatIso.sum2nat ~> sum_encode

6166 NatIso.nat2sum ~> sum_decode

6167 NatIso.list2nat ~> list_encode

6168 NatIso.nat2list ~> list_decode

6169 NatIso.set2nat ~> set_encode

6170 NatIso.nat2set ~> set_decode

6172 Lemmas:

6173 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode

6174 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode

6175 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode

6176 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode

6177 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode

6178 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse

6179 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse

6180 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode

6181 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode

6182 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode

6183 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode

6184 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode

6185 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode

6187 * Sledgehammer:

6188 - Renamed ATP commands:

6189 atp_info ~> sledgehammer running_atps

6190 atp_kill ~> sledgehammer kill_atps

6191 atp_messages ~> sledgehammer messages

6192 atp_minimize ~> sledgehammer minimize

6193 print_atps ~> sledgehammer available_atps

6194 INCOMPATIBILITY.

6195 - Added user's manual ("isabelle doc sledgehammer").

6196 - Added option syntax and "sledgehammer_params" to customize

6197 Sledgehammer's behavior. See the manual for details.

6198 - Modified the Isar proof reconstruction code so that it produces

6199 direct proofs rather than proofs by contradiction. (This feature

6200 is still experimental.)

6201 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in

6202 full-typed mode.

6203 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.

6205 * Nitpick:

6206 - Added and implemented "binary_ints" and "bits" options.

6207 - Added "std" option and implemented support for nonstandard models.

6208 - Added and implemented "finitize" option to improve the precision

6209 of infinite datatypes based on a monotonicity analysis.

6210 - Added support for quotient types.

6211 - Added support for "specification" and "ax_specification"

6212 constructs.

6213 - Added support for local definitions (for "function" and

6214 "termination" proofs).

6215 - Added support for term postprocessors.

6216 - Optimized "Multiset.multiset" and "FinFun.finfun".

6217 - Improved efficiency of "destroy_constrs" optimization.

6218 - Fixed soundness bugs related to "destroy_constrs" optimization and

6219 record getters.

6220 - Fixed soundness bug related to higher-order constructors.

6221 - Fixed soundness bug when "full_descrs" is enabled.

6222 - Improved precision of set constructs.

6223 - Added "atoms" option.

6224 - Added cache to speed up repeated Kodkod invocations on the same

6225 problems.

6226 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and

6227 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and

6228 "SAT4J_Light". INCOMPATIBILITY.

6229 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",

6230 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.

6231 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.

6233 * Method "induct" now takes instantiations of the form t, where t is not

6234 a variable, as a shorthand for "x == t", where x is a fresh variable.

6235 If this is not intended, t has to be enclosed in parentheses.

6236 By default, the equalities generated by definitional instantiations

6237 are pre-simplified, which may cause parameters of inductive cases

6238 to disappear, or may even delete some of the inductive cases.

6239 Use "induct (no_simp)" instead of "induct" to restore the old

6240 behaviour. The (no_simp) option is also understood by the "cases"

6241 and "nominal_induct" methods, which now perform pre-simplification, too.

6242 INCOMPATIBILITY.

6245 *** HOLCF ***

6247 * Variable names in lemmas generated by the domain package have

6248 changed; the naming scheme is now consistent with the HOL datatype

6249 package. Some proof scripts may be affected, INCOMPATIBILITY.

6251 * The domain package no longer defines the function "foo_copy" for

6252 recursive domain "foo". The reach lemma is now stated directly in

6253 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must

6254 be reformulated in terms of "foo_take", INCOMPATIBILITY.

6256 * Most definedness lemmas generated by the domain package (previously

6257 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form

6258 like "foo$x = UU <-> x = UU", which works better as a simp rule.

6259 Proofs that used definedness lemmas as intro rules may break,

6260 potential INCOMPATIBILITY.

6262 * Induction and casedist rules generated by the domain package now

6263 declare proper case_names (one called "bottom", and one named for each

6264 constructor). INCOMPATIBILITY.

6266 * For mutually-recursive domains, separate "reach" and "take_lemma"

6267 rules are generated for each domain, INCOMPATIBILITY.

6269 foo_bar.reach ~> foo.reach bar.reach

6270 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma