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

NEWS

author | wenzelm |

Sat Jan 06 16:56:07 2018 +0100 (2018-01-06) | |

changeset 67352 | 5f7f339f3d7e |

parent 67341 | df79ef3b3a41 |

child 67356 | ba226b87c69e |

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

inner syntax comments may be written as "\<comment> \<open>text\<close>";

1 Isabelle NEWS -- history of user-relevant changes

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

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

7 New in this Isabelle version

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

10 *** General ***

12 * Inner syntax comments may be written as "\<comment> \<open>text\<close>", similar to

13 marginal comments in outer syntax.

15 * The old 'def' command has been discontinued (legacy since

16 Isbelle2016-1). INCOMPATIBILITY, use 'define' instead -- usually with

17 object-logic equality or equivalence.

19 * Session-qualified theory names are mandatory: it is no longer possible

20 to refer to unqualified theories from the parent session.

21 INCOMPATIBILITY for old developments that have not been updated to

22 Isabelle2017 yet (using the "isabelle imports" tool).

24 * Theory header 'abbrevs' specifications need to be separated by 'and'.

25 INCOMPATIBILITY.

27 * Only the most fundamental theory names are global, usually the entry

28 points to major logic sessions: Pure, Main, Complex_Main, HOLCF, IFOL,

29 FOL, ZF, ZFC etc. INCOMPATIBILITY, need to use qualified names for

30 formerly global "HOL-Probability.Probability" and "HOL-SPARK.SPARK".

32 * Command 'external_file' declares the formal dependency on the given

33 file name, such that the Isabelle build process knows about it, but

34 without specific Prover IDE management.

36 * Session ROOT entries no longer allow specification of 'files'. Rare

37 INCOMPATIBILITY, use command 'external_file' within a proper theory

38 context.

40 * Session root directories may be specified multiple times: each

41 accessible ROOT file is processed only once. This facilitates

42 specification of $ISABELLE_HOME_USER/ROOTS or command-line options like

43 -d or -D for "isabelle build" and "isabelle jedit". Example:

45 isabelle build -D '~~/src/ZF'

47 * The command 'display_drafts' has been discontinued. INCOMPATIBILITY,

48 use action "isabelle.draft" (or "print") in Isabelle/jEdit instead.

50 * Isabelle symbol "\<hyphen>" is rendered as explicit Unicode hyphen U+2010, to

51 avoid unclear meaning of the old "soft hyphen" U+00AD. Rare

52 INCOMPATIBILITY, e.g. copy-paste of historic Isabelle HTML output.

55 *** Isabelle/jEdit Prover IDE ***

57 * PIDE markup for session ROOT files: allows to complete session names,

58 follow links to theories and document files etc.

60 * Completion supports theory header imports, using theory base name.

61 E.g. "Prob" may be completed to "HOL-Probability.Probability".

63 * The command-line tool "isabelle jedit" provides more flexible options

64 for session selection:

65 - options -P opens the parent session image of -l

66 - options -A and -B modify the meaning of -l to produce a base

67 image on the spot, based on the specified ancestor (or parent)

68 - option -F focuses on the specified logic session

69 - option -R has changed: it only opens the session ROOT entry

70 - option -S sets up the development environment to edit the

71 specified session: it abbreviates -B -F -R -l

73 Examples:

74 isabelle jedit -d '$AFP' -S Formal_SSA -A HOL

75 isabelle jedit -d '$AFP' -S Formal_SSA -A HOL-Analysis

77 * Named control symbols (without special Unicode rendering) are shown as

78 bold-italic keyword. This is particularly useful for the short form of

79 antiquotations with control symbol: \<^name>\<open>argument\<close>. The action

80 "isabelle.antiquoted_cartouche" turns an antiquotation with 0 or 1

81 arguments into this format.

83 * Completion provides templates for named symbols with arguments,

84 e.g. "\<comment> \<open>ARGUMENT\<close>" or "\<^emph>\<open>ARGUMENT\<close>".

86 * Bibtex database files (.bib) are semantically checked.

88 * Action "isabelle.preview" is able to present more file formats,

89 notably bibtex database files and ML files.

91 * Action "isabelle.draft" is similar to "isabelle.preview", but shows a

92 plain-text document draft.

94 * When loading text files, the Isabelle symbols encoding UTF-8-Isabelle

95 is only used if there is no conflict with existing Unicode sequences in

96 the file. Otherwise, the fallback encoding is plain UTF-8 and Isabelle

97 symbols remain in literal \<symbol> form. This avoids accidental loss of

98 Unicode content when saving the file.

101 *** Isabelle/VSCode Prover IDE ***

103 * HTML preview of theories and other file-formats similar to

104 Isabelle/jEdit.

107 *** Document preparation ***

109 * System option "document_tags" specifies a default for otherwise

110 untagged commands. This is occasionally useful to control the global

111 visibility of commands via session options (e.g. in ROOT).

113 * Document markup commands ('section', 'text' etc.) are implicitly

114 tagged as "document" and visible by default. This avoids the application

115 of option "document_tags" to these commands.

117 * Isabelle names are mangled into LaTeX macro names to allow the full

118 identifier syntax with underscore, prime, digits. This is relevant for

119 antiquotations in control symbol notation, e.g. \<^const_name> becomes

120 \isactrlconstUNDERSCOREname.

122 * Document antiquotation @{cite} now checks the given Bibtex entries

123 against the Bibtex database files -- only in batch-mode session builds.

125 * Document antiquotation @{session name} checks and prints the given

126 session name verbatim.

128 * Document preparation with skip_proofs option now preserves the content

129 more accurately: only terminal proof steps ('by' etc.) are skipped.

131 * Command-line tool "isabelle document" has been re-implemented in

132 Isabelle/Scala, with simplified arguments and explicit errors from the

133 latex and bibtex process. Minor INCOMPATIBILITY.

136 *** HOL ***

138 * A new command parametric_constant for proving parametricity of

139 non-recursive definitions. For constants that are not fully parametric

140 the command will infer conditions on relations (e.g., bi_unique,

141 bi_total, or type class conditions such as "respects 0") sufficient for

142 parametricity. See ~~/src/HOL/ex/Conditional_Parametricity_Examples for

143 some examples.

145 * SMT module:

146 - The 'smt_oracle' option is now necessary when using the 'smt' method

147 with a solver other than Z3. INCOMPATIBILITY.

148 - The encoding to first-order logic is now more complete in the

149 presence of higher-order quantifiers. An 'smt_explicit_application'

150 option has been added to control this. INCOMPATIBILITY.

152 * Datatypes:

153 - The legacy command 'old_datatype', provided by

154 '~~/src/HOL/Library/Old_Datatype.thy', has been removed. INCOMPATIBILITY.

156 * Theory HOL-Computational_Algebra.Polynomial_Factorial does not provide

157 instances of rat, real, complex as factorial rings etc. Import

158 HOL-Computational_Algebra.Field_as_Ring explicitly in case of need.

159 INCOMPATIBILITY.

161 * Fact mod_mult_self4 (on nat) renamed to mod_mult_self3', to avoid

162 clash with fact mod_mult_self4 (on more generic semirings).

163 INCOMPATIBILITY.

165 * Facts sum.commute(_restrict) and prod.commute(_restrict) renamed to

166 sum.swap(_restrict) and prod.swap(_restrict), to avoid name clashes on

167 interpretation of abstract locales. INCOMPATIBILITY.

169 * Predicate pairwise_coprime abolished, use "pairwise coprime" instead.

170 INCOMPATIBILITY.

172 * HOL-Algebra: renamed (^) to [^]

174 * Session HOL-Analysis: Moebius functions and the Riemann mapping

175 theorem.

177 * Class linordered_semiring_1 covers zero_less_one also, ruling out

178 pathologic instances. Minor INCOMPATIBILITY.

180 * Removed nat-int transfer machinery. Rare INCOMPATIBILITY.

182 * Predicate coprime is now a real definition, not a mere

183 abbreviation. INCOMPATIBILITY.

185 * Code generation: Code generation takes an explicit option

186 "case_insensitive" to accomodate case-insensitive file systems.

189 *** System ***

191 * Session ROOT entry: empty 'document_files' means there is no document

192 for this session. There is no need to specify options [document = false]

193 anymore.

195 * The command-line tool "isabelle mkroot" now always produces a document

196 outline: its options have been adapted accordingly. INCOMPATIBILITY.

198 * The command-line tool "isabelle mkroot -I" initializes a Mercurial

199 repository for the generated session files.

201 * Linux and Windows/Cygwin is for x86_64 only. Old 32bit platform

202 support has been discontinued.

204 * Mac OS X 10.10 Yosemite is now the baseline version; Mavericks is no

205 longer supported.

207 * Java runtime is for x86_64 only. Corresponding Isabelle settings have

208 been renamed to ISABELLE_TOOL_JAVA_OPTIONS and JEDIT_JAVA_OPTIONS,

209 instead of former 32/64 variants. INCOMPATIBILITY.

211 * Command-line tool "isabelle build" supports new options:

212 - option -B NAME: include session NAME and all descendants

213 - option -S: only observe changes of sources, not heap images

214 - option -f: forces a fresh build

216 * Command-line tool "isabelle build" takes "condition" options with the

217 corresponding environment values into account, when determining the

218 up-to-date status of a session.

220 * Command-line tool "isabelle imports -I" also reports actual session

221 imports. This helps to minimize the session dependency graph.

223 * Update to current Poly/ML 5.7.1 with slightly improved performance and

224 PIDE markup for identifier bindings.

226 * ISABELLE_LATEX and ISABELLE_PDFLATEX now include platform-specific

227 options for improved error reporting. Potential INCOMPATIBILITY with

228 unusual LaTeX installations, may have to adapt these settings.

232 New in Isabelle2017 (October 2017)

233 ----------------------------------

235 *** General ***

237 * Experimental support for Visual Studio Code (VSCode) as alternative

238 Isabelle/PIDE front-end, see also

239 https://marketplace.visualstudio.com/items?itemName=makarius.Isabelle2017

241 VSCode is a new type of application that continues the concepts of

242 "programmer's editor" and "integrated development environment" towards

243 fully semantic editing and debugging -- in a relatively light-weight

244 manner. Thus it fits nicely on top of the Isabelle/PIDE infrastructure.

245 Technically, VSCode is based on the Electron application framework

246 (Node.js + Chromium browser + V8), which is implemented in JavaScript

247 and TypeScript, while Isabelle/VSCode mainly consists of Isabelle/Scala

248 modules around a Language Server implementation.

250 * Theory names are qualified by the session name that they belong to.

251 This affects imports, but not the theory name space prefix (which is

252 just the theory base name as before).

254 In order to import theories from other sessions, the ROOT file format

255 provides a new 'sessions' keyword. In contrast, a theory that is

256 imported in the old-fashioned manner via an explicit file-system path

257 belongs to the current session, and might cause theory name conflicts

258 later on. Theories that are imported from other sessions are excluded

259 from the current session document. The command-line tool "isabelle

260 imports" helps to update theory imports.

262 * The main theory entry points for some non-HOL sessions have changed,

263 to avoid confusion with the global name "Main" of the session HOL. This

264 leads to the follow renamings:

266 CTT/Main.thy ~> CTT/CTT.thy

267 ZF/Main.thy ~> ZF/ZF.thy

268 ZF/Main_ZF.thy ~> ZF/ZF.thy

269 ZF/Main_ZFC.thy ~> ZF/ZFC.thy

270 ZF/ZF.thy ~> ZF/ZF_Base.thy

272 INCOMPATIBILITY.

274 * Commands 'alias' and 'type_alias' introduce aliases for constants and

275 type constructors, respectively. This allows adhoc changes to name-space

276 accesses within global or local theory contexts, e.g. within a 'bundle'.

278 * Document antiquotations @{prf} and @{full_prf} output proof terms

279 (again) in the same way as commands 'prf' and 'full_prf'.

281 * Computations generated by the code generator can be embedded directly

282 into ML, alongside with @{code} antiquotations, using the following

283 antiquotations:

285 @{computation ... terms: ... datatypes: ...} :

286 ((term -> term) -> 'ml option -> 'a) -> Proof.context -> term -> 'a

287 @{computation_conv ... terms: ... datatypes: ...} :

288 (Proof.context -> 'ml -> conv) -> Proof.context -> conv

289 @{computation_check terms: ... datatypes: ...} : Proof.context -> conv

291 See src/HOL/ex/Computations.thy,

292 src/HOL/Decision_Procs/Commutative_Ring.thy and

293 src/HOL/Decision_Procs/Reflective_Field.thy for examples and the

294 tutorial on code generation.

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

299 * Session-qualified theory imports allow the Prover IDE to process

300 arbitrary theory hierarchies independently of the underlying logic

301 session image (e.g. option "isabelle jedit -l"), but the directory

302 structure needs to be known in advance (e.g. option "isabelle jedit -d"

303 or a line in the file $ISABELLE_HOME_USER/ROOTS).

305 * The PIDE document model maintains file content independently of the

306 status of jEdit editor buffers. Reloading jEdit buffers no longer causes

307 changes of formal document content. Theory dependencies are always

308 resolved internally, without the need for corresponding editor buffers.

309 The system option "jedit_auto_load" has been discontinued: it is

310 effectively always enabled.

312 * The Theories dockable provides a "Purge" button, in order to restrict

313 the document model to theories that are required for open editor

314 buffers.

316 * The Theories dockable indicates the overall status of checking of each

317 entry. When all forked tasks of a theory are finished, the border is

318 painted with thick lines; remaining errors in this situation are

319 represented by a different border color.

321 * Automatic indentation is more careful to avoid redundant spaces in

322 intermediate situations. Keywords are indented after input (via typed

323 characters or completion); see also option "jedit_indent_input".

325 * Action "isabelle.preview" opens an HTML preview of the current theory

326 document in the default web browser.

328 * Command-line invocation "isabelle jedit -R -l LOGIC" opens the ROOT

329 entry of the specified logic session in the editor, while its parent is

330 used for formal checking.

332 * The main Isabelle/jEdit plugin may be restarted manually (using the

333 jEdit Plugin Manager), as long as the "Isabelle Base" plugin remains

334 enabled at all times.

336 * Update to current jedit-5.4.0.

339 *** Pure ***

341 * Deleting the last code equations for a particular function using

342 [code del] results in function with no equations (runtime abort) rather

343 than an unimplemented function (generation time abort). Use explicit

344 [[code drop:]] to enforce the latter. Minor INCOMPATIBILITY.

346 * Proper concept of code declarations in code.ML:

347 - Regular code declarations act only on the global theory level, being

348 ignored with warnings if syntactically malformed.

349 - Explicitly global code declarations yield errors if syntactically

350 malformed.

351 - Default code declarations are silently ignored if syntactically

352 malformed.

353 Minor INCOMPATIBILITY.

355 * Clarified and standardized internal data bookkeeping of code

356 declarations: history of serials allows to track potentially

357 non-monotonous declarations appropriately. Minor INCOMPATIBILITY.

360 *** HOL ***

362 * The Nunchaku model finder is now part of "Main".

364 * SMT module:

365 - A new option, 'smt_nat_as_int', has been added to translate 'nat' to

366 'int' and benefit from the SMT solver's theory reasoning. It is

367 disabled by default.

368 - The legacy module "src/HOL/Library/Old_SMT.thy" has been removed.

369 - Several small issues have been rectified in the 'smt' command.

371 * (Co)datatype package: The 'size_gen_o_map' lemma is no longer

372 generated for datatypes with type class annotations. As a result, the

373 tactic that derives it no longer fails on nested datatypes. Slight

374 INCOMPATIBILITY.

376 * Command and antiquotation "value" with modified default strategy:

377 terms without free variables are always evaluated using plain evaluation

378 only, with no fallback on normalization by evaluation. Minor

379 INCOMPATIBILITY.

381 * Theories "GCD" and "Binomial" are already included in "Main" (instead

382 of "Complex_Main").

384 * Constant "surj" is a full input/output abbreviation (again).

385 Minor INCOMPATIBILITY.

387 * Dropped aliasses RangeP, DomainP for Rangep, Domainp respectively.

388 INCOMPATIBILITY.

390 * Renamed ii to imaginary_unit in order to free up ii as a variable

391 name. The syntax \<i> remains available. INCOMPATIBILITY.

393 * Dropped abbreviations transP, antisymP, single_valuedP; use constants

394 transp, antisymp, single_valuedp instead. INCOMPATIBILITY.

396 * Constant "subseq" in Topological_Spaces has been removed -- it is

397 subsumed by "strict_mono". Some basic lemmas specific to "subseq" have

398 been renamed accordingly, e.g. "subseq_o" -> "strict_mono_o" etc.

400 * Theory List: "sublist" renamed to "nths" in analogy with "nth", and

401 "sublisteq" renamed to "subseq". Minor INCOMPATIBILITY.

403 * Theory List: new generic function "sorted_wrt".

405 * Named theorems mod_simps covers various congruence rules concerning

406 mod, replacing former zmod_simps. INCOMPATIBILITY.

408 * Swapped orientation of congruence rules mod_add_left_eq,

409 mod_add_right_eq, mod_add_eq, mod_mult_left_eq, mod_mult_right_eq,

410 mod_mult_eq, mod_minus_eq, mod_diff_left_eq, mod_diff_right_eq,

411 mod_diff_eq. INCOMPATIBILITY.

413 * Generalized some facts:

414 measure_induct_rule

415 measure_induct

416 zminus_zmod ~> mod_minus_eq

417 zdiff_zmod_left ~> mod_diff_left_eq

418 zdiff_zmod_right ~> mod_diff_right_eq

419 zmod_eq_dvd_iff ~> mod_eq_dvd_iff

420 INCOMPATIBILITY.

422 * Algebraic type class hierarchy of euclidean (semi)rings in HOL:

423 euclidean_(semi)ring, euclidean_(semi)ring_cancel,

424 unique_euclidean_(semi)ring; instantiation requires provision of a

425 euclidean size.

427 * Theory "HOL-Number_Theory.Euclidean_Algorithm" has been reworked:

428 - Euclidean induction is available as rule eucl_induct.

429 - Constants Euclidean_Algorithm.gcd, Euclidean_Algorithm.lcm,

430 Euclidean_Algorithm.Gcd and Euclidean_Algorithm.Lcm allow

431 easy instantiation of euclidean (semi)rings as GCD (semi)rings.

432 - Coefficients obtained by extended euclidean algorithm are

433 available as "bezout_coefficients".

434 INCOMPATIBILITY.

436 * Theory "Number_Theory.Totient" introduces basic notions about Euler's

437 totient function previously hidden as solitary example in theory

438 Residues. Definition changed so that "totient 1 = 1" in agreement with

439 the literature. Minor INCOMPATIBILITY.

441 * New styles in theory "HOL-Library.LaTeXsugar":

442 - "dummy_pats" for printing equations with "_" on the lhs;

443 - "eta_expand" for printing eta-expanded terms.

445 * Theory "HOL-Library.Permutations": theorem bij_swap_ompose_bij has

446 been renamed to bij_swap_compose_bij. INCOMPATIBILITY.

448 * New theory "HOL-Library.Going_To_Filter" providing the "f going_to F"

449 filter for describing points x such that f(x) is in the filter F.

451 * Theory "HOL-Library.Formal_Power_Series": constants X/E/L/F have been

452 renamed to fps_X/fps_exp/fps_ln/fps_hypergeo to avoid polluting the name

453 space. INCOMPATIBILITY.

455 * Theory "HOL-Library.FinFun" has been moved to AFP (again).

456 INCOMPATIBILITY.

458 * Theory "HOL-Library.FuncSet": some old and rarely used ASCII

459 replacement syntax has been removed. INCOMPATIBILITY, standard syntax

460 with symbols should be used instead. The subsequent commands help to

461 reproduce the old forms, e.g. to simplify porting old theories:

463 syntax (ASCII)

464 "_PiE" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set" ("(3PIE _:_./ _)" 10)

465 "_Pi" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set" ("(3PI _:_./ _)" 10)

466 "_lam" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> ('a \<Rightarrow> 'b)" ("(3%_:_./ _)" [0,0,3] 3)

468 * Theory "HOL-Library.Multiset": the simprocs on subsets operators of

469 multisets have been renamed:

471 msetless_cancel_numerals ~> msetsubset_cancel

472 msetle_cancel_numerals ~> msetsubset_eq_cancel

474 INCOMPATIBILITY.

476 * Theory "HOL-Library.Pattern_Aliases" provides input and output syntax

477 for pattern aliases as known from Haskell, Scala and ML.

479 * Theory "HOL-Library.Uprod" formalizes the type of unordered pairs.

481 * Session HOL-Analysis: more material involving arcs, paths, covering

482 spaces, innessential maps, retracts, infinite products, simplicial

483 complexes. Baire Category theorem. Major results include the Jordan

484 Curve Theorem and the Great Picard Theorem.

486 * Session HOL-Algebra has been extended by additional lattice theory:

487 the Knaster-Tarski fixed point theorem and Galois Connections.

489 * Sessions HOL-Computational_Algebra and HOL-Number_Theory: new notions

490 of squarefreeness, n-th powers, and prime powers.

492 * Session "HOL-Computional_Algebra" covers many previously scattered

493 theories, notably Euclidean_Algorithm, Factorial_Ring,

494 Formal_Power_Series, Fraction_Field, Fundamental_Theorem_Algebra,

495 Normalized_Fraction, Polynomial_FPS, Polynomial, Primes. Minor

496 INCOMPATIBILITY.

499 *** System ***

501 * Isabelle/Scala: the SQL module supports access to relational

502 databases, either as plain file (SQLite) or full-scale server

503 (PostgreSQL via local port or remote ssh connection).

505 * Results of "isabelle build" are recorded as SQLite database (i.e.

506 "Application File Format" in the sense of

507 https://www.sqlite.org/appfileformat.html). This allows systematic

508 access via operations from module Sessions.Store in Isabelle/Scala.

510 * System option "parallel_proofs" is 1 by default (instead of more

511 aggressive 2). This requires less heap space and avoids burning parallel

512 CPU cycles, while full subproof parallelization is enabled for repeated

513 builds (according to parallel_subproofs_threshold).

515 * System option "record_proofs" allows to change the global

516 Proofterm.proofs variable for a session. Regular values are are 0, 1, 2;

517 a negative value means the current state in the ML heap image remains

518 unchanged.

520 * Isabelle settings variable ISABELLE_SCALA_BUILD_OPTIONS has been

521 renamed to ISABELLE_SCALAC_OPTIONS. Rare INCOMPATIBILITY.

523 * Isabelle settings variables ISABELLE_WINDOWS_PLATFORM,

524 ISABELLE_WINDOWS_PLATFORM32, ISABELLE_WINDOWS_PLATFORM64 indicate the

525 native Windows platform (independently of the Cygwin installation). This

526 is analogous to ISABELLE_PLATFORM, ISABELLE_PLATFORM32,

527 ISABELLE_PLATFORM64.

529 * Command-line tool "isabelle build_docker" builds a Docker image from

530 the Isabelle application bundle for Linux. See also

531 https://hub.docker.com/r/makarius/isabelle

533 * Command-line tool "isabelle vscode_server" provides a Language Server

534 Protocol implementation, e.g. for the Visual Studio Code editor. It

535 serves as example for alternative PIDE front-ends.

537 * Command-line tool "isabelle imports" helps to maintain theory imports

538 wrt. session structure. Examples for the main Isabelle distribution:

540 isabelle imports -I -a

541 isabelle imports -U -a

542 isabelle imports -U -i -a

543 isabelle imports -M -a -d '~~/src/Benchmarks'

547 New in Isabelle2016-1 (December 2016)

548 -------------------------------------

550 *** General ***

552 * Splitter in proof methods "simp", "auto" and friends:

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

554 INCOMPATIBILITY.

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

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

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

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

559 result the subgoal may be split into several subgoals.

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

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

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

565 bundle foo

566 begin

567 declare a [simp]

568 declare b [intro]

569 end

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

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

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

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

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

577 discontinued.

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

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

581 quotes when sub-languages are nested.

583 * Mixfix annotations support general block properties, with syntax

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

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

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

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

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

590 statements without object-logic judgment.

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

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

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

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

597 examples.

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

600 instances) are generated into companion object of corresponding type

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

603 * Solve direct: option "solve_direct_strict_warnings" gives explicit

604 warnings for lemma statements with trivial proofs.

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

609 * More aggressive flushing of machine-generated input, according to

610 system option editor_generated_input_delay (in addition to existing

611 editor_input_delay for regular user edits). This may affect overall PIDE

612 reactivity and CPU usage.

614 * Syntactic indentation according to Isabelle outer syntax. Action

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

616 command keywords and some command substructure. Action

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

618 according to command keywords only; see also option

619 "jedit_indent_newline".

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

622 number of subgoals. This requires information of ongoing document

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

624 quickly; see also option "jedit_script_indent" and

625 "jedit_script_indent_limit".

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

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

629 structure of theory specifications is treated as well.

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

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

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

635 e.g. 'context', 'notepad'.

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

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

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

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

643 occurrences of the formal entity at the caret position. This facilitates

644 systematic renaming.

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

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

648 theorem statement.

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

651 situations where old ASCII notation may be updated.

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

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

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

656 inaccessible via keyboard completion).

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

659 following independent stages:

661 src/Pure/ROOT0.ML

662 src/Pure/ROOT.ML

663 src/Pure/Pure.thy

664 src/Pure/ML_Bootstrap.thy

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

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

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

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

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

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

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

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

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

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

678 * Additional abbreviations for syntactic completion may be specified

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

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

681 new 'abbrevs' section.

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

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

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

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

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

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

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

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

692 old keymaps.

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

695 and diverse:

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

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

699 @{dir NAME} -- check for directory

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

702 have to be changed.

705 *** Document preparation ***

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

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

710 existing antiquotation @{class}.

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

713 this allows special forms of document output.

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

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

717 derivatives.

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

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

722 Isabelle2015).

725 *** Isar ***

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

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

729 'definition', 'inductive', 'function'.

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

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

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

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

735 context: INCOMPATIBILITY.

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

738 optional abstraction over local parameters. The syntax resembles

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

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

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

743 context.

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

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

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

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

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

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

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

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

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

757 INCOMPATIBILITY.

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

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

761 definitions.

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

764 expression, e.g.

766 (use facts in simp)

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

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

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

773 *** Pure ***

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

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

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

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

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

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

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

783 regardless of the actual parameters that are provided. Rare

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

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

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

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

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

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

791 INCOMPATIBILITY, need to provide explicit type constraints for Pure

792 types where this is really intended.

795 *** HOL ***

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

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

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

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

801 quantifier-free propositional logic with linear real arithmetic

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

804 * The new "nunchaku" command integrates the Nunchaku model finder. The

805 tool is experimental. See ~~/src/HOL/Nunchaku/Nunchaku.thy for details.

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

808 break existing proofs. INCOMPATIBILITY.

810 * Sledgehammer:

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

812 - Produce syntactically correct Vampire 4.0 problem files.

814 * (Co)datatype package:

815 - New commands for defining corecursive functions and reasoning about

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

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

818 method. See 'isabelle doc corec'.

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

820 citizen in bounded natural functors.

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

822 to the map function.

823 - 'bnf' automatically discharges reflexive proof obligations.

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

825 terms of map and set

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

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

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

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

830 - Renamed lemmas:

831 rel_prod_apply ~> rel_prod_inject

832 pred_prod_apply ~> pred_prod_inject

833 INCOMPATIBILITY.

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

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

836 equivalent) form.

837 INCOMPATIBILITY.

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

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

841 which exposed details of the internal fixpoint construction and was

842 hard to use. INCOMPATIBILITY.

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

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

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

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

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

851 eliminated altogether.

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

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

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

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

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

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

859 INCOMPATIBILITY in rare situations.

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

862 INCOMPATIBILITY.

864 * Renamed constants and corresponding theorems:

866 setsum ~> sum

867 setprod ~> prod

868 listsum ~> sum_list

869 listprod ~> prod_list

871 INCOMPATIBILITY.

873 * Sligthly more standardized theorem names:

874 sgn_times ~> sgn_mult

875 sgn_mult' ~> Real_Vector_Spaces.sgn_mult

876 divide_zero_left ~> div_0

877 zero_mod_left ~> mod_0

878 divide_zero ~> div_by_0

879 divide_1 ~> div_by_1

880 nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left

881 div_mult_self1_is_id ~> nonzero_mult_div_cancel_left

882 nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right

883 div_mult_self2_is_id ~> nonzero_mult_div_cancel_right

884 is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left

885 is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right

886 mod_div_equality ~> div_mult_mod_eq

887 mod_div_equality2 ~> mult_div_mod_eq

888 mod_div_equality3 ~> mod_div_mult_eq

889 mod_div_equality4 ~> mod_mult_div_eq

890 minus_div_eq_mod ~> minus_div_mult_eq_mod

891 minus_div_eq_mod2 ~> minus_mult_div_eq_mod

892 minus_mod_eq_div ~> minus_mod_eq_div_mult

893 minus_mod_eq_div2 ~> minus_mod_eq_mult_div

894 div_mod_equality' ~> minus_mod_eq_div_mult [symmetric]

895 mod_div_equality' ~> minus_div_mult_eq_mod [symmetric]

896 zmod_zdiv_equality ~> mult_div_mod_eq [symmetric]

897 zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric]

898 Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

899 mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

900 zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

901 div_1 ~> div_by_Suc_0

902 mod_1 ~> mod_by_Suc_0

903 INCOMPATIBILITY.

905 * New type class "idom_abs_sgn" specifies algebraic properties

906 of sign and absolute value functions. Type class "sgn_if" has

907 disappeared. Slight INCOMPATIBILITY.

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

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

912 corresponding to {0..255}.

914 - Logical representation:

915 * 0 is instantiated to the ASCII zero character.

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

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

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

919 are non-canonical.

920 - Printing and parsing:

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

922 (as before).

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

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

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

926 is parsable for every numeral expression n.

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

928 printed as their logical representation.

929 - Explicit conversions from and to the natural numbers are

930 provided as char_of_nat, nat_of_char (as before).

931 - The auxiliary nibble type has been discontinued.

933 INCOMPATIBILITY.

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

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

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

938 infix "mod" syntax. INCOMPATIBILITY.

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

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

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

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

944 easily recovered by composition with eq_refl. Minor INCOMPATIBILITY.

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

947 equation in term output. Minor INCOMPATIBILITY.

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

950 which renders those abstract effectively.

952 * Command 'export_code' checks given constants for abstraction

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

954 interface for the generated code.

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

957 spelt out explicitly.

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

960 explicitly provided auxiliary definitions for required type class

961 dictionaries rather than half-working magic. INCOMPATIBILITY, see the

962 tutorial on code generation for details.

964 * Theory Set_Interval: substantial new theorems on indexed sums and

965 products.

967 * Locale bijection establishes convenient default simp rules such as

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

970 * Abstract locales semigroup, abel_semigroup, semilattice,

971 semilattice_neutr, ordering, ordering_top, semilattice_order,

972 semilattice_neutr_order, comm_monoid_set, semilattice_set,

973 semilattice_neutr_set, semilattice_order_set,

974 semilattice_order_neutr_set monoid_list, comm_monoid_list,

975 comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified

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

977 INCOMPATIBILITY.

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

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

981 lifting_syntax begin ... end". Minor INCOMPATIBILITY.

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

984 INCOMPATIBILITY.

986 nat_less_cases -- removed, use linorder_cases instead

987 inv_image_comp -- removed, use image_inv_f_f instead

988 image_surj_f_inv_f ~> image_f_inv_f

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

991 groups to semi-groups that are also monoids:

992 le_add_same_cancel1

993 le_add_same_cancel2

994 less_add_same_cancel1

995 less_add_same_cancel2

996 add_le_same_cancel1

997 add_le_same_cancel2

998 add_less_same_cancel1

999 add_less_same_cancel2

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

1002 superseeded by a more general version:

1003 less_add_cancel_left_greater_zero ~> less_add_same_cancel1

1004 less_add_cancel_right_greater_zero ~> less_add_same_cancel2

1005 less_eq_add_cancel_left_greater_eq_zero ~> le_add_same_cancel1

1006 less_eq_add_cancel_right_greater_eq_zero ~> le_add_same_cancel2

1007 less_eq_add_cancel_left_less_eq_zero ~> add_le_same_cancel1

1008 less_eq_add_cancel_right_less_eq_zero ~> add_le_same_cancel2

1009 less_add_cancel_left_less_zero ~> add_less_same_cancel1

1010 less_add_cancel_right_less_zero ~> add_less_same_cancel2

1011 INCOMPATIBILITY.

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

1014 resemble the f.split naming convention, INCOMPATIBILITY.

1016 * Added class topological_monoid.

1018 * The following theorems have been renamed:

1020 setsum_left_distrib ~> sum_distrib_right

1021 setsum_right_distrib ~> sum_distrib_left

1023 INCOMPATIBILITY.

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

1026 INCOMPATIBILITY.

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

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

1030 A)".

1032 * Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY.

1034 * The type class ordered_comm_monoid_add is now called

1035 ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add

1036 is introduced as the combination of ordered_ab_semigroup_add +

1037 comm_monoid_add. INCOMPATIBILITY.

1039 * Introduced the type classes canonically_ordered_comm_monoid_add and

1040 dioid.

1042 * Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When

1043 instantiating linordered_semiring_strict and ordered_ab_group_add, an

1044 explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might

1045 be required. INCOMPATIBILITY.

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

1048 of a more general type also:

1049 lcm_left_commute_nat ~> lcm.left_commute

1050 lcm_left_commute_int ~> lcm.left_commute

1051 gcd_left_commute_nat ~> gcd.left_commute

1052 gcd_left_commute_int ~> gcd.left_commute

1053 gcd_greatest_iff_nat ~> gcd_greatest_iff

1054 gcd_greatest_iff_int ~> gcd_greatest_iff

1055 coprime_dvd_mult_nat ~> coprime_dvd_mult

1056 coprime_dvd_mult_int ~> coprime_dvd_mult

1057 zpower_numeral_even ~> power_numeral_even

1058 gcd_mult_cancel_nat ~> gcd_mult_cancel

1059 gcd_mult_cancel_int ~> gcd_mult_cancel

1060 div_gcd_coprime_nat ~> div_gcd_coprime

1061 div_gcd_coprime_int ~> div_gcd_coprime

1062 zpower_numeral_odd ~> power_numeral_odd

1063 zero_less_int_conv ~> of_nat_0_less_iff

1064 gcd_greatest_nat ~> gcd_greatest

1065 gcd_greatest_int ~> gcd_greatest

1066 coprime_mult_nat ~> coprime_mult

1067 coprime_mult_int ~> coprime_mult

1068 lcm_commute_nat ~> lcm.commute

1069 lcm_commute_int ~> lcm.commute

1070 int_less_0_conv ~> of_nat_less_0_iff

1071 gcd_commute_nat ~> gcd.commute

1072 gcd_commute_int ~> gcd.commute

1073 Gcd_insert_nat ~> Gcd_insert

1074 Gcd_insert_int ~> Gcd_insert

1075 of_int_int_eq ~> of_int_of_nat_eq

1076 lcm_least_nat ~> lcm_least

1077 lcm_least_int ~> lcm_least

1078 lcm_assoc_nat ~> lcm.assoc

1079 lcm_assoc_int ~> lcm.assoc

1080 int_le_0_conv ~> of_nat_le_0_iff

1081 int_eq_0_conv ~> of_nat_eq_0_iff

1082 Gcd_empty_nat ~> Gcd_empty

1083 Gcd_empty_int ~> Gcd_empty

1084 gcd_assoc_nat ~> gcd.assoc

1085 gcd_assoc_int ~> gcd.assoc

1086 zero_zle_int ~> of_nat_0_le_iff

1087 lcm_dvd2_nat ~> dvd_lcm2

1088 lcm_dvd2_int ~> dvd_lcm2

1089 lcm_dvd1_nat ~> dvd_lcm1

1090 lcm_dvd1_int ~> dvd_lcm1

1091 gcd_zero_nat ~> gcd_eq_0_iff

1092 gcd_zero_int ~> gcd_eq_0_iff

1093 gcd_dvd2_nat ~> gcd_dvd2

1094 gcd_dvd2_int ~> gcd_dvd2

1095 gcd_dvd1_nat ~> gcd_dvd1

1096 gcd_dvd1_int ~> gcd_dvd1

1097 int_numeral ~> of_nat_numeral

1098 lcm_ac_nat ~> ac_simps

1099 lcm_ac_int ~> ac_simps

1100 gcd_ac_nat ~> ac_simps

1101 gcd_ac_int ~> ac_simps

1102 abs_int_eq ~> abs_of_nat

1103 zless_int ~> of_nat_less_iff

1104 zdiff_int ~> of_nat_diff

1105 zadd_int ~> of_nat_add

1106 int_mult ~> of_nat_mult

1107 int_Suc ~> of_nat_Suc

1108 inj_int ~> inj_of_nat

1109 int_1 ~> of_nat_1

1110 int_0 ~> of_nat_0

1111 Lcm_empty_nat ~> Lcm_empty

1112 Lcm_empty_int ~> Lcm_empty

1113 Lcm_insert_nat ~> Lcm_insert

1114 Lcm_insert_int ~> Lcm_insert

1115 comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd

1116 comp_fun_idem_gcd_int ~> comp_fun_idem_gcd

1117 comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm

1118 comp_fun_idem_lcm_int ~> comp_fun_idem_lcm

1119 Lcm_eq_0 ~> Lcm_eq_0_I

1120 Lcm0_iff ~> Lcm_0_iff

1121 Lcm_dvd_int ~> Lcm_least

1122 divides_mult_nat ~> divides_mult

1123 divides_mult_int ~> divides_mult

1124 lcm_0_nat ~> lcm_0_right

1125 lcm_0_int ~> lcm_0_right

1126 lcm_0_left_nat ~> lcm_0_left

1127 lcm_0_left_int ~> lcm_0_left

1128 dvd_gcd_D1_nat ~> dvd_gcdD1

1129 dvd_gcd_D1_int ~> dvd_gcdD1

1130 dvd_gcd_D2_nat ~> dvd_gcdD2

1131 dvd_gcd_D2_int ~> dvd_gcdD2

1132 coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff

1133 coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff

1134 realpow_minus_mult ~> power_minus_mult

1135 realpow_Suc_le_self ~> power_Suc_le_self

1136 dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest

1137 INCOMPATIBILITY.

1139 * Renamed HOL/Quotient_Examples/FSet.thy to

1140 HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY.

1142 * Session HOL-Library: theory FinFun bundles "finfun_syntax" and

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

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

1145 "unbundle finfun_syntax" to imitate import of

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

1148 * Session HOL-Library: theory Multiset_Permutations (executably) defines

1149 the set of permutations of a given set or multiset, i.e. the set of all

1150 lists that contain every element of the carrier (multi-)set exactly

1151 once.

1153 * Session HOL-Library: multiset membership is now expressed using

1154 set_mset rather than count.

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

1157 by default.

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

1160 equations count_eq_zero_iff and not_in_iff.

1162 - Rules count_inI and in_countE obtain facts of the form

1163 "count M a = n" from membership.

1165 - Rules count_in_diffI and in_diff_countE obtain facts of the form

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

1168 INCOMPATIBILITY.

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

1171 displaying equations in functional programming style --- variables

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

1173 underscores.

1175 * Session HOL-Library: theory Combinator_PER provides combinator to

1176 build partial equivalence relations from a predicate and an equivalence

1177 relation.

1179 * Session HOL-Library: theory Perm provides basic facts about almost

1180 everywhere fix bijections.

1182 * Session HOL-Library: theory Normalized_Fraction allows viewing an

1183 element of a field of fractions as a normalized fraction (i.e. a pair of

1184 numerator and denominator such that the two are coprime and the

1185 denominator is normalized wrt. unit factors).

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

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

1191 * Session HOL-Analysis: measure theory has been moved here from

1192 HOL-Probability. When importing HOL-Analysis some theorems need

1193 additional name spaces prefixes due to name clashes. INCOMPATIBILITY.

1195 * Session HOL-Analysis: more complex analysis including Cauchy's

1196 inequality, Liouville theorem, open mapping theorem, maximum modulus

1197 principle, Residue theorem, Schwarz Lemma.

1199 * Session HOL-Analysis: Theory of polyhedra: faces, extreme points,

1200 polytopes, and the Krein–Milman Minkowski theorem.

1202 * Session HOL-Analysis: Numerous results ported from the HOL Light

1203 libraries: homeomorphisms, continuous function extensions, invariance of

1204 domain.

1206 * Session HOL-Probability: the type of emeasure and nn_integral was

1207 changed from ereal to ennreal, INCOMPATIBILITY.

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

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

1212 * Session HOL-Probability: Code generation and QuickCheck for

1213 Probability Mass Functions.

1215 * Session HOL-Probability: theory Random_Permutations contains some

1216 theory about choosing a permutation of a set uniformly at random and

1217 folding over a list in random order.

1219 * Session HOL-Probability: theory SPMF formalises discrete

1220 subprobability distributions.

1222 * Session HOL-Library: the names of multiset theorems have been

1223 normalised to distinguish which ordering the theorems are about

1225 mset_less_eqI ~> mset_subset_eqI

1226 mset_less_insertD ~> mset_subset_insertD

1227 mset_less_eq_count ~> mset_subset_eq_count

1228 mset_less_diff_self ~> mset_subset_diff_self

1229 mset_le_exists_conv ~> mset_subset_eq_exists_conv

1230 mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel

1231 mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel

1232 mset_le_mono_add ~> mset_subset_eq_mono_add

1233 mset_le_add_left ~> mset_subset_eq_add_left

1234 mset_le_add_right ~> mset_subset_eq_add_right

1235 mset_le_single ~> mset_subset_eq_single

1236 mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute

1237 diff_le_self ~> diff_subset_eq_self

1238 mset_leD ~> mset_subset_eqD

1239 mset_lessD ~> mset_subsetD

1240 mset_le_insertD ~> mset_subset_eq_insertD

1241 mset_less_of_empty ~> mset_subset_of_empty

1242 mset_less_size ~> mset_subset_size

1243 wf_less_mset_rel ~> wf_subset_mset_rel

1244 count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq

1245 mset_remdups_le ~> mset_remdups_subset_eq

1246 ms_lesseq_impl ~> subset_eq_mset_impl

1248 Some functions have been renamed:

1249 ms_lesseq_impl -> subset_eq_mset_impl

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

1252 #\<subseteq># ~> \<le>

1253 #\<subset># ~> <

1254 le_multiset ~> less_eq_multiset

1255 less_multiset ~> le_multiset

1256 INCOMPATIBILITY.

1258 * Session HOL-Library: the prefix multiset_order has been discontinued:

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

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

1261 interpretations "multiset_linorder" and "multiset_wellorder" have been

1262 replaced by instantiations. INCOMPATIBILITY.

1264 * Session HOL-Library: some theorems about the multiset ordering have

1265 been renamed:

1267 le_multiset_def ~> less_eq_multiset_def

1268 less_multiset_def ~> le_multiset_def

1269 less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset

1270 mult_less_not_refl ~> mset_le_not_refl

1271 mult_less_trans ~> mset_le_trans

1272 mult_less_not_sym ~> mset_le_not_sym

1273 mult_less_asym ~> mset_le_asym

1274 mult_less_irrefl ~> mset_le_irrefl

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

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

1278 le_multiset_total ~> less_eq_multiset_total

1279 less_multiset_right_total ~> subset_eq_imp_le_multiset

1280 le_multiset_empty_left ~> less_eq_multiset_empty_left

1281 le_multiset_empty_right ~> less_eq_multiset_empty_right

1282 less_multiset_empty_right ~> le_multiset_empty_left

1283 less_multiset_empty_left ~> le_multiset_empty_right

1284 union_less_diff_plus ~> union_le_diff_plus

1285 ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset

1286 less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty

1287 le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty

1288 INCOMPATIBILITY.

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

1291 INCOMPATIBILITY.

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

1294 INCOMPATIBILITY, use the following replacements:

1296 le_multiset_plus_plus_left_iff ~> add_less_cancel_right

1297 less_multiset_plus_plus_left_iff ~> add_less_cancel_right

1298 le_multiset_plus_plus_right_iff ~> add_less_cancel_left

1299 less_multiset_plus_plus_right_iff ~> add_less_cancel_left

1300 add_eq_self_empty_iff ~> add_cancel_left_right

1301 mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right

1302 mset_less_add_bothsides ~> subset_mset.add_less_cancel_right

1303 mset_le_add_bothsides ~> subset_mset.add_less_cancel_right

1304 empty_inter ~> subset_mset.inf_bot_left

1305 inter_empty ~> subset_mset.inf_bot_right

1306 empty_sup ~> subset_mset.sup_bot_left

1307 sup_empty ~> subset_mset.sup_bot_right

1308 bdd_below_multiset ~> subset_mset.bdd_above_bot

1309 subset_eq_empty ~> subset_mset.le_zero_eq

1310 le_empty ~> subset_mset.le_zero_eq

1311 mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero

1312 mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero

1314 * Session HOL-Library: some typeclass constraints about multisets have

1315 been reduced from ordered or linordered to preorder. Multisets have the

1316 additional typeclasses order_bot, no_top,

1317 ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add,

1318 linordered_cancel_ab_semigroup_add, and

1319 ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY.

1321 * Session HOL-Library: there are some new simplification rules about

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

1323 INCOMPATIBILITY.

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

1326 interpretations ordered_ab_semigroup_monoid_add_imp_le and

1327 bounded_lattice_bot. INCOMPATIBILITY.

1329 * Session HOL-Library, theory Multiset: single has been removed in favor

1330 of add_mset that roughly corresponds to Set.insert. Some theorems have

1331 removed or changed:

1333 single_not_empty ~> add_mset_not_empty or empty_not_add_mset

1334 fold_mset_insert ~> fold_mset_add_mset

1335 image_mset_insert ~> image_mset_add_mset

1336 union_single_eq_diff

1337 multi_self_add_other_not_self

1338 diff_single_eq_union

1339 INCOMPATIBILITY.

1341 * Session HOL-Library, theory Multiset: some theorems have been changed

1342 to use add_mset instead of single:

1344 mset_add

1345 multi_self_add_other_not_self

1346 diff_single_eq_union

1347 union_single_eq_diff

1348 union_single_eq_member

1349 add_eq_conv_diff

1350 insert_noteq_member

1351 add_eq_conv_ex

1352 multi_member_split

1353 multiset_add_sub_el_shuffle

1354 mset_subset_eq_insertD

1355 mset_subset_insertD

1356 insert_subset_eq_iff

1357 insert_union_subset_iff

1358 multi_psub_of_add_self

1359 inter_add_left1

1360 inter_add_left2

1361 inter_add_right1

1362 inter_add_right2

1363 sup_union_left1

1364 sup_union_left2

1365 sup_union_right1

1366 sup_union_right2

1367 size_eq_Suc_imp_eq_union

1368 multi_nonempty_split

1369 mset_insort

1370 mset_update

1371 mult1I

1372 less_add

1373 mset_zip_take_Cons_drop_twice

1374 rel_mset_Zero

1375 msed_map_invL

1376 msed_map_invR

1377 msed_rel_invL

1378 msed_rel_invR

1379 le_multiset_right_total

1380 multiset_induct

1381 multiset_induct2_size

1382 multiset_induct2

1383 INCOMPATIBILITY.

1385 * Session HOL-Library, theory Multiset: the definitions of some

1386 constants have changed to use add_mset instead of adding a single

1387 element:

1389 image_mset

1390 mset

1391 replicate_mset

1392 mult1

1393 pred_mset

1394 rel_mset'

1395 mset_insort

1397 INCOMPATIBILITY.

1399 * Session HOL-Library, theory Multiset: due to the above changes, the

1400 attributes of some multiset theorems have been changed:

1402 insert_DiffM [] ~> [simp]

1403 insert_DiffM2 [simp] ~> []

1404 diff_add_mset_swap [simp]

1405 fold_mset_add_mset [simp]

1406 diff_diff_add [simp] (for multisets only)

1407 diff_cancel [simp] ~> []

1408 count_single [simp] ~> []

1409 set_mset_single [simp] ~> []

1410 size_multiset_single [simp] ~> []

1411 size_single [simp] ~> []

1412 image_mset_single [simp] ~> []

1413 mset_subset_eq_mono_add_right_cancel [simp] ~> []

1414 mset_subset_eq_mono_add_left_cancel [simp] ~> []

1415 fold_mset_single [simp] ~> []

1416 subset_eq_empty [simp] ~> []

1417 empty_sup [simp] ~> []

1418 sup_empty [simp] ~> []

1419 inter_empty [simp] ~> []

1420 empty_inter [simp] ~> []

1421 INCOMPATIBILITY.

1423 * Session HOL-Library, theory Multiset: the order of the variables in

1424 the second cases of multiset_induct, multiset_induct2_size,

1425 multiset_induct2 has been changed (e.g. Add A a ~> Add a A).

1426 INCOMPATIBILITY.

1428 * Session HOL-Library, theory Multiset: there is now a simplification

1429 procedure on multisets. It mimics the behavior of the procedure on

1430 natural numbers. INCOMPATIBILITY.

1432 * Session HOL-Library, theory Multiset: renamed sums and products of

1433 multisets:

1435 msetsum ~> sum_mset

1436 msetprod ~> prod_mset

1438 * Session HOL-Library, theory Multiset: the notation for intersection

1439 and union of multisets have been changed:

1441 #\<inter> ~> \<inter>#

1442 #\<union> ~> \<union>#

1444 INCOMPATIBILITY.

1446 * Session HOL-Library, theory Multiset: the lemma

1447 one_step_implies_mult_aux on multisets has been removed, use

1448 one_step_implies_mult instead. INCOMPATIBILITY.

1450 * Session HOL-Library: theory Complete_Partial_Order2 provides reasoning

1451 support for monotonicity and continuity in chain-complete partial orders

1452 and about admissibility conditions for fixpoint inductions.

1454 * Session HOL-Library: theory Library/Polynomial contains also

1455 derivation of polynomials (formerly in Library/Poly_Deriv) but not

1456 gcd/lcm on polynomials over fields. This has been moved to a separate

1457 theory Library/Polynomial_GCD_euclidean.thy, to pave way for a possible

1458 future different type class instantiation for polynomials over factorial

1459 rings. INCOMPATIBILITY.

1461 * Session HOL-Library: theory Sublist provides function "prefixes" with

1462 the following renaming

1464 prefixeq -> prefix

1465 prefix -> strict_prefix

1466 suffixeq -> suffix

1467 suffix -> strict_suffix

1469 Added theory of longest common prefixes.

1471 * Session HOL-Number_Theory: algebraic foundation for primes:

1472 Generalisation of predicate "prime" and introduction of predicates

1473 "prime_elem", "irreducible", a "prime_factorization" function, and the

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

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

1476 "prime_nat_iff". INCOMPATIBILITY.

1478 * Session Old_Number_Theory has been removed, after porting remaining

1479 theories.

1481 * Session HOL-Types_To_Sets provides an experimental extension of

1482 Higher-Order Logic to allow translation of types to sets.

1485 *** ML ***

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

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

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

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

1491 INCOMPATIBILITY.

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

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

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

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

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

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

1499 superseded by General.Div.

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

1502 the argument is a plain file. Minor INCOMPATIBILITY.

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

1505 with approximative output quality.

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

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

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

1511 This is particularly useful for conditional compilation, without

1512 requiring separate files.

1514 * Option ML_exception_debugger controls detailed exception trace via the

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

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

1517 debugger information requires consirable time and space: main

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

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

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

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

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

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

1525 balanced blocks of Local_Theory.open_target versus

1526 Local_Theory.close_target instead. Rare INCOMPATIBILITY.

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

1529 replaced by structure Timeout, with slightly different signature.

1530 INCOMPATIBILITY.

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

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

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

1535 File.full_path). Potential INCOMPATIBILITY.

1537 * Binding.empty_atts supersedes Thm.empty_binding and

1538 Attrib.empty_binding. Minor INCOMPATIBILITY.

1541 *** System ***

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

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

1546 much less disk space.

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

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

1550 particular:

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

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

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

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

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

1558 prover front-ends should use ML_Process or Isabelle_Process in

1559 Isabelle/Scala. INCOMPATIBILITY.

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

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

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

1564 return code 1.

1566 * The command-line tool "isabelle build" supports option -N for cyclic

1567 shuffling of NUMA CPU nodes. This may help performance tuning on Linux

1568 servers with separate CPU/memory modules.

1570 * System option "threads" (for the size of the Isabelle/ML thread farm)

1571 is also passed to the underlying ML runtime system as --gcthreads,

1572 unless there is already a default provided via ML_OPTIONS settings.

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

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

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

1577 by default).

1579 * System option "profiling" specifies the mode for global ML profiling

1580 in "isabelle build". Possible values are "time", "allocations". The

1581 command-line tool "isabelle profiling_report" helps to digest the

1582 resulting log files.

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

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

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

1587 implicit default via option -p.

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

1590 bootstrapping Isabelle/Pure interactively.

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

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

1594 Isabelle/ML or Isabelle/Scala.

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

1597 settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64,

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

1599 ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been

1600 discontinued. Potential INCOMPATIBILITY.

1602 * The Isabelle system environment always ensures that the main

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

1604 "isabelle_scala_script".

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

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

1608 Isabelle_Tool.Body.

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

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

1612 produce robust shell scripts under program control, without worrying

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

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

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

1616 been discontinued.

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

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

1620 but without the Isabelle settings environment.

1622 * Isabelle/Scala: the SSH module supports ssh and sftp connections, for

1623 remote command-execution and file-system access. This resembles

1624 operations from module File and Isabelle_System to some extent. Note

1625 that Path specifications need to be resolved remotely via

1626 ssh.remote_path instead of File.standard_path: the implicit process

1627 environment is different, Isabelle settings are not available remotely.

1629 * Isabelle/Scala: the Mercurial module supports repositories via the

1630 regular hg command-line interface. The repositroy clone and working

1631 directory may reside on a local or remote file-system (via ssh

1632 connection).

1636 New in Isabelle2016 (February 2016)

1637 -----------------------------------

1639 *** General ***

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

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

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

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

1645 examples that do require HOL.

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

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

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

1651 without any special print mode. Important ASCII replacement syntax

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

1653 has been removed (see below).

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

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

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

1659 context has been discontinued. Rare INCOMPATIBILITY, use explicit

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

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

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

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

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

1666 meaning.

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

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

1670 to update old sources.

1672 * Toplevel theorem statements have been simplified as follows:

1674 theorems ~> lemmas

1675 schematic_lemma ~> schematic_goal

1676 schematic_theorem ~> schematic_goal

1677 schematic_corollary ~> schematic_goal

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

1680 accordingly.

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

1683 'theorem'.

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

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

1687 deferred definitions require a surrounding 'overloading' block.

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

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

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

1694 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',

1695 'SML_file_no_debug' control compilation of sources with or without

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

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

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

1699 any effect on the running ML program.

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

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

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

1704 update.

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

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

1708 enable option "editor_output_state".

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

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

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

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

1714 visibility.

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

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

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

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

1720 panel.

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

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

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

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

1727 implicit: a popup will show up unconditionally.

1729 * Additional abbreviations for syntactic completion may be specified in

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

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

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

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

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

1736 suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.

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

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

1740 the editor.

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

1743 instead of former C+e LEFT.

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

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

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

1748 instead.

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

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

1752 single-instance applications seen on common GUI desktops.

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

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

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

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

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

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

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

1765 *** Document preparation ***

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

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

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

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

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

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

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

1776 follows:

1778 \<^item> itemize

1779 \<^enum> enumerate

1780 \<^descr> description

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

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

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

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

1786 standard Isabelle fonts provide glyphs to render important control

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

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

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

1791 standard LaTeX macros of the same names.

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

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

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

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

1797 cartouche tokens seen in theory sources.

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

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

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

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

1803 or terminal spaces are ignored.

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

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

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

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

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

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

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

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

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

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

1819 documentation, with a hyperlink in the Prover IDE.

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

1822 entities of the Isar language.

1824 * HTML presentation uses the standard IsabelleText font and Unicode

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

1826 print mode "HTML" loses its special meaning.

1829 *** Isar ***

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

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

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

1834 example:

1836 have result: "C x y"

1837 if "A x" and "B y"

1838 for x :: 'a and y :: 'a

1839 <proof>

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

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

1843 corresponds to a raw proof block like this:

1845 {

1846 fix x :: 'a and y :: 'a

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

1848 have "C x y" <proof>

1849 }

1850 note result = this

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

1853 instead of 'assume' above.

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

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

1858 assume result: "C x y"

1859 if "A x" and "B y"

1860 for x :: 'a and y :: 'a

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

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

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

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

1867 example:

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

1871 is equivalent to:

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

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

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

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

1878 follows:

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

1882 or:

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

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

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

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

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

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

1893 of the local context elements yet.

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

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

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

1899 then have something

1900 proof cases

1901 case a

1902 then show ?thesis <proof>

1903 next

1904 case b

1905 then show ?thesis <proof>

1906 next

1907 case c

1908 then show ?thesis <proof>

1909 qed

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

1913 case a: (c xs)

1914 case a [attributes]: (c xs)

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

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

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

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

1920 and always put attributes in front.

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

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

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

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

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

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

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

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

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

1933 supply [simp] = a

1934 proof

1935 show A by simp

1936 next

1937 show A by simp

1938 qed

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

1941 proof body as well, abstracted over relevant parameters.

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

1944 parameter scope for of each clause.

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

1947 statements: result is abstracted over unknowns.

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

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

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

1952 manual.

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

1955 ('apply' scripts).

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

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

1959 example:

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

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

1963 proof goal_cases

1964 case (1 x)

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

1966 next

1967 case (2 y z)

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

1969 qed

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

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

1973 proof goal_cases

1974 case prems: 1

1975 then show ?case using prems sorry

1976 next

1977 case prems: 2

1978 then show ?case using prems sorry

1979 qed

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

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

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

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

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

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

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

1990 occasionally useful for demonstration and testing purposes.

1993 *** Pure ***

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

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

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

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

2000 * Keyword 'rewrites' identifies rewrite morphisms in interpretation

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

2003 * More gentle suppression of syntax along locale morphisms while

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

2005 would be suppressed for morphisms except term identity. Now

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

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

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

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

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

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

2013 begin

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

2015 end

2017 locale morphism =

2018 left: struct composition + right: struct composition'

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

2020 begin

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

2022 end

2024 * Command 'global_interpretation' issues interpretations into global

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

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

2028 'defines'.

2030 * Command 'permanent_interpretation' has been discontinued. Use

2031 'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.

2033 * Command 'print_definitions' prints dependencies of definitional

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

2036 * Configuration option rule_insts_schematic has been discontinued

2037 (intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.

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

2040 INCOMPATIBILITY in situations where the previous misbehaviour has been

2041 exploited.

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

2044 operations behave more similar to abbreviations. Potential

2045 INCOMPATIBILITY in exotic situations.

2048 *** HOL ***

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

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

2052 global collection of overloaded constant / type definitions into

2053 account. Type definitions with open dependencies on overloaded

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

2055 provides extra robustness in theory construction. Rare INCOMPATIBILITY.

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

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

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

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

2061 Option.is_none_def. Occasional INCOMPATIBILITY in applications.

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

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

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

2066 simplify porting old theories:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

2095 INCOMPATIBILITY, use plain "::" instead.

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

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

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

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

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

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

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

2105 definition and its monotonicity result. Rare INCOMPATIBILITY.

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

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

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

2110 also subject to "inductive_internals". Rare INCOMPATIBILITY.

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

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

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

2115 INCOMPATIBILITY.

2117 * Combinator to represent case distinction on products is named

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

2119 theorem aliasses have been retained.

2121 Consolidated facts:

2122 PairE ~> prod.exhaust

2123 Pair_eq ~> prod.inject

2124 pair_collapse ~> prod.collapse

2125 Pair_fst_snd_eq ~> prod_eq_iff

2126 split_twice ~> prod.case_distrib

2127 split_weak_cong ~> prod.case_cong_weak

2128 split_split ~> prod.split

2129 split_split_asm ~> prod.split_asm

2130 splitI ~> case_prodI

2131 splitD ~> case_prodD

2132 splitI2 ~> case_prodI2

2133 splitI2' ~> case_prodI2'

2134 splitE ~> case_prodE

2135 splitE' ~> case_prodE'

2136 split_pair ~> case_prod_Pair

2137 split_eta ~> case_prod_eta

2138 split_comp ~> case_prod_comp

2139 mem_splitI ~> mem_case_prodI

2140 mem_splitI2 ~> mem_case_prodI2

2141 mem_splitE ~> mem_case_prodE

2142 The_split ~> The_case_prod

2143 cond_split_eta ~> cond_case_prod_eta

2144 Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE

2145 Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI

2146 in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq

2147 Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD

2148 Collect_split_Grp_inD ~> Collect_case_prod_Grp_in

2149 Domain_Collect_split ~> Domain_Collect_case_prod

2150 Image_Collect_split ~> Image_Collect_case_prod

2151 Range_Collect_split ~> Range_Collect_case_prod

2152 Eps_split ~> Eps_case_prod

2153 Eps_split_eq ~> Eps_case_prod_eq

2154 split_rsp ~> case_prod_rsp

2155 curry_split ~> curry_case_prod

2156 split_curry ~> case_prod_curry

2158 Changes in structure HOLogic:

2159 split_const ~> case_prod_const

2160 mk_split ~> mk_case_prod

2161 mk_psplits ~> mk_ptupleabs

2162 strip_psplits ~> strip_ptupleabs

2164 INCOMPATIBILITY.

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

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

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

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

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

2172 Consolidated facts (among others):

2173 real_of_nat_le_iff -> of_nat_le_iff

2174 real_of_nat_numeral of_nat_numeral

2175 real_of_int_zero of_int_0

2176 real_of_nat_zero of_nat_0

2177 real_of_one of_int_1

2178 real_of_int_add of_int_add

2179 real_of_nat_add of_nat_add

2180 real_of_int_diff of_int_diff

2181 real_of_nat_diff of_nat_diff

2182 floor_subtract floor_diff_of_int

2183 real_of_int_inject of_int_eq_iff

2184 real_of_int_gt_zero_cancel_iff of_int_0_less_iff

2185 real_of_int_ge_zero_cancel_iff of_int_0_le_iff

2186 real_of_nat_ge_zero of_nat_0_le_iff

2187 real_of_int_ceiling_ge le_of_int_ceiling

2188 ceiling_less_eq ceiling_less_iff

2189 ceiling_le_eq ceiling_le_iff

2190 less_floor_eq less_floor_iff

2191 floor_less_eq floor_less_iff

2192 floor_divide_eq_div floor_divide_of_int_eq

2193 real_of_int_zero_cancel of_nat_eq_0_iff

2194 ceiling_real_of_int ceiling_of_int

2196 INCOMPATIBILITY.

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

2199 been removed. INCOMPATIBILITY.

2201 * Quickcheck setup for finite sets.

2203 * Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.

2205 * Sledgehammer:

2206 - The MaSh relevance filter has been sped up.

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

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

2209 - Auto Sledgehammer now minimizes and preplays the results.

2210 - Handle Vampire 4.0 proof output without raising exception.

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

2212 Isabelle/jEdit instead. INCOMPATIBILITY.

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

2215 * Nitpick:

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

2217 - Fixed soundness bug in "destroy_constrs" optimization.

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

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

2220 - Eliminated obsolete "blocking" option.

2222 * (Co)datatype package:

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

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

2225 - Always generate "case_transfer" theorem.

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

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

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

2229 being defined.

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

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

2233 'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',

2234 'transfer_prover_start' and 'transfer_prover_end'.

2236 * New diagnostic command print_record for displaying record definitions.

2238 * Division on integers is bootstrapped directly from division on

2239 naturals and uses generic numeral algorithm for computations. Slight

2240 INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former

2241 simprocs binary_int_div and binary_int_mod

2243 * Tightened specification of class semiring_no_zero_divisors. Minor

2244 INCOMPATIBILITY.

2246 * Class algebraic_semidom introduces common algebraic notions of

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

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

2249 fields with notions that are trivial there.

2251 * Class normalization_semidom specifies canonical representants for

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

2253 This formalizes associated elements as well.

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

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

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

2258 gcd_nat.assoc and gcd_int.assoc by gcd.assoc.

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

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

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

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

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

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

2266 during instantiation.

2268 * New cancellation simprocs for boolean algebras to cancel complementary

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

2270 "top". INCOMPATIBILITY.

2272 * Class uniform_space introduces uniform spaces btw topological spaces

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

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

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

2277 open_real_def \<leadsto> open_dist

2278 open_complex_def \<leadsto> open_dist

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

2282 * Library/Multiset:

2283 - Renamed multiset inclusion operators:

2284 < ~> <#

2285 > ~> >#

2286 <= ~> <=#

2287 >= ~> >=#

2288 \<le> ~> \<le>#

2289 \<ge> ~> \<ge>#

2290 INCOMPATIBILITY.

2291 - Added multiset inclusion operator syntax:

2292 \<subset>#

2293 \<subseteq>#

2294 \<supset>#

2295 \<supseteq>#

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

2297 "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",

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

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

2300 are now available through the "subset_mset" interpretation

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

2302 INCOMPATIBILITY.

2303 - Renamed conversions:

2304 multiset_of ~> mset

2305 multiset_of_set ~> mset_set

2306 set_of ~> set_mset

2307 INCOMPATIBILITY

2308 - Renamed lemmas:

2309 mset_le_def ~> subseteq_mset_def

2310 mset_less_def ~> subset_mset_def

2311 less_eq_multiset.rep_eq ~> subseteq_mset_def

2312 INCOMPATIBILITY

2313 - Removed lemmas generated by lift_definition:

2314 less_eq_multiset.abs_eq, less_eq_multiset.rsp,

2315 less_eq_multiset.transfer, less_eq_multiset_def

2316 INCOMPATIBILITY

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

2320 * Library/Bourbaki_Witt_Fixpoint: Added formalisation of the

2321 Bourbaki-Witt fixpoint theorem for increasing functions in

2322 chain-complete partial orders.

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

2325 Minor INCOMPATIBILITY, use 'function' instead.

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

2328 periodic functions.

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

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

2332 GCD.

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

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

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

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

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

2341 (exponentiation on real numbers) again.

2343 * HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour

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

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

2346 Theorem of Algebra. Ported from HOL Light.

2348 * HOL-Multivariate_Analysis: topological concepts such as connected

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

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

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

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

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

2355 properties.

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

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

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

2361 structures.

2364 *** ML ***

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

2367 system are available:

2369 profile_time (*CPU time*)

2370 profile_time_thread (*CPU time on this thread*)

2371 profile_allocations (*overall heap allocations*)

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

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

2376 Isar proof method.

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

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

2380 breaks.

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

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

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

2386 * Simproc programming interfaces have been simplified:

2387 Simplifier.make_simproc and Simplifier.define_simproc supersede various

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

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

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

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

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

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

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

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

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

2401 Old cterm_instantiate is superseded by infer_instantiate.

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

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

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

2406 instead (with proper context).

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

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

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

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

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

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

2415 the proof context discipline.

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

2418 context_tactic, which allows to change the proof context dynamically

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

2420 METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are

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

2424 *** System ***

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

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

2429 conflations:

2431 hence ~> then have

2432 thus ~> then show

2434 This syntax is more orthogonal and improves readability and

2435 maintainability of proofs.

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

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

2439 performance.

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

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

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

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

2447 space.

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

2450 platforms as follows.

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

2453 associated with the main app bundle

2455 - isabelle jedit: settings

2456 JEDIT_JAVA_SYSTEM_OPTIONS

2457 JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64

2459 - isabelle build: settings

2460 ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64

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

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

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

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

2467 required after change.

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

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

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

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

2477 New in Isabelle2015 (May 2015)

2478 ------------------------------

2480 *** General ***

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

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

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

2486 context

2487 begin

2489 private definition ...

2490 private lemma ...

2492 qualified definition ...

2493 qualified lemma ...

2495 lemma ...

2496 theorem ...

2498 end

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

2501 naming policy.

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

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

2505 INCOMPATIBILITY, use 'sorry' instead.

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

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

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

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

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

2513 schematically expanded before search. Search results match the naive

2514 expectation more closely, particularly wrt. abbreviations.

2515 INCOMPATIBILITY.

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

2518 theory context.

2520 * Outer syntax commands are managed authentically within the theory

2521 context, without implicit global state. Potential for accidental

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

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

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

2526 update_semicolons" to remove obsolete semicolons from old theory

2527 sources.

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

2530 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.

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

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

2534 method provides basic fact/term matching in addition to

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

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

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

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

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

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

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

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

2547 option jedit_structure_limit determines maximum number of lines to scan

2548 in the buffer.

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

2551 marker, SideKick parser.

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

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

2555 the editor (hyperlinks, completion etc.).

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

2558 Options / Text Area).

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

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

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

2564 restrict the visualized hierarchy.

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

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

2570 *** Document preparation ***

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

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

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

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

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

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

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

2579 update_header"). Minor INCOMPATIBILITY.

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

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

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

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

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

2587 style.

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

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

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

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

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

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

2596 tags. Potential INCOMPATIBILITY in exotic situations.

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

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

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

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

2602 dynamically in GUI front-ends. Implementations of document

2603 antiquotations need to observe the margin explicitly according to

2604 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.

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

2607 mandatory for document preparation. The legacy mode with implicit

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

2609 INCOMPATIBILITY.

2612 *** Pure ***

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

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

2616 these variables become schematic in the instantiated theorem; this

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

2618 Configuration option rule_insts_schematic (default false) controls use

2619 of schematic variables outside the context. Minor INCOMPATIBILITY,

2620 declare rule_insts_schematic = true temporarily and update to use local

2621 variable declarations or dummy patterns instead.

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

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

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

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

2628 incremented to avoid material in the proof context. Rare

2629 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to

2630 different index.

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

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

2634 of numeral signs, particularly in expressions involving infix syntax

2635 like "(- 1) ^ n".

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

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

2639 token category instead.

2642 *** HOL ***

2644 * New (co)datatype package:

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

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

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

2648 'isabelle doc datatypes' for information on porting.

2649 INCOMPATIBILITY.

2650 - Renamed theorems:

2651 disc_corec ~> corec_disc

2652 disc_corec_iff ~> corec_disc_iff

2653 disc_exclude ~> distinct_disc

2654 disc_exhaust ~> exhaust_disc

2655 disc_map_iff ~> map_disc_iff

2656 sel_corec ~> corec_sel

2657 sel_exhaust ~> exhaust_sel

2658 sel_map ~> map_sel

2659 sel_set ~> set_sel

2660 sel_split ~> split_sel

2661 sel_split_asm ~> split_sel_asm

2662 strong_coinduct ~> coinduct_strong

2663 weak_case_cong ~> case_cong_weak

2664 INCOMPATIBILITY.

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

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

2667 INCOMPATIBILITY.

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

2669 consequences of other set rules "by auto".

2670 INCOMPATIBILITY.

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

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

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

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

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

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

2677 INCOMPATIBILITY.

2678 - Renamed theories:

2679 BNF_Comp ~> BNF_Composition

2680 BNF_FP_Base ~> BNF_Fixpoint_Base

2681 BNF_GFP ~> BNF_Greatest_Fixpoint

2682 BNF_LFP ~> BNF_Least_Fixpoint

2683 BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions

2684 Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions

2685 INCOMPATIBILITY.

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

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

2688 Lifting_Product and Lifting_Option from Main became obsolete and

2689 were removed. Changed definitions of the relators rel_prod and

2690 rel_sum (using inductive).

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

2692 of rel_prod_def and rel_sum_def.

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

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

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

2696 constructors, case combinators, discriminators, selectors and

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

2698 rules.

2700 * Old datatype package:

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

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

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

2704 'isabelle doc datatypes' for information on porting.

2705 INCOMPATIBILITY.

2706 - Renamed theorems:

2707 weak_case_cong ~> case_cong_weak

2708 INCOMPATIBILITY.

2709 - Renamed theory:

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

2711 INCOMPATIBILITY.

2713 * Nitpick:

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

2715 operations.

2717 * Sledgehammer:

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

2719 default.

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

2721 source. The "z3_non_commercial" option is discontinued.

2722 - Minimization is now always enabled by default.

2723 Removed sub-command:

2724 min

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

2726 dramatically improved.

2727 - Improved support for CVC4 and veriT.

2729 * Old and new SMT modules:

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

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

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

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

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

2735 point to it.

2736 INCOMPATIBILITY.

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

2738 INCOMPATIBILITY.

2739 - New option 'smt_reconstruction_step_timeout' to limit the

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

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

2742 method, especially runtime statistics of Z3 proof reconstruction.

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

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

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

2747 lifting, and avoids tedious workarounds.

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

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

2751 Minor INCOMPATIBILITY.

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

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

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

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

2758 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.

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

2761 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.

2763 * Class linordered_semidom really requires no zero divisors.

2764 INCOMPATIBILITY.

2766 * Classes division_ring, field and linordered_field always demand

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

2768 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.

2770 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit

2771 additive inverse operation. INCOMPATIBILITY.

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

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

2775 INCOMPATIBILITY: type constraints may be necessary.

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

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

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

2780 needed.

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

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

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

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

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

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

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

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

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

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

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

2795 "nat_floor"/"nat_ceiling".

2797 * Qualified some duplicated fact names required for boostrapping the

2798 type class hierarchy:

2799 ab_add_uminus_conv_diff ~> diff_conv_add_uminus

2800 field_inverse_zero ~> inverse_zero

2801 field_divide_inverse ~> divide_inverse

2802 field_inverse ~> left_inverse

2803 Minor INCOMPATIBILITY.

2805 * Eliminated fact duplicates:

2806 mult_less_imp_less_right ~> mult_right_less_imp_less

2807 mult_less_imp_less_left ~> mult_left_less_imp_less

2808 Minor INCOMPATIBILITY.

2810 * Fact consolidation: even_less_0_iff is subsumed by

2811 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).

2813 * Generalized and consolidated some theorems concerning divsibility:

2814 dvd_reduce ~> dvd_add_triv_right_iff

2815 dvd_plus_eq_right ~> dvd_add_right_iff

2816 dvd_plus_eq_left ~> dvd_add_left_iff

2817 Minor INCOMPATIBILITY.

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

2820 and part of theory Main.

2821 even_def ~> even_iff_mod_2_eq_zero

2822 INCOMPATIBILITY.

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

2825 INCOMPATIBILITY.

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

2828 Fact rename:

2829 listsum_def ~> listsum.eq_foldr

2830 INCOMPATIBILITY.

2832 * Product over lists via constant "listprod".

2834 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to

2835 Cons_nth_drop_Suc.

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

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

2839 HOL/Codegenerator_Test/Code_Test* for examples.

2841 * Library/Multiset:

2842 - Introduced "replicate_mset" operation.

2843 - Introduced alternative characterizations of the multiset ordering in

2844 "Library/Multiset_Order".

2845 - Renamed multiset ordering:

2846 <# ~> #<#

2847 <=# ~> #<=#

2848 \<subset># ~> #\<subset>#

2849 \<subseteq># ~> #\<subseteq>#

2850 INCOMPATIBILITY.

2851 - Introduced abbreviations for ill-named multiset operations:

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

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

2854 INCOMPATIBILITY.

2855 - Renamed

2856 in_multiset_of ~> in_multiset_in_set

2857 Multiset.fold ~> fold_mset

2858 Multiset.filter ~> filter_mset

2859 INCOMPATIBILITY.

2860 - Removed mcard, is equal to size.

2861 - Added attributes:

2862 image_mset.id [simp]

2863 image_mset_id [simp]

2864 elem_multiset_of_set [simp, intro]

2865 comp_fun_commute_plus_mset [simp]

2866 comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]

2867 in_mset_fold_plus_iff [iff]

2868 set_of_Union_mset [simp]

2869 in_Union_mset_iff [iff]

2870 INCOMPATIBILITY.

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

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

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

2875 argument. Minor INCOMPATIBILITY.

2877 * HOL-Decision_Procs: New counterexample generator quickcheck

2878 [approximation] for inequalities of transcendental functions. Uses

2879 hardware floating point arithmetic to randomly discover potential

2880 counterexamples. Counterexamples are certified with the "approximation"

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

2882 examples.

2884 * HOL-Probability: Reworked measurability prover

2885 - applies destructor rules repeatedly

2886 - removed application splitting (replaced by destructor rule)

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

2888 projection

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

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

2894 *** ML ***

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

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

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

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

2900 contemporary applications use the strict Name_Space.check (and

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

2902 INCOMPATIBILITY in rare applications of Name_Space.intern.

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

2905 ERROR instead of internal Toplevel.UNDEF.

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

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

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

2911 INCOMPATIBILITY.

2913 * Former combinators NAMED_CRITICAL and CRITICAL for central critical

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

2915 Multithreading.synchronized and its high-level derivative

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

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

2918 nested.

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

2921 change of semantics with minimal potential for INCOMPATIBILITY.

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

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

2925 available as Thm.global_ctyp_of and Thm.global_cterm_of.

2926 INCOMPATIBILITY.

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

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

2930 Thm.term_of etc.

2932 * Proper context for various elementary tactics: assume_tac,

2933 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,

2934 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.

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

2937 PARALLEL_GOALS.

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

2940 which also allows to specify a fork priority.

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

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

2944 markup). Minor INCOMPATIBILITY.

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

2947 Input.source (with formal position information).

2950 *** System ***

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

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

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

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

2958 be externally triggered using an appropriate ROOT file plus a

2959 corresponding theory. Parametrization is possible using environment

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

2961 INCOMPATIBILITY.

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

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

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

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

2968 menu Global Options / Appearance.

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

2971 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.

2975 New in Isabelle2014 (August 2014)

2976 ---------------------------------

2978 *** General ***

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

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

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

2983 environment is restricted to the Standard ML implementation of

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

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

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

2987 some examples.

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

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

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

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

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

2994 restore the previous behavior. INCOMPATIBILITY, especially where

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

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

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

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

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

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

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

3003 subgoal-addressing needs to be observed: no subgoals or a subgoal

3004 number that is out of range produces an empty result sequence, not an

3005 exception. Potential INCOMPATIBILITY for non-conformant tactical

3006 proof tools.

3008 * Lexical syntax (inner and outer) supports text cartouches with

3009 arbitrary nesting, and without escapes of quotes etc. The Prover IDE

3010 supports input via ` (backquote).

3012 * The outer syntax categories "text" (for formal comments and document

3013 markup commands) and "altstring" (for literal fact references) allow

3014 cartouches as well, in addition to the traditional mix of quotations.

3016 * Syntax of document antiquotation @{rail} now uses \<newline> instead

3017 of "\\", to avoid the optical illusion of escaped backslash within

3018 string token. General renovation of its syntax using text cartouches.

3019 Minor INCOMPATIBILITY.

3021 * Discontinued legacy_isub_isup, which was a temporary workaround for

3022 Isabelle/ML in Isabelle2013-1. The prover process no longer accepts

3023 old identifier syntax with \<^isub> or \<^isup>. Potential

3024 INCOMPATIBILITY.

3026 * Document antiquotation @{url} produces markup for the given URL,

3027 which results in an active hyperlink within the text.

3029 * Document antiquotation @{file_unchecked} is like @{file}, but does

3030 not check existence within the file-system.

3032 * Updated and extended manuals: codegen, datatypes, implementation,

3033 isar-ref, jedit, system.

3036 *** Prover IDE -- Isabelle/Scala/jEdit ***

3038 * Improved Document panel: simplified interaction where every single

3039 mouse click (re)opens document via desktop environment or as jEdit

3040 buffer.

3042 * Support for Navigator plugin (with toolbar buttons), with connection

3043 to PIDE hyperlinks.

3045 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.

3046 Open text buffers take precedence over copies within the file-system.

3048 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for

3049 auxiliary ML files.

3051 * Improved syntactic and semantic completion mechanism, with simple

3052 templates, completion language context, name-space completion,

3053 file-name completion, spell-checker completion.

3055 * Refined GUI popup for completion: more robust key/mouse event

3056 handling and propagation to enclosing text area -- avoid loosing

3057 keystrokes with slow / remote graphics displays.

3059 * Completion popup supports both ENTER and TAB (default) to select an

3060 item, depending on Isabelle options.

3062 * Refined insertion of completion items wrt. jEdit text: multiple

3063 selections, rectangular selections, rectangular selection as "tall

3064 caret".

3066 * Integrated spell-checker for document text, comments etc. with

3067 completion popup and context-menu.

3069 * More general "Query" panel supersedes "Find" panel, with GUI access

3070 to commands 'find_theorems' and 'find_consts', as well as print

3071 operations for the context. Minor incompatibility in keyboard

3072 shortcuts etc.: replace action isabelle-find by isabelle-query.

3074 * Search field for all output panels ("Output", "Query", "Info" etc.)

3075 to highlight text via regular expression.

3077 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /

3078 General") allows to specify additional print modes for the prover

3079 process, without requiring old-fashioned command-line invocation of

3080 "isabelle jedit -m MODE".

3082 * More support for remote files (e.g. http) using standard Java

3083 networking operations instead of jEdit virtual file-systems.

3085 * Empty editors buffers that are no longer required (e.g.\ via theory

3086 imports) are automatically removed from the document model.

3088 * Improved monitor panel.

3090 * Improved Console/Scala plugin: more uniform scala.Console output,

3091 more robust treatment of threads and interrupts.

3093 * Improved management of dockable windows: clarified keyboard focus

3094 and window placement wrt. main editor view; optional menu item to

3095 "Detach" a copy where this makes sense.

3097 * New Simplifier Trace panel provides an interactive view of the

3098 simplification process, enabled by the "simp_trace_new" attribute

3099 within the context.

3102 *** Pure ***

3104 * Low-level type-class commands 'classes', 'classrel', 'arities' have

3105 been discontinued to avoid the danger of non-trivial axiomatization

3106 that is not immediately visible. INCOMPATIBILITY, use regular

3107 'instance' command with proof. The required OFCLASS(...) theorem

3108 might be postulated via 'axiomatization' beforehand, or the proof

3109 finished trivially if the underlying class definition is made vacuous

3110 (without any assumptions). See also Isabelle/ML operations

3111 Axclass.class_axiomatization, Axclass.classrel_axiomatization,

3112 Axclass.arity_axiomatization.

3114 * Basic constants of Pure use more conventional names and are always

3115 qualified. Rare INCOMPATIBILITY, but with potentially serious

3116 consequences, notably for tools in Isabelle/ML. The following

3117 renaming needs to be applied:

3119 == ~> Pure.eq

3120 ==> ~> Pure.imp

3121 all ~> Pure.all

3122 TYPE ~> Pure.type

3123 dummy_pattern ~> Pure.dummy_pattern

3125 Systematic porting works by using the following theory setup on a

3126 *previous* Isabelle version to introduce the new name accesses for the

3127 old constants:

3129 setup {*

3130 fn thy => thy

3131 |> Sign.root_path

3132 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="

3133 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"

3134 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"

3135 |> Sign.restore_naming thy

3136 *}

3138 Thus ML antiquotations like @{const_name Pure.eq} may be used already.

3139 Later the application is moved to the current Isabelle version, and

3140 the auxiliary aliases are deleted.

3142 * Attributes "where" and "of" allow an optional context of local

3143 variables ('for' declaration): these variables become schematic in the

3144 instantiated theorem.

3146 * Obsolete attribute "standard" has been discontinued (legacy since

3147 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context

3148 where instantiations with schematic variables are intended (for

3149 declaration commands like 'lemmas' or attributes like "of"). The

3150 following temporary definition may help to port old applications:

3152 attribute_setup standard =

3153 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"

3155 * More thorough check of proof context for goal statements and

3156 attributed fact expressions (concerning background theory, declared

3157 hyps). Potential INCOMPATIBILITY, tools need to observe standard

3158 context discipline. See also Assumption.add_assumes and the more

3159 primitive Thm.assume_hyps.

3161 * Inner syntax token language allows regular quoted strings "..."

3162 (only makes sense in practice, if outer syntax is delimited

3163 differently, e.g. via cartouches).

3165 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,

3166 but the latter is retained some time as Proof General legacy.

3168 * Code generator preprocessor: explicit control of simp tracing on a

3169 per-constant basis. See attribute "code_preproc".

3172 *** HOL ***

3174 * Code generator: enforce case of identifiers only for strict target

3175 language requirements. INCOMPATIBILITY.

3177 * Code generator: explicit proof contexts in many ML interfaces.

3178 INCOMPATIBILITY.

3180 * Code generator: minimize exported identifiers by default. Minor

3181 INCOMPATIBILITY.

3183 * Code generation for SML and OCaml: dropped arcane "no_signatures"

3184 option. Minor INCOMPATIBILITY.

3186 * "declare [[code abort: ...]]" replaces "code_abort ...".

3187 INCOMPATIBILITY.

3189 * "declare [[code drop: ...]]" drops all code equations associated

3190 with the given constants.

3192 * Code generations are provided for make, fields, extend and truncate

3193 operations on records.

3195 * Command and antiquotation "value" are now hardcoded against nbe and

3196 ML. Minor INCOMPATIBILITY.

3198 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.

3200 * The symbol "\<newline>" may be used within char or string literals

3201 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.

3203 * Qualified String.implode and String.explode. INCOMPATIBILITY.

3205 * Simplifier: Enhanced solver of preconditions of rewrite rules can

3206 now deal with conjunctions. For help with converting proofs, the old

3207 behaviour of the simplifier can be restored like this: declare/using

3208 [[simp_legacy_precond]]. This configuration option will disappear

3209 again in the future. INCOMPATIBILITY.

3211 * Simproc "finite_Collect" is no longer enabled by default, due to

3212 spurious crashes and other surprises. Potential INCOMPATIBILITY.

3214 * Moved new (co)datatype package and its dependencies from session

3215 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',

3216 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now

3217 part of theory "Main".

3219 Theory renamings:

3220 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)

3221 Library/Wfrec.thy ~> Wfrec.thy

3222 Library/Zorn.thy ~> Zorn.thy

3223 Cardinals/Order_Relation.thy ~> Order_Relation.thy

3224 Library/Order_Union.thy ~> Cardinals/Order_Union.thy

3225 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy

3226 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy

3227 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy

3228 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy

3229 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy

3230 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy

3231 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy

3232 BNF/BNF_Comp.thy ~> BNF_Comp.thy

3233 BNF/BNF_Def.thy ~> BNF_Def.thy

3234 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy

3235 BNF/BNF_GFP.thy ~> BNF_GFP.thy

3236 BNF/BNF_LFP.thy ~> BNF_LFP.thy

3237 BNF/BNF_Util.thy ~> BNF_Util.thy

3238 BNF/Coinduction.thy ~> Coinduction.thy

3239 BNF/More_BNFs.thy ~> Library/More_BNFs.thy

3240 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy

3241 BNF/Examples/* ~> BNF_Examples/*

3243 New theories:

3244 Wellorder_Extension.thy (split from Zorn.thy)

3245 Library/Cardinal_Notations.thy

3246 Library/BNF_Axomatization.thy

3247 BNF_Examples/Misc_Primcorec.thy

3248 BNF_Examples/Stream_Processor.thy

3250 Discontinued theories:

3251 BNF/BNF.thy

3252 BNF/Equiv_Relations_More.thy

3254 INCOMPATIBILITY.

3256 * New (co)datatype package:

3257 - Command 'primcorec' is fully implemented.

3258 - Command 'datatype_new' generates size functions ("size_xxx" and

3259 "size") as required by 'fun'.

3260 - BNFs are integrated with the Lifting tool and new-style

3261 (co)datatypes with Transfer.

3262 - Renamed commands:

3263 datatype_new_compat ~> datatype_compat

3264 primrec_new ~> primrec

3265 wrap_free_constructors ~> free_constructors

3266 INCOMPATIBILITY.

3267 - The generated constants "xxx_case" and "xxx_rec" have been renamed

3268 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").

3269 INCOMPATIBILITY.

3270 - The constant "xxx_(un)fold" and related theorems are no longer

3271 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually

3272 using "prim(co)rec".

3273 INCOMPATIBILITY.

3274 - No discriminators are generated for nullary constructors by

3275 default, eliminating the need for the odd "=:" syntax.

3276 INCOMPATIBILITY.

3277 - No discriminators or selectors are generated by default by

3278 "datatype_new", unless custom names are specified or the new

3279 "discs_sels" option is passed.

3280 INCOMPATIBILITY.

3282 * Old datatype package:

3283 - The generated theorems "xxx.cases" and "xxx.recs" have been

3284 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->

3285 "sum.case"). INCOMPATIBILITY.

3286 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have

3287 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,

3288 "prod_case" ~> "case_prod"). INCOMPATIBILITY.

3290 * The types "'a list" and "'a option", their set and map functions,

3291 their relators, and their selectors are now produced using the new

3292 BNF-based datatype package.

3294 Renamed constants:

3295 Option.set ~> set_option

3296 Option.map ~> map_option

3297 option_rel ~> rel_option

3299 Renamed theorems:

3300 set_def ~> set_rec[abs_def]

3301 map_def ~> map_rec[abs_def]

3302 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")

3303 option.recs ~> option.rec

3304 list_all2_def ~> list_all2_iff

3305 set.simps ~> set_simps (or the slightly different "list.set")

3306 map.simps ~> list.map

3307 hd.simps ~> list.sel(1)

3308 tl.simps ~> list.sel(2-3)

3309 the.simps ~> option.sel

3311 INCOMPATIBILITY.

3313 * The following map functions and relators have been renamed:

3314 sum_map ~> map_sum

3315 map_pair ~> map_prod

3316 prod_rel ~> rel_prod

3317 sum_rel ~> rel_sum

3318 fun_rel ~> rel_fun

3319 set_rel ~> rel_set

3320 filter_rel ~> rel_filter

3321 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")

3322 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")

3323 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")

3325 INCOMPATIBILITY.

3327 * Lifting and Transfer:

3328 - a type variable as a raw type is supported

3329 - stronger reflexivity prover

3330 - rep_eq is always generated by lift_definition

3331 - setup for Lifting/Transfer is now automated for BNFs

3332 + holds for BNFs that do not contain a dead variable

3333 + relator_eq, relator_mono, relator_distr, relator_domain,

3334 relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,

3335 right_unique, right_total, left_unique, left_total are proved

3336 automatically

3337 + definition of a predicator is generated automatically

3338 + simplification rules for a predicator definition are proved

3339 automatically for datatypes

3340 - consolidation of the setup of Lifting/Transfer

3341 + property that a relator preservers reflexivity is not needed any

3342 more

3343 Minor INCOMPATIBILITY.

3344 + left_total and left_unique rules are now transfer rules

3345 (reflexivity_rule attribute not needed anymore)

3346 INCOMPATIBILITY.

3347 + Domainp does not have to be a separate assumption in

3348 relator_domain theorems (=> more natural statement)

3349 INCOMPATIBILITY.

3350 - registration of code equations is more robust

3351 Potential INCOMPATIBILITY.

3352 - respectfulness proof obligation is preprocessed to a more readable

3353 form

3354 Potential INCOMPATIBILITY.

3355 - eq_onp is always unfolded in respectfulness proof obligation

3356 Potential INCOMPATIBILITY.

3357 - unregister lifting setup for Code_Numeral.integer and

3358 Code_Numeral.natural

3359 Potential INCOMPATIBILITY.

3360 - Lifting.invariant -> eq_onp

3361 INCOMPATIBILITY.

3363 * New internal SAT solver "cdclite" that produces models and proof

3364 traces. This solver replaces the internal SAT solvers "enumerate" and

3365 "dpll". Applications that explicitly used one of these two SAT

3366 solvers should use "cdclite" instead. In addition, "cdclite" is now

3367 the default SAT solver for the "sat" and "satx" proof methods and

3368 corresponding tactics; the old default can be restored using "declare

3369 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.

3371 * SMT module: A new version of the SMT module, temporarily called

3372 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,

3373 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also

3374 supported as oracles. Yices is no longer supported, because no version

3375 of the solver can handle both SMT-LIB 2 and quantifiers.

3377 * Activation of Z3 now works via "z3_non_commercial" system option

3378 (without requiring restart), instead of former settings variable

3379 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu

3380 Plugin Options / Isabelle / General.

3382 * Sledgehammer:

3383 - Z3 can now produce Isar proofs.

3384 - MaSh overhaul:

3385 . New SML-based learning algorithms eliminate the dependency on

3386 Python and increase performance and reliability.

3387 . MaSh and MeSh are now used by default together with the

3388 traditional MePo (Meng-Paulson) relevance filter. To disable

3389 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin

3390 Options / Isabelle / General to "none".

3391 - New option:

3392 smt_proofs

3393 - Renamed options:

3394 isar_compress ~> compress

3395 isar_try0 ~> try0

3397 INCOMPATIBILITY.

3399 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.

3401 * Nitpick:

3402 - Fixed soundness bug whereby mutually recursive datatypes could

3403 take infinite values.

3404 - Fixed soundness bug with low-level number functions such as

3405 "Abs_Integ" and "Rep_Integ".

3406 - Removed "std" option.

3407 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to

3408 "hide_types".

3410 * Metis: Removed legacy proof method 'metisFT'. Use 'metis

3411 (full_types)' instead. INCOMPATIBILITY.

3413 * Try0: Added 'algebra' and 'meson' to the set of proof methods.

3415 * Adjustion of INF and SUP operations:

3416 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.

3417 - Consolidated theorem names containing INFI and SUPR: have INF and

3418 SUP instead uniformly.

3419 - More aggressive normalization of expressions involving INF and Inf

3420 or SUP and Sup.

3421 - INF_image and SUP_image do not unfold composition.

3422 - Dropped facts INF_comp, SUP_comp.

3423 - Default congruence rules strong_INF_cong and strong_SUP_cong, with

3424 simplifier implication in premises. Generalize and replace former

3425 INT_cong, SUP_cong

3427 INCOMPATIBILITY.

3429 * SUP and INF generalized to conditionally_complete_lattice.

3431 * Swapped orientation of facts image_comp and vimage_comp:

3433 image_compose ~> image_comp [symmetric]

3434 image_comp ~> image_comp [symmetric]

3435 vimage_compose ~> vimage_comp [symmetric]

3436 vimage_comp ~> vimage_comp [symmetric]

3438 INCOMPATIBILITY.

3440 * Theory reorganization: split of Big_Operators.thy into

3441 Groups_Big.thy and Lattices_Big.thy.

3443 * Consolidated some facts about big group operators:

3445 setsum_0' ~> setsum.neutral

3446 setsum_0 ~> setsum.neutral_const

3447 setsum_addf ~> setsum.distrib

3448 setsum_cartesian_product ~> setsum.cartesian_product

3449 setsum_cases ~> setsum.If_cases

3450 setsum_commute ~> setsum.commute

3451 setsum_cong ~> setsum.cong

3452 setsum_delta ~> setsum.delta

3453 setsum_delta' ~> setsum.delta'

3454 setsum_diff1' ~> setsum.remove

3455 setsum_empty ~> setsum.empty

3456 setsum_infinite ~> setsum.infinite

3457 setsum_insert ~> setsum.insert

3458 setsum_inter_restrict'' ~> setsum.inter_filter

3459 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left

3460 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right

3461 setsum_mono_zero_left ~> setsum.mono_neutral_left

3462 setsum_mono_zero_right ~> setsum.mono_neutral_right

3463 setsum_reindex ~> setsum.reindex

3464 setsum_reindex_cong ~> setsum.reindex_cong

3465 setsum_reindex_nonzero ~> setsum.reindex_nontrivial

3466 setsum_restrict_set ~> setsum.inter_restrict

3467 setsum_Plus ~> setsum.Plus

3468 setsum_setsum_restrict ~> setsum.commute_restrict

3469 setsum_Sigma ~> setsum.Sigma

3470 setsum_subset_diff ~> setsum.subset_diff

3471 setsum_Un_disjoint ~> setsum.union_disjoint

3472 setsum_UN_disjoint ~> setsum.UNION_disjoint

3473 setsum_Un_Int ~> setsum.union_inter

3474 setsum_Union_disjoint ~> setsum.Union_disjoint

3475 setsum_UNION_zero ~> setsum.Union_comp

3476 setsum_Un_zero ~> setsum.union_inter_neutral

3477 strong_setprod_cong ~> setprod.strong_cong

3478 strong_setsum_cong ~> setsum.strong_cong

3479 setprod_1' ~> setprod.neutral

3480 setprod_1 ~> setprod.neutral_const

3481 setprod_cartesian_product ~> setprod.cartesian_product

3482 setprod_cong ~> setprod.cong

3483 setprod_delta ~> setprod.delta

3484 setprod_delta' ~> setprod.delta'

3485 setprod_empty ~> setprod.empty

3486 setprod_infinite ~> setprod.infinite

3487 setprod_insert ~> setprod.insert

3488 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left

3489 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right

3490 setprod_mono_one_left ~> setprod.mono_neutral_left

3491 setprod_mono_one_right ~> setprod.mono_neutral_right

3492 setprod_reindex ~> setprod.reindex

3493 setprod_reindex_cong ~> setprod.reindex_cong

3494 setprod_reindex_nonzero ~> setprod.reindex_nontrivial

3495 setprod_Sigma ~> setprod.Sigma

3496 setprod_subset_diff ~> setprod.subset_diff

3497 setprod_timesf ~> setprod.distrib

3498 setprod_Un2 ~> setprod.union_diff2

3499 setprod_Un_disjoint ~> setprod.union_disjoint

3500 setprod_UN_disjoint ~> setprod.UNION_disjoint

3501 setprod_Un_Int ~> setprod.union_inter

3502 setprod_Union_disjoint ~> setprod.Union_disjoint

3503 setprod_Un_one ~> setprod.union_inter_neutral

3505 Dropped setsum_cong2 (simple variant of setsum.cong).

3506 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)

3507 Dropped setsum_reindex_id, setprod_reindex_id

3508 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).

3510 INCOMPATIBILITY.

3512 * Abolished slightly odd global lattice interpretation for min/max.

3514 Fact consolidations:

3515 min_max.inf_assoc ~> min.assoc

3516 min_max.inf_commute ~> min.commute

3517 min_max.inf_left_commute ~> min.left_commute

3518 min_max.inf_idem ~> min.idem

3519 min_max.inf_left_idem ~> min.left_idem

3520 min_max.inf_right_idem ~> min.right_idem

3521 min_max.sup_assoc ~> max.assoc

3522 min_max.sup_commute ~> max.commute

3523 min_max.sup_left_commute ~> max.left_commute

3524 min_max.sup_idem ~> max.idem

3525 min_max.sup_left_idem ~> max.left_idem

3526 min_max.sup_inf_distrib1 ~> max_min_distrib2

3527 min_max.sup_inf_distrib2 ~> max_min_distrib1

3528 min_max.inf_sup_distrib1 ~> min_max_distrib2

3529 min_max.inf_sup_distrib2 ~> min_max_distrib1

3530 min_max.distrib ~> min_max_distribs

3531 min_max.inf_absorb1 ~> min.absorb1

3532 min_max.inf_absorb2 ~> min.absorb2

3533 min_max.sup_absorb1 ~> max.absorb1

3534 min_max.sup_absorb2 ~> max.absorb2

3535 min_max.le_iff_inf ~> min.absorb_iff1

3536 min_max.le_iff_sup ~> max.absorb_iff2

3537 min_max.inf_le1 ~> min.cobounded1

3538 min_max.inf_le2 ~> min.cobounded2

3539 le_maxI1, min_max.sup_ge1 ~> max.cobounded1

3540 le_maxI2, min_max.sup_ge2 ~> max.cobounded2

3541 min_max.le_infI1 ~> min.coboundedI1

3542 min_max.le_infI2 ~> min.coboundedI2

3543 min_max.le_supI1 ~> max.coboundedI1

3544 min_max.le_supI2 ~> max.coboundedI2

3545 min_max.less_infI1 ~> min.strict_coboundedI1

3546 min_max.less_infI2 ~> min.strict_coboundedI2

3547 min_max.less_supI1 ~> max.strict_coboundedI1

3548 min_max.less_supI2 ~> max.strict_coboundedI2

3549 min_max.inf_mono ~> min.mono

3550 min_max.sup_mono ~> max.mono

3551 min_max.le_infI, min_max.inf_greatest ~> min.boundedI

3552 min_max.le_supI, min_max.sup_least ~> max.boundedI

3553 min_max.le_inf_iff ~> min.bounded_iff

3554 min_max.le_sup_iff ~> max.bounded_iff

3556 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,

3557 min.left_commute, min.left_idem, max.commute, max.assoc,

3558 max.left_commute, max.left_idem directly.

3560 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,

3561 min.cobounded2, max.cobounded1m max.cobounded2 directly.

3563 For min_ac or max_ac, prefer more general collection ac_simps.

3565 INCOMPATIBILITY.

3567 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>

3568 Inf_fin_le_Sup_fin. INCOMPATIBILITY.

3570 * Qualified constant names Wellfounded.acc, Wellfounded.accp.

3571 INCOMPATIBILITY.

3573 * Fact generalization and consolidation:

3574 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1

3576 INCOMPATIBILITY.

3578 * Purely algebraic definition of even. Fact generalization and

3579 consolidation:

3580 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd

3581 even_zero_(nat|int) ~> even_zero

3583 INCOMPATIBILITY.

3585 * Abolished neg_numeral.

3586 - Canonical representation for minus one is "- 1".

3587 - Canonical representation for other negative numbers is "- (numeral _)".

3588 - When devising rule sets for number calculation, consider the

3589 following canonical cases: 0, 1, numeral _, - 1, - numeral _.

3590 - HOLogic.dest_number also recognizes numerals in non-canonical forms

3591 like "numeral One", "- numeral One", "- 0" and even "- ... - _".

3592 - Syntax for negative numerals is mere input syntax.

3594 INCOMPATIBILITY.

3596 * Reduced name variants for rules on associativity and commutativity:

3598 add_assoc ~> add.assoc

3599 add_commute ~> add.commute

3600 add_left_commute ~> add.left_commute

3601 mult_assoc ~> mult.assoc

3602 mult_commute ~> mult.commute

3603 mult_left_commute ~> mult.left_commute

3604 nat_add_assoc ~> add.assoc

3605 nat_add_commute ~> add.commute

3606 nat_add_left_commute ~> add.left_commute

3607 nat_mult_assoc ~> mult.assoc

3608 nat_mult_commute ~> mult.commute

3609 eq_assoc ~> iff_assoc

3610 eq_left_commute ~> iff_left_commute

3612 INCOMPATIBILITY.

3614 * Fact collections add_ac and mult_ac are considered old-fashioned.

3615 Prefer ac_simps instead, or specify rules

3616 (add|mult).(assoc|commute|left_commute) individually.

3618 * Elimination of fact duplicates:

3619 equals_zero_I ~> minus_unique

3620 diff_eq_0_iff_eq ~> right_minus_eq

3621 nat_infinite ~> infinite_UNIV_nat

3622 int_infinite ~> infinite_UNIV_int

3624 INCOMPATIBILITY.

3626 * Fact name consolidation:

3627 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus

3628 minus_le_self_iff ~> neg_less_eq_nonneg

3629 le_minus_self_iff ~> less_eq_neg_nonpos

3630 neg_less_nonneg ~> neg_less_pos

3631 less_minus_self_iff ~> less_neg_neg [simp]

3633 INCOMPATIBILITY.

3635 * More simplification rules on unary and binary minus:

3636 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,

3637 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,

3638 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,

3639 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,

3640 minus_add_cancel, uminus_add_conv_diff. These correspondingly have

3641 been taken away from fact collections algebra_simps and field_simps.

3642 INCOMPATIBILITY.

3644 To restore proofs, the following patterns are helpful:

3646 a) Arbitrary failing proof not involving "diff_def":

3647 Consider simplification with algebra_simps or field_simps.

3649 b) Lifting rules from addition to subtraction:

3650 Try with "using <rule for addition> of [... "- _" ...]" by simp".

3652 c) Simplification with "diff_def": just drop "diff_def".

3653 Consider simplification with algebra_simps or field_simps;

3654 or the brute way with

3655 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".

3657 * Introduce bdd_above and bdd_below in theory

3658 Conditionally_Complete_Lattices, use them instead of explicitly

3659 stating boundedness of sets.

3661 * ccpo.admissible quantifies only over non-empty chains to allow more

3662 syntax-directed proof rules; the case of the empty chain shows up as

3663 additional case in fixpoint induction proofs. INCOMPATIBILITY.

3665 * Removed and renamed theorems in Series:

3666 summable_le ~> suminf_le

3667 suminf_le ~> suminf_le_const

3668 series_pos_le ~> setsum_le_suminf

3669 series_pos_less ~> setsum_less_suminf

3670 suminf_ge_zero ~> suminf_nonneg

3671 suminf_gt_zero ~> suminf_pos

3672 suminf_gt_zero_iff ~> suminf_pos_iff

3673 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ

3674 suminf_0_le ~> suminf_nonneg [rotate]

3675 pos_summable ~> summableI_nonneg_bounded

3676 ratio_test ~> summable_ratio_test

3678 removed series_zero, replaced by sums_finite

3680 removed auxiliary lemmas:

3682 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,

3683 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,

3684 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,

3685 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,

3686 summable_convergent_sumr_iff, sumr_diff_mult_const

3688 INCOMPATIBILITY.

3690 * Replace (F)DERIV syntax by has_derivative:

3691 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"

3693 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"

3695 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax

3697 - removed constant isDiff

3699 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as

3700 input syntax.

3702 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.

3704 - Renamed FDERIV_... lemmas to has_derivative_...

3706 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV

3708 - removed DERIV_intros, has_derivative_eq_intros

3710 - introduced derivative_intros and deriative_eq_intros which

3711 includes now rules for DERIV, has_derivative and

3712 has_vector_derivative.

3714 - Other renamings:

3715 differentiable_def ~> real_differentiable_def

3716 differentiableE ~> real_differentiableE

3717 fderiv_def ~> has_derivative_at

3718 field_fderiv_def ~> field_has_derivative_at

3719 isDiff_der ~> differentiable_def

3720 deriv_fderiv ~> has_field_derivative_def

3721 deriv_def ~> DERIV_def

3723 INCOMPATIBILITY.

3725 * Include more theorems in continuous_intros. Remove the

3726 continuous_on_intros, isCont_intros collections, these facts are now

3727 in continuous_intros.

3729 * Theorems about complex numbers are now stated only using Re and Im,

3730 the Complex constructor is not used anymore. It is possible to use

3731 primcorec to defined the behaviour of a complex-valued function.

3733 Removed theorems about the Complex constructor from the simpset, they

3734 are available as the lemma collection legacy_Complex_simps. This

3735 especially removes

3737 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".

3739 Instead the reverse direction is supported with

3740 Complex_eq: "Complex a b = a + \<i> * b"

3742 Moved csqrt from Fundamental_Algebra_Theorem to Complex.

3744 Renamings:

3745 Re/Im ~> complex.sel

3746 complex_Re/Im_zero ~> zero_complex.sel

3747 complex_Re/Im_add ~> plus_complex.sel

3748 complex_Re/Im_minus ~> uminus_complex.sel

3749 complex_Re/Im_diff ~> minus_complex.sel

3750 complex_Re/Im_one ~> one_complex.sel

3751 complex_Re/Im_mult ~> times_complex.sel

3752 complex_Re/Im_inverse ~> inverse_complex.sel

3753 complex_Re/Im_scaleR ~> scaleR_complex.sel

3754 complex_Re/Im_i ~> ii.sel

3755 complex_Re/Im_cnj ~> cnj.sel

3756 Re/Im_cis ~> cis.sel

3758 complex_divide_def ~> divide_complex_def

3759 complex_norm_def ~> norm_complex_def

3760 cmod_def ~> norm_complex_de

3762 Removed theorems:

3763 complex_zero_def

3764 complex_add_def

3765 complex_minus_def

3766 complex_diff_def

3767 complex_one_def

3768 complex_mult_def

3769 complex_inverse_def

3770 complex_scaleR_def

3772 INCOMPATIBILITY.

3774 * Theory Lubs moved HOL image to HOL-Library. It is replaced by

3775 Conditionally_Complete_Lattices. INCOMPATIBILITY.

3777 * HOL-Library: new theory src/HOL/Library/Tree.thy.

3779 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it

3780 is subsumed by session Kleene_Algebra in AFP.

3782 * HOL-Library / theory RBT: various constants and facts are hidden;

3783 lifting setup is unregistered. INCOMPATIBILITY.

3785 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.

3787 * HOL-Word: bit representations prefer type bool over type bit.

3788 INCOMPATIBILITY.

3790 * HOL-Word:

3791 - Abandoned fact collection "word_arith_alts", which is a duplicate

3792 of "word_arith_wis".

3793 - Dropped first (duplicated) element in fact collections

3794 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",

3795 "uint_word_arith_bintrs".

3797 * HOL-Number_Theory:

3798 - consolidated the proofs of the binomial theorem

3799 - the function fib is again of type nat => nat and not overloaded

3800 - no more references to Old_Number_Theory in the HOL libraries

3801 (except the AFP)

3803 INCOMPATIBILITY.

3805 * HOL-Multivariate_Analysis:

3806 - Type class ordered_real_vector for ordered vector spaces.

3807 - New theory Complex_Basic_Analysis defining complex derivatives,

3808 holomorphic functions, etc., ported from HOL Light's canal.ml.

3809 - Changed order of ordered_euclidean_space to be compatible with

3810 pointwise ordering on products. Therefore instance of

3811 conditionally_complete_lattice and ordered_real_vector.

3812 INCOMPATIBILITY: use box instead of greaterThanLessThan or

3813 explicit set-comprehensions with eucl_less for other (half-)open

3814 intervals.

3815 - removed dependencies on type class ordered_euclidean_space with

3816 introduction of "cbox" on euclidean_space

3817 - renamed theorems:

3818 interval ~> box

3819 mem_interval ~> mem_box

3820 interval_eq_empty ~> box_eq_empty

3821 interval_ne_empty ~> box_ne_empty

3822 interval_sing(1) ~> cbox_sing

3823 interval_sing(2) ~> box_sing

3824 subset_interval_imp ~> subset_box_imp

3825 subset_interval ~> subset_box

3826 open_interval ~> open_box

3827 closed_interval ~> closed_cbox

3828 interior_closed_interval ~> interior_cbox

3829 bounded_closed_interval ~> bounded_cbox

3830 compact_interval ~> compact_cbox

3831 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric

3832 bounded_subset_closed_interval ~> bounded_subset_cbox

3833 mem_interval_componentwiseI ~> mem_box_componentwiseI

3834 convex_box ~> convex_prod

3835 rel_interior_real_interval ~> rel_interior_real_box

3836 convex_interval ~> convex_box

3837 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox

3838 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox

3839 content_closed_interval' ~> content_cbox'

3840 elementary_subset_interval ~> elementary_subset_box

3841 diameter_closed_interval ~> diameter_cbox

3842 frontier_closed_interval ~> frontier_cbox

3843 frontier_open_interval ~> frontier_box

3844 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric

3845 closure_open_interval ~> closure_box

3846 open_closed_interval_convex ~> open_cbox_convex

3847 open_interval_midpoint ~> box_midpoint

3848 content_image_affinity_interval ~> content_image_affinity_cbox

3849 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval

3850 bounded_interval ~> bounded_closed_interval + bounded_boxes

3852 - respective theorems for intervals over the reals:

3853 content_closed_interval + content_cbox

3854 has_integral + has_integral_real

3855 fine_division_exists + fine_division_exists_real

3856 has_integral_null + has_integral_null_real

3857 tagged_division_union_interval + tagged_division_union_interval_real

3858 has_integral_const + has_integral_const_real

3859 integral_const + integral_const_real

3860 has_integral_bound + has_integral_bound_real

3861 integrable_continuous + integrable_continuous_real

3862 integrable_subinterval + integrable_subinterval_real

3863 has_integral_reflect_lemma + has_integral_reflect_lemma_real

3864 integrable_reflect + integrable_reflect_real

3865 integral_reflect + integral_reflect_real

3866 image_affinity_interval + image_affinity_cbox

3867 image_smult_interval + image_smult_cbox

3868 integrable_const + integrable_const_ivl

3869 integrable_on_subinterval + integrable_on_subcbox

3871 - renamed theorems:

3872 derivative_linear ~> has_derivative_bounded_linear

3873 derivative_is_linear ~> has_derivative_linear

3874 bounded_linear_imp_linear ~> bounded_linear.linear

3876 * HOL-Probability:

3877 - Renamed positive_integral to nn_integral:

3879 . Renamed all lemmas "*positive_integral*" to *nn_integral*"

3880 positive_integral_positive ~> nn_integral_nonneg

3882 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.

3884 - replaced the Lebesgue integral on real numbers by the more general

3885 Bochner integral for functions into a real-normed vector space.

3887 integral_zero ~> integral_zero / integrable_zero

3888 integral_minus ~> integral_minus / integrable_minus

3889 integral_add ~> integral_add / integrable_add

3890 integral_diff ~> integral_diff / integrable_diff

3891 integral_setsum ~> integral_setsum / integrable_setsum

3892 integral_multc ~> integral_mult_left / integrable_mult_left

3893 integral_cmult ~> integral_mult_right / integrable_mult_right

3894 integral_triangle_inequality~> integral_norm_bound

3895 integrable_nonneg ~> integrableI_nonneg

3896 integral_positive ~> integral_nonneg_AE

3897 integrable_abs_iff ~> integrable_abs_cancel

3898 positive_integral_lim_INF ~> nn_integral_liminf

3899 lebesgue_real_affine ~> lborel_real_affine

3900 borel_integral_has_integral ~> has_integral_lebesgue_integral

3901 integral_indicator ~>

3902 integral_real_indicator / integrable_real_indicator

3903 positive_integral_fst ~> nn_integral_fst'

3904 positive_integral_fst_measurable ~> nn_integral_fst

3905 positive_integral_snd_measurable ~> nn_integral_snd

3907 integrable_fst_measurable ~>

3908 integral_fst / integrable_fst / AE_integrable_fst

3910 integrable_snd_measurable ~>

3911 integral_snd / integrable_snd / AE_integrable_snd

3913 integral_monotone_convergence ~>

3914 integral_monotone_convergence / integrable_monotone_convergence

3916 integral_monotone_convergence_at_top ~>

3917 integral_monotone_convergence_at_top /

3918 integrable_monotone_convergence_at_top

3920 has_integral_iff_positive_integral_lebesgue ~>

3921 has_integral_iff_has_bochner_integral_lebesgue_nonneg

3923 lebesgue_integral_has_integral ~>

3924 has_integral_integrable_lebesgue_nonneg

3926 positive_integral_lebesgue_has_integral ~>

3927 integral_has_integral_lebesgue_nonneg /

3928 integrable_has_integral_lebesgue_nonneg

3930 lebesgue_integral_real_affine ~>

3931 nn_integral_real_affine

3933 has_integral_iff_positive_integral_lborel ~>

3934 integral_has_integral_nonneg / integrable_has_integral_nonneg

3936 The following theorems where removed:

3938 lebesgue_integral_nonneg

3939 lebesgue_integral_uminus

3940 lebesgue_integral_cmult

3941 lebesgue_integral_multc

3942 lebesgue_integral_cmult_nonneg

3943 integral_cmul_indicator

3944 integral_real

3946 - Formalized properties about exponentially, Erlang, and normal

3947 distributed random variables.

3949 * HOL-Decision_Procs: Separate command 'approximate' for approximative

3950 computation in src/HOL/Decision_Procs/Approximation. Minor

3951 INCOMPATIBILITY.

3954 *** Scala ***

3956 * The signature and semantics of Document.Snapshot.cumulate_markup /

3957 select_markup have been clarified. Markup is now traversed in the

3958 order of reports given by the prover: later markup is usually more

3959 specific and may override results accumulated so far. The elements

3960 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.

3962 * Substantial reworking of internal PIDE protocol communication

3963 channels. INCOMPATIBILITY.

3966 *** ML ***

3968 * Subtle change of semantics of Thm.eq_thm: theory stamps are not

3969 compared (according to Thm.thm_ord), but assumed to be covered by the

3970 current background theory. Thus equivalent data produced in different

3971 branches of the theory graph usually coincides (e.g. relevant for

3972 theory merge). Note that the softer Thm.eq_thm_prop is often more

3973 appropriate than Thm.eq_thm.

3975 * Proper context for basic Simplifier operations: rewrite_rule,

3976 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to

3977 pass runtime Proof.context (and ensure that the simplified entity

3978 actually belongs to it).

3980 * Proper context discipline for read_instantiate and instantiate_tac:

3981 variables that are meant to become schematic need to be given as

3982 fixed, and are generalized by the explicit context of local variables.

3983 This corresponds to Isar attributes "where" and "of" with 'for'

3984 declaration. INCOMPATIBILITY, also due to potential change of indices

3985 of schematic variables.

3987 * Moved ML_Compiler.exn_trace and other operations on exceptions to

3988 structure Runtime. Minor INCOMPATIBILITY.

3990 * Discontinued old Toplevel.debug in favour of system option

3991 "ML_exception_trace", which may be also declared within the context

3992 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.

3994 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor

3995 INCOMPATIBILITY.

3997 * Configuration option "ML_print_depth" controls the pretty-printing

3998 depth of the ML compiler within the context. The old print_depth in

3999 ML is still available as default_print_depth, but rarely used. Minor

4000 INCOMPATIBILITY.

4002 * Toplevel function "use" refers to raw ML bootstrap environment,

4003 without Isar context nor antiquotations. Potential INCOMPATIBILITY.

4004 Note that 'ML_file' is the canonical command to load ML files into the

4005 formal context.

4007 * Simplified programming interface to define ML antiquotations, see

4008 structure ML_Antiquotation. Minor INCOMPATIBILITY.

4010 * ML antiquotation @{here} refers to its source position, which is

4011 occasionally useful for experimentation and diagnostic purposes.

4013 * ML antiquotation @{path} produces a Path.T value, similarly to

4014 Path.explode, but with compile-time check against the file-system and

4015 some PIDE markup. Note that unlike theory source, ML does not have a

4016 well-defined master directory, so an absolute symbolic path

4017 specification is usually required, e.g. "~~/src/HOL".

4019 * ML antiquotation @{print} inlines a function to print an arbitrary

4020 ML value, which is occasionally useful for diagnostic or demonstration

4021 purposes.

4024 *** System ***

4026 * Proof General with its traditional helper scripts is now an optional

4027 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle

4028 component repository http://isabelle.in.tum.de/components/. Note that

4029 the "system" manual provides general explanations about add-on

4030 components, especially those that are not bundled with the release.

4032 * The raw Isabelle process executable has been renamed from

4033 "isabelle-process" to "isabelle_process", which conforms to common

4034 shell naming conventions, and allows to define a shell function within

4035 the Isabelle environment to avoid dynamic path lookup. Rare

4036 incompatibility for old tools that do not use the ISABELLE_PROCESS

4037 settings variable.

4039 * Former "isabelle tty" has been superseded by "isabelle console",

4040 with implicit build like "isabelle jedit", and without the mostly

4041 obsolete Isar TTY loop.

4043 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER

4044 and PDF_VIEWER now refer to the actual programs, not shell

4045 command-lines. Discontinued option -c: invocation may be asynchronous

4046 via desktop environment, without any special precautions. Potential

4047 INCOMPATIBILITY with ambitious private settings.

4049 * Removed obsolete "isabelle unsymbolize". Note that the usual format

4050 for email communication is the Unicode rendering of Isabelle symbols,

4051 as produced by Isabelle/jEdit, for example.

4053 * Removed obsolete tool "wwwfind". Similar functionality may be

4054 integrated into Isabelle/jEdit eventually.

4056 * Improved 'display_drafts' concerning desktop integration and

4057 repeated invocation in PIDE front-end: re-use single file

4058 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.

4060 * Session ROOT specifications require explicit 'document_files' for

4061 robust dependencies on LaTeX sources. Only these explicitly given

4062 files are copied to the document output directory, before document

4063 processing is started.

4065 * Windows: support for regular TeX installation (e.g. MiKTeX) instead

4066 of TeX Live from Cygwin.

4070 New in Isabelle2013-2 (December 2013)

4071 -------------------------------------

4073 *** Prover IDE -- Isabelle/Scala/jEdit ***

4075 * More robust editing of running commands with internal forks,

4076 e.g. non-terminating 'by' steps.

4078 * More relaxed Sledgehammer panel: avoid repeated application of query

4079 after edits surrounding the command location.

4081 * More status information about commands that are interrupted

4082 accidentally (via physical event or Poly/ML runtime system signal,

4083 e.g. out-of-memory).

4086 *** System ***

4088 * More robust termination of external processes managed by

4089 Isabelle/ML: support cancellation of tasks within the range of

4090 milliseconds, as required for PIDE document editing with automatically

4091 tried tools (e.g. Sledgehammer).

4093 * Reactivated Isabelle/Scala kill command for external processes on

4094 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a

4095 workaround for some Debian/Ubuntu Linux versions from 2013.

4099 New in Isabelle2013-1 (November 2013)

4100 -------------------------------------

4102 *** General ***

4104 * Discontinued obsolete 'uses' within theory header. Note that

4105 commands like 'ML_file' work without separate declaration of file

4106 dependencies. Minor INCOMPATIBILITY.

4108 * Discontinued redundant 'use' command, which was superseded by

4109 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.

4111 * Simplified subscripts within identifiers, using plain \<^sub>

4112 instead of the second copy \<^isub> and \<^isup>. Superscripts are

4113 only for literal tokens within notation; explicit mixfix annotations

4114 for consts or fixed variables may be used as fall-back for unusual

4115 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in

4116 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to

4117 standardize symbols as a starting point for further manual cleanup.

4118 The ML reference variable "legacy_isub_isup" may be set as temporary

4119 workaround, to make the prover accept a subset of the old identifier

4120 syntax.

4122 * Document antiquotations: term style "isub" has been renamed to

4123 "sub". Minor INCOMPATIBILITY.

4125 * Uniform management of "quick_and_dirty" as system option (see also

4126 "isabelle options"), configuration option within the context (see also

4127 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor

4128 INCOMPATIBILITY, need to use more official Isabelle means to access

4129 quick_and_dirty, instead of historical poking into mutable reference.

4131 * Renamed command 'print_configs' to 'print_options'. Minor

4132 INCOMPATIBILITY.

4134 * Proper diagnostic command 'print_state'. Old 'pr' (with its

4135 implicit change of some global references) is retained for now as

4136 control command, e.g. for ProofGeneral 3.7.x.

4138 * Discontinued 'print_drafts' command with its old-fashioned PS output

4139 and Unix command-line print spooling. Minor INCOMPATIBILITY: use

4140 'display_drafts' instead and print via the regular document viewer.

4142 * Updated and extended "isar-ref" and "implementation" manual,

4143 eliminated old "ref" manual.

4146 *** Prover IDE -- Isabelle/Scala/jEdit ***

4148 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or

4149 Documentation panel.

4151 * Dockable window "Documentation" provides access to Isabelle

4152 documentation.

4154 * Dockable window "Find" provides query operations for formal entities

4155 (GUI front-end to 'find_theorems' command).

4157 * Dockable window "Sledgehammer" manages asynchronous / parallel

4158 sledgehammer runs over existing document sources, independently of

4159 normal editing and checking process.

4161 * Dockable window "Timing" provides an overview of relevant command

4162 timing information, depending on option jedit_timing_threshold. The

4163 same timing information is shown in the extended tooltip of the

4164 command keyword, when hovering the mouse over it while the CONTROL or

4165 COMMAND modifier is pressed.

4167 * Improved dockable window "Theories": Continuous checking of proof

4168 document (visible and required parts) may be controlled explicitly,

4169 using check box or shortcut "C+e ENTER". Individual theory nodes may

4170 be marked explicitly as required and checked in full, using check box

4171 or shortcut "C+e SPACE".

4173 * Improved completion mechanism, which is now managed by the

4174 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle

4175 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).

4177 * Standard jEdit keyboard shortcut C+b complete-word is remapped to

4178 isabelle.complete for explicit completion in Isabelle sources.

4179 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts

4180 to resolve conflict.

4182 * Improved support of various "minor modes" for Isabelle NEWS,

4183 options, session ROOT etc., with completion and SideKick tree view.

4185 * Strictly monotonic document update, without premature cancellation of

4186 running transactions that are still needed: avoid reset/restart of

4187 such command executions while editing.

4189 * Support for asynchronous print functions, as overlay to existing

4190 document content.

4192 * Support for automatic tools in HOL, which try to prove or disprove

4193 toplevel theorem statements.

4195 * Action isabelle.reset-font-size resets main text area font size

4196 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see

4197 also "Plugin Options / Isabelle / General"). It can be bound to some

4198 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).

4200 * File specifications in jEdit (e.g. file browser) may refer to

4201 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued

4202 obsolete $ISABELLE_HOME_WINDOWS variable.

4204 * Improved support for Linux look-and-feel "GTK+", see also "Utilities

4205 / Global Options / Appearance".

4207 * Improved support of native Mac OS X functionality via "MacOSX"

4208 plugin, which is now enabled by default.

4211 *** Pure ***

4213 * Commands 'interpretation' and 'sublocale' are now target-sensitive.

4214 In particular, 'interpretation' allows for non-persistent

4215 interpretation within "context ... begin ... end" blocks offering a

4216 light-weight alternative to 'sublocale'. See "isar-ref" manual for

4217 details.

4219 * Improved locales diagnostic command 'print_dependencies'.

4221 * Discontinued obsolete 'axioms' command, which has been marked as

4222 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'

4223 instead, while observing its uniform scope for polymorphism.

4225 * Discontinued empty name bindings in 'axiomatization'.

4226 INCOMPATIBILITY.

4228 * System option "proofs" has been discontinued. Instead the global

4229 state of Proofterm.proofs is persistently compiled into logic images

4230 as required, notably HOL-Proofs. Users no longer need to change

4231 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.

4233 * Syntax translation functions (print_translation etc.) always depend

4234 on Proof.context. Discontinued former "(advanced)" option -- this is

4235 now the default. Minor INCOMPATIBILITY.

4237 * Former global reference trace_unify_fail is now available as

4238 configuration option "unify_trace_failure" (global context only).

4240 * SELECT_GOAL now retains the syntactic context of the overall goal

4241 state (schematic variables etc.). Potential INCOMPATIBILITY in rare

4242 situations.

4245 *** HOL ***

4247 * Stronger precedence of syntax for big intersection and union on

4248 sets, in accordance with corresponding lattice operations.

4249 INCOMPATIBILITY.

4251 * Notation "{p:A. P}" now allows tuple patterns as well.

4253 * Nested case expressions are now translated in a separate check phase

4254 rather than during parsing. The data for case combinators is separated

4255 from the datatype package. The declaration attribute

4256 "case_translation" can be used to register new case combinators:

4258 declare [[case_translation case_combinator constructor1 ... constructorN]]

4260 * Code generator:

4261 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /

4262 'code_instance'.

4263 - 'code_identifier' declares name hints for arbitrary identifiers in

4264 generated code, subsuming 'code_modulename'.

4266 See the isar-ref manual for syntax diagrams, and the HOL theories for

4267 examples.

4269 * Attibute 'code': 'code' now declares concrete and abstract code

4270 equations uniformly. Use explicit 'code equation' and 'code abstract'

4271 to distinguish both when desired.

4273 * Discontinued theories Code_Integer and Efficient_Nat by a more

4274 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,

4275 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code

4276 generation for details. INCOMPATIBILITY.

4278 * Numeric types are mapped by default to target language numerals:

4279 natural (replaces former code_numeral) and integer (replaces former

4280 code_int). Conversions are available as integer_of_natural /

4281 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and

4282 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in

4283 ML). INCOMPATIBILITY.

4285 * Function package: For mutually recursive functions f and g, separate

4286 cases rules f.cases and g.cases are generated instead of unusable

4287 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,

4288 in the case that the unusable rule was used nevertheless.

4290 * Function package: For each function f, new rules f.elims are

4291 generated, which eliminate equalities of the form "f x = t".

4293 * New command 'fun_cases' derives ad-hoc elimination rules for

4294 function equations as simplified instances of f.elims, analogous to

4295 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.

4297 * Lifting:

4298 - parametrized correspondence relations are now supported:

4299 + parametricity theorems for the raw term can be specified in

4300 the command lift_definition, which allow us to generate stronger

4301 transfer rules

4302 + setup_lifting generates stronger transfer rules if parametric

4303 correspondence relation can be generated

4304 + various new properties of the relator must be specified to support

4305 parametricity

4306 + parametricity theorem for the Quotient relation can be specified

4307 - setup_lifting generates domain rules for the Transfer package

4308 - stronger reflexivity prover of respectfulness theorems for type

4309 copies

4310 - ===> and --> are now local. The symbols can be introduced

4311 by interpreting the locale lifting_syntax (typically in an

4312 anonymous context)

4313 - Lifting/Transfer relevant parts of Library/Quotient_* are now in

4314 Main. Potential INCOMPATIBILITY

4315 - new commands for restoring and deleting Lifting/Transfer context:

4316 lifting_forget, lifting_update

4317 - the command print_quotmaps was renamed to print_quot_maps.

4318 INCOMPATIBILITY

4320 * Transfer:

4321 - better support for domains in Transfer: replace Domainp T

4322 by the actual invariant in a transferred goal

4323 - transfer rules can have as assumptions other transfer rules

4324 - Experimental support for transferring from the raw level to the

4325 abstract level: Transfer.transferred attribute

4326 - Attribute version of the transfer method: untransferred attribute

4328 * Reification and reflection:

4329 - Reification is now directly available in HOL-Main in structure

4330 "Reification".

4331 - Reflection now handles multiple lists with variables also.

4332 - The whole reflection stack has been decomposed into conversions.

4333 INCOMPATIBILITY.

4335 * Revised devices for recursive definitions over finite sets:

4336 - Only one fundamental fold combinator on finite set remains:

4337 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b

4338 This is now identity on infinite sets.

4339 - Locales ("mini packages") for fundamental definitions with

4340 Finite_Set.fold: folding, folding_idem.

4341 - Locales comm_monoid_set, semilattice_order_set and

4342 semilattice_neutr_order_set for big operators on sets.

4343 See theory Big_Operators for canonical examples.

4344 Note that foundational constants comm_monoid_set.F and

4345 semilattice_set.F correspond to former combinators fold_image

4346 and fold1 respectively. These are now gone. You may use

4347 those foundational constants as substitutes, but it is

4348 preferable to interpret the above locales accordingly.

4349 - Dropped class ab_semigroup_idem_mult (special case of lattice,

4350 no longer needed in connection with Finite_Set.fold etc.)

4351 - Fact renames:

4352 card.union_inter ~> card_Un_Int [symmetric]

4353 card.union_disjoint ~> card_Un_disjoint

4354 INCOMPATIBILITY.

4356 * Locale hierarchy for abstract orderings and (semi)lattices.

4358 * Complete_Partial_Order.admissible is defined outside the type class

4359 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the

4360 class predicate assumption or sort constraint when possible.

4361 INCOMPATIBILITY.

4363 * Introduce type class "conditionally_complete_lattice": Like a

4364 complete lattice but does not assume the existence of the top and

4365 bottom elements. Allows to generalize some lemmas about reals and

4366 extended reals. Removed SupInf and replaced it by the instantiation

4367 of conditionally_complete_lattice for real. Renamed lemmas about

4368 conditionally-complete lattice from Sup_... to cSup_... and from

4369 Inf_... to cInf_... to avoid hidding of similar complete lattice

4370 lemmas.

4372 * Introduce type class linear_continuum as combination of

4373 conditionally-complete lattices and inner dense linorders which have

4374 more than one element. INCOMPATIBILITY.

4376 * Introduced type classes order_top and order_bot. The old classes top

4377 and bot only contain the syntax without assumptions. INCOMPATIBILITY:

4378 Rename bot -> order_bot, top -> order_top

4380 * Introduce type classes "no_top" and "no_bot" for orderings without

4381 top and bottom elements.

4383 * Split dense_linorder into inner_dense_order and no_top, no_bot.

4385 * Complex_Main: Unify and move various concepts from

4386 HOL-Multivariate_Analysis to HOL-Complex_Main.

4388 - Introduce type class (lin)order_topology and

4389 linear_continuum_topology. Allows to generalize theorems about

4390 limits and order. Instances are reals and extended reals.

4392 - continuous and continuos_on from Multivariate_Analysis:

4393 "continuous" is the continuity of a function at a filter. "isCont"

4394 is now an abbrevitation: "isCont x f == continuous (at _) f".

4396 Generalized continuity lemmas from isCont to continuous on an

4397 arbitrary filter.

4399 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove

4400 compactness of closed intervals on reals. Continuous functions

4401 attain infimum and supremum on compact sets. The inverse of a

4402 continuous function is continuous, when the function is continuous

4403 on a compact set.

4405 - connected from Multivariate_Analysis. Use it to prove the

4406 intermediate value theorem. Show connectedness of intervals on

4407 linear_continuum_topology).

4409 - first_countable_topology from Multivariate_Analysis. Is used to

4410 show equivalence of properties on the neighbourhood filter of x and

4411 on all sequences converging to x.

4413 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved

4414 theorems from Library/FDERIV.thy to Deriv.thy and base the

4415 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV

4416 which are restricted to sets, i.e. to represent derivatives from

4417 left or right.

4419 - Removed the within-filter. It is replaced by the principal filter:

4421 F within X = inf F (principal X)

4423 - Introduce "at x within U" as a single constant, "at x" is now an

4424 abbreviation for "at x within UNIV"

4426 - Introduce named theorem collections tendsto_intros,

4427 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems

4428 in tendsto_intros (or FDERIV_intros) are also available as

4429 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side

4430 is replaced by a congruence rule. This allows to apply them as

4431 intro rules and then proving equivalence by the simplifier.

4433 - Restructured theories in HOL-Complex_Main:

4435 + Moved RealDef and RComplete into Real

4437 + Introduced Topological_Spaces and moved theorems about

4438 topological spaces, filters, limits and continuity to it

4440 + Renamed RealVector to Real_Vector_Spaces

4442 + Split Lim, SEQ, Series into Topological_Spaces,

4443 Real_Vector_Spaces, and Limits

4445 + Moved Ln and Log to Transcendental

4447 + Moved theorems about continuity from Deriv to Topological_Spaces

4449 - Remove various auxiliary lemmas.

4451 INCOMPATIBILITY.

4453 * Nitpick:

4454 - Added option "spy".

4455 - Reduce incidence of "too high arity" errors.

4457 * Sledgehammer:

4458 - Renamed option:

4459 isar_shrink ~> isar_compress

4460 INCOMPATIBILITY.

4461 - Added options "isar_try0", "spy".

4462 - Better support for "isar_proofs".

4463 - MaSh has been fined-tuned and now runs as a local server.

4465 * Improved support for ad hoc overloading of constants (see also

4466 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).

4468 * Library/Polynomial.thy:

4469 - Use lifting for primitive definitions.

4470 - Explicit conversions from and to lists of coefficients, used for

4471 generated code.

4472 - Replaced recursion operator poly_rec by fold_coeffs.

4473 - Prefer pre-existing gcd operation for gcd.

4474 - Fact renames:

4475 poly_eq_iff ~> poly_eq_poly_eq_iff

4476 poly_ext ~> poly_eqI

4477 expand_poly_eq ~> poly_eq_iff

4478 IMCOMPATIBILITY.

4480 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and

4481 case_of_simps to convert function definitions between a list of

4482 equations with patterns on the lhs and a single equation with case

4483 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.

4485 * New Library/FSet.thy: type of finite sets defined as a subtype of

4486 sets defined by Lifting/Transfer.

4488 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.

4490 * Consolidation of library theories on product orders:

4492 Product_Lattice ~> Product_Order -- pointwise order on products

4493 Product_ord ~> Product_Lexorder -- lexicographic order on products

4495 INCOMPATIBILITY.

4497 * Imperative-HOL: The MREC combinator is considered legacy and no

4498 longer included by default. INCOMPATIBILITY, use partial_function

4499 instead, or import theory Legacy_Mrec as a fallback.

4501 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and

4502 ~~/src/HOL/Algebra/poly. Existing theories should be based on

4503 ~~/src/HOL/Library/Polynomial instead. The latter provides

4504 integration with HOL's type classes for rings. INCOMPATIBILITY.

4506 * HOL-BNF:

4507 - Various improvements to BNF-based (co)datatype package, including

4508 new commands "primrec_new", "primcorec", and

4509 "datatype_new_compat", as well as documentation. See

4510 "datatypes.pdf" for details.

4511 - New "coinduction" method to avoid some boilerplate (compared to

4512 coinduct).

4513 - Renamed keywords:

4514 data ~> datatype_new

4515 codata ~> codatatype

4516 bnf_def ~> bnf

4517 - Renamed many generated theorems, including

4518 discs ~> disc

4519 map_comp' ~> map_comp

4520 map_id' ~> map_id

4521 sels ~> sel

4522 set_map' ~> set_map

4523 sets ~> set

4524 IMCOMPATIBILITY.

4527 *** ML ***

4529 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function

4530 "check_property" allows to check specifications of the form "ALL x y

4531 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its

4532 Examples.thy in particular.

4534 * Improved printing of exception trace in Poly/ML 5.5.1, with regular

4535 tracing output in the command transaction context instead of physical

4536 stdout. See also Toplevel.debug, Toplevel.debugging and

4537 ML_Compiler.exn_trace.

4539 * ML type "theory" is now immutable, without any special treatment of

4540 drafts or linear updates (which could lead to "stale theory" errors in

4541 the past). Discontinued obsolete operations like Theory.copy,

4542 Theory.checkpoint, and the auxiliary type theory_ref. Minor

4543 INCOMPATIBILITY.

4545 * More uniform naming of goal functions for skipped proofs:

4547 Skip_Proof.prove ~> Goal.prove_sorry

4548 Skip_Proof.prove_global ~> Goal.prove_sorry_global

4550 Minor INCOMPATIBILITY.

4552 * Simplifier tactics and tools use proper Proof.context instead of

4553 historic type simpset. Old-style declarations like addsimps,

4554 addsimprocs etc. operate directly on Proof.context. Raw type simpset

4555 retains its use as snapshot of the main Simplifier context, using

4556 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port

4557 old tools by making them depend on (ctxt : Proof.context) instead of

4558 (ss : simpset), then turn (simpset_of ctxt) into ctxt.

4560 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)

4561 operate on Proof.context instead of claset, for uniformity with addIs,

4562 addEs, addDs etc. Note that claset_of and put_claset allow to manage

4563 clasets separately from the context.

4565 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.

4566 INCOMPATIBILITY, use @{context} instead.

4568 * Antiquotation @{theory_context A} is similar to @{theory A}, but

4569 presents the result as initial Proof.context.

4572 *** System ***

4574 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by

4575 "isabelle build" in Isabelle2013. INCOMPATIBILITY.

4577 * Discontinued obsolete isabelle-process options -f and -u (former

4578 administrative aliases of option -e). Minor INCOMPATIBILITY.

4580 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND

4581 settings variable.

4583 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic

4584 document formats: dvi.gz, ps, ps.gz -- the default document format is

4585 always pdf.

4587 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to

4588 specify global resources of the JVM process run by isabelle build.

4590 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows

4591 to run Isabelle/Scala source files as standalone programs.

4593 * Improved "isabelle keywords" tool (for old-style ProofGeneral

4594 keyword tables): use Isabelle/Scala operations, which inspect outer

4595 syntax without requiring to build sessions first.

4597 * Sessions may be organized via 'chapter' specifications in the ROOT

4598 file, which determines a two-level hierarchy of browser info. The old

4599 tree-like organization via implicit sub-session relation (with its

4600 tendency towards erratic fluctuation of URLs) has been discontinued.

4601 The default chapter is called "Unsorted". Potential INCOMPATIBILITY

4602 for HTML presentation of theories.

4606 New in Isabelle2013 (February 2013)

4607 -----------------------------------

4609 *** General ***

4611 * Theorem status about oracles and unfinished/failed future proofs is

4612 no longer printed by default, since it is incompatible with

4613 incremental / parallel checking of the persistent document model. ML

4614 function Thm.peek_status may be used to inspect a snapshot of the

4615 ongoing evaluation process. Note that in batch mode --- notably

4616 isabelle build --- the system ensures that future proofs of all

4617 accessible theorems in the theory context are finished (as before).

4619 * Configuration option show_markup controls direct inlining of markup

4620 into the printed representation of formal entities --- notably type

4621 and sort constraints. This enables Prover IDE users to retrieve that

4622 information via tooltips in the output window, for example.

4624 * Command 'ML_file' evaluates ML text from a file directly within the

4625 theory, without any predeclaration via 'uses' in the theory header.

4627 * Old command 'use' command and corresponding keyword 'uses' in the

4628 theory header are legacy features and will be discontinued soon.

4629 Tools that load their additional source files may imitate the

4630 'ML_file' implementation, such that the system can take care of

4631 dependencies properly.

4633 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which

4634 is called fastforce / fast_force_tac already since Isabelle2011-1.

4636 * Updated and extended "isar-ref" and "implementation" manual, reduced

4637 remaining material in old "ref" manual.

4639 * Improved support for auxiliary contexts that indicate block structure

4640 for specifications. Nesting of "context fixes ... context assumes ..."

4641 and "class ... context ...".

4643 * Attribute "consumes" allows a negative value as well, which is

4644 interpreted relatively to the total number of premises of the rule in

4645 the target context. This form of declaration is stable when exported

4646 from a nested 'context' with additional assumptions. It is the

4647 preferred form for definitional packages, notably cases/rules produced

4648 in HOL/inductive and HOL/function.

4650 * More informative error messages for Isar proof commands involving

4651 lazy enumerations (method applications etc.).

4653 * Refined 'help' command to retrieve outer syntax commands according

4654 to name patterns (with clickable results).

4657 *** Prover IDE -- Isabelle/Scala/jEdit ***

4659 * Parallel terminal proofs ('by') are enabled by default, likewise

4660 proofs that are built into packages like 'datatype', 'function'. This

4661 allows to "run ahead" checking the theory specifications on the

4662 surface, while the prover is still crunching on internal

4663 justifications. Unfinished / cancelled proofs are restarted as

4664 required to complete full proof checking eventually.

4666 * Improved output panel with tooltips, hyperlinks etc. based on the

4667 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of

4668 tooltips leads to some window that supports the same recursively,

4669 which can lead to stacks of tooltips as the semantic document content

4670 is explored. ESCAPE closes the whole stack, individual windows may be

4671 closed separately, or detached to become independent jEdit dockables.

4673 * Improved support for commands that produce graph output: the text

4674 message contains a clickable area to open a new instance of the graph

4675 browser on demand.

4677 * More robust incremental parsing of outer syntax (partial comments,

4678 malformed symbols). Changing the balance of open/close quotes and

4679 comment delimiters works more conveniently with unfinished situations

4680 that frequently occur in user interaction.

4682 * More efficient painting and improved reactivity when editing large

4683 files. More scalable management of formal document content.

4685 * Smarter handling of tracing messages: prover process pauses after

4686 certain number of messages per command transaction, with some user

4687 dialog to stop or continue. This avoids swamping the front-end with

4688 potentially infinite message streams.

4690 * More plugin options and preferences, based on Isabelle/Scala. The

4691 jEdit plugin option panel provides access to some Isabelle/Scala

4692 options, including tuning parameters for editor reactivity and color

4693 schemes.

4695 * Dockable window "Symbols" provides some editing support for Isabelle

4696 symbols.

4698 * Dockable window "Monitor" shows ML runtime statistics. Note that

4699 continuous display of the chart slows down the system.

4701 * Improved editing support for control styles: subscript, superscript,

4702 bold, reset of style -- operating on single symbols or text

4703 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.

4705 * Actions isabelle.increase-font-size and isabelle.decrease-font-size

4706 adjust the main text area font size, and its derivatives for output,

4707 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often

4708 need to be adapted to local keyboard layouts.

4710 * More reactive completion popup by default: use \t (TAB) instead of

4711 \n (NEWLINE) to minimize intrusion into regular flow of editing. See

4712 also "Plugin Options / SideKick / General / Code Completion Options".

4714 * Implicit check and build dialog of the specified logic session

4715 image. For example, HOL, HOLCF, HOL-Nominal can be produced on

4716 demand, without bundling big platform-dependent heap images in the

4717 Isabelle distribution.

4719 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates

4720 from Oracle provide better multi-platform experience. This version is

4721 now bundled exclusively with Isabelle.

4724 *** Pure ***

4726 * Code generation for Haskell: restrict unqualified imports from

4727 Haskell Prelude to a small set of fundamental operations.

4729 * Command 'export_code': relative file names are interpreted

4730 relatively to master directory of current theory rather than the

4731 rather arbitrary current working directory. INCOMPATIBILITY.

4733 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,

4734 use regular rule composition via "OF" / "THEN", or explicit proof

4735 structure instead. Note that Isabelle/ML provides a variety of

4736 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied

4737 with some care where this is really required.

4739 * Command 'typ' supports an additional variant with explicit sort

4740 constraint, to infer and check the most general type conforming to a

4741 given sort. Example (in HOL):

4743 typ "_ * _ * bool * unit" :: finite

4745 * Command 'locale_deps' visualizes all locales and their relations as

4746 a Hasse diagram.

4749 *** HOL ***

4751 * Sledgehammer:

4753 - Added MaSh relevance filter based on machine-learning; see the

4754 Sledgehammer manual for details.

4755 - Polished Isar proofs generated with "isar_proofs" option.

4756 - Rationalized type encodings ("type_enc" option).

4757 - Renamed "kill_provers" subcommand to "kill_all".

4758 - Renamed options:

4759 isar_proof ~> isar_proofs

4760 isar_shrink_factor ~> isar_shrink

4761 max_relevant ~> max_facts

4762 relevance_thresholds ~> fact_thresholds

4764 * Quickcheck: added an optimisation for equality premises. It is

4765 switched on by default, and can be switched off by setting the

4766 configuration quickcheck_optimise_equality to false.

4768 * Quotient: only one quotient can be defined by quotient_type

4769 INCOMPATIBILITY.

4771 * Lifting:

4772 - generation of an abstraction function equation in lift_definition

4773 - quot_del attribute

4774 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)

4776 * Simproc "finite_Collect" rewrites set comprehensions into pointfree

4777 expressions.

4779 * Preprocessing of the code generator rewrites set comprehensions into

4780 pointfree expressions.

4782 * The SMT solver Z3 has now by default a restricted set of directly

4783 supported features. For the full set of features (div/mod, nonlinear

4784 arithmetic, datatypes/records) with potential proof reconstruction

4785 failures, enable the configuration option "z3_with_extensions". Minor

4786 INCOMPATIBILITY.

4788 * Simplified 'typedef' specifications: historical options for implicit

4789 set definition and alternative name have been discontinued. The

4790 former behavior of "typedef (open) t = A" is now the default, but

4791 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories

4792 accordingly.

4794 * Removed constant "chars"; prefer "Enum.enum" on type "char"

4795 directly. INCOMPATIBILITY.

4797 * Moved operation product, sublists and n_lists from theory Enum to

4798 List. INCOMPATIBILITY.

4800 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.

4802 * Class "comm_monoid_diff" formalises properties of bounded

4803 subtraction, with natural numbers and multisets as typical instances.

4805 * Added combinator "Option.these" with type "'a option set => 'a set".

4807 * Theory "Transitive_Closure": renamed lemmas

4809 reflcl_tranclp -> reflclp_tranclp

4810 rtranclp_reflcl -> rtranclp_reflclp

4812 INCOMPATIBILITY.

4814 * Theory "Rings": renamed lemmas (in class semiring)

4816 left_distrib ~> distrib_right

4817 right_distrib ~> distrib_left

4819 INCOMPATIBILITY.

4821 * Generalized the definition of limits:

4823 - Introduced the predicate filterlim (LIM x F. f x :> G) which

4824 expresses that when the input values x converge to F then the

4825 output f x converges to G.

4827 - Added filters for convergence to positive (at_top) and negative

4828 infinity (at_bot).

4830 - Moved infinity in the norm (at_infinity) from

4831 Multivariate_Analysis to Complex_Main.

4833 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>

4834 at_top".

4836 INCOMPATIBILITY.

4838 * Theory "Library/Option_ord" provides instantiation of option type to

4839 lattice type classes.

4841 * Theory "Library/Multiset": renamed

4843 constant fold_mset ~> Multiset.fold

4844 fact fold_mset_commute ~> fold_mset_comm

4846 INCOMPATIBILITY.

4848 * Renamed theory Library/List_Prefix to Library/Sublist, with related

4849 changes as follows.

4851 - Renamed constants (and related lemmas)

4853 prefix ~> prefixeq

4854 strict_prefix ~> prefix

4856 - Replaced constant "postfix" by "suffixeq" with swapped argument

4857 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped

4858 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.

4859 Renamed lemmas accordingly.

4861 - Added constant "list_hembeq" for homeomorphic embedding on

4862 lists. Added abbreviation "sublisteq" for special case

4863 "list_hembeq (op =)".

4865 - Theory Library/Sublist no longer provides "order" and "bot" type

4866 class instances for the prefix order (merely corresponding locale

4867 interpretations). The type class instances are now in theory

4868 Library/Prefix_Order.

4870 - The sublist relation of theory Library/Sublist_Order is now based

4871 on "Sublist.sublisteq". Renamed lemmas accordingly:

4873 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff

4874 le_list_append_mono ~> Sublist.list_hembeq_append_mono

4875 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2

4876 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD

4877 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'

4878 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq

4879 le_list_drop_Cons ~> Sublist.sublisteq_Cons'

4880 le_list_drop_many ~> Sublist.sublisteq_drop_many

4881 le_list_filter_left ~> Sublist.sublisteq_filter_left

4882 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many

4883 le_list_rev_take_iff ~> Sublist.sublisteq_append

4884 le_list_same_length ~> Sublist.sublisteq_same_length

4885 le_list_take_many_iff ~> Sublist.sublisteq_append'

4886 less_eq_list.drop ~> less_eq_list_drop

4887 less_eq_list.induct ~> less_eq_list_induct

4888 not_le_list_length ~> Sublist.not_sublisteq_length

4890 INCOMPATIBILITY.

4892 * New theory Library/Countable_Set.

4894 * Theory Library/Debug and Library/Parallel provide debugging and

4895 parallel execution for code generated towards Isabelle/ML.

4897 * Theory Library/FuncSet: Extended support for Pi and extensional and

4898 introduce the extensional dependent function space "PiE". Replaced

4899 extensional_funcset by an abbreviation, and renamed lemmas from

4900 extensional_funcset to PiE as follows:

4902 extensional_empty ~> PiE_empty

4903 extensional_funcset_empty_domain ~> PiE_empty_domain

4904 extensional_funcset_empty_range ~> PiE_empty_range

4905 extensional_funcset_arb ~> PiE_arb

4906 extensional_funcset_mem ~> PiE_mem

4907 extensional_funcset_extend_domainI ~> PiE_fun_upd

4908 extensional_funcset_restrict_domain ~> fun_upd_in_PiE

4909 extensional_funcset_extend_domain_eq ~> PiE_insert_eq

4910 card_extensional_funcset ~> card_PiE

4911 finite_extensional_funcset ~> finite_PiE

4913 INCOMPATIBILITY.

4915 * Theory Library/FinFun: theory of almost everywhere constant

4916 functions (supersedes the AFP entry "Code Generation for Functions as

4917 Data").

4919 * Theory Library/Phantom: generic phantom type to make a type

4920 parameter appear in a constant's type. This alternative to adding

4921 TYPE('a) as another parameter avoids unnecessary closures in generated

4922 code.

4924 * Theory Library/RBT_Impl: efficient construction of red-black trees

4925 from sorted associative lists. Merging two trees with rbt_union may

4926 return a structurally different tree than before. Potential

4927 INCOMPATIBILITY.

4929 * Theory Library/IArray: immutable arrays with code generation.

4931 * Theory Library/Finite_Lattice: theory of finite lattices.

4933 * HOL/Multivariate_Analysis: replaced

4935 "basis :: 'a::euclidean_space => nat => real"

4936 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"

4938 on euclidean spaces by using the inner product "_ \<bullet> _" with

4939 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by

4940 "SUM i : Basis. f i * r i".

4942 With this change the following constants are also changed or removed:

4944 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)

4945 a $$ i ~> inner a i (where i : Basis)

4946 cart_base i removed

4947 \<pi>, \<pi>' removed

4949 Theorems about these constants where removed.

4951 Renamed lemmas:

4953 component_le_norm ~> Basis_le_norm

4954 euclidean_eq ~> euclidean_eq_iff

4955 differential_zero_maxmin_component ~> differential_zero_maxmin_cart

4956 euclidean_simps ~> inner_simps

4957 independent_basis ~> independent_Basis

4958 span_basis ~> span_Basis

4959 in_span_basis ~> in_span_Basis

4960 norm_bound_component_le ~> norm_boound_Basis_le

4961 norm_bound_component_lt ~> norm_boound_Basis_lt

4962 component_le_infnorm ~> Basis_le_infnorm

4964 INCOMPATIBILITY.

4966 * HOL/Probability:

4968 - Added simproc "measurable" to automatically prove measurability.

4970 - Added induction rules for sigma sets with disjoint union

4971 (sigma_sets_induct_disjoint) and for Borel-measurable functions

4972 (borel_measurable_induct).

4974 - Added the Daniell-Kolmogorov theorem (the existence the limit of a

4975 projective family).

4977 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the

4978 AFP entry "Ordinals_and_Cardinals").

4980 * HOL/BNF: New (co)datatype package based on bounded natural functors

4981 with support for mixed, nested recursion and interesting non-free

4982 datatypes.

4984 * HOL/Finite_Set and Relation: added new set and relation operations

4985 expressed by Finite_Set.fold.

4987 * New theory HOL/Library/RBT_Set: implementation of sets by red-black

4988 trees for the code generator.

4990 * HOL/Library/RBT and HOL/Library/Mapping have been converted to

4991 Lifting/Transfer.

4992 possible INCOMPATIBILITY.

4994 * HOL/Set: renamed Set.project -> Set.filter

4995 INCOMPATIBILITY.

4998 *** Document preparation ***

5000 * Dropped legacy antiquotations "term_style" and "thm_style", since

5001 styles may be given as arguments to "term" and "thm" already.

5002 Discontinued legacy styles "prem1" .. "prem19".

5004 * Default LaTeX rendering for \<euro> is now based on eurosym package,

5005 instead of slightly exotic babel/greek.

5007 * Document variant NAME may use different LaTeX entry point

5008 document/root_NAME.tex if that file exists, instead of the common

5009 document/root.tex.

5011 * Simplified custom document/build script, instead of old-style

5012 document/IsaMakefile. Minor INCOMPATIBILITY.

5015 *** ML ***

5017 * The default limit for maximum number of worker threads is now 8,

5018 instead of 4, in correspondence to capabilities of contemporary

5019 hardware and Poly/ML runtime system.

5021 * Type Seq.results and related operations support embedded error

5022 messages within lazy enumerations, and thus allow to provide

5023 informative errors in the absence of any usable results.

5025 * Renamed Position.str_of to Position.here to emphasize that this is a

5026 formal device to inline positions into message text, but not

5027 necessarily printing visible text.

5030 *** System ***

5032 * Advanced support for Isabelle sessions and build management, see

5033 "system" manual for the chapter of that name, especially the "isabelle

5034 build" tool and its examples. The "isabelle mkroot" tool prepares

5035 session root directories for use with "isabelle build", similar to

5036 former "isabelle mkdir" for "isabelle usedir". Note that this affects

5037 document preparation as well. INCOMPATIBILITY, isabelle usedir /

5038 mkdir / make are rendered obsolete.

5040 * Discontinued obsolete Isabelle/build script, it is superseded by the

5041 regular isabelle build tool. For example:

5043 isabelle build -s -b HOL

5045 * Discontinued obsolete "isabelle makeall".

5047 * Discontinued obsolete IsaMakefile and ROOT.ML files from the

5048 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that

5049 provides some traditional targets that invoke "isabelle build". Note

5050 that this is inefficient! Applications of Isabelle/HOL involving

5051 "isabelle make" should be upgraded to use "isabelle build" directly.

5053 * The "isabelle options" tool prints Isabelle system options, as

5054 required for "isabelle build", for example.

5056 * The "isabelle logo" tool produces EPS and PDF format simultaneously.

5057 Minor INCOMPATIBILITY in command-line options.

5059 * The "isabelle install" tool has now a simpler command-line. Minor

5060 INCOMPATIBILITY.

5062 * The "isabelle components" tool helps to resolve add-on components

5063 that are not bundled, or referenced from a bare-bones repository

5064 version of Isabelle.

5066 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general

5067 platform family: "linux", "macos", "windows".

5069 * The ML system is configured as regular component, and no longer

5070 picked up from some surrounding directory. Potential INCOMPATIBILITY

5071 for home-made settings.

5073 * Improved ML runtime statistics (heap, threads, future tasks etc.).

5075 * Discontinued support for Poly/ML 5.2.1, which was the last version

5076 without exception positions and advanced ML compiler/toplevel

5077 configuration.

5079 * Discontinued special treatment of Proof General -- no longer guess

5080 PROOFGENERAL_HOME based on accidental file-system layout. Minor

5081 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS

5082 settings manually, or use a Proof General version that has been

5083 bundled as Isabelle component.

5087 New in Isabelle2012 (May 2012)

5088 ------------------------------

5090 *** General ***

5092 * Prover IDE (PIDE) improvements:

5094 - more robust Sledgehammer integration (as before the sledgehammer

5095 command-line needs to be typed into the source buffer)

5096 - markup for bound variables

5097 - markup for types of term variables (displayed as tooltips)

5098 - support for user-defined Isar commands within the running session

5099 - improved support for Unicode outside original 16bit range

5100 e.g. glyph for \<A> (thanks to jEdit 4.5.1)

5102 * Forward declaration of outer syntax keywords within the theory

5103 header -- minor INCOMPATIBILITY for user-defined commands. Allow new

5104 commands to be used in the same theory where defined.

5106 * Auxiliary contexts indicate block structure for specifications with

5107 additional parameters and assumptions. Such unnamed contexts may be

5108 nested within other targets, like 'theory', 'locale', 'class',

5109 'instantiation' etc. Results from the local context are generalized

5110 accordingly and applied to the enclosing target context. Example:

5112 context

5113 fixes x y z :: 'a

5114 assumes xy: "x = y" and yz: "y = z"

5115 begin

5117 lemma my_trans: "x = z" using xy yz by simp

5119 end

5121 thm my_trans

5123 The most basic application is to factor-out context elements of

5124 several fixes/assumes/shows theorem statements, e.g. see

5125 ~~/src/HOL/Isar_Examples/Group_Context.thy

5127 Any other local theory specification element works within the "context

5128 ... begin ... end" block as well.

5130 * Bundled declarations associate attributed fact expressions with a

5131 given name in the context. These may be later included in other

5132 contexts. This allows to manage context extensions casually, without

5133 the logical dependencies of locales and locale interpretation. See

5134 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.

5136 * Commands 'lemmas' and 'theorems' allow local variables using 'for'

5137 declaration, and results are standardized before being stored. Thus

5138 old-style "standard" after instantiation or composition of facts

5139 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of

5140 indices of schematic variables.

5142 * Rule attributes in local theory declarations (e.g. locale or class)

5143 are now statically evaluated: the resulting theorem is stored instead

5144 of the original expression. INCOMPATIBILITY in rare situations, where

5145 the historic accident of dynamic re-evaluation in interpretations

5146 etc. was exploited.

5148 * New tutorial "Programming and Proving in Isabelle/HOL"

5149 ("prog-prove"). It completely supersedes "A Tutorial Introduction to

5150 Structured Isar Proofs" ("isar-overview"), which has been removed. It

5151 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order

5152 Logic" as the recommended beginners tutorial, but does not cover all

5153 of the material of that old tutorial.

5155 * Updated and extended reference manuals: "isar-ref",

5156 "implementation", "system"; reduced remaining material in old "ref"

5157 manual.

5160 *** Pure ***

5162 * Command 'definition' no longer exports the foundational "raw_def"

5163 into the user context. Minor INCOMPATIBILITY, may use the regular

5164 "def" result with attribute "abs_def" to imitate the old version.

5166 * Attribute "abs_def" turns an equation of the form "f x y == t" into

5167 "f == %x y. t", which ensures that "simp" or "unfold" steps always

5168 expand it. This also works for object-logic equality. (Formerly

5169 undocumented feature.)

5171 * Sort constraints are now propagated in simultaneous statements, just

5172 like type constraints. INCOMPATIBILITY in rare situations, where

5173 distinct sorts used to be assigned accidentally. For example:

5175 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"

5177 lemma "P (x::'a)" and "Q (y::'a::bar)"

5178 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"

5180 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more

5181 tolerant against multiple unifiers, as long as the final result is

5182 unique. (As before, rules are composed in canonical right-to-left

5183 order to accommodate newly introduced premises.)

5185 * Renamed some inner syntax categories:

5187 num ~> num_token

5188 xnum ~> xnum_token

5189 xstr ~> str_token

5191 Minor INCOMPATIBILITY. Note that in practice "num_const" or

5192 "num_position" etc. are mainly used instead (which also include

5193 position information via constraints).

5195 * Simplified configuration options for syntax ambiguity: see

5196 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref

5197 manual. Minor INCOMPATIBILITY.

5199 * Discontinued configuration option "syntax_positions": atomic terms

5200 in parse trees are always annotated by position constraints.

5202 * Old code generator for SML and its commands 'code_module',

5203 'code_library', 'consts_code', 'types_code' have been discontinued.

5204 Use commands of the generic code generator instead. INCOMPATIBILITY.

5206 * Redundant attribute "code_inline" has been discontinued. Use

5207 "code_unfold" instead. INCOMPATIBILITY.

5209 * Dropped attribute "code_unfold_post" in favor of the its dual

5210 "code_abbrev", which yields a common pattern in definitions like

5212 definition [code_abbrev]: "f = t"

5214 INCOMPATIBILITY.

5216 * Obsolete 'types' command has been discontinued. Use 'type_synonym'

5217 instead. INCOMPATIBILITY.

5219 * Discontinued old "prems" fact, which used to refer to the accidental

5220 collection of foundational premises in the context (already marked as

5221 legacy since Isabelle2011).

5224 *** HOL ***

5226 * Type 'a set is now a proper type constructor (just as before

5227 Isabelle2008). Definitions mem_def and Collect_def have disappeared.

5228 Non-trivial INCOMPATIBILITY. For developments keeping predicates and

5229 sets separate, it is often sufficient to rephrase some set S that has

5230 been accidentally used as predicates by "%x. x : S", and some

5231 predicate P that has been accidentally used as set by "{x. P x}".

5232 Corresponding proofs in a first step should be pruned from any

5233 tinkering with former theorems mem_def and Collect_def as far as

5234 possible.

5236 For developments which deliberately mix predicates and sets, a

5237 planning step is necessary to determine what should become a predicate

5238 and what a set. It can be helpful to carry out that step in

5239 Isabelle2011-1 before jumping right into the current release.

5241 * Code generation by default implements sets as container type rather

5242 than predicates. INCOMPATIBILITY.

5244 * New type synonym 'a rel = ('a * 'a) set

5246 * The representation of numerals has changed. Datatype "num"

5247 represents strictly positive binary numerals, along with functions

5248 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent

5249 positive and negated numeric literals, respectively. See also

5250 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some

5251 user theories may require adaptations as follows:

5253 - Theorems with number_ring or number_semiring constraints: These

5254 classes are gone; use comm_ring_1 or comm_semiring_1 instead.

5256 - Theories defining numeric types: Remove number, number_semiring,

5257 and number_ring instances. Defer all theorems about numerals until

5258 after classes one and semigroup_add have been instantiated.

5260 - Numeral-only simp rules: Replace each rule having a "number_of v"

5261 pattern with two copies, one for numeral and one for neg_numeral.

5263 - Theorems about subclasses of semiring_1 or ring_1: These classes

5264 automatically support numerals now, so more simp rules and

5265 simprocs may now apply within the proof.

5267 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:

5268 Redefine using other integer operations.

5270 * Transfer: New package intended to generalize the existing

5271 "descending" method and related theorem attributes from the Quotient

5272 package. (Not all functionality is implemented yet, but future

5273 development will focus on Transfer as an eventual replacement for the

5274 corresponding parts of the Quotient package.)

5276 - transfer_rule attribute: Maintains a collection of transfer rules,

5277 which relate constants at two different types. Transfer rules may

5278 relate different type instances of the same polymorphic constant,

5279 or they may relate an operation on a raw type to a corresponding

5280 operation on an abstract type (quotient or subtype). For example:

5282 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map

5283 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int

5285 - transfer method: Replaces a subgoal on abstract types with an

5286 equivalent subgoal on the corresponding raw types. Constants are

5287 replaced with corresponding ones according to the transfer rules.

5288 Goals are generalized over all free variables by default; this is

5289 necessary for variables whose types change, but can be overridden

5290 for specific variables with e.g. "transfer fixing: x y z". The

5291 variant transfer' method allows replacing a subgoal with one that

5292 is logically stronger (rather than equivalent).

5294 - relator_eq attribute: Collects identity laws for relators of

5295 various type constructors, e.g. "list_all2 (op =) = (op =)". The

5296 transfer method uses these lemmas to infer transfer rules for

5297 non-polymorphic constants on the fly.

5299 - transfer_prover method: Assists with proving a transfer rule for a

5300 new constant, provided the constant is defined in terms of other

5301 constants that already have transfer rules. It should be applied

5302 after unfolding the constant definitions.

5304 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer

5305 from type nat to type int.

5307 * Lifting: New package intended to generalize the quotient_definition

5308 facility of the Quotient package; designed to work with Transfer.

5310 - lift_definition command: Defines operations on an abstract type in

5311 terms of a corresponding operation on a representation

5312 type. Example syntax:

5314 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"

5315 is List.insert

5317 Users must discharge a respectfulness proof obligation when each

5318 constant is defined. (For a type copy, i.e. a typedef with UNIV,

5319 the proof is discharged automatically.) The obligation is

5320 presented in a user-friendly, readable form; a respectfulness

5321 theorem in the standard format and a transfer rule are generated

5322 by the package.

5324 - Integration with code_abstype: For typedefs (e.g. subtypes

5325 corresponding to a datatype invariant, such as dlist),

5326 lift_definition generates a code certificate theorem and sets up

5327 code generation for each constant.

5329 - setup_lifting command: Sets up the Lifting package to work with a

5330 user-defined type. The user must provide either a quotient theorem

5331 or a type_definition theorem. The package configures transfer

5332 rules for equality and quantifiers on the type, and sets up the

5333 lift_definition command to work with the type.

5335 - Usage examples: See Quotient_Examples/Lift_DList.thy,

5336 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,

5337 Word/Word.thy and Library/Float.thy.

5339 * Quotient package:

5341 - The 'quotient_type' command now supports a 'morphisms' option with

5342 rep and abs functions, similar to typedef.

5344 - 'quotient_type' sets up new types to work with the Lifting and

5345 Transfer packages, as with 'setup_lifting'.

5347 - The 'quotient_definition' command now requires the user to prove a

5348 respectfulness property at the point where the constant is

5349 defined, similar to lift_definition; INCOMPATIBILITY.

5351 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems

5352 accordingly, INCOMPATIBILITY.

5354 * New diagnostic command 'find_unused_assms' to find potentially

5355 superfluous assumptions in theorems using Quickcheck.

5357 * Quickcheck:

5359 - Quickcheck returns variable assignments as counterexamples, which

5360 allows to reveal the underspecification of functions under test.

5361 For example, refuting "hd xs = x", it presents the variable

5362 assignment xs = [] and x = a1 as a counterexample, assuming that

5363 any property is false whenever "hd []" occurs in it.

5365 These counterexample are marked as potentially spurious, as

5366 Quickcheck also returns "xs = []" as a counterexample to the

5367 obvious theorem "hd xs = hd xs".

5369 After finding a potentially spurious counterexample, Quickcheck

5370 continues searching for genuine ones.

5372 By default, Quickcheck shows potentially spurious and genuine

5373 counterexamples. The option "genuine_only" sets quickcheck to only

5374 show genuine counterexamples.

5376 - The command 'quickcheck_generator' creates random and exhaustive

5377 value generators for a given type and operations.

5379 It generates values by using the operations as if they were

5380 constructors of that type.

5382 - Support for multisets.

5384 - Added "use_subtype" options.

5386 - Added "quickcheck_locale" configuration to specify how to process

5387 conjectures in a locale context.

5389 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option

5390 and affecting 'rat' and 'real'.

5392 * Sledgehammer:

5393 - Integrated more tightly with SPASS, as described in the ITP 2012

5394 paper "More SPASS with Isabelle".

5395 - Made it try "smt" as a fallback if "metis" fails or times out.

5396 - Added support for the following provers: Alt-Ergo (via Why3 and

5397 TFF1), iProver, iProver-Eq.

5398 - Sped up the minimizer.

5399 - Added "lam_trans", "uncurry_aliases", and "minimize" options.

5400 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").

5401 - Renamed "sound" option to "strict".

5403 * Metis: Added possibility to specify lambda translations scheme as a

5404 parenthesized argument (e.g., "by (metis (lifting) ...)").

5406 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".

5408 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.

5410 * New "case_product" attribute to generate a case rule doing multiple

5411 case distinctions at the same time. E.g.

5413 list.exhaust [case_product nat.exhaust]

5415 produces a rule which can be used to perform case distinction on both

5416 a list and a nat.

5418 * New "eventually_elim" method as a generalized variant of the

5419 eventually_elim* rules. Supports structured proofs.

5421 * Typedef with implicit set definition is considered legacy. Use

5422 "typedef (open)" form instead, which will eventually become the

5423 default.

5425 * Record: code generation can be switched off manually with

5427 declare [[record_coden = false]] -- "default true"

5429 * Datatype: type parameters allow explicit sort constraints.

5431 * Concrete syntax for case expressions includes constraints for source

5432 positions, and thus produces Prover IDE markup for its bindings.

5433 INCOMPATIBILITY for old-style syntax translations that augment the

5434 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of

5435 one_case.

5437 * Clarified attribute "mono_set": pure declaration without modifying

5438 the result of the fact expression.

5440 * More default pred/set conversions on a couple of relation operations

5441 and predicates. Added powers of predicate relations. Consolidation

5442 of some relation theorems:

5444 converse_def ~> converse_unfold

5445 rel_comp_def ~> relcomp_unfold

5446 symp_def ~> (modified, use symp_def and sym_def instead)

5447 transp_def ~> transp_trans

5448 Domain_def ~> Domain_unfold

5449 Range_def ~> Domain_converse [symmetric]

5451 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.

5453 See theory "Relation" for examples for making use of pred/set

5454 conversions by means of attributes "to_set" and "to_pred".

5456 INCOMPATIBILITY.

5458 * Renamed facts about the power operation on relations, i.e., relpow

5459 to match the constant's name:

5461 rel_pow_1 ~> relpow_1

5462 rel_pow_0_I ~> relpow_0_I

5463 rel_pow_Suc_I ~> relpow_Suc_I

5464 rel_pow_Suc_I2 ~> relpow_Suc_I2

5465 rel_pow_0_E ~> relpow_0_E

5466 rel_pow_Suc_E ~> relpow_Suc_E

5467 rel_pow_E ~> relpow_E

5468 rel_pow_Suc_D2 ~> relpow_Suc_D2

5469 rel_pow_Suc_E2 ~> relpow_Suc_E2

5470 rel_pow_Suc_D2' ~> relpow_Suc_D2'

5471 rel_pow_E2 ~> relpow_E2

5472 rel_pow_add ~> relpow_add

5473 rel_pow_commute ~> relpow

5474 rel_pow_empty ~> relpow_empty:

5475 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow

5476 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl

5477 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow

5478 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow

5479 rel_pow_fun_conv ~> relpow_fun_conv

5480 rel_pow_finite_bounded1 ~> relpow_finite_bounded1

5481 rel_pow_finite_bounded ~> relpow_finite_bounded

5482 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow

5483 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow

5484 single_valued_rel_pow ~> single_valued_relpow

5486 INCOMPATIBILITY.

5488 * Theory Relation: Consolidated constant name for relation composition

5489 and corresponding theorem names:

5491 - Renamed constant rel_comp to relcomp.

5493 - Dropped abbreviation pred_comp. Use relcompp instead.

5495 - Renamed theorems:

5497 rel_compI ~> relcompI

5498 rel_compEpair ~> relcompEpair

5499 rel_compE ~> relcompE

5500 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq

5501 rel_comp_empty1 ~> relcomp_empty1

5502 rel_comp_mono ~> relcomp_mono

5503 rel_comp_subset_Sigma ~> relcomp_subset_Sigma

5504 rel_comp_distrib ~> relcomp_distrib

5505 rel_comp_distrib2 ~> relcomp_distrib2

5506 rel_comp_UNION_distrib ~> relcomp_UNION_distrib

5507 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2

5508 single_valued_rel_comp ~> single_valued_relcomp

5509 rel_comp_def ~> relcomp_unfold

5510 converse_rel_comp ~> converse_relcomp

5511 pred_compI ~> relcomppI

5512 pred_compE ~> relcomppE

5513 pred_comp_bot1 ~> relcompp_bot1

5514 pred_comp_bot2 ~> relcompp_bot2

5515 transp_pred_comp_less_eq ~> transp_relcompp_less_eq

5516 pred_comp_mono ~> relcompp_mono

5517 pred_comp_distrib ~> relcompp_distrib

5518 pred_comp_distrib2 ~> relcompp_distrib2

5519 converse_pred_comp ~> converse_relcompp

5521 finite_rel_comp ~> finite_relcomp

5523 set_rel_comp ~> set_relcomp

5525 INCOMPATIBILITY.

5527 * Theory Divides: Discontinued redundant theorems about div and mod.

5528 INCOMPATIBILITY, use the corresponding generic theorems instead.

5530 DIVISION_BY_ZERO ~> div_by_0, mod_by_0

5531 zdiv_self ~> div_self

5532 zmod_self ~> mod_self

5533 zdiv_zero ~> div_0

5534 zmod_zero ~> mod_0

5535 zdiv_zmod_equality ~> div_mod_equality2

5536 zdiv_zmod_equality2 ~> div_mod_equality

5537 zmod_zdiv_trivial ~> mod_div_trivial

5538 zdiv_zminus_zminus ~> div_minus_minus

5539 zmod_zminus_zminus ~> mod_minus_minus

5540 zdiv_zminus2 ~> div_minus_right

5541 zmod_zminus2 ~> mod_minus_right

5542 zdiv_minus1_right ~> div_minus1_right

5543 zmod_minus1_right ~> mod_minus1_right

5544 zdvd_mult_div_cancel ~> dvd_mult_div_cancel

5545 zmod_zmult1_eq ~> mod_mult_right_eq

5546 zpower_zmod ~> power_mod

5547 zdvd_zmod ~> dvd_mod

5548 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd

5549 mod_mult_distrib ~> mult_mod_left

5550 mod_mult_distrib2 ~> mult_mod_right

5552 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use

5553 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.

5555 * Finite_Set.fold now qualified. INCOMPATIBILITY.

5557 * Consolidated theorem names concerning fold combinators:

5559 inf_INFI_fold_inf ~> inf_INF_fold_inf

5560 sup_SUPR_fold_sup ~> sup_SUP_fold_sup

5561 INFI_fold_inf ~> INF_fold_inf

5562 SUPR_fold_sup ~> SUP_fold_sup

5563 union_set ~> union_set_fold

5564 minus_set ~> minus_set_fold

5565 INFI_set_fold ~> INF_set_fold

5566 SUPR_set_fold ~> SUP_set_fold

5567 INF_code ~> INF_set_foldr

5568 SUP_code ~> SUP_set_foldr

5569 foldr.simps ~> foldr.simps (in point-free formulation)

5570 foldr_fold_rev ~> foldr_conv_fold

5571 foldl_fold ~> foldl_conv_fold

5572 foldr_foldr ~> foldr_conv_foldl

5573 foldl_foldr ~> foldl_conv_foldr

5574 fold_set_remdups ~> fold_set_fold_remdups

5575 fold_set ~> fold_set_fold

5576 fold1_set ~> fold1_set_fold

5578 INCOMPATIBILITY.

5580 * Dropped rarely useful theorems concerning fold combinators:

5581 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,

5582 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,

5583 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,

5584 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,

5585 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,

5586 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.

5587 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"

5588 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be

5589 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by

5590 unfolding "foldr_conv_fold" and "foldl_conv_fold".

5592 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,

5593 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,

5594 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,

5595 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding

5596 lemmas over fold rather than foldr, or make use of lemmas

5597 fold_conv_foldr and fold_rev.

5599 * Congruence rules Option.map_cong and Option.bind_cong for recursion

5600 through option types.

5602 * "Transitive_Closure.ntrancl": bounded transitive closure on

5603 relations.

5605 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.

5607 * Theory Int: Discontinued many legacy theorems specific to type int.

5608 INCOMPATIBILITY, use the corresponding generic theorems instead.

5610 zminus_zminus ~> minus_minus

5611 zminus_0 ~> minus_zero

5612 zminus_zadd_distrib ~> minus_add_distrib

5613 zadd_commute ~> add_commute

5614 zadd_assoc ~> add_assoc

5615 zadd_left_commute ~> add_left_commute

5616 zadd_ac ~> add_ac

5617 zmult_ac ~> mult_ac

5618 zadd_0 ~> add_0_left

5619 zadd_0_right ~> add_0_right

5620 zadd_zminus_inverse2 ~> left_minus

5621 zmult_zminus ~> mult_minus_left

5622 zmult_commute ~> mult_commute

5623 zmult_assoc ~> mult_assoc

5624 zadd_zmult_distrib ~> left_distrib

5625 zadd_zmult_distrib2 ~> right_distrib

5626 zdiff_zmult_distrib ~> left_diff_distrib

5627 zdiff_zmult_distrib2 ~> right_diff_distrib

5628 zmult_1 ~> mult_1_left

5629 zmult_1_right ~> mult_1_right

5630 zle_refl ~> order_refl

5631 zle_trans ~> order_trans

5632 zle_antisym ~> order_antisym

5633 zle_linear ~> linorder_linear

5634 zless_linear ~> linorder_less_linear

5635 zadd_left_mono ~> add_left_mono

5636 zadd_strict_right_mono ~> add_strict_right_mono

5637 zadd_zless_mono ~> add_less_le_mono

5638 int_0_less_1 ~> zero_less_one

5639 int_0_neq_1 ~> zero_neq_one

5640 zless_le ~> less_le

5641 zpower_zadd_distrib ~> power_add

5642 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff

5643 zero_le_zpower_abs ~> zero_le_power_abs

5645 * Theory Deriv: Renamed

5647 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing

5649 * Theory Library/Multiset: Improved code generation of multisets.

5651 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets

5652 are expressed via type classes again. The special syntax

5653 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant

5654 setsum_set, which is now subsumed by Big_Operators.setsum.

5655 INCOMPATIBILITY.

5657 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,

5658 use theory HOL/Library/Nat_Bijection instead.

5660 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black

5661 trees is now inside a type class context. Names of affected

5662 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for

5663 theories working directly with raw red-black trees, adapt the names as

5664 follows:

5666 Operations:

5667 bulkload -> rbt_bulkload

5668 del_from_left -> rbt_del_from_left

5669 del_from_right -> rbt_del_from_right

5670 del -> rbt_del

5671 delete -> rbt_delete

5672 ins -> rbt_ins

5673 insert -> rbt_insert

5674 insertw -> rbt_insert_with

5675 insert_with_key -> rbt_insert_with_key

5676 map_entry -> rbt_map_entry

5677 lookup -> rbt_lookup

5678 sorted -> rbt_sorted

5679 tree_greater -> rbt_greater

5680 tree_less -> rbt_less

5681 tree_less_symbol -> rbt_less_symbol

5682 union -> rbt_union

5683 union_with -> rbt_union_with

5684 union_with_key -> rbt_union_with_key

5686 Lemmas:

5687 balance_left_sorted -> balance_left_rbt_sorted

5688 balance_left_tree_greater -> balance_left_rbt_greater

5689 balance_left_tree_less -> balance_left_rbt_less

5690 balance_right_sorted -> balance_right_rbt_sorted

5691 balance_right_tree_greater -> balance_right_rbt_greater

5692 balance_right_tree_less -> balance_right_rbt_less

5693 balance_sorted -> balance_rbt_sorted

5694 balance_tree_greater -> balance_rbt_greater

5695 balance_tree_less -> balance_rbt_less

5696 bulkload_is_rbt -> rbt_bulkload_is_rbt

5697 combine_sorted -> combine_rbt_sorted

5698 combine_tree_greater -> combine_rbt_greater

5699 combine_tree_less -> combine_rbt_less

5700 delete_in_tree -> rbt_delete_in_tree

5701 delete_is_rbt -> rbt_delete_is_rbt

5702 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater

5703 del_from_left_tree_less -> rbt_del_from_left_rbt_less

5704 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater

5705 del_from_right_tree_less -> rbt_del_from_right_rbt_less

5706 del_in_tree -> rbt_del_in_tree

5707 del_inv1_inv2 -> rbt_del_inv1_inv2

5708 del_sorted -> rbt_del_rbt_sorted

5709 del_tree_greater -> rbt_del_rbt_greater

5710 del_tree_less -> rbt_del_rbt_less

5711 dom_lookup_Branch -> dom_rbt_lookup_Branch

5712 entries_lookup -> entries_rbt_lookup

5713 finite_dom_lookup -> finite_dom_rbt_lookup

5714 insert_sorted -> rbt_insert_rbt_sorted

5715 insertw_is_rbt -> rbt_insertw_is_rbt

5716 insertwk_is_rbt -> rbt_insertwk_is_rbt

5717 insertwk_sorted -> rbt_insertwk_rbt_sorted

5718 insertw_sorted -> rbt_insertw_rbt_sorted

5719 ins_sorted -> ins_rbt_sorted

5720 ins_tree_greater -> ins_rbt_greater

5721 ins_tree_less -> ins_rbt_less

5722 is_rbt_sorted -> is_rbt_rbt_sorted

5723 lookup_balance -> rbt_lookup_balance

5724 lookup_bulkload -> rbt_lookup_rbt_bulkload

5725 lookup_delete -> rbt_lookup_rbt_delete

5726 lookup_Empty -> rbt_lookup_Empty

5727 lookup_from_in_tree -> rbt_lookup_from_in_tree

5728 lookup_in_tree -> rbt_lookup_in_tree

5729 lookup_ins -> rbt_lookup_ins

5730 lookup_insert -> rbt_lookup_rbt_insert

5731 lookup_insertw -> rbt_lookup_rbt_insertw

5732 lookup_insertwk -> rbt_lookup_rbt_insertwk

5733 lookup_keys -> rbt_lookup_keys

5734 lookup_map -> rbt_lookup_map

5735 lookup_map_entry -> rbt_lookup_rbt_map_entry

5736 lookup_tree_greater -> rbt_lookup_rbt_greater

5737 lookup_tree_less -> rbt_lookup_rbt_less

5738 lookup_union -> rbt_lookup_rbt_union

5739 map_entry_color_of -> rbt_map_entry_color_of

5740 map_entry_inv1 -> rbt_map_entry_inv1

5741 map_entry_inv2 -> rbt_map_entry_inv2

5742 map_entry_is_rbt -> rbt_map_entry_is_rbt

5743 map_entry_sorted -> rbt_map_entry_rbt_sorted

5744 map_entry_tree_greater -> rbt_map_entry_rbt_greater

5745 map_entry_tree_less -> rbt_map_entry_rbt_less

5746 map_tree_greater -> map_rbt_greater

5747 map_tree_less -> map_rbt_less

5748 map_sorted -> map_rbt_sorted

5749 paint_sorted -> paint_rbt_sorted

5750 paint_lookup -> paint_rbt_lookup

5751 paint_tree_greater -> paint_rbt_greater

5752 paint_tree_less -> paint_rbt_less

5753 sorted_entries -> rbt_sorted_entries

5754 tree_greater_eq_trans -> rbt_greater_eq_trans

5755 tree_greater_nit -> rbt_greater_nit

5756 tree_greater_prop -> rbt_greater_prop

5757 tree_greater_simps -> rbt_greater_simps

5758 tree_greater_trans -> rbt_greater_trans

5759 tree_less_eq_trans -> rbt_less_eq_trans

5760 tree_less_nit -> rbt_less_nit

5761 tree_less_prop -> rbt_less_prop

5762 tree_less_simps -> rbt_less_simps

5763 tree_less_trans -> rbt_less_trans

5764 tree_ord_props -> rbt_ord_props

5765 union_Branch -> rbt_union_Branch

5766 union_is_rbt -> rbt_union_is_rbt

5767 unionw_is_rbt -> rbt_unionw_is_rbt

5768 unionwk_is_rbt -> rbt_unionwk_is_rbt

5769 unionwk_sorted -> rbt_unionwk_rbt_sorted

5771 * Theory HOL/Library/Float: Floating point numbers are now defined as

5772 a subset of the real numbers. All operations are defined using the

5773 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.

5775 Changed Operations:

5776 float_abs -> abs

5777 float_nprt -> nprt

5778 float_pprt -> pprt

5779 pow2 -> use powr

5780 round_down -> float_round_down

5781 round_up -> float_round_up

5782 scale -> exponent

5784 Removed Operations:

5785 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod

5787 Renamed Lemmas:

5788 abs_float_def -> Float.compute_float_abs

5789 bitlen_ge0 -> bitlen_nonneg

5790 bitlen.simps -> Float.compute_bitlen

5791 float_components -> Float_mantissa_exponent

5792 float_divl.simps -> Float.compute_float_divl

5793 float_divr.simps -> Float.compute_float_divr

5794 float_eq_odd -> mult_powr_eq_mult_powr_iff

5795 float_power -> real_of_float_power

5796 lapprox_posrat_def -> Float.compute_lapprox_posrat

5797 lapprox_rat.simps -> Float.compute_lapprox_rat

5798 le_float_def' -> Float.compute_float_le

5799 le_float_def -> less_eq_float.rep_eq

5800 less_float_def' -> Float.compute_float_less

5801 less_float_def -> less_float.rep_eq

5802 normfloat_def -> Float.compute_normfloat

5803 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0

5804 normfloat -> normfloat_def

5805 normfloat_unique -> use normfloat_def

5806 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral

5807 one_float_def -> Float.compute_float_one

5808 plus_float_def -> Float.compute_float_plus

5809 rapprox_posrat_def -> Float.compute_rapprox_posrat

5810 rapprox_rat.simps -> Float.compute_rapprox_rat

5811 real_of_float_0 -> zero_float.rep_eq

5812 real_of_float_1 -> one_float.rep_eq

5813 real_of_float_abs -> abs_float.rep_eq

5814 real_of_float_add -> plus_float.rep_eq

5815 real_of_float_minus -> uminus_float.rep_eq

5816 real_of_float_mult -> times_float.rep_eq

5817 real_of_float_simp -> Float.rep_eq

5818 real_of_float_sub -> minus_float.rep_eq

5819 round_down.simps -> Float.compute_float_round_down

5820 round_up.simps -> Float.compute_float_round_up

5821 times_float_def -> Float.compute_float_times

5822 uminus_float_def -> Float.compute_float_uminus

5823 zero_float_def -> Float.compute_float_zero

5825 Lemmas not necessary anymore, use the transfer method:

5826 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,

5827 float_divr, float_le_simp, float_less1_mantissa_bound,

5828 float_less_simp, float_less_zero, float_le_zero,

5829 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,

5830 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,

5831 lapprox_rat_bottom, normalized_float, rapprox_posrat,

5832 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,

5833 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,

5834 round_up, zero_le_float, zero_less_float

5836 * New theory HOL/Library/DAList provides an abstract type for

5837 association lists with distinct keys.

5839 * Session HOL/IMP: Added new theory of abstract interpretation of

5840 annotated commands.

5842 * Session HOL-Import: Re-implementation from scratch is faster,

5843 simpler, and more scalable. Requires a proof bundle, which is

5844 available as an external component. Discontinued old (and mostly

5845 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.

5847 * Session HOL-Word: Discontinued many redundant theorems specific to

5848 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems

5849 instead.

5851 word_sub_alt ~> word_sub_wi

5852 word_add_alt ~> word_add_def

5853 word_mult_alt ~> word_mult_def

5854 word_minus_alt ~> word_minus_def

5855 word_0_alt ~> word_0_wi

5856 word_1_alt ~> word_1_wi

5857 word_add_0 ~> add_0_left

5858 word_add_0_right ~> add_0_right

5859 word_mult_1 ~> mult_1_left

5860 word_mult_1_right ~> mult_1_right

5861 word_add_commute ~> add_commute

5862 word_add_assoc ~> add_assoc

5863 word_add_left_commute ~> add_left_commute

5864 word_mult_commute ~> mult_commute

5865 word_mult_assoc ~> mult_assoc

5866 word_mult_left_commute ~> mult_left_commute

5867 word_left_distrib ~> left_distrib

5868 word_right_distrib ~> right_distrib

5869 word_left_minus ~> left_minus

5870 word_diff_0_right ~> diff_0_right

5871 word_diff_self ~> diff_self

5872 word_sub_def ~> diff_minus

5873 word_diff_minus ~> diff_minus

5874 word_add_ac ~> add_ac

5875 word_mult_ac ~> mult_ac

5876 word_plus_ac0 ~> add_0_left add_0_right add_ac

5877 word_times_ac1 ~> mult_1_left mult_1_right mult_ac

5878 word_order_trans ~> order_trans

5879 word_order_refl ~> order_refl

5880 word_order_antisym ~> order_antisym

5881 word_order_linear ~> linorder_linear

5882 lenw1_zero_neq_one ~> zero_neq_one

5883 word_number_of_eq ~> number_of_eq

5884 word_of_int_add_hom ~> wi_hom_add

5885 word_of_int_sub_hom ~> wi_hom_sub

5886 word_of_int_mult_hom ~> wi_hom_mult

5887 word_of_int_minus_hom ~> wi_hom_neg

5888 word_of_int_succ_hom ~> wi_hom_succ

5889 word_of_int_pred_hom ~> wi_hom_pred

5890 word_of_int_0_hom ~> word_0_wi

5891 word_of_int_1_hom ~> word_1_wi

5893 * Session HOL-Word: New proof method "word_bitwise" for splitting

5894 machine word equalities and inequalities into logical circuits,

5895 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,

5896 multiplication, shifting by constants, bitwise operators and numeric

5897 constants. Requires fixed-length word types, not 'a word. Solves

5898 many standard word identities outright and converts more into first

5899 order problems amenable to blast or similar. See also examples in

5900 HOL/Word/Examples/WordExamples.thy.

5902 * Session HOL-Probability: Introduced the type "'a measure" to

5903 represent measures, this replaces the records 'a algebra and 'a

5904 measure_space. The locales based on subset_class now have two

5905 locale-parameters the space \<Omega> and the set of measurable sets M.

5906 The product of probability spaces uses now the same constant as the

5907 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)

5908 measure". Most constants are defined now outside of locales and gain

5909 an additional parameter, like null_sets, almost_eventually or \<mu>'.

5910 Measure space constructions for distributions and densities now got

5911 their own constants distr and density. Instead of using locales to

5912 describe measure spaces with a finite space, the measure count_space

5913 and point_measure is introduced. INCOMPATIBILITY.

5915 Renamed constants:

5916 measure -> emeasure

5917 finite_measure.\<mu>' -> measure

5918 product_algebra_generator -> prod_algebra

5919 product_prob_space.emb -> prod_emb

5920 product_prob_space.infprod_algebra -> PiM

5922 Removed locales:

5923 completeable_measure_space

5924 finite_measure_space

5925 finite_prob_space

5926 finite_product_finite_prob_space

5927 finite_product_sigma_algebra

5928 finite_sigma_algebra

5929 measure_space

5930 pair_finite_prob_space

5931 pair_finite_sigma_algebra

5932 pair_finite_space

5933 pair_sigma_algebra

5934 product_sigma_algebra

5936 Removed constants:

5937 conditional_space

5938 distribution -> use distr measure, or distributed predicate

5939 image_space

5940 joint_distribution -> use distr measure, or distributed predicate

5941 pair_measure_generator

5942 product_prob_space.infprod_algebra -> use PiM

5943 subvimage

5945 Replacement theorems:

5946 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite

5947 finite_measure.empty_measure -> measure_empty

5948 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq

5949 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq

5950 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably

5951 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure

5952 finite_measure.finite_measure -> finite_measure.emeasure_finite

5953 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton

5954 finite_measure.positive_measure' -> measure_nonneg

5955 finite_measure.real_measure -> finite_measure.emeasure_real

5956 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb

5957 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite

5958 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty

5959 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed

5960 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple

5961 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple

5962 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple

5963 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple

5964 information_space.entropy_commute -> information_space.entropy_commute_simple

5965 information_space.entropy_eq -> information_space.entropy_simple_distributed

5966 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed

5967 information_space.entropy_positive -> information_space.entropy_nonneg_simple

5968 information_space.entropy_uniform_max -> information_space.entropy_uniform

5969 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq

5970 information_space.KL_eq_0 -> information_space.KL_same_eq_0

5971 information_space.KL_ge_0 -> information_space.KL_nonneg

5972 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed

5973 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple

5974 Int_stable_cuboids -> Int_stable_atLeastAtMost

5975 Int_stable_product_algebra_generator -> positive_integral

5976 measure_preserving -> equality "distr M N f = N" "f : measurable M N"

5977 measure_space.additive -> emeasure_additive

5978 measure_space.AE_iff_null_set -> AE_iff_null

5979 measure_space.almost_everywhere_def -> eventually_ae_filter

5980 measure_space.almost_everywhere_vimage -> AE_distrD

5981 measure_space.continuity_from_above -> INF_emeasure_decseq

5982 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq

5983 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq

5984 measure_space.continuity_from_below -> SUP_emeasure_incseq

5985 measure_space_density -> emeasure_density

5986 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density

5987 measure_space.integrable_vimage -> integrable_distr

5988 measure_space.integral_translated_density -> integral_density

5989 measure_space.integral_vimage -> integral_distr

5990 measure_space.measure_additive -> plus_emeasure

5991 measure_space.measure_compl -> emeasure_compl

5992 measure_space.measure_countable_increasing -> emeasure_countable_increasing

5993 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably

5994 measure_space.measure_decseq -> decseq_emeasure

5995 measure_space.measure_Diff -> emeasure_Diff

5996 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set

5997 measure_space.measure_eq_0 -> emeasure_eq_0

5998 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite

5999 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton

6000 measure_space.measure_incseq -> incseq_emeasure

6001 measure_space.measure_insert -> emeasure_insert

6002 measure_space.measure_mono -> emeasure_mono

6003 measure_space.measure_not_negative -> emeasure_not_MInf

6004 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq

6005 measure_space.measure_setsum -> setsum_emeasure

6006 measure_space.measure_setsum_split -> setsum_emeasure_cover

6007 measure_space.measure_space_vimage -> emeasure_distr

6008 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite

6009 measure_space.measure_subadditive -> subadditive

6010 measure_space.measure_top -> emeasure_space

6011 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0

6012 measure_space.measure_Un_null_set -> emeasure_Un_null_set

6013 measure_space.positive_integral_translated_density -> positive_integral_density

6014 measure_space.positive_integral_vimage -> positive_integral_distr

6015 measure_space.real_continuity_from_above -> Lim_measure_decseq

6016 measure_space.real_continuity_from_below -> Lim_measure_incseq

6017 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably

6018 measure_space.real_measure_Diff -> measure_Diff

6019 measure_space.real_measure_finite_Union -> measure_finite_Union

6020 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton

6021 measure_space.real_measure_subadditive -> measure_subadditive

6022 measure_space.real_measure_Union -> measure_Union

6023 measure_space.real_measure_UNION -> measure_UNION

6024 measure_space.simple_function_vimage -> simple_function_comp

6025 measure_space.simple_integral_vimage -> simple_integral_distr

6026 measure_space.simple_integral_vimage -> simple_integral_distr

6027 measure_unique_Int_stable -> measure_eqI_generator_eq

6028 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq

6029 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1

6030 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2

6031 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1

6032 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2

6033 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff

6034 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap

6035 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'

6036 pair_sigma_algebra.sets_swap -> sets_pair_swap

6037 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1

6038 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2

6039 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap

6040 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2

6041 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt

6042 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times

6043 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM

6044 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq

6045 prob_space.measure_space_1 -> prob_space.emeasure_space_1

6046 prob_space.prob_space_vimage -> prob_space_distr

6047 prob_space.random_variable_restrict -> measurable_restrict

6048 prob_space_unique_Int_stable -> measure_eqI_prob_space

6049 product_algebraE -> prod_algebraE_all

6050 product_algebra_generator_der -> prod_algebra_eq_finite

6051 product_algebra_generator_into_space -> prod_algebra_sets_into_space

6052 product_algebraI -> sets_PiM_I_finite

6053 product_measure_exists -> product_sigma_finite.sigma_finite

6054 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator

6055 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb

6056 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty

6057 product_prob_space.measurable_component -> measurable_component_singleton

6058 product_prob_space.measurable_emb -> measurable_prod_emb

6059 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single

6060 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton

6061 product_prob_space.measure_emb -> emeasure_prod_emb

6062 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict

6063 product_sigma_algebra.product_algebra_into_space -> space_closed

6064 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge

6065 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton

6066 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge

6067 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable

6068 sets_product_algebra -> sets_PiM

6069 sigma_algebra.measurable_sigma -> measurable_measure_of

6070 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint

6071 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr

6072 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq

6073 space_product_algebra -> space_PiM

6075 * Session HOL-TPTP: support to parse and import TPTP problems (all

6076 languages) into Isabelle/HOL.

6079 *** FOL ***

6081 * New "case_product" attribute (see HOL).

6084 *** ZF ***

6086 * Greater support for structured proofs involving induction or case

6087 analysis.

6089 * Much greater use of mathematical symbols.

6091 * Removal of many ML theorem bindings. INCOMPATIBILITY.

6094 *** ML ***

6096 * Antiquotation @{keyword "name"} produces a parser for outer syntax

6097 from a minor keyword introduced via theory header declaration.

6099 * Antiquotation @{command_spec "name"} produces the

6100 Outer_Syntax.command_spec from a major keyword introduced via theory

6101 header declaration; it can be passed to Outer_Syntax.command etc.

6103 * Local_Theory.define no longer hard-wires default theorem name

6104 "foo_def", but retains the binding as given. If that is Binding.empty

6105 / Attrib.empty_binding, the result is not registered as user-level

6106 fact. The Local_Theory.define_internal variant allows to specify a

6107 non-empty name (used for the foundation in the background theory),

6108 while omitting the fact binding in the user-context. Potential

6109 INCOMPATIBILITY for derived definitional packages: need to specify

6110 naming policy for primitive definitions more explicitly.

6112 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in

6113 conformance with similar operations in structure Term and Logic.

6115 * Antiquotation @{attributes [...]} embeds attribute source

6116 representation into the ML text, which is particularly useful with

6117 declarations like Local_Theory.note.

6119 * Structure Proof_Context follows standard naming scheme. Old

6120 ProofContext has been discontinued. INCOMPATIBILITY.

6122 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle

6123 change of semantics: update is applied to auxiliary local theory

6124 context as well.

6126 * Modernized some old-style infix operations:

6128 addeqcongs ~> Simplifier.add_eqcong

6129 deleqcongs ~> Simplifier.del_eqcong

6130 addcongs ~> Simplifier.add_cong

6131 delcongs ~> Simplifier.del_cong

6132 setmksimps ~> Simplifier.set_mksimps

6133 setmkcong ~> Simplifier.set_mkcong

6134 setmksym ~> Simplifier.set_mksym

6135 setmkeqTrue ~> Simplifier.set_mkeqTrue

6136 settermless ~> Simplifier.set_termless

6137 setsubgoaler ~> Simplifier.set_subgoaler

6138 addsplits ~> Splitter.add_split

6139 delsplits ~> Splitter.del_split

6142 *** System ***

6144 * USER_HOME settings variable points to cross-platform user home

6145 directory, which coincides with HOME on POSIX systems only. Likewise,

6146 the Isabelle path specification "~" now expands to $USER_HOME, instead

6147 of former $HOME. A different default for USER_HOME may be set

6148 explicitly in shell environment, before Isabelle settings are

6149 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where

6150 the generic user home was intended.

6152 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name

6153 notation, which is useful for the jEdit file browser, for example.

6155 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar

6156 (not just JRE).

6160 New in Isabelle2011-1 (October 2011)

6161 ------------------------------------

6163 *** General ***

6165 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as

6166 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.

6168 - Management of multiple theory files directly from the editor

6169 buffer store -- bypassing the file-system (no requirement to save

6170 files for checking).

6172 - Markup of formal entities within the text buffer, with semantic

6173 highlighting, tooltips and hyperlinks to jump to defining source

6174 positions.

6176 - Improved text rendering, with sub/superscripts in the source

6177 buffer (including support for copy/paste wrt. output panel, HTML

6178 theory output and other non-Isabelle text boxes).

6180 - Refined scheduling of proof checking and printing of results,

6181 based on interactive editor view. (Note: jEdit folding and

6182 narrowing allows to restrict buffer perspectives explicitly.)

6184 - Reduced CPU performance requirements, usable on machines with few

6185 cores.

6187 - Reduced memory requirements due to pruning of unused document

6188 versions (garbage collection).

6190 See also ~~/src/Tools/jEdit/README.html for further information,

6191 including some remaining limitations.

6193 * Theory loader: source files are exclusively located via the master

6194 directory of each theory node (where the .thy file itself resides).

6195 The global load path (such as src/HOL/Library) has been discontinued.

6196 Note that the path element ~~ may be used to reference theories in the

6197 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".

6198 INCOMPATIBILITY.

6200 * Theory loader: source files are identified by content via SHA1

6201 digests. Discontinued former path/modtime identification and optional

6202 ISABELLE_FILE_IDENT plugin scripts.

6204 * Parallelization of nested Isar proofs is subject to

6205 Goal.parallel_proofs_threshold (default 100). See also isabelle

6206 usedir option -Q.

6208 * Name space: former unsynchronized references are now proper

6209 configuration options, with more conventional names:

6211 long_names ~> names_long

6212 short_names ~> names_short

6213 unique_names ~> names_unique

6215 Minor INCOMPATIBILITY, need to declare options in context like this:

6217 declare [[names_unique = false]]

6219 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note

6220 that the result needs to be unique, which means fact specifications

6221 may have to be refined after enriching a proof context.

6223 * Attribute "case_names" has been refined: the assumptions in each case

6224 can be named now by following the case name with [name1 name2 ...].

6226 * Isabelle/Isar reference manual has been updated and extended:

6227 - "Synopsis" provides a catalog of main Isar language concepts.

6228 - Formal references in syntax diagrams, via @{rail} antiquotation.

6229 - Updated material from classic "ref" manual, notably about

6230 "Classical Reasoner".

6233 *** HOL ***

6235 * Class bot and top require underlying partial order rather than

6236 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.

6238 * Class complete_lattice: generalized a couple of lemmas from sets;

6239 generalized theorems INF_cong and SUP_cong. New type classes for

6240 complete boolean algebras and complete linear orders. Lemmas

6241 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in

6242 class complete_linorder.

6244 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,

6245 Sup_fun_def, Inf_apply, Sup_apply.

6247 Removed redundant lemmas (the right hand side gives hints how to

6248 replace them for (metis ...), or (simp only: ...) proofs):

6250 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]

6251 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]

6252 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right

6253 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right

6254 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right

6255 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right

6256 Inter_def ~> INF_def, image_def

6257 Union_def ~> SUP_def, image_def

6258 INT_eq ~> INF_def, and image_def

6259 UN_eq ~> SUP_def, and image_def