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

NEWS

author | traytel |

Mon Dec 18 16:58:13 2017 +0100 (20 months ago) | |

changeset 67224 | 341fbce5b26d |

parent 67221 | 62a5fbdded50 |

child 67246 | 4cedf44f2af1 |

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

a conditional paramitrecity prover

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 * The old 'def' command has been discontinued (legacy since

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

14 object-logic equality or equivalence.

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

17 to refer to unqualified theories from the parent session.

18 INCOMPATIBILITY for old developments that have not been updated to

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

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

22 INCOMPATIBILITY.

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

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

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

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

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

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

31 without specific Prover IDE management.

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

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

35 context.

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

38 accessible ROOT file is processed only once. This facilitates

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

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

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

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

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

48 follow links to theories and document files etc.

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

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

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

54 for session selection:

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

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

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

58 - option -F focuses on the specified logic session

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

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

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

63 Examples:

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

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

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

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

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

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

71 arguments into this format.

74 *** Document preparation ***

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

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

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

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

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

82 of option "document_tags" to these commands.

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

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

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

87 \isactrlconstUNDERSCOREname.

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

90 session name verbatim.

92 * Document preparation with skip_proofs option now preserves the content

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

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

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

97 latex and bibtex process. Minor INCOMPATIBILITY.

100 *** HOL ***

102 * A new command parametric_constant for proving parametricity of

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

104 command will infer conditions on relations (e.g., bi_unique, bi_total, or

105 type class conditions such as "respects 0") sufficient for parametricity.

106 See ~~/src/HOL/ex/Conditional_Parametricity_Examples for some examples.

108 * SMT module:

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

110 with a solver other than Z3. INCOMPATIBILITY.

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

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

113 option has been added to control this. INCOMPATIBILITY.

115 * Theory HOL-Computational_Algebra.Polynomial_Factorial does not provide

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

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

118 INCOMPATIBILITY.

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

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

122 INCOMPATIBILITY.

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

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

126 interpretation of abstract locales. INCOMPATIBILITY.

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

129 INCOMPATIBILITY.

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

132 theorem.

134 * Class linordered_semiring_1 covers zero_less_one also, ruling out

135 pathologic instances. Minor INCOMPATIBILITY.

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

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

140 abbreviation. INCOMPATIBILITY.

142 * Code generation: Code generation takes an explicit option

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

146 *** System ***

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

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

150 anymore.

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

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

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

156 repository for the generated session files.

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

159 support has been discontinued.

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

162 longer supported.

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

165 been renamed to ISABELLE_TOOL_JAVA_OPTIONS and JEDIT_JAVA_OPTIONS,

166 instead of former 32/64 variants. INCOMPATIBILITY.

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

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

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

171 - option -f: forces a fresh build

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

174 corresponding environment values into account, when determining the

175 up-to-date status of a session.

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

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

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

181 PIDE markup for identifier bindings.

183 * ISABELLE_LATEX and ISABELLE_PDFLATEX now include platform-specific

184 options for improved error reporting. Potential INCOMPATIBILITY with

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

189 New in Isabelle2017 (October 2017)

190 ----------------------------------

192 *** General ***

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

195 Isabelle/PIDE front-end, see also

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

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

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

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

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

202 Technically, VSCode is based on the Electron application framework

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

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

205 modules around a Language Server implementation.

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

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

209 just the theory base name as before).

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

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

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

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

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

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

217 imports" helps to update theory imports.

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

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

221 leads to the follow renamings:

223 CTT/Main.thy ~> CTT/CTT.thy

224 ZF/Main.thy ~> ZF/ZF.thy

225 ZF/Main_ZF.thy ~> ZF/ZF.thy

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

227 ZF/ZF.thy ~> ZF/ZF_Base.thy

229 INCOMPATIBILITY.

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

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

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

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

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

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

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

240 antiquotations:

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

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

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

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

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

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

249 src/HOL/Decision_Procs/Commutative_Ring.thy and

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

251 tutorial on code generation.

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

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

257 arbitrary theory hierarchies independently of the underlying logic

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

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

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

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

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

264 changes of formal document content. Theory dependencies are always

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

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

267 effectively always enabled.

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

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

271 buffers.

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

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

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

276 represented by a different border color.

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

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

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

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

283 document in the default web browser.

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

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

287 used for formal checking.

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

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

291 enabled at all times.

293 * Update to current jedit-5.4.0.

296 *** Pure ***

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

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

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

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

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

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

305 ignored with warnings if syntactically malformed.

306 - Explicitly global code declarations yield errors if syntactically

307 malformed.

308 - Default code declarations are silently ignored if syntactically

309 malformed.

310 Minor INCOMPATIBILITY.

312 * Clarified and standardized internal data bookkeeping of code

313 declarations: history of serials allows to track potentially

314 non-monotonous declarations appropriately. Minor INCOMPATIBILITY.

317 *** HOL ***

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

321 * SMT module:

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

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

324 disabled by default.

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

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

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

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

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

331 INCOMPATIBILITY.

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

334 terms without free variables are always evaluated using plain evaluation

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

336 INCOMPATIBILITY.

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

339 of "Complex_Main").

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

342 Minor INCOMPATIBILITY.

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

345 INCOMPATIBILITY.

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

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

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

351 transp, antisymp, single_valuedp instead. INCOMPATIBILITY.

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

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

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

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

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

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

362 * Named theorems mod_simps covers various congruence rules concerning

363 mod, replacing former zmod_simps. INCOMPATIBILITY.

365 * Swapped orientation of congruence rules mod_add_left_eq,

366 mod_add_right_eq, mod_add_eq, mod_mult_left_eq, mod_mult_right_eq,

367 mod_mult_eq, mod_minus_eq, mod_diff_left_eq, mod_diff_right_eq,

368 mod_diff_eq. INCOMPATIBILITY.

370 * Generalized some facts:

371 measure_induct_rule

372 measure_induct

373 zminus_zmod ~> mod_minus_eq

374 zdiff_zmod_left ~> mod_diff_left_eq

375 zdiff_zmod_right ~> mod_diff_right_eq

376 zmod_eq_dvd_iff ~> mod_eq_dvd_iff

377 INCOMPATIBILITY.

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

380 euclidean_(semi)ring, euclidean_(semi)ring_cancel,

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

382 euclidean size.

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

385 - Euclidean induction is available as rule eucl_induct.

386 - Constants Euclidean_Algorithm.gcd, Euclidean_Algorithm.lcm,

387 Euclidean_Algorithm.Gcd and Euclidean_Algorithm.Lcm allow

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

389 - Coefficients obtained by extended euclidean algorithm are

390 available as "bezout_coefficients".

391 INCOMPATIBILITY.

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

394 totient function previously hidden as solitary example in theory

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

396 the literature. Minor INCOMPATIBILITY.

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

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

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

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

403 been renamed to bij_swap_compose_bij. INCOMPATIBILITY.

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

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

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

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

410 space. INCOMPATIBILITY.

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

413 INCOMPATIBILITY.

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

416 replacement syntax has been removed. INCOMPATIBILITY, standard syntax

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

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

420 syntax (ASCII)

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

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

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

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

426 multisets have been renamed:

428 msetless_cancel_numerals ~> msetsubset_cancel

429 msetle_cancel_numerals ~> msetsubset_eq_cancel

431 INCOMPATIBILITY.

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

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

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

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

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

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

441 Curve Theorem and the Great Picard Theorem.

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

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

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

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

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

450 theories, notably Euclidean_Algorithm, Factorial_Ring,

451 Formal_Power_Series, Fraction_Field, Fundamental_Theorem_Algebra,

452 Normalized_Fraction, Polynomial_FPS, Polynomial, Primes. Minor

453 INCOMPATIBILITY.

456 *** System ***

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

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

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

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

463 "Application File Format" in the sense of

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

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

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

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

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

470 builds (according to parallel_subproofs_threshold).

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

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

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

475 unchanged.

477 * Isabelle settings variable ISABELLE_SCALA_BUILD_OPTIONS has been

478 renamed to ISABELLE_SCALAC_OPTIONS. Rare INCOMPATIBILITY.

480 * Isabelle settings variables ISABELLE_WINDOWS_PLATFORM,

481 ISABELLE_WINDOWS_PLATFORM32, ISABELLE_WINDOWS_PLATFORM64 indicate the

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

483 is analogous to ISABELLE_PLATFORM, ISABELLE_PLATFORM32,

484 ISABELLE_PLATFORM64.

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

487 the Isabelle application bundle for Linux. See also

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

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

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

492 serves as example for alternative PIDE front-ends.

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

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

497 isabelle imports -I -a

498 isabelle imports -U -a

499 isabelle imports -U -i -a

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

504 New in Isabelle2016-1 (December 2016)

505 -------------------------------------

507 *** General ***

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

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

511 INCOMPATIBILITY.

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

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

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

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

516 result the subgoal may be split into several subgoals.

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

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

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

522 bundle foo

523 begin

524 declare a [simp]

525 declare b [intro]

526 end

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

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

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

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

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

534 discontinued.

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

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

538 quotes when sub-languages are nested.

540 * Mixfix annotations support general block properties, with syntax

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

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

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

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

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

547 statements without object-logic judgment.

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

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

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

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

554 examples.

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

557 instances) are generated into companion object of corresponding type

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

560 * Solve direct: option "solve_direct_strict_warnings" gives explicit

561 warnings for lemma statements with trivial proofs.

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

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

567 system option editor_generated_input_delay (in addition to existing

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

569 reactivity and CPU usage.

571 * Syntactic indentation according to Isabelle outer syntax. Action

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

573 command keywords and some command substructure. Action

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

575 according to command keywords only; see also option

576 "jedit_indent_newline".

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

579 number of subgoals. This requires information of ongoing document

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

581 quickly; see also option "jedit_script_indent" and

582 "jedit_script_indent_limit".

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

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

586 structure of theory specifications is treated as well.

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

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

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

592 e.g. 'context', 'notepad'.

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

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

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

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

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

601 systematic renaming.

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

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

605 theorem statement.

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

608 situations where old ASCII notation may be updated.

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

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

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

613 inaccessible via keyboard completion).

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

616 following independent stages:

618 src/Pure/ROOT0.ML

619 src/Pure/ROOT.ML

620 src/Pure/Pure.thy

621 src/Pure/ML_Bootstrap.thy

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

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

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

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

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

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

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

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

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

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

635 * Additional abbreviations for syntactic completion may be specified

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

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

638 new 'abbrevs' section.

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

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

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

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

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

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

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

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

649 old keymaps.

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

652 and diverse:

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

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

656 @{dir NAME} -- check for directory

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

659 have to be changed.

662 *** Document preparation ***

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

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

667 existing antiquotation @{class}.

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

670 this allows special forms of document output.

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

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

674 derivatives.

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

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

679 Isabelle2015).

682 *** Isar ***

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

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

686 'definition', 'inductive', 'function'.

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

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

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

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

692 context: INCOMPATIBILITY.

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

695 optional abstraction over local parameters. The syntax resembles

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

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

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

700 context.

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

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

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

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

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

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

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

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

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

714 INCOMPATIBILITY.

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

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

718 definitions.

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

721 expression, e.g.

723 (use facts in simp)

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

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

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

730 *** Pure ***

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

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

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

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

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

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

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

740 regardless of the actual parameters that are provided. Rare

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

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

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

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

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

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

748 INCOMPATIBILITY, need to provide explicit type constraints for Pure

749 types where this is really intended.

752 *** HOL ***

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

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

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

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

758 quantifier-free propositional logic with linear real arithmetic

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

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

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

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

765 break existing proofs. INCOMPATIBILITY.

767 * Sledgehammer:

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

769 - Produce syntactically correct Vampire 4.0 problem files.

771 * (Co)datatype package:

772 - New commands for defining corecursive functions and reasoning about

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

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

775 method. See 'isabelle doc corec'.

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

777 citizen in bounded natural functors.

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

779 to the map function.

780 - 'bnf' automatically discharges reflexive proof obligations.

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

782 terms of map and set

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

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

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

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

787 - Renamed lemmas:

788 rel_prod_apply ~> rel_prod_inject

789 pred_prod_apply ~> pred_prod_inject

790 INCOMPATIBILITY.

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

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

793 equivalent) form.

794 INCOMPATIBILITY.

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

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

798 which exposed details of the internal fixpoint construction and was

799 hard to use. INCOMPATIBILITY.

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

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

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

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

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

808 eliminated altogether.

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

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

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

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

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

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

816 INCOMPATIBILITY in rare situations.

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

819 INCOMPATIBILITY.

821 * Renamed constants and corresponding theorems:

823 setsum ~> sum

824 setprod ~> prod

825 listsum ~> sum_list

826 listprod ~> prod_list

828 INCOMPATIBILITY.

830 * Sligthly more standardized theorem names:

831 sgn_times ~> sgn_mult

832 sgn_mult' ~> Real_Vector_Spaces.sgn_mult

833 divide_zero_left ~> div_0

834 zero_mod_left ~> mod_0

835 divide_zero ~> div_by_0

836 divide_1 ~> div_by_1

837 nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left

838 div_mult_self1_is_id ~> nonzero_mult_div_cancel_left

839 nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right

840 div_mult_self2_is_id ~> nonzero_mult_div_cancel_right

841 is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left

842 is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right

843 mod_div_equality ~> div_mult_mod_eq

844 mod_div_equality2 ~> mult_div_mod_eq

845 mod_div_equality3 ~> mod_div_mult_eq

846 mod_div_equality4 ~> mod_mult_div_eq

847 minus_div_eq_mod ~> minus_div_mult_eq_mod

848 minus_div_eq_mod2 ~> minus_mult_div_eq_mod

849 minus_mod_eq_div ~> minus_mod_eq_div_mult

850 minus_mod_eq_div2 ~> minus_mod_eq_mult_div

851 div_mod_equality' ~> minus_mod_eq_div_mult [symmetric]

852 mod_div_equality' ~> minus_div_mult_eq_mod [symmetric]

853 zmod_zdiv_equality ~> mult_div_mod_eq [symmetric]

854 zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric]

855 Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

856 mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

857 zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

858 div_1 ~> div_by_Suc_0

859 mod_1 ~> mod_by_Suc_0

860 INCOMPATIBILITY.

862 * New type class "idom_abs_sgn" specifies algebraic properties

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

864 disappeared. Slight INCOMPATIBILITY.

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

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

869 corresponding to {0..255}.

871 - Logical representation:

872 * 0 is instantiated to the ASCII zero character.

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

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

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

876 are non-canonical.

877 - Printing and parsing:

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

879 (as before).

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

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

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

883 is parsable for every numeral expression n.

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

885 printed as their logical representation.

886 - Explicit conversions from and to the natural numbers are

887 provided as char_of_nat, nat_of_char (as before).

888 - The auxiliary nibble type has been discontinued.

890 INCOMPATIBILITY.

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

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

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

895 infix "mod" syntax. INCOMPATIBILITY.

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

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

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

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

901 easily recovered by composition with eq_refl. Minor INCOMPATIBILITY.

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

904 equation in term output. Minor INCOMPATIBILITY.

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

907 which renders those abstract effectively.

909 * Command 'export_code' checks given constants for abstraction

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

911 interface for the generated code.

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

914 spelt out explicitly.

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

917 explicitly provided auxiliary definitions for required type class

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

919 tutorial on code generation for details.

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

922 products.

924 * Locale bijection establishes convenient default simp rules such as

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

927 * Abstract locales semigroup, abel_semigroup, semilattice,

928 semilattice_neutr, ordering, ordering_top, semilattice_order,

929 semilattice_neutr_order, comm_monoid_set, semilattice_set,

930 semilattice_neutr_set, semilattice_order_set,

931 semilattice_order_neutr_set monoid_list, comm_monoid_list,

932 comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified

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

934 INCOMPATIBILITY.

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

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

938 lifting_syntax begin ... end". Minor INCOMPATIBILITY.

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

941 INCOMPATIBILITY.

943 nat_less_cases -- removed, use linorder_cases instead

944 inv_image_comp -- removed, use image_inv_f_f instead

945 image_surj_f_inv_f ~> image_f_inv_f

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

948 groups to semi-groups that are also monoids:

949 le_add_same_cancel1

950 le_add_same_cancel2

951 less_add_same_cancel1

952 less_add_same_cancel2

953 add_le_same_cancel1

954 add_le_same_cancel2

955 add_less_same_cancel1

956 add_less_same_cancel2

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

959 superseeded by a more general version:

960 less_add_cancel_left_greater_zero ~> less_add_same_cancel1

961 less_add_cancel_right_greater_zero ~> less_add_same_cancel2

962 less_eq_add_cancel_left_greater_eq_zero ~> le_add_same_cancel1

963 less_eq_add_cancel_right_greater_eq_zero ~> le_add_same_cancel2

964 less_eq_add_cancel_left_less_eq_zero ~> add_le_same_cancel1

965 less_eq_add_cancel_right_less_eq_zero ~> add_le_same_cancel2

966 less_add_cancel_left_less_zero ~> add_less_same_cancel1

967 less_add_cancel_right_less_zero ~> add_less_same_cancel2

968 INCOMPATIBILITY.

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

971 resemble the f.split naming convention, INCOMPATIBILITY.

973 * Added class topological_monoid.

975 * The following theorems have been renamed:

977 setsum_left_distrib ~> sum_distrib_right

978 setsum_right_distrib ~> sum_distrib_left

980 INCOMPATIBILITY.

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

983 INCOMPATIBILITY.

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

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

987 A)".

989 * Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY.

991 * The type class ordered_comm_monoid_add is now called

992 ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add

993 is introduced as the combination of ordered_ab_semigroup_add +

994 comm_monoid_add. INCOMPATIBILITY.

996 * Introduced the type classes canonically_ordered_comm_monoid_add and

997 dioid.

999 * Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When

1000 instantiating linordered_semiring_strict and ordered_ab_group_add, an

1001 explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might

1002 be required. INCOMPATIBILITY.

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

1005 of a more general type also:

1006 lcm_left_commute_nat ~> lcm.left_commute

1007 lcm_left_commute_int ~> lcm.left_commute

1008 gcd_left_commute_nat ~> gcd.left_commute

1009 gcd_left_commute_int ~> gcd.left_commute

1010 gcd_greatest_iff_nat ~> gcd_greatest_iff

1011 gcd_greatest_iff_int ~> gcd_greatest_iff

1012 coprime_dvd_mult_nat ~> coprime_dvd_mult

1013 coprime_dvd_mult_int ~> coprime_dvd_mult

1014 zpower_numeral_even ~> power_numeral_even

1015 gcd_mult_cancel_nat ~> gcd_mult_cancel

1016 gcd_mult_cancel_int ~> gcd_mult_cancel

1017 div_gcd_coprime_nat ~> div_gcd_coprime

1018 div_gcd_coprime_int ~> div_gcd_coprime

1019 zpower_numeral_odd ~> power_numeral_odd

1020 zero_less_int_conv ~> of_nat_0_less_iff

1021 gcd_greatest_nat ~> gcd_greatest

1022 gcd_greatest_int ~> gcd_greatest

1023 coprime_mult_nat ~> coprime_mult

1024 coprime_mult_int ~> coprime_mult

1025 lcm_commute_nat ~> lcm.commute

1026 lcm_commute_int ~> lcm.commute

1027 int_less_0_conv ~> of_nat_less_0_iff

1028 gcd_commute_nat ~> gcd.commute

1029 gcd_commute_int ~> gcd.commute

1030 Gcd_insert_nat ~> Gcd_insert

1031 Gcd_insert_int ~> Gcd_insert

1032 of_int_int_eq ~> of_int_of_nat_eq

1033 lcm_least_nat ~> lcm_least

1034 lcm_least_int ~> lcm_least

1035 lcm_assoc_nat ~> lcm.assoc

1036 lcm_assoc_int ~> lcm.assoc

1037 int_le_0_conv ~> of_nat_le_0_iff

1038 int_eq_0_conv ~> of_nat_eq_0_iff

1039 Gcd_empty_nat ~> Gcd_empty

1040 Gcd_empty_int ~> Gcd_empty

1041 gcd_assoc_nat ~> gcd.assoc

1042 gcd_assoc_int ~> gcd.assoc

1043 zero_zle_int ~> of_nat_0_le_iff

1044 lcm_dvd2_nat ~> dvd_lcm2

1045 lcm_dvd2_int ~> dvd_lcm2

1046 lcm_dvd1_nat ~> dvd_lcm1

1047 lcm_dvd1_int ~> dvd_lcm1

1048 gcd_zero_nat ~> gcd_eq_0_iff

1049 gcd_zero_int ~> gcd_eq_0_iff

1050 gcd_dvd2_nat ~> gcd_dvd2

1051 gcd_dvd2_int ~> gcd_dvd2

1052 gcd_dvd1_nat ~> gcd_dvd1

1053 gcd_dvd1_int ~> gcd_dvd1

1054 int_numeral ~> of_nat_numeral

1055 lcm_ac_nat ~> ac_simps

1056 lcm_ac_int ~> ac_simps

1057 gcd_ac_nat ~> ac_simps

1058 gcd_ac_int ~> ac_simps

1059 abs_int_eq ~> abs_of_nat

1060 zless_int ~> of_nat_less_iff

1061 zdiff_int ~> of_nat_diff

1062 zadd_int ~> of_nat_add

1063 int_mult ~> of_nat_mult

1064 int_Suc ~> of_nat_Suc

1065 inj_int ~> inj_of_nat

1066 int_1 ~> of_nat_1

1067 int_0 ~> of_nat_0

1068 Lcm_empty_nat ~> Lcm_empty

1069 Lcm_empty_int ~> Lcm_empty

1070 Lcm_insert_nat ~> Lcm_insert

1071 Lcm_insert_int ~> Lcm_insert

1072 comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd

1073 comp_fun_idem_gcd_int ~> comp_fun_idem_gcd

1074 comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm

1075 comp_fun_idem_lcm_int ~> comp_fun_idem_lcm

1076 Lcm_eq_0 ~> Lcm_eq_0_I

1077 Lcm0_iff ~> Lcm_0_iff

1078 Lcm_dvd_int ~> Lcm_least

1079 divides_mult_nat ~> divides_mult

1080 divides_mult_int ~> divides_mult

1081 lcm_0_nat ~> lcm_0_right

1082 lcm_0_int ~> lcm_0_right

1083 lcm_0_left_nat ~> lcm_0_left

1084 lcm_0_left_int ~> lcm_0_left

1085 dvd_gcd_D1_nat ~> dvd_gcdD1

1086 dvd_gcd_D1_int ~> dvd_gcdD1

1087 dvd_gcd_D2_nat ~> dvd_gcdD2

1088 dvd_gcd_D2_int ~> dvd_gcdD2

1089 coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff

1090 coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff

1091 realpow_minus_mult ~> power_minus_mult

1092 realpow_Suc_le_self ~> power_Suc_le_self

1093 dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest

1094 INCOMPATIBILITY.

1096 * Renamed HOL/Quotient_Examples/FSet.thy to

1097 HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY.

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

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

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

1102 "unbundle finfun_syntax" to imitate import of

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

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

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

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

1108 once.

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

1111 set_mset rather than count.

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

1114 by default.

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

1117 equations count_eq_zero_iff and not_in_iff.

1119 - Rules count_inI and in_countE obtain facts of the form

1120 "count M a = n" from membership.

1122 - Rules count_in_diffI and in_diff_countE obtain facts of the form

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

1125 INCOMPATIBILITY.

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

1128 displaying equations in functional programming style --- variables

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

1130 underscores.

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

1133 build partial equivalence relations from a predicate and an equivalence

1134 relation.

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

1137 everywhere fix bijections.

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

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

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

1142 denominator is normalized wrt. unit factors).

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

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

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

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

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

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

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

1154 principle, Residue theorem, Schwarz Lemma.

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

1157 polytopes, and the Krein–Milman Minkowski theorem.

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

1160 libraries: homeomorphisms, continuous function extensions, invariance of

1161 domain.

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

1164 changed from ereal to ennreal, INCOMPATIBILITY.

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

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

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

1170 Probability Mass Functions.

1172 * Session HOL-Probability: theory Random_Permutations contains some

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

1174 folding over a list in random order.

1176 * Session HOL-Probability: theory SPMF formalises discrete

1177 subprobability distributions.

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

1180 normalised to distinguish which ordering the theorems are about

1182 mset_less_eqI ~> mset_subset_eqI

1183 mset_less_insertD ~> mset_subset_insertD

1184 mset_less_eq_count ~> mset_subset_eq_count

1185 mset_less_diff_self ~> mset_subset_diff_self

1186 mset_le_exists_conv ~> mset_subset_eq_exists_conv

1187 mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel

1188 mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel

1189 mset_le_mono_add ~> mset_subset_eq_mono_add

1190 mset_le_add_left ~> mset_subset_eq_add_left

1191 mset_le_add_right ~> mset_subset_eq_add_right

1192 mset_le_single ~> mset_subset_eq_single

1193 mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute

1194 diff_le_self ~> diff_subset_eq_self

1195 mset_leD ~> mset_subset_eqD

1196 mset_lessD ~> mset_subsetD

1197 mset_le_insertD ~> mset_subset_eq_insertD

1198 mset_less_of_empty ~> mset_subset_of_empty

1199 mset_less_size ~> mset_subset_size

1200 wf_less_mset_rel ~> wf_subset_mset_rel

1201 count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq

1202 mset_remdups_le ~> mset_remdups_subset_eq

1203 ms_lesseq_impl ~> subset_eq_mset_impl

1205 Some functions have been renamed:

1206 ms_lesseq_impl -> subset_eq_mset_impl

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

1209 #\<subseteq># ~> \<le>

1210 #\<subset># ~> <

1211 le_multiset ~> less_eq_multiset

1212 less_multiset ~> le_multiset

1213 INCOMPATIBILITY.

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

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

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

1218 interpretations "multiset_linorder" and "multiset_wellorder" have been

1219 replaced by instantiations. INCOMPATIBILITY.

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

1222 been renamed:

1224 le_multiset_def ~> less_eq_multiset_def

1225 less_multiset_def ~> le_multiset_def

1226 less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset

1227 mult_less_not_refl ~> mset_le_not_refl

1228 mult_less_trans ~> mset_le_trans

1229 mult_less_not_sym ~> mset_le_not_sym

1230 mult_less_asym ~> mset_le_asym

1231 mult_less_irrefl ~> mset_le_irrefl

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

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

1235 le_multiset_total ~> less_eq_multiset_total

1236 less_multiset_right_total ~> subset_eq_imp_le_multiset

1237 le_multiset_empty_left ~> less_eq_multiset_empty_left

1238 le_multiset_empty_right ~> less_eq_multiset_empty_right

1239 less_multiset_empty_right ~> le_multiset_empty_left

1240 less_multiset_empty_left ~> le_multiset_empty_right

1241 union_less_diff_plus ~> union_le_diff_plus

1242 ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset

1243 less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty

1244 le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty

1245 INCOMPATIBILITY.

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

1248 INCOMPATIBILITY.

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

1251 INCOMPATIBILITY, use the following replacements:

1253 le_multiset_plus_plus_left_iff ~> add_less_cancel_right

1254 less_multiset_plus_plus_left_iff ~> add_less_cancel_right

1255 le_multiset_plus_plus_right_iff ~> add_less_cancel_left

1256 less_multiset_plus_plus_right_iff ~> add_less_cancel_left

1257 add_eq_self_empty_iff ~> add_cancel_left_right

1258 mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right

1259 mset_less_add_bothsides ~> subset_mset.add_less_cancel_right

1260 mset_le_add_bothsides ~> subset_mset.add_less_cancel_right

1261 empty_inter ~> subset_mset.inf_bot_left

1262 inter_empty ~> subset_mset.inf_bot_right

1263 empty_sup ~> subset_mset.sup_bot_left

1264 sup_empty ~> subset_mset.sup_bot_right

1265 bdd_below_multiset ~> subset_mset.bdd_above_bot

1266 subset_eq_empty ~> subset_mset.le_zero_eq

1267 le_empty ~> subset_mset.le_zero_eq

1268 mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero

1269 mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero

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

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

1273 additional typeclasses order_bot, no_top,

1274 ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add,

1275 linordered_cancel_ab_semigroup_add, and

1276 ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY.

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

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

1280 INCOMPATIBILITY.

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

1283 interpretations ordered_ab_semigroup_monoid_add_imp_le and

1284 bounded_lattice_bot. INCOMPATIBILITY.

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

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

1288 removed or changed:

1290 single_not_empty ~> add_mset_not_empty or empty_not_add_mset

1291 fold_mset_insert ~> fold_mset_add_mset

1292 image_mset_insert ~> image_mset_add_mset

1293 union_single_eq_diff

1294 multi_self_add_other_not_self

1295 diff_single_eq_union

1296 INCOMPATIBILITY.

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

1299 to use add_mset instead of single:

1301 mset_add

1302 multi_self_add_other_not_self

1303 diff_single_eq_union

1304 union_single_eq_diff

1305 union_single_eq_member

1306 add_eq_conv_diff

1307 insert_noteq_member

1308 add_eq_conv_ex

1309 multi_member_split

1310 multiset_add_sub_el_shuffle

1311 mset_subset_eq_insertD

1312 mset_subset_insertD

1313 insert_subset_eq_iff

1314 insert_union_subset_iff

1315 multi_psub_of_add_self

1316 inter_add_left1

1317 inter_add_left2

1318 inter_add_right1

1319 inter_add_right2

1320 sup_union_left1

1321 sup_union_left2

1322 sup_union_right1

1323 sup_union_right2

1324 size_eq_Suc_imp_eq_union

1325 multi_nonempty_split

1326 mset_insort

1327 mset_update

1328 mult1I

1329 less_add

1330 mset_zip_take_Cons_drop_twice

1331 rel_mset_Zero

1332 msed_map_invL

1333 msed_map_invR

1334 msed_rel_invL

1335 msed_rel_invR

1336 le_multiset_right_total

1337 multiset_induct

1338 multiset_induct2_size

1339 multiset_induct2

1340 INCOMPATIBILITY.

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

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

1344 element:

1346 image_mset

1347 mset

1348 replicate_mset

1349 mult1

1350 pred_mset

1351 rel_mset'

1352 mset_insort

1354 INCOMPATIBILITY.

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

1357 attributes of some multiset theorems have been changed:

1359 insert_DiffM [] ~> [simp]

1360 insert_DiffM2 [simp] ~> []

1361 diff_add_mset_swap [simp]

1362 fold_mset_add_mset [simp]

1363 diff_diff_add [simp] (for multisets only)

1364 diff_cancel [simp] ~> []

1365 count_single [simp] ~> []

1366 set_mset_single [simp] ~> []

1367 size_multiset_single [simp] ~> []

1368 size_single [simp] ~> []

1369 image_mset_single [simp] ~> []

1370 mset_subset_eq_mono_add_right_cancel [simp] ~> []

1371 mset_subset_eq_mono_add_left_cancel [simp] ~> []

1372 fold_mset_single [simp] ~> []

1373 subset_eq_empty [simp] ~> []

1374 empty_sup [simp] ~> []

1375 sup_empty [simp] ~> []

1376 inter_empty [simp] ~> []

1377 empty_inter [simp] ~> []

1378 INCOMPATIBILITY.

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

1381 the second cases of multiset_induct, multiset_induct2_size,

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

1383 INCOMPATIBILITY.

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

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

1387 natural numbers. INCOMPATIBILITY.

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

1390 multisets:

1392 msetsum ~> sum_mset

1393 msetprod ~> prod_mset

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

1396 and union of multisets have been changed:

1398 #\<inter> ~> \<inter>#

1399 #\<union> ~> \<union>#

1401 INCOMPATIBILITY.

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

1404 one_step_implies_mult_aux on multisets has been removed, use

1405 one_step_implies_mult instead. INCOMPATIBILITY.

1407 * Session HOL-Library: theory Complete_Partial_Order2 provides reasoning

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

1409 and about admissibility conditions for fixpoint inductions.

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

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

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

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

1415 future different type class instantiation for polynomials over factorial

1416 rings. INCOMPATIBILITY.

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

1419 the following renaming

1421 prefixeq -> prefix

1422 prefix -> strict_prefix

1423 suffixeq -> suffix

1424 suffix -> strict_suffix

1426 Added theory of longest common prefixes.

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

1429 Generalisation of predicate "prime" and introduction of predicates

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

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

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

1433 "prime_nat_iff". INCOMPATIBILITY.

1435 * Session Old_Number_Theory has been removed, after porting remaining

1436 theories.

1438 * Session HOL-Types_To_Sets provides an experimental extension of

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

1442 *** ML ***

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

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

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

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

1448 INCOMPATIBILITY.

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

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

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

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

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

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

1456 superseded by General.Div.

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

1459 the argument is a plain file. Minor INCOMPATIBILITY.

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

1462 with approximative output quality.

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

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

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

1468 This is particularly useful for conditional compilation, without

1469 requiring separate files.

1471 * Option ML_exception_debugger controls detailed exception trace via the

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

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

1474 debugger information requires consirable time and space: main

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

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

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

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

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

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

1482 balanced blocks of Local_Theory.open_target versus

1483 Local_Theory.close_target instead. Rare INCOMPATIBILITY.

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

1486 replaced by structure Timeout, with slightly different signature.

1487 INCOMPATIBILITY.

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

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

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

1492 File.full_path). Potential INCOMPATIBILITY.

1494 * Binding.empty_atts supersedes Thm.empty_binding and

1495 Attrib.empty_binding. Minor INCOMPATIBILITY.

1498 *** System ***

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

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

1503 much less disk space.

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

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

1507 particular:

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

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

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

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

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

1515 prover front-ends should use ML_Process or Isabelle_Process in

1516 Isabelle/Scala. INCOMPATIBILITY.

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

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

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

1521 return code 1.

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

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

1525 servers with separate CPU/memory modules.

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

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

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

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

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

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

1534 by default).

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

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

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

1539 resulting log files.

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

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

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

1544 implicit default via option -p.

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

1547 bootstrapping Isabelle/Pure interactively.

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

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

1551 Isabelle/ML or Isabelle/Scala.

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

1554 settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64,

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

1556 ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been

1557 discontinued. Potential INCOMPATIBILITY.

1559 * The Isabelle system environment always ensures that the main

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

1561 "isabelle_scala_script".

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

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

1565 Isabelle_Tool.Body.

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

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

1569 produce robust shell scripts under program control, without worrying

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

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

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

1573 been discontinued.

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

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

1577 but without the Isabelle settings environment.

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

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

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

1582 that Path specifications need to be resolved remotely via

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

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

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

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

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

1589 connection).

1593 New in Isabelle2016 (February 2016)

1594 -----------------------------------

1596 *** General ***

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

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

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

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

1602 examples that do require HOL.

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

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

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

1608 without any special print mode. Important ASCII replacement syntax

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

1610 has been removed (see below).

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

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

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

1616 context has been discontinued. Rare INCOMPATIBILITY, use explicit

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

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

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

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

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

1623 meaning.

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

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

1627 to update old sources.

1629 * Toplevel theorem statements have been simplified as follows:

1631 theorems ~> lemmas

1632 schematic_lemma ~> schematic_goal

1633 schematic_theorem ~> schematic_goal

1634 schematic_corollary ~> schematic_goal

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

1637 accordingly.

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

1640 'theorem'.

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

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

1644 deferred definitions require a surrounding 'overloading' block.

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

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

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

1651 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',

1652 'SML_file_no_debug' control compilation of sources with or without

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

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

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

1656 any effect on the running ML program.

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

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

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

1661 update.

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

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

1665 enable option "editor_output_state".

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

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

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

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

1671 visibility.

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

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

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

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

1677 panel.

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

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

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

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

1684 implicit: a popup will show up unconditionally.

1686 * Additional abbreviations for syntactic completion may be specified in

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

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

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

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

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

1693 suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.

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

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

1697 the editor.

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

1700 instead of former C+e LEFT.

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

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

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

1705 instead.

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

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

1709 single-instance applications seen on common GUI desktops.

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

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

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

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

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

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

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

1722 *** Document preparation ***

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

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

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

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

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

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

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

1733 follows:

1735 \<^item> itemize

1736 \<^enum> enumerate

1737 \<^descr> description

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

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

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

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

1743 standard Isabelle fonts provide glyphs to render important control

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

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

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

1748 standard LaTeX macros of the same names.

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

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

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

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

1754 cartouche tokens seen in theory sources.

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

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

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

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

1760 or terminal spaces are ignored.

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

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

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

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

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

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

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

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

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

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

1776 documentation, with a hyperlink in the Prover IDE.

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

1779 entities of the Isar language.

1781 * HTML presentation uses the standard IsabelleText font and Unicode

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

1783 print mode "HTML" loses its special meaning.

1786 *** Isar ***

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

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

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

1791 example:

1793 have result: "C x y"

1794 if "A x" and "B y"

1795 for x :: 'a and y :: 'a

1796 <proof>

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

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

1800 corresponds to a raw proof block like this:

1802 {

1803 fix x :: 'a and y :: 'a

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

1805 have "C x y" <proof>

1806 }

1807 note result = this

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

1810 instead of 'assume' above.

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

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

1815 assume result: "C x y"

1816 if "A x" and "B y"

1817 for x :: 'a and y :: 'a

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

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

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

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

1824 example:

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

1828 is equivalent to:

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

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

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

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

1835 follows:

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

1839 or:

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

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

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

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

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

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

1850 of the local context elements yet.

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

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

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

1856 then have something

1857 proof cases

1858 case a

1859 then show ?thesis <proof>

1860 next

1861 case b

1862 then show ?thesis <proof>

1863 next

1864 case c

1865 then show ?thesis <proof>

1866 qed

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

1870 case a: (c xs)

1871 case a [attributes]: (c xs)

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

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

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

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

1877 and always put attributes in front.

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

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

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

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

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

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

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

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

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

1890 supply [simp] = a

1891 proof

1892 show A by simp

1893 next

1894 show A by simp

1895 qed

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

1898 proof body as well, abstracted over relevant parameters.

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

1901 parameter scope for of each clause.

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

1904 statements: result is abstracted over unknowns.

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

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

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

1909 manual.

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

1912 ('apply' scripts).

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

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

1916 example:

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

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

1920 proof goal_cases

1921 case (1 x)

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

1923 next

1924 case (2 y z)

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

1926 qed

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

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

1930 proof goal_cases

1931 case prems: 1

1932 then show ?case using prems sorry

1933 next

1934 case prems: 2

1935 then show ?case using prems sorry

1936 qed

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

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

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

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

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

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

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

1947 occasionally useful for demonstration and testing purposes.

1950 *** Pure ***

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

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

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

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

1957 * Keyword 'rewrites' identifies rewrite morphisms in interpretation

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

1960 * More gentle suppression of syntax along locale morphisms while

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

1962 would be suppressed for morphisms except term identity. Now

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

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

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

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

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

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

1970 begin

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

1972 end

1974 locale morphism =

1975 left: struct composition + right: struct composition'

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

1977 begin

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

1979 end

1981 * Command 'global_interpretation' issues interpretations into global

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

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

1985 'defines'.

1987 * Command 'permanent_interpretation' has been discontinued. Use

1988 'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.

1990 * Command 'print_definitions' prints dependencies of definitional

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

1993 * Configuration option rule_insts_schematic has been discontinued

1994 (intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.

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

1997 INCOMPATIBILITY in situations where the previous misbehaviour has been

1998 exploited.

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

2001 operations behave more similar to abbreviations. Potential

2002 INCOMPATIBILITY in exotic situations.

2005 *** HOL ***

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

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

2009 global collection of overloaded constant / type definitions into

2010 account. Type definitions with open dependencies on overloaded

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

2012 provides extra robustness in theory construction. Rare INCOMPATIBILITY.

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

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

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

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

2018 Option.is_none_def. Occasional INCOMPATIBILITY in applications.

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

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

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

2023 simplify porting old theories:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

2052 INCOMPATIBILITY, use plain "::" instead.

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

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

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

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

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

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

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

2062 definition and its monotonicity result. Rare INCOMPATIBILITY.

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

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

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

2067 also subject to "inductive_internals". Rare INCOMPATIBILITY.

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

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

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

2072 INCOMPATIBILITY.

2074 * Combinator to represent case distinction on products is named

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

2076 theorem aliasses have been retained.

2078 Consolidated facts:

2079 PairE ~> prod.exhaust

2080 Pair_eq ~> prod.inject

2081 pair_collapse ~> prod.collapse

2082 Pair_fst_snd_eq ~> prod_eq_iff

2083 split_twice ~> prod.case_distrib

2084 split_weak_cong ~> prod.case_cong_weak

2085 split_split ~> prod.split

2086 split_split_asm ~> prod.split_asm

2087 splitI ~> case_prodI

2088 splitD ~> case_prodD

2089 splitI2 ~> case_prodI2

2090 splitI2' ~> case_prodI2'

2091 splitE ~> case_prodE

2092 splitE' ~> case_prodE'

2093 split_pair ~> case_prod_Pair

2094 split_eta ~> case_prod_eta

2095 split_comp ~> case_prod_comp

2096 mem_splitI ~> mem_case_prodI

2097 mem_splitI2 ~> mem_case_prodI2

2098 mem_splitE ~> mem_case_prodE

2099 The_split ~> The_case_prod

2100 cond_split_eta ~> cond_case_prod_eta

2101 Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE

2102 Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI

2103 in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq

2104 Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD

2105 Collect_split_Grp_inD ~> Collect_case_prod_Grp_in

2106 Domain_Collect_split ~> Domain_Collect_case_prod

2107 Image_Collect_split ~> Image_Collect_case_prod

2108 Range_Collect_split ~> Range_Collect_case_prod

2109 Eps_split ~> Eps_case_prod

2110 Eps_split_eq ~> Eps_case_prod_eq

2111 split_rsp ~> case_prod_rsp

2112 curry_split ~> curry_case_prod

2113 split_curry ~> case_prod_curry

2115 Changes in structure HOLogic:

2116 split_const ~> case_prod_const

2117 mk_split ~> mk_case_prod

2118 mk_psplits ~> mk_ptupleabs

2119 strip_psplits ~> strip_ptupleabs

2121 INCOMPATIBILITY.

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

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

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

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

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

2129 Consolidated facts (among others):

2130 real_of_nat_le_iff -> of_nat_le_iff

2131 real_of_nat_numeral of_nat_numeral

2132 real_of_int_zero of_int_0

2133 real_of_nat_zero of_nat_0

2134 real_of_one of_int_1

2135 real_of_int_add of_int_add

2136 real_of_nat_add of_nat_add

2137 real_of_int_diff of_int_diff

2138 real_of_nat_diff of_nat_diff

2139 floor_subtract floor_diff_of_int

2140 real_of_int_inject of_int_eq_iff

2141 real_of_int_gt_zero_cancel_iff of_int_0_less_iff

2142 real_of_int_ge_zero_cancel_iff of_int_0_le_iff

2143 real_of_nat_ge_zero of_nat_0_le_iff

2144 real_of_int_ceiling_ge le_of_int_ceiling

2145 ceiling_less_eq ceiling_less_iff

2146 ceiling_le_eq ceiling_le_iff

2147 less_floor_eq less_floor_iff

2148 floor_less_eq floor_less_iff

2149 floor_divide_eq_div floor_divide_of_int_eq

2150 real_of_int_zero_cancel of_nat_eq_0_iff

2151 ceiling_real_of_int ceiling_of_int

2153 INCOMPATIBILITY.

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

2156 been removed. INCOMPATIBILITY.

2158 * Quickcheck setup for finite sets.

2160 * Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.

2162 * Sledgehammer:

2163 - The MaSh relevance filter has been sped up.

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

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

2166 - Auto Sledgehammer now minimizes and preplays the results.

2167 - Handle Vampire 4.0 proof output without raising exception.

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

2169 Isabelle/jEdit instead. INCOMPATIBILITY.

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

2172 * Nitpick:

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

2174 - Fixed soundness bug in "destroy_constrs" optimization.

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

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

2177 - Eliminated obsolete "blocking" option.

2179 * (Co)datatype package:

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

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

2182 - Always generate "case_transfer" theorem.

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

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

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

2186 being defined.

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

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

2190 'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',

2191 'transfer_prover_start' and 'transfer_prover_end'.

2193 * New diagnostic command print_record for displaying record definitions.

2195 * Division on integers is bootstrapped directly from division on

2196 naturals and uses generic numeral algorithm for computations. Slight

2197 INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former

2198 simprocs binary_int_div and binary_int_mod

2200 * Tightened specification of class semiring_no_zero_divisors. Minor

2201 INCOMPATIBILITY.

2203 * Class algebraic_semidom introduces common algebraic notions of

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

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

2206 fields with notions that are trivial there.

2208 * Class normalization_semidom specifies canonical representants for

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

2210 This formalizes associated elements as well.

2212 * Abstract specification of gcd/lcm operations in classes semiring_gcd,

2213 semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute

2214 and gcd_int.commute are subsumed by gcd.commute, as well as

2215 gcd_nat.assoc and gcd_int.assoc by gcd.assoc.

2217 * Former constants Fields.divide (_ / _) and Divides.div (_ div _) are

2218 logically unified to Rings.divide in syntactic type class Rings.divide,

2219 with infix syntax (_ div _). Infix syntax (_ / _) for field division is

2220 added later as abbreviation in class Fields.inverse. INCOMPATIBILITY,

2221 instantiations must refer to Rings.divide rather than the former

2222 separate constants, hence infix syntax (_ / _) is usually not available

2223 during instantiation.

2225 * New cancellation simprocs for boolean algebras to cancel complementary

2226 terms for sup and inf. For example, "sup x (sup y (- x))" simplifies to

2227 "top". INCOMPATIBILITY.

2229 * Class uniform_space introduces uniform spaces btw topological spaces

2230 and metric spaces. Minor INCOMPATIBILITY: open_<type>_def needs to be

2231 introduced in the form of an uniformity. Some constants are more general

2232 now, it may be necessary to add type class constraints.

2234 open_real_def \<leadsto> open_dist

2235 open_complex_def \<leadsto> open_dist

2237 * Library/Monad_Syntax: notation uses symbols \<bind> and \<then>. INCOMPATIBILITY.

2239 * Library/Multiset:

2240 - Renamed multiset inclusion operators:

2241 < ~> <#

2242 > ~> >#

2243 <= ~> <=#

2244 >= ~> >=#

2245 \<le> ~> \<le>#

2246 \<ge> ~> \<ge>#

2247 INCOMPATIBILITY.

2248 - Added multiset inclusion operator syntax:

2249 \<subset>#

2250 \<subseteq>#

2251 \<supset>#

2252 \<supseteq>#

2253 - "'a multiset" is no longer an instance of the "order",

2254 "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",

2255 "semilattice_inf", and "semilattice_sup" type classes. The theorems

2256 previously provided by these type classes (directly or indirectly)

2257 are now available through the "subset_mset" interpretation

2258 (e.g. add_mono ~> subset_mset.add_mono).

2259 INCOMPATIBILITY.

2260 - Renamed conversions:

2261 multiset_of ~> mset

2262 multiset_of_set ~> mset_set

2263 set_of ~> set_mset

2264 INCOMPATIBILITY

2265 - Renamed lemmas:

2266 mset_le_def ~> subseteq_mset_def

2267 mset_less_def ~> subset_mset_def

2268 less_eq_multiset.rep_eq ~> subseteq_mset_def

2269 INCOMPATIBILITY

2270 - Removed lemmas generated by lift_definition:

2271 less_eq_multiset.abs_eq, less_eq_multiset.rsp,

2272 less_eq_multiset.transfer, less_eq_multiset_def

2273 INCOMPATIBILITY

2275 * Library/Omega_Words_Fun: Infinite words modeled as functions nat \<Rightarrow> 'a.

2277 * Library/Bourbaki_Witt_Fixpoint: Added formalisation of the

2278 Bourbaki-Witt fixpoint theorem for increasing functions in

2279 chain-complete partial orders.

2281 * Library/Old_Recdef: discontinued obsolete 'defer_recdef' command.

2282 Minor INCOMPATIBILITY, use 'function' instead.

2284 * Library/Periodic_Fun: a locale that provides convenient lemmas for

2285 periodic functions.

2287 * Library/Formal_Power_Series: proper definition of division (with

2288 remainder) for formal power series; instances for Euclidean Ring and

2289 GCD.

2291 * HOL-Imperative_HOL: obsolete theory Legacy_Mrec has been removed.

2293 * HOL-Statespace: command 'statespace' uses mandatory qualifier for

2294 import of parent, as for general 'locale' expressions. INCOMPATIBILITY,

2295 remove '!' and add '?' as required.

2297 * HOL-Decision_Procs: The "approximation" method works with "powr"

2298 (exponentiation on real numbers) again.

2300 * HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour

2301 integrals (= complex path integrals), Cauchy's integral theorem, winding

2302 numbers and Cauchy's integral formula, Liouville theorem, Fundamental

2303 Theorem of Algebra. Ported from HOL Light.

2305 * HOL-Multivariate_Analysis: topological concepts such as connected

2306 components, homotopic paths and the inside or outside of a set.

2308 * HOL-Multivariate_Analysis: radius of convergence of power series and

2309 various summability tests; Harmonic numbers and the Euler–Mascheroni

2310 constant; the Generalised Binomial Theorem; the complex and real

2311 Gamma/log-Gamma/Digamma/ Polygamma functions and their most important

2312 properties.

2314 * HOL-Probability: The central limit theorem based on Levy's uniqueness

2315 and continuity theorems, weak convergence, and characterisitc functions.

2317 * HOL-Data_Structures: new and growing session of standard data

2318 structures.

2321 *** ML ***

2323 * The following combinators for low-level profiling of the ML runtime

2324 system are available:

2326 profile_time (*CPU time*)

2327 profile_time_thread (*CPU time on this thread*)

2328 profile_allocations (*overall heap allocations*)

2330 * Antiquotation @{undefined} or \<^undefined> inlines (raise Match).

2332 * Antiquotation @{method NAME} inlines the (checked) name of the given

2333 Isar proof method.

2335 * Pretty printing of Poly/ML compiler output in Isabelle has been

2336 improved: proper treatment of break offsets and blocks with consistent

2337 breaks.

2339 * The auxiliary module Pure/display.ML has been eliminated. Its

2340 elementary thm print operations are now in Pure/more_thm.ML and thus

2341 called Thm.pretty_thm, Thm.string_of_thm etc. INCOMPATIBILITY.

2343 * Simproc programming interfaces have been simplified:

2344 Simplifier.make_simproc and Simplifier.define_simproc supersede various

2345 forms of Simplifier.mk_simproc, Simplifier.simproc_global etc. Note that

2346 term patterns for the left-hand sides are specified with implicitly

2347 fixed variables, like top-level theorem statements. INCOMPATIBILITY.

2349 * Instantiation rules have been re-organized as follows:

2351 Thm.instantiate (*low-level instantiation with named arguments*)

2352 Thm.instantiate' (*version with positional arguments*)

2354 Drule.infer_instantiate (*instantiation with type inference*)

2355 Drule.infer_instantiate' (*version with positional arguments*)

2357 The LHS only requires variable specifications, instead of full terms.

2358 Old cterm_instantiate is superseded by infer_instantiate.

2359 INCOMPATIBILITY, need to re-adjust some ML names and types accordingly.

2361 * Old tactic shorthands atac, rtac, etac, dtac, ftac have been

2362 discontinued. INCOMPATIBILITY, use regular assume_tac, resolve_tac etc.

2363 instead (with proper context).

2365 * Thm.instantiate (and derivatives) no longer require the LHS of the

2366 instantiation to be certified: plain variables are given directly.

2368 * Subgoal.SUBPROOF and Subgoal.FOCUS combinators use anonymous

2369 quasi-bound variables (like the Simplifier), instead of accidentally

2370 named local fixes. This has the potential to improve stability of proof

2371 tools, but can also cause INCOMPATIBILITY for tools that don't observe

2372 the proof context discipline.

2374 * Isar proof methods are based on a slightly more general type

2375 context_tactic, which allows to change the proof context dynamically

2376 (e.g. to update cases) and indicate explicit Seq.Error results. Former

2377 METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are

2378 provided in src/Pure/Isar/method.ML for convenience. INCOMPATIBILITY.

2381 *** System ***

2383 * Command-line tool "isabelle console" enables print mode "ASCII".

2385 * Command-line tool "isabelle update_then" expands old Isar command

2386 conflations:

2388 hence ~> then have

2389 thus ~> then show

2391 This syntax is more orthogonal and improves readability and

2392 maintainability of proofs.

2394 * Global session timeout is multiplied by timeout_scale factor. This

2395 allows to adjust large-scale tests (e.g. AFP) to overall hardware

2396 performance.

2398 * Property values in etc/symbols may contain spaces, if written with the

2399 replacement character "␣" (Unicode point 0x2324). For example:

2401 \<star> code: 0x0022c6 group: operator font: Deja␣Vu␣Sans␣Mono

2403 * Java runtime environment for x86_64-windows allows to use larger heap

2404 space.

2406 * Java runtime options are determined separately for 32bit vs. 64bit

2407 platforms as follows.

2409 - Isabelle desktop application: platform-specific files that are

2410 associated with the main app bundle

2412 - isabelle jedit: settings

2413 JEDIT_JAVA_SYSTEM_OPTIONS

2414 JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64

2416 - isabelle build: settings

2417 ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64

2419 * Bash shell function "jvmpath" has been renamed to "platform_path": it

2420 is relevant both for Poly/ML and JVM processes.

2422 * Poly/ML default platform architecture may be changed from 32bit to

2423 64bit via system option ML_system_64. A system restart (and rebuild) is

2424 required after change.

2426 * Poly/ML 5.6 runs natively on x86-windows and x86_64-windows, which

2427 both allow larger heap space than former x86-cygwin.

2429 * Heap images are 10-15% smaller due to less wasteful persistent theory

2430 content (using ML type theory_id instead of theory);

2434 New in Isabelle2015 (May 2015)

2435 ------------------------------

2437 *** General ***

2439 * Local theory specification commands may have a 'private' or

2440 'qualified' modifier to restrict name space accesses to the local scope,

2441 as provided by some "context begin ... end" block. For example:

2443 context

2444 begin

2446 private definition ...

2447 private lemma ...

2449 qualified definition ...

2450 qualified lemma ...

2452 lemma ...

2453 theorem ...

2455 end

2457 * Command 'experiment' opens an anonymous locale context with private

2458 naming policy.

2460 * Command 'notepad' requires proper nesting of begin/end and its proof

2461 structure in the body: 'oops' is no longer supported here. Minor

2462 INCOMPATIBILITY, use 'sorry' instead.

2464 * Command 'named_theorems' declares a dynamic fact within the context,

2465 together with an attribute to maintain the content incrementally. This

2466 supersedes functor Named_Thms in Isabelle/ML, but with a subtle change

2467 of semantics due to external visual order vs. internal reverse order.

2469 * 'find_theorems': search patterns which are abstractions are

2470 schematically expanded before search. Search results match the naive

2471 expectation more closely, particularly wrt. abbreviations.

2472 INCOMPATIBILITY.

2474 * Commands 'method_setup' and 'attribute_setup' now work within a local

2475 theory context.

2477 * Outer syntax commands are managed authentically within the theory

2478 context, without implicit global state. Potential for accidental

2479 INCOMPATIBILITY, make sure that required theories are really imported.

2481 * Historical command-line terminator ";" is no longer accepted (and

2482 already used differently in Isar). Minor INCOMPATIBILITY, use "isabelle

2483 update_semicolons" to remove obsolete semicolons from old theory

2484 sources.

2486 * Structural composition of proof methods (meth1; meth2) in Isar

2487 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.

2489 * The Eisbach proof method language allows to define new proof methods

2490 by combining existing ones with their usual syntax. The "match" proof

2491 method provides basic fact/term matching in addition to

2492 premise/conclusion matching through Subgoal.focus, and binds fact names

2493 from matches as well as term patterns within matches. The Isabelle

2494 documentation provides an entry "eisbach" for the Eisbach User Manual.

2495 Sources and various examples are in ~~/src/HOL/Eisbach/.

2498 *** Prover IDE -- Isabelle/Scala/jEdit ***

2500 * Improved folding mode "isabelle" based on Isar syntax. Alternatively,

2501 the "sidekick" mode may be used for document structure.

2503 * Extended bracket matching based on Isar language structure. System

2504 option jedit_structure_limit determines maximum number of lines to scan

2505 in the buffer.

2507 * Support for BibTeX files: context menu, context-sensitive token

2508 marker, SideKick parser.

2510 * Document antiquotation @{cite} provides formal markup, which is

2511 interpreted semi-formally based on .bib files that happen to be open in

2512 the editor (hyperlinks, completion etc.).

2514 * Less waste of vertical space via negative line spacing (see Global

2515 Options / Text Area).

2517 * Improved graphview panel with optional output of PNG or PDF, for

2518 display of 'thy_deps', 'class_deps' etc.

2520 * The commands 'thy_deps' and 'class_deps' allow optional bounds to

2521 restrict the visualized hierarchy.

2523 * Improved scheduling for asynchronous print commands (e.g. provers

2524 managed by the Sledgehammer panel) wrt. ongoing document processing.

2527 *** Document preparation ***

2529 * Document markup commands 'chapter', 'section', 'subsection',

2530 'subsubsection', 'text', 'txt', 'text_raw' work uniformly in any

2531 context, even before the initial 'theory' command. Obsolete proof

2532 commands 'sect', 'subsect', 'subsubsect', 'txt_raw' have been

2533 discontinued, use 'section', 'subsection', 'subsubsection', 'text_raw'

2534 instead. The old 'header' command is still retained for some time, but

2535 should be replaced by 'chapter', 'section' etc. (using "isabelle

2536 update_header"). Minor INCOMPATIBILITY.

2538 * Official support for "tt" style variants, via \isatt{...} or

2539 \begin{isabellett}...\end{isabellett}. The somewhat fragile \verb or

2540 verbatim environment of LaTeX is no longer used. This allows @{ML} etc.

2541 as argument to other macros (such as footnotes).

2543 * Document antiquotation @{verbatim} prints ASCII text literally in "tt"

2544 style.

2546 * Discontinued obsolete option "document_graph": session_graph.pdf is

2547 produced unconditionally for HTML browser_info and PDF-LaTeX document.

2549 * Diagnostic commands and document markup commands within a proof do not

2550 affect the command tag for output. Thus commands like 'thm' are subject

2551 to proof document structure, and no longer "stick out" accidentally.

2552 Commands 'text' and 'txt' merely differ in the LaTeX style, not their

2553 tags. Potential INCOMPATIBILITY in exotic situations.

2555 * System option "pretty_margin" is superseded by "thy_output_margin",

2556 which is also accessible via document antiquotation option "margin".

2557 Only the margin for document output may be changed, but not the global

2558 pretty printing: that is 76 for plain console output, and adapted

2559 dynamically in GUI front-ends. Implementations of document

2560 antiquotations need to observe the margin explicitly according to

2561 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.

2563 * Specification of 'document_files' in the session ROOT file is

2564 mandatory for document preparation. The legacy mode with implicit

2565 copying of the document/ directory is no longer supported. Minor

2566 INCOMPATIBILITY.

2569 *** Pure ***

2571 * Proof methods with explicit instantiation ("rule_tac", "subgoal_tac"

2572 etc.) allow an optional context of local variables ('for' declaration):

2573 these variables become schematic in the instantiated theorem; this

2574 behaviour is analogous to 'for' in attributes "where" and "of".

2575 Configuration option rule_insts_schematic (default false) controls use

2576 of schematic variables outside the context. Minor INCOMPATIBILITY,

2577 declare rule_insts_schematic = true temporarily and update to use local

2578 variable declarations or dummy patterns instead.

2580 * Explicit instantiation via attributes "where", "of", and proof methods

2581 "rule_tac" with derivatives like "subgoal_tac" etc. admit dummy patterns

2582 ("_") that stand for anonymous local variables.

2584 * Generated schematic variables in standard format of exported facts are

2585 incremented to avoid material in the proof context. Rare

2586 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to

2587 different index.

2589 * Lexical separation of signed and unsigned numerals: categories "num"

2590 and "float" are unsigned. INCOMPATIBILITY: subtle change in precedence

2591 of numeral signs, particularly in expressions involving infix syntax

2592 like "(- 1) ^ n".

2594 * Old inner token category "xnum" has been discontinued. Potential

2595 INCOMPATIBILITY for exotic syntax: may use mixfix grammar with "num"

2596 token category instead.

2599 *** HOL ***

2601 * New (co)datatype package:

2602 - The 'datatype_new' command has been renamed 'datatype'. The old

2603 command of that name is now called 'old_datatype' and is provided

2604 by "~~/src/HOL/Library/Old_Datatype.thy". See

2605 'isabelle doc datatypes' for information on porting.

2606 INCOMPATIBILITY.

2607 - Renamed theorems:

2608 disc_corec ~> corec_disc

2609 disc_corec_iff ~> corec_disc_iff

2610 disc_exclude ~> distinct_disc

2611 disc_exhaust ~> exhaust_disc

2612 disc_map_iff ~> map_disc_iff

2613 sel_corec ~> corec_sel

2614 sel_exhaust ~> exhaust_sel

2615 sel_map ~> map_sel

2616 sel_set ~> set_sel

2617 sel_split ~> split_sel

2618 sel_split_asm ~> split_sel_asm

2619 strong_coinduct ~> coinduct_strong

2620 weak_case_cong ~> case_cong_weak

2621 INCOMPATIBILITY.

2622 - The "no_code" option to "free_constructors", "datatype_new", and

2623 "codatatype" has been renamed "plugins del: code".

2624 INCOMPATIBILITY.

2625 - The rules "set_empty" have been removed. They are easy

2626 consequences of other set rules "by auto".

2627 INCOMPATIBILITY.

2628 - The rule "set_cases" is now registered with the "[cases set]"

2629 attribute. This can influence the behavior of the "cases" proof

2630 method when more than one case rule is applicable (e.g., an

2631 assumption is of the form "w : set ws" and the method "cases w"

2632 is invoked). The solution is to specify the case rule explicitly

2633 (e.g. "cases w rule: widget.exhaust").

2634 INCOMPATIBILITY.

2635 - Renamed theories:

2636 BNF_Comp ~> BNF_Composition

2637 BNF_FP_Base ~> BNF_Fixpoint_Base

2638 BNF_GFP ~> BNF_Greatest_Fixpoint

2639 BNF_LFP ~> BNF_Least_Fixpoint

2640 BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions

2641 Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions

2642 INCOMPATIBILITY.

2643 - Lifting and Transfer setup for basic HOL types sum and prod (also

2644 option) is now performed by the BNF package. Theories Lifting_Sum,

2645 Lifting_Product and Lifting_Option from Main became obsolete and

2646 were removed. Changed definitions of the relators rel_prod and

2647 rel_sum (using inductive).

2648 INCOMPATIBILITY: use rel_prod.simps and rel_sum.simps instead

2649 of rel_prod_def and rel_sum_def.

2650 Minor INCOMPATIBILITY: (rarely used by name) transfer theorem names

2651 changed (e.g. map_prod_transfer ~> prod.map_transfer).

2652 - Parametricity theorems for map functions, relators, set functions,

2653 constructors, case combinators, discriminators, selectors and

2654 (co)recursors are automatically proved and registered as transfer

2655 rules.

2657 * Old datatype package:

2658 - The old 'datatype' command has been renamed 'old_datatype', and

2659 'rep_datatype' has been renamed 'old_rep_datatype'. They are

2660 provided by "~~/src/HOL/Library/Old_Datatype.thy". See

2661 'isabelle doc datatypes' for information on porting.

2662 INCOMPATIBILITY.

2663 - Renamed theorems:

2664 weak_case_cong ~> case_cong_weak

2665 INCOMPATIBILITY.

2666 - Renamed theory:

2667 ~~/src/HOL/Datatype.thy ~> ~~/src/HOL/Library/Old_Datatype.thy

2668 INCOMPATIBILITY.

2670 * Nitpick:

2671 - Fixed soundness bug related to the strict and non-strict subset

2672 operations.

2674 * Sledgehammer:

2675 - CVC4 is now included with Isabelle instead of CVC3 and run by

2676 default.

2677 - Z3 is now always enabled by default, now that it is fully open

2678 source. The "z3_non_commercial" option is discontinued.

2679 - Minimization is now always enabled by default.

2680 Removed sub-command:

2681 min

2682 - Proof reconstruction, both one-liners and Isar, has been

2683 dramatically improved.

2684 - Improved support for CVC4 and veriT.

2686 * Old and new SMT modules:

2687 - The old 'smt' method has been renamed 'old_smt' and moved to

2688 'src/HOL/Library/Old_SMT.thy'. It is provided for compatibility,

2689 until applications have been ported to use the new 'smt' method. For

2690 the method to work, an older version of Z3 (e.g. Z3 3.2 or 4.0) must

2691 be installed, and the environment variable "OLD_Z3_SOLVER" must

2692 point to it.

2693 INCOMPATIBILITY.

2694 - The 'smt2' method has been renamed 'smt'.

2695 INCOMPATIBILITY.

2696 - New option 'smt_reconstruction_step_timeout' to limit the

2697 reconstruction time of Z3 proof steps in the new 'smt' method.

2698 - New option 'smt_statistics' to display statistics of the new 'smt'

2699 method, especially runtime statistics of Z3 proof reconstruction.

2701 * Lifting: command 'lift_definition' allows to execute lifted constants

2702 that have as a return type a datatype containing a subtype. This

2703 overcomes long-time limitations in the area of code generation and

2704 lifting, and avoids tedious workarounds.

2706 * Command and antiquotation "value" provide different evaluation slots

2707 (again), where the previous strategy (NBE after ML) serves as default.

2708 Minor INCOMPATIBILITY.

2710 * Add NO_MATCH-simproc, allows to check for syntactic non-equality.

2712 * field_simps: Use NO_MATCH-simproc for distribution rules, to avoid

2713 non-termination in case of distributing a division. With this change

2714 field_simps is in some cases slightly less powerful, if it fails try to

2715 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.

2717 * Separate class no_zero_divisors has been given up in favour of fully

2718 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.

2720 * Class linordered_semidom really requires no zero divisors.

2721 INCOMPATIBILITY.

2723 * Classes division_ring, field and linordered_field always demand

2724 "inverse 0 = 0". Given up separate classes division_ring_inverse_zero,

2725 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.

2727 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit

2728 additive inverse operation. INCOMPATIBILITY.

2730 * Complex powers and square roots. The functions "ln" and "powr" are now

2731 overloaded for types real and complex, and 0 powr y = 0 by definition.

2732 INCOMPATIBILITY: type constraints may be necessary.

2734 * The functions "sin" and "cos" are now defined for any type of sort

2735 "{real_normed_algebra_1,banach}" type, so in particular on "real" and

2736 "complex" uniformly. Minor INCOMPATIBILITY: type constraints may be

2737 needed.

2739 * New library of properties of the complex transcendental functions sin,

2740 cos, tan, exp, Ln, Arctan, Arcsin, Arccos. Ported from HOL Light.

2742 * The factorial function, "fact", now has type "nat => 'a" (of a sort

2743 that admits numeric types including nat, int, real and complex.

2744 INCOMPATIBILITY: an expression such as "fact 3 = 6" may require a type

2745 constraint, and the combination "real (fact k)" is likely to be

2746 unsatisfactory. If a type conversion is still necessary, then use

2747 "of_nat (fact k)" or "real_of_nat (fact k)".

2749 * Removed functions "natfloor" and "natceiling", use "nat o floor" and

2750 "nat o ceiling" instead. A few of the lemmas have been retained and

2751 adapted: in their names "natfloor"/"natceiling" has been replaced by

2752 "nat_floor"/"nat_ceiling".

2754 * Qualified some duplicated fact names required for boostrapping the

2755 type class hierarchy:

2756 ab_add_uminus_conv_diff ~> diff_conv_add_uminus

2757 field_inverse_zero ~> inverse_zero

2758 field_divide_inverse ~> divide_inverse

2759 field_inverse ~> left_inverse

2760 Minor INCOMPATIBILITY.

2762 * Eliminated fact duplicates:

2763 mult_less_imp_less_right ~> mult_right_less_imp_less

2764 mult_less_imp_less_left ~> mult_left_less_imp_less

2765 Minor INCOMPATIBILITY.

2767 * Fact consolidation: even_less_0_iff is subsumed by

2768 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).

2770 * Generalized and consolidated some theorems concerning divsibility:

2771 dvd_reduce ~> dvd_add_triv_right_iff

2772 dvd_plus_eq_right ~> dvd_add_right_iff

2773 dvd_plus_eq_left ~> dvd_add_left_iff

2774 Minor INCOMPATIBILITY.

2776 * "even" and "odd" are mere abbreviations for "2 dvd _" and "~ 2 dvd _"

2777 and part of theory Main.

2778 even_def ~> even_iff_mod_2_eq_zero

2779 INCOMPATIBILITY.

2781 * Lemma name consolidation: divide_Numeral1 ~> divide_numeral_1. Minor

2782 INCOMPATIBILITY.

2784 * Bootstrap of listsum as special case of abstract product over lists.

2785 Fact rename:

2786 listsum_def ~> listsum.eq_foldr

2787 INCOMPATIBILITY.

2789 * Product over lists via constant "listprod".

2791 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to

2792 Cons_nth_drop_Suc.

2794 * New infrastructure for compiling, running, evaluating and testing

2795 generated code in target languages in HOL/Library/Code_Test. See

2796 HOL/Codegenerator_Test/Code_Test* for examples.

2798 * Library/Multiset:

2799 - Introduced "replicate_mset" operation.

2800 - Introduced alternative characterizations of the multiset ordering in

2801 "Library/Multiset_Order".

2802 - Renamed multiset ordering:

2803 <# ~> #<#

2804 <=# ~> #<=#

2805 \<subset># ~> #\<subset>#

2806 \<subseteq># ~> #\<subseteq>#

2807 INCOMPATIBILITY.

2808 - Introduced abbreviations for ill-named multiset operations:

2809 <#, \<subset># abbreviate < (strict subset)

2810 <=#, \<le>#, \<subseteq># abbreviate <= (subset or equal)

2811 INCOMPATIBILITY.

2812 - Renamed

2813 in_multiset_of ~> in_multiset_in_set

2814 Multiset.fold ~> fold_mset

2815 Multiset.filter ~> filter_mset

2816 INCOMPATIBILITY.

2817 - Removed mcard, is equal to size.

2818 - Added attributes:

2819 image_mset.id [simp]

2820 image_mset_id [simp]

2821 elem_multiset_of_set [simp, intro]

2822 comp_fun_commute_plus_mset [simp]

2823 comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]

2824 in_mset_fold_plus_iff [iff]

2825 set_of_Union_mset [simp]

2826 in_Union_mset_iff [iff]

2827 INCOMPATIBILITY.

2829 * Library/Sum_of_Squares: simplified and improved "sos" method. Always

2830 use local CSDP executable, which is much faster than the NEOS server.

2831 The "sos_cert" functionality is invoked as "sos" with additional

2832 argument. Minor INCOMPATIBILITY.

2834 * HOL-Decision_Procs: New counterexample generator quickcheck

2835 [approximation] for inequalities of transcendental functions. Uses

2836 hardware floating point arithmetic to randomly discover potential

2837 counterexamples. Counterexamples are certified with the "approximation"

2838 method. See HOL/Decision_Procs/ex/Approximation_Quickcheck_Ex.thy for

2839 examples.

2841 * HOL-Probability: Reworked measurability prover

2842 - applies destructor rules repeatedly

2843 - removed application splitting (replaced by destructor rule)

2844 - added congruence rules to rewrite measure spaces under the sets

2845 projection

2847 * New proof method "rewrite" (in theory ~~/src/HOL/Library/Rewrite) for

2848 single-step rewriting with subterm selection based on patterns.

2851 *** ML ***

2853 * Subtle change of name space policy: undeclared entries are now

2854 considered inaccessible, instead of accessible via the fully-qualified

2855 internal name. This mainly affects Name_Space.intern (and derivatives),

2856 which may produce an unexpected Long_Name.hidden prefix. Note that

2857 contemporary applications use the strict Name_Space.check (and

2858 derivatives) instead, which is not affected by the change. Potential

2859 INCOMPATIBILITY in rare applications of Name_Space.intern.

2861 * Subtle change of error semantics of Toplevel.proof_of: regular user

2862 ERROR instead of internal Toplevel.UNDEF.

2864 * Basic combinators map, fold, fold_map, split_list, apply are available

2865 as parameterized antiquotations, e.g. @{map 4} for lists of quadruples.

2867 * Renamed "pairself" to "apply2", in accordance to @{apply 2}.

2868 INCOMPATIBILITY.

2870 * Former combinators NAMED_CRITICAL and CRITICAL for central critical

2871 sections have been discontinued, in favour of the more elementary

2872 Multithreading.synchronized and its high-level derivative

2873 Synchronized.var (which is usually sufficient in applications). Subtle

2874 INCOMPATIBILITY: synchronized access needs to be atomic and cannot be

2875 nested.

2877 * Synchronized.value (ML) is actually synchronized (as in Scala): subtle

2878 change of semantics with minimal potential for INCOMPATIBILITY.

2880 * The main operations to certify logical entities are Thm.ctyp_of and

2881 Thm.cterm_of with a local context; old-style global theory variants are

2882 available as Thm.global_ctyp_of and Thm.global_cterm_of.

2883 INCOMPATIBILITY.

2885 * Elementary operations in module Thm are no longer pervasive.

2886 INCOMPATIBILITY, need to use qualified Thm.prop_of, Thm.cterm_of,

2887 Thm.term_of etc.

2889 * Proper context for various elementary tactics: assume_tac,

2890 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,

2891 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.

2893 * Tactical PARALLEL_ALLGOALS is the most common way to refer to

2894 PARALLEL_GOALS.

2896 * Goal.prove_multi is superseded by the fully general Goal.prove_common,

2897 which also allows to specify a fork priority.

2899 * Antiquotation @{command_spec "COMMAND"} is superseded by

2900 @{command_keyword COMMAND} (usually without quotes and with PIDE

2901 markup). Minor INCOMPATIBILITY.

2903 * Cartouches within ML sources are turned into values of type

2904 Input.source (with formal position information).

2907 *** System ***

2909 * The Isabelle tool "update_cartouches" changes theory files to use

2910 cartouches instead of old-style {* verbatim *} or `alt_string` tokens.

2912 * The Isabelle tool "build" provides new options -X, -k, -x.

2914 * Discontinued old-fashioned "codegen" tool. Code generation can always

2915 be externally triggered using an appropriate ROOT file plus a

2916 corresponding theory. Parametrization is possible using environment

2917 variables, or ML snippets in the most extreme cases. Minor

2918 INCOMPATIBILITY.

2920 * JVM system property "isabelle.threads" determines size of Scala thread

2921 pool, like Isabelle system option "threads" for ML.

2923 * JVM system property "isabelle.laf" determines the default Swing

2924 look-and-feel, via internal class name or symbolic name as in the jEdit

2925 menu Global Options / Appearance.

2927 * Support for Proof General and Isar TTY loop has been discontinued.

2928 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.

2932 New in Isabelle2014 (August 2014)

2933 ---------------------------------

2935 *** General ***

2937 * Support for official Standard ML within the Isabelle context.

2938 Command 'SML_file' reads and evaluates the given Standard ML file.

2939 Toplevel bindings are stored within the theory context; the initial

2940 environment is restricted to the Standard ML implementation of

2941 Poly/ML, without the add-ons of Isabelle/ML. Commands 'SML_import'

2942 and 'SML_export' allow to exchange toplevel bindings between the two

2943 separate environments. See also ~~/src/Tools/SML/Examples.thy for

2944 some examples.

2946 * Standard tactics and proof methods such as "clarsimp", "auto" and

2947 "safe" now preserve equality hypotheses "x = expr" where x is a free

2948 variable. Locale assumptions and chained facts containing "x"

2949 continue to be useful. The new method "hypsubst_thin" and the

2950 configuration option "hypsubst_thin" (within the attribute name space)

2951 restore the previous behavior. INCOMPATIBILITY, especially where

2952 induction is done after these methods or when the names of free and

2953 bound variables clash. As first approximation, old proofs may be

2954 repaired by "using [[hypsubst_thin = true]]" in the critical spot.

2956 * More static checking of proof methods, which allows the system to

2957 form a closure over the concrete syntax. Method arguments should be

2958 processed in the original proof context as far as possible, before

2959 operating on the goal state. In any case, the standard discipline for

2960 subgoal-addressing needs to be observed: no subgoals or a subgoal

2961 number that is out of range produces an empty result sequence, not an

2962 exception. Potential INCOMPATIBILITY for non-conformant tactical

2963 proof tools.

2965 * Lexical syntax (inner and outer) supports text cartouches with

2966 arbitrary nesting, and without escapes of quotes etc. The Prover IDE

2967 supports input via ` (backquote).

2969 * The outer syntax categories "text" (for formal comments and document

2970 markup commands) and "altstring" (for literal fact references) allow

2971 cartouches as well, in addition to the traditional mix of quotations.

2973 * Syntax of document antiquotation @{rail} now uses \<newline> instead

2974 of "\\", to avoid the optical illusion of escaped backslash within

2975 string token. General renovation of its syntax using text cartouches.

2976 Minor INCOMPATIBILITY.

2978 * Discontinued legacy_isub_isup, which was a temporary workaround for

2979 Isabelle/ML in Isabelle2013-1. The prover process no longer accepts

2980 old identifier syntax with \<^isub> or \<^isup>. Potential

2981 INCOMPATIBILITY.

2983 * Document antiquotation @{url} produces markup for the given URL,

2984 which results in an active hyperlink within the text.

2986 * Document antiquotation @{file_unchecked} is like @{file}, but does

2987 not check existence within the file-system.

2989 * Updated and extended manuals: codegen, datatypes, implementation,

2990 isar-ref, jedit, system.

2993 *** Prover IDE -- Isabelle/Scala/jEdit ***

2995 * Improved Document panel: simplified interaction where every single

2996 mouse click (re)opens document via desktop environment or as jEdit

2997 buffer.

2999 * Support for Navigator plugin (with toolbar buttons), with connection

3000 to PIDE hyperlinks.

3002 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.

3003 Open text buffers take precedence over copies within the file-system.

3005 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for

3006 auxiliary ML files.

3008 * Improved syntactic and semantic completion mechanism, with simple

3009 templates, completion language context, name-space completion,

3010 file-name completion, spell-checker completion.

3012 * Refined GUI popup for completion: more robust key/mouse event

3013 handling and propagation to enclosing text area -- avoid loosing

3014 keystrokes with slow / remote graphics displays.

3016 * Completion popup supports both ENTER and TAB (default) to select an

3017 item, depending on Isabelle options.

3019 * Refined insertion of completion items wrt. jEdit text: multiple

3020 selections, rectangular selections, rectangular selection as "tall

3021 caret".

3023 * Integrated spell-checker for document text, comments etc. with

3024 completion popup and context-menu.

3026 * More general "Query" panel supersedes "Find" panel, with GUI access

3027 to commands 'find_theorems' and 'find_consts', as well as print

3028 operations for the context. Minor incompatibility in keyboard

3029 shortcuts etc.: replace action isabelle-find by isabelle-query.

3031 * Search field for all output panels ("Output", "Query", "Info" etc.)

3032 to highlight text via regular expression.

3034 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /

3035 General") allows to specify additional print modes for the prover

3036 process, without requiring old-fashioned command-line invocation of

3037 "isabelle jedit -m MODE".

3039 * More support for remote files (e.g. http) using standard Java

3040 networking operations instead of jEdit virtual file-systems.

3042 * Empty editors buffers that are no longer required (e.g.\ via theory

3043 imports) are automatically removed from the document model.

3045 * Improved monitor panel.

3047 * Improved Console/Scala plugin: more uniform scala.Console output,

3048 more robust treatment of threads and interrupts.

3050 * Improved management of dockable windows: clarified keyboard focus

3051 and window placement wrt. main editor view; optional menu item to

3052 "Detach" a copy where this makes sense.

3054 * New Simplifier Trace panel provides an interactive view of the

3055 simplification process, enabled by the "simp_trace_new" attribute

3056 within the context.

3059 *** Pure ***

3061 * Low-level type-class commands 'classes', 'classrel', 'arities' have

3062 been discontinued to avoid the danger of non-trivial axiomatization

3063 that is not immediately visible. INCOMPATIBILITY, use regular

3064 'instance' command with proof. The required OFCLASS(...) theorem

3065 might be postulated via 'axiomatization' beforehand, or the proof

3066 finished trivially if the underlying class definition is made vacuous

3067 (without any assumptions). See also Isabelle/ML operations

3068 Axclass.class_axiomatization, Axclass.classrel_axiomatization,

3069 Axclass.arity_axiomatization.

3071 * Basic constants of Pure use more conventional names and are always

3072 qualified. Rare INCOMPATIBILITY, but with potentially serious

3073 consequences, notably for tools in Isabelle/ML. The following

3074 renaming needs to be applied:

3076 == ~> Pure.eq

3077 ==> ~> Pure.imp

3078 all ~> Pure.all

3079 TYPE ~> Pure.type

3080 dummy_pattern ~> Pure.dummy_pattern

3082 Systematic porting works by using the following theory setup on a

3083 *previous* Isabelle version to introduce the new name accesses for the

3084 old constants:

3086 setup {*

3087 fn thy => thy

3088 |> Sign.root_path

3089 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="

3090 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"

3091 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"

3092 |> Sign.restore_naming thy

3093 *}

3095 Thus ML antiquotations like @{const_name Pure.eq} may be used already.

3096 Later the application is moved to the current Isabelle version, and

3097 the auxiliary aliases are deleted.

3099 * Attributes "where" and "of" allow an optional context of local

3100 variables ('for' declaration): these variables become schematic in the

3101 instantiated theorem.

3103 * Obsolete attribute "standard" has been discontinued (legacy since

3104 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context

3105 where instantiations with schematic variables are intended (for

3106 declaration commands like 'lemmas' or attributes like "of"). The

3107 following temporary definition may help to port old applications:

3109 attribute_setup standard =

3110 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"

3112 * More thorough check of proof context for goal statements and

3113 attributed fact expressions (concerning background theory, declared

3114 hyps). Potential INCOMPATIBILITY, tools need to observe standard

3115 context discipline. See also Assumption.add_assumes and the more

3116 primitive Thm.assume_hyps.

3118 * Inner syntax token language allows regular quoted strings "..."

3119 (only makes sense in practice, if outer syntax is delimited

3120 differently, e.g. via cartouches).

3122 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,

3123 but the latter is retained some time as Proof General legacy.

3125 * Code generator preprocessor: explicit control of simp tracing on a

3126 per-constant basis. See attribute "code_preproc".

3129 *** HOL ***

3131 * Code generator: enforce case of identifiers only for strict target

3132 language requirements. INCOMPATIBILITY.

3134 * Code generator: explicit proof contexts in many ML interfaces.

3135 INCOMPATIBILITY.

3137 * Code generator: minimize exported identifiers by default. Minor

3138 INCOMPATIBILITY.

3140 * Code generation for SML and OCaml: dropped arcane "no_signatures"

3141 option. Minor INCOMPATIBILITY.

3143 * "declare [[code abort: ...]]" replaces "code_abort ...".

3144 INCOMPATIBILITY.

3146 * "declare [[code drop: ...]]" drops all code equations associated

3147 with the given constants.

3149 * Code generations are provided for make, fields, extend and truncate

3150 operations on records.

3152 * Command and antiquotation "value" are now hardcoded against nbe and

3153 ML. Minor INCOMPATIBILITY.

3155 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.

3157 * The symbol "\<newline>" may be used within char or string literals

3158 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.

3160 * Qualified String.implode and String.explode. INCOMPATIBILITY.

3162 * Simplifier: Enhanced solver of preconditions of rewrite rules can

3163 now deal with conjunctions. For help with converting proofs, the old

3164 behaviour of the simplifier can be restored like this: declare/using

3165 [[simp_legacy_precond]]. This configuration option will disappear

3166 again in the future. INCOMPATIBILITY.

3168 * Simproc "finite_Collect" is no longer enabled by default, due to

3169 spurious crashes and other surprises. Potential INCOMPATIBILITY.

3171 * Moved new (co)datatype package and its dependencies from session

3172 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',

3173 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now

3174 part of theory "Main".

3176 Theory renamings:

3177 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)

3178 Library/Wfrec.thy ~> Wfrec.thy

3179 Library/Zorn.thy ~> Zorn.thy

3180 Cardinals/Order_Relation.thy ~> Order_Relation.thy

3181 Library/Order_Union.thy ~> Cardinals/Order_Union.thy

3182 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy

3183 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy

3184 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy

3185 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy

3186 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy

3187 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy

3188 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy

3189 BNF/BNF_Comp.thy ~> BNF_Comp.thy

3190 BNF/BNF_Def.thy ~> BNF_Def.thy

3191 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy

3192 BNF/BNF_GFP.thy ~> BNF_GFP.thy

3193 BNF/BNF_LFP.thy ~> BNF_LFP.thy

3194 BNF/BNF_Util.thy ~> BNF_Util.thy

3195 BNF/Coinduction.thy ~> Coinduction.thy

3196 BNF/More_BNFs.thy ~> Library/More_BNFs.thy

3197 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy

3198 BNF/Examples/* ~> BNF_Examples/*

3200 New theories:

3201 Wellorder_Extension.thy (split from Zorn.thy)

3202 Library/Cardinal_Notations.thy

3203 Library/BNF_Axomatization.thy

3204 BNF_Examples/Misc_Primcorec.thy

3205 BNF_Examples/Stream_Processor.thy

3207 Discontinued theories:

3208 BNF/BNF.thy

3209 BNF/Equiv_Relations_More.thy

3211 INCOMPATIBILITY.

3213 * New (co)datatype package:

3214 - Command 'primcorec' is fully implemented.

3215 - Command 'datatype_new' generates size functions ("size_xxx" and

3216 "size") as required by 'fun'.

3217 - BNFs are integrated with the Lifting tool and new-style

3218 (co)datatypes with Transfer.

3219 - Renamed commands:

3220 datatype_new_compat ~> datatype_compat

3221 primrec_new ~> primrec

3222 wrap_free_constructors ~> free_constructors

3223 INCOMPATIBILITY.

3224 - The generated constants "xxx_case" and "xxx_rec" have been renamed

3225 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").

3226 INCOMPATIBILITY.

3227 - The constant "xxx_(un)fold" and related theorems are no longer

3228 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually

3229 using "prim(co)rec".

3230 INCOMPATIBILITY.

3231 - No discriminators are generated for nullary constructors by

3232 default, eliminating the need for the odd "=:" syntax.

3233 INCOMPATIBILITY.

3234 - No discriminators or selectors are generated by default by

3235 "datatype_new", unless custom names are specified or the new

3236 "discs_sels" option is passed.

3237 INCOMPATIBILITY.

3239 * Old datatype package:

3240 - The generated theorems "xxx.cases" and "xxx.recs" have been

3241 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->

3242 "sum.case"). INCOMPATIBILITY.

3243 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have

3244 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,

3245 "prod_case" ~> "case_prod"). INCOMPATIBILITY.

3247 * The types "'a list" and "'a option", their set and map functions,

3248 their relators, and their selectors are now produced using the new

3249 BNF-based datatype package.

3251 Renamed constants:

3252 Option.set ~> set_option

3253 Option.map ~> map_option

3254 option_rel ~> rel_option

3256 Renamed theorems:

3257 set_def ~> set_rec[abs_def]

3258 map_def ~> map_rec[abs_def]

3259 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")

3260 option.recs ~> option.rec

3261 list_all2_def ~> list_all2_iff

3262 set.simps ~> set_simps (or the slightly different "list.set")

3263 map.simps ~> list.map

3264 hd.simps ~> list.sel(1)

3265 tl.simps ~> list.sel(2-3)

3266 the.simps ~> option.sel

3268 INCOMPATIBILITY.

3270 * The following map functions and relators have been renamed:

3271 sum_map ~> map_sum

3272 map_pair ~> map_prod

3273 prod_rel ~> rel_prod

3274 sum_rel ~> rel_sum

3275 fun_rel ~> rel_fun

3276 set_rel ~> rel_set

3277 filter_rel ~> rel_filter

3278 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")

3279 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")

3280 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")

3282 INCOMPATIBILITY.

3284 * Lifting and Transfer:

3285 - a type variable as a raw type is supported

3286 - stronger reflexivity prover

3287 - rep_eq is always generated by lift_definition

3288 - setup for Lifting/Transfer is now automated for BNFs

3289 + holds for BNFs that do not contain a dead variable

3290 + relator_eq, relator_mono, relator_distr, relator_domain,

3291 relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,

3292 right_unique, right_total, left_unique, left_total are proved

3293 automatically

3294 + definition of a predicator is generated automatically

3295 + simplification rules for a predicator definition are proved

3296 automatically for datatypes

3297 - consolidation of the setup of Lifting/Transfer

3298 + property that a relator preservers reflexivity is not needed any

3299 more

3300 Minor INCOMPATIBILITY.

3301 + left_total and left_unique rules are now transfer rules

3302 (reflexivity_rule attribute not needed anymore)

3303 INCOMPATIBILITY.

3304 + Domainp does not have to be a separate assumption in

3305 relator_domain theorems (=> more natural statement)

3306 INCOMPATIBILITY.

3307 - registration of code equations is more robust

3308 Potential INCOMPATIBILITY.

3309 - respectfulness proof obligation is preprocessed to a more readable

3310 form

3311 Potential INCOMPATIBILITY.

3312 - eq_onp is always unfolded in respectfulness proof obligation

3313 Potential INCOMPATIBILITY.

3314 - unregister lifting setup for Code_Numeral.integer and

3315 Code_Numeral.natural

3316 Potential INCOMPATIBILITY.

3317 - Lifting.invariant -> eq_onp

3318 INCOMPATIBILITY.

3320 * New internal SAT solver "cdclite" that produces models and proof

3321 traces. This solver replaces the internal SAT solvers "enumerate" and

3322 "dpll". Applications that explicitly used one of these two SAT

3323 solvers should use "cdclite" instead. In addition, "cdclite" is now

3324 the default SAT solver for the "sat" and "satx" proof methods and

3325 corresponding tactics; the old default can be restored using "declare

3326 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.

3328 * SMT module: A new version of the SMT module, temporarily called

3329 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,

3330 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also

3331 supported as oracles. Yices is no longer supported, because no version

3332 of the solver can handle both SMT-LIB 2 and quantifiers.

3334 * Activation of Z3 now works via "z3_non_commercial" system option

3335 (without requiring restart), instead of former settings variable

3336 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu

3337 Plugin Options / Isabelle / General.

3339 * Sledgehammer:

3340 - Z3 can now produce Isar proofs.

3341 - MaSh overhaul:

3342 . New SML-based learning algorithms eliminate the dependency on

3343 Python and increase performance and reliability.

3344 . MaSh and MeSh are now used by default together with the

3345 traditional MePo (Meng-Paulson) relevance filter. To disable

3346 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin

3347 Options / Isabelle / General to "none".

3348 - New option:

3349 smt_proofs

3350 - Renamed options:

3351 isar_compress ~> compress

3352 isar_try0 ~> try0

3354 INCOMPATIBILITY.

3356 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.

3358 * Nitpick:

3359 - Fixed soundness bug whereby mutually recursive datatypes could

3360 take infinite values.

3361 - Fixed soundness bug with low-level number functions such as

3362 "Abs_Integ" and "Rep_Integ".

3363 - Removed "std" option.

3364 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to

3365 "hide_types".

3367 * Metis: Removed legacy proof method 'metisFT'. Use 'metis

3368 (full_types)' instead. INCOMPATIBILITY.

3370 * Try0: Added 'algebra' and 'meson' to the set of proof methods.

3372 * Adjustion of INF and SUP operations:

3373 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.

3374 - Consolidated theorem names containing INFI and SUPR: have INF and

3375 SUP instead uniformly.

3376 - More aggressive normalization of expressions involving INF and Inf

3377 or SUP and Sup.

3378 - INF_image and SUP_image do not unfold composition.

3379 - Dropped facts INF_comp, SUP_comp.

3380 - Default congruence rules strong_INF_cong and strong_SUP_cong, with

3381 simplifier implication in premises. Generalize and replace former

3382 INT_cong, SUP_cong

3384 INCOMPATIBILITY.

3386 * SUP and INF generalized to conditionally_complete_lattice.

3388 * Swapped orientation of facts image_comp and vimage_comp:

3390 image_compose ~> image_comp [symmetric]

3391 image_comp ~> image_comp [symmetric]

3392 vimage_compose ~> vimage_comp [symmetric]

3393 vimage_comp ~> vimage_comp [symmetric]

3395 INCOMPATIBILITY.

3397 * Theory reorganization: split of Big_Operators.thy into

3398 Groups_Big.thy and Lattices_Big.thy.

3400 * Consolidated some facts about big group operators:

3402 setsum_0' ~> setsum.neutral

3403 setsum_0 ~> setsum.neutral_const

3404 setsum_addf ~> setsum.distrib

3405 setsum_cartesian_product ~> setsum.cartesian_product

3406 setsum_cases ~> setsum.If_cases

3407 setsum_commute ~> setsum.commute

3408 setsum_cong ~> setsum.cong

3409 setsum_delta ~> setsum.delta

3410 setsum_delta' ~> setsum.delta'

3411 setsum_diff1' ~> setsum.remove

3412 setsum_empty ~> setsum.empty

3413 setsum_infinite ~> setsum.infinite

3414 setsum_insert ~> setsum.insert

3415 setsum_inter_restrict'' ~> setsum.inter_filter

3416 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left

3417 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right

3418 setsum_mono_zero_left ~> setsum.mono_neutral_left

3419 setsum_mono_zero_right ~> setsum.mono_neutral_right

3420 setsum_reindex ~> setsum.reindex

3421 setsum_reindex_cong ~> setsum.reindex_cong

3422 setsum_reindex_nonzero ~> setsum.reindex_nontrivial

3423 setsum_restrict_set ~> setsum.inter_restrict

3424 setsum_Plus ~> setsum.Plus

3425 setsum_setsum_restrict ~> setsum.commute_restrict

3426 setsum_Sigma ~> setsum.Sigma

3427 setsum_subset_diff ~> setsum.subset_diff

3428 setsum_Un_disjoint ~> setsum.union_disjoint

3429 setsum_UN_disjoint ~> setsum.UNION_disjoint

3430 setsum_Un_Int ~> setsum.union_inter

3431 setsum_Union_disjoint ~> setsum.Union_disjoint

3432 setsum_UNION_zero ~> setsum.Union_comp

3433 setsum_Un_zero ~> setsum.union_inter_neutral

3434 strong_setprod_cong ~> setprod.strong_cong

3435 strong_setsum_cong ~> setsum.strong_cong

3436 setprod_1' ~> setprod.neutral

3437 setprod_1 ~> setprod.neutral_const

3438 setprod_cartesian_product ~> setprod.cartesian_product

3439 setprod_cong ~> setprod.cong

3440 setprod_delta ~> setprod.delta

3441 setprod_delta' ~> setprod.delta'

3442 setprod_empty ~> setprod.empty

3443 setprod_infinite ~> setprod.infinite

3444 setprod_insert ~> setprod.insert

3445 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left

3446 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right

3447 setprod_mono_one_left ~> setprod.mono_neutral_left

3448 setprod_mono_one_right ~> setprod.mono_neutral_right

3449 setprod_reindex ~> setprod.reindex

3450 setprod_reindex_cong ~> setprod.reindex_cong

3451 setprod_reindex_nonzero ~> setprod.reindex_nontrivial

3452 setprod_Sigma ~> setprod.Sigma

3453 setprod_subset_diff ~> setprod.subset_diff

3454 setprod_timesf ~> setprod.distrib

3455 setprod_Un2 ~> setprod.union_diff2

3456 setprod_Un_disjoint ~> setprod.union_disjoint

3457 setprod_UN_disjoint ~> setprod.UNION_disjoint

3458 setprod_Un_Int ~> setprod.union_inter

3459 setprod_Union_disjoint ~> setprod.Union_disjoint

3460 setprod_Un_one ~> setprod.union_inter_neutral

3462 Dropped setsum_cong2 (simple variant of setsum.cong).

3463 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)

3464 Dropped setsum_reindex_id, setprod_reindex_id

3465 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).

3467 INCOMPATIBILITY.

3469 * Abolished slightly odd global lattice interpretation for min/max.

3471 Fact consolidations:

3472 min_max.inf_assoc ~> min.assoc

3473 min_max.inf_commute ~> min.commute

3474 min_max.inf_left_commute ~> min.left_commute

3475 min_max.inf_idem ~> min.idem

3476 min_max.inf_left_idem ~> min.left_idem

3477 min_max.inf_right_idem ~> min.right_idem

3478 min_max.sup_assoc ~> max.assoc

3479 min_max.sup_commute ~> max.commute

3480 min_max.sup_left_commute ~> max.left_commute

3481 min_max.sup_idem ~> max.idem

3482 min_max.sup_left_idem ~> max.left_idem

3483 min_max.sup_inf_distrib1 ~> max_min_distrib2

3484 min_max.sup_inf_distrib2 ~> max_min_distrib1

3485 min_max.inf_sup_distrib1 ~> min_max_distrib2

3486 min_max.inf_sup_distrib2 ~> min_max_distrib1

3487 min_max.distrib ~> min_max_distribs

3488 min_max.inf_absorb1 ~> min.absorb1

3489 min_max.inf_absorb2 ~> min.absorb2

3490 min_max.sup_absorb1 ~> max.absorb1

3491 min_max.sup_absorb2 ~> max.absorb2

3492 min_max.le_iff_inf ~> min.absorb_iff1

3493 min_max.le_iff_sup ~> max.absorb_iff2

3494 min_max.inf_le1 ~> min.cobounded1

3495 min_max.inf_le2 ~> min.cobounded2

3496 le_maxI1, min_max.sup_ge1 ~> max.cobounded1

3497 le_maxI2, min_max.sup_ge2 ~> max.cobounded2

3498 min_max.le_infI1 ~> min.coboundedI1

3499 min_max.le_infI2 ~> min.coboundedI2

3500 min_max.le_supI1 ~> max.coboundedI1

3501 min_max.le_supI2 ~> max.coboundedI2

3502 min_max.less_infI1 ~> min.strict_coboundedI1

3503 min_max.less_infI2 ~> min.strict_coboundedI2

3504 min_max.less_supI1 ~> max.strict_coboundedI1

3505 min_max.less_supI2 ~> max.strict_coboundedI2

3506 min_max.inf_mono ~> min.mono

3507 min_max.sup_mono ~> max.mono

3508 min_max.le_infI, min_max.inf_greatest ~> min.boundedI

3509 min_max.le_supI, min_max.sup_least ~> max.boundedI

3510 min_max.le_inf_iff ~> min.bounded_iff

3511 min_max.le_sup_iff ~> max.bounded_iff

3513 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,

3514 min.left_commute, min.left_idem, max.commute, max.assoc,

3515 max.left_commute, max.left_idem directly.

3517 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,

3518 min.cobounded2, max.cobounded1m max.cobounded2 directly.

3520 For min_ac or max_ac, prefer more general collection ac_simps.

3522 INCOMPATIBILITY.

3524 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>

3525 Inf_fin_le_Sup_fin. INCOMPATIBILITY.

3527 * Qualified constant names Wellfounded.acc, Wellfounded.accp.

3528 INCOMPATIBILITY.

3530 * Fact generalization and consolidation:

3531 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1

3533 INCOMPATIBILITY.

3535 * Purely algebraic definition of even. Fact generalization and

3536 consolidation:

3537 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd

3538 even_zero_(nat|int) ~> even_zero

3540 INCOMPATIBILITY.

3542 * Abolished neg_numeral.

3543 - Canonical representation for minus one is "- 1".

3544 - Canonical representation for other negative numbers is "- (numeral _)".

3545 - When devising rule sets for number calculation, consider the

3546 following canonical cases: 0, 1, numeral _, - 1, - numeral _.

3547 - HOLogic.dest_number also recognizes numerals in non-canonical forms

3548 like "numeral One", "- numeral One", "- 0" and even "- ... - _".

3549 - Syntax for negative numerals is mere input syntax.

3551 INCOMPATIBILITY.

3553 * Reduced name variants for rules on associativity and commutativity:

3555 add_assoc ~> add.assoc

3556 add_commute ~> add.commute

3557 add_left_commute ~> add.left_commute

3558 mult_assoc ~> mult.assoc

3559 mult_commute ~> mult.commute

3560 mult_left_commute ~> mult.left_commute

3561 nat_add_assoc ~> add.assoc

3562 nat_add_commute ~> add.commute

3563 nat_add_left_commute ~> add.left_commute

3564 nat_mult_assoc ~> mult.assoc

3565 nat_mult_commute ~> mult.commute

3566 eq_assoc ~> iff_assoc

3567 eq_left_commute ~> iff_left_commute

3569 INCOMPATIBILITY.

3571 * Fact collections add_ac and mult_ac are considered old-fashioned.

3572 Prefer ac_simps instead, or specify rules

3573 (add|mult).(assoc|commute|left_commute) individually.

3575 * Elimination of fact duplicates:

3576 equals_zero_I ~> minus_unique

3577 diff_eq_0_iff_eq ~> right_minus_eq

3578 nat_infinite ~> infinite_UNIV_nat

3579 int_infinite ~> infinite_UNIV_int

3581 INCOMPATIBILITY.

3583 * Fact name consolidation:

3584 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus

3585 minus_le_self_iff ~> neg_less_eq_nonneg

3586 le_minus_self_iff ~> less_eq_neg_nonpos

3587 neg_less_nonneg ~> neg_less_pos

3588 less_minus_self_iff ~> less_neg_neg [simp]

3590 INCOMPATIBILITY.

3592 * More simplification rules on unary and binary minus:

3593 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,

3594 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,

3595 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,

3596 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,

3597 minus_add_cancel, uminus_add_conv_diff. These correspondingly have

3598 been taken away from fact collections algebra_simps and field_simps.

3599 INCOMPATIBILITY.

3601 To restore proofs, the following patterns are helpful:

3603 a) Arbitrary failing proof not involving "diff_def":

3604 Consider simplification with algebra_simps or field_simps.

3606 b) Lifting rules from addition to subtraction:

3607 Try with "using <rule for addition> of [... "- _" ...]" by simp".

3609 c) Simplification with "diff_def": just drop "diff_def".

3610 Consider simplification with algebra_simps or field_simps;

3611 or the brute way with

3612 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".

3614 * Introduce bdd_above and bdd_below in theory

3615 Conditionally_Complete_Lattices, use them instead of explicitly

3616 stating boundedness of sets.

3618 * ccpo.admissible quantifies only over non-empty chains to allow more

3619 syntax-directed proof rules; the case of the empty chain shows up as

3620 additional case in fixpoint induction proofs. INCOMPATIBILITY.

3622 * Removed and renamed theorems in Series:

3623 summable_le ~> suminf_le

3624 suminf_le ~> suminf_le_const

3625 series_pos_le ~> setsum_le_suminf

3626 series_pos_less ~> setsum_less_suminf

3627 suminf_ge_zero ~> suminf_nonneg

3628 suminf_gt_zero ~> suminf_pos

3629 suminf_gt_zero_iff ~> suminf_pos_iff

3630 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ

3631 suminf_0_le ~> suminf_nonneg [rotate]

3632 pos_summable ~> summableI_nonneg_bounded

3633 ratio_test ~> summable_ratio_test

3635 removed series_zero, replaced by sums_finite

3637 removed auxiliary lemmas:

3639 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,

3640 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,

3641 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,

3642 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,

3643 summable_convergent_sumr_iff, sumr_diff_mult_const

3645 INCOMPATIBILITY.

3647 * Replace (F)DERIV syntax by has_derivative:

3648 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"

3650 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"

3652 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax

3654 - removed constant isDiff

3656 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as

3657 input syntax.

3659 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.

3661 - Renamed FDERIV_... lemmas to has_derivative_...

3663 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV

3665 - removed DERIV_intros, has_derivative_eq_intros

3667 - introduced derivative_intros and deriative_eq_intros which

3668 includes now rules for DERIV, has_derivative and

3669 has_vector_derivative.

3671 - Other renamings:

3672 differentiable_def ~> real_differentiable_def

3673 differentiableE ~> real_differentiableE

3674 fderiv_def ~> has_derivative_at

3675 field_fderiv_def ~> field_has_derivative_at

3676 isDiff_der ~> differentiable_def

3677 deriv_fderiv ~> has_field_derivative_def

3678 deriv_def ~> DERIV_def

3680 INCOMPATIBILITY.

3682 * Include more theorems in continuous_intros. Remove the

3683 continuous_on_intros, isCont_intros collections, these facts are now

3684 in continuous_intros.

3686 * Theorems about complex numbers are now stated only using Re and Im,

3687 the Complex constructor is not used anymore. It is possible to use

3688 primcorec to defined the behaviour of a complex-valued function.

3690 Removed theorems about the Complex constructor from the simpset, they

3691 are available as the lemma collection legacy_Complex_simps. This

3692 especially removes

3694 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".

3696 Instead the reverse direction is supported with

3697 Complex_eq: "Complex a b = a + \<i> * b"

3699 Moved csqrt from Fundamental_Algebra_Theorem to Complex.

3701 Renamings:

3702 Re/Im ~> complex.sel

3703 complex_Re/Im_zero ~> zero_complex.sel

3704 complex_Re/Im_add ~> plus_complex.sel

3705 complex_Re/Im_minus ~> uminus_complex.sel

3706 complex_Re/Im_diff ~> minus_complex.sel

3707 complex_Re/Im_one ~> one_complex.sel

3708 complex_Re/Im_mult ~> times_complex.sel

3709 complex_Re/Im_inverse ~> inverse_complex.sel

3710 complex_Re/Im_scaleR ~> scaleR_complex.sel

3711 complex_Re/Im_i ~> ii.sel

3712 complex_Re/Im_cnj ~> cnj.sel

3713 Re/Im_cis ~> cis.sel

3715 complex_divide_def ~> divide_complex_def

3716 complex_norm_def ~> norm_complex_def

3717 cmod_def ~> norm_complex_de

3719 Removed theorems:

3720 complex_zero_def

3721 complex_add_def

3722 complex_minus_def

3723 complex_diff_def

3724 complex_one_def

3725 complex_mult_def

3726 complex_inverse_def

3727 complex_scaleR_def

3729 INCOMPATIBILITY.

3731 * Theory Lubs moved HOL image to HOL-Library. It is replaced by

3732 Conditionally_Complete_Lattices. INCOMPATIBILITY.

3734 * HOL-Library: new theory src/HOL/Library/Tree.thy.

3736 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it

3737 is subsumed by session Kleene_Algebra in AFP.

3739 * HOL-Library / theory RBT: various constants and facts are hidden;

3740 lifting setup is unregistered. INCOMPATIBILITY.

3742 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.

3744 * HOL-Word: bit representations prefer type bool over type bit.

3745 INCOMPATIBILITY.

3747 * HOL-Word:

3748 - Abandoned fact collection "word_arith_alts", which is a duplicate

3749 of "word_arith_wis".

3750 - Dropped first (duplicated) element in fact collections

3751 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",

3752 "uint_word_arith_bintrs".

3754 * HOL-Number_Theory:

3755 - consolidated the proofs of the binomial theorem

3756 - the function fib is again of type nat => nat and not overloaded

3757 - no more references to Old_Number_Theory in the HOL libraries

3758 (except the AFP)

3760 INCOMPATIBILITY.

3762 * HOL-Multivariate_Analysis:

3763 - Type class ordered_real_vector for ordered vector spaces.

3764 - New theory Complex_Basic_Analysis defining complex derivatives,

3765 holomorphic functions, etc., ported from HOL Light's canal.ml.

3766 - Changed order of ordered_euclidean_space to be compatible with

3767 pointwise ordering on products. Therefore instance of

3768 conditionally_complete_lattice and ordered_real_vector.

3769 INCOMPATIBILITY: use box instead of greaterThanLessThan or

3770 explicit set-comprehensions with eucl_less for other (half-)open

3771 intervals.

3772 - removed dependencies on type class ordered_euclidean_space with

3773 introduction of "cbox" on euclidean_space

3774 - renamed theorems:

3775 interval ~> box

3776 mem_interval ~> mem_box

3777 interval_eq_empty ~> box_eq_empty

3778 interval_ne_empty ~> box_ne_empty

3779 interval_sing(1) ~> cbox_sing

3780 interval_sing(2) ~> box_sing

3781 subset_interval_imp ~> subset_box_imp

3782 subset_interval ~> subset_box

3783 open_interval ~> open_box

3784 closed_interval ~> closed_cbox

3785 interior_closed_interval ~> interior_cbox

3786 bounded_closed_interval ~> bounded_cbox

3787 compact_interval ~> compact_cbox

3788 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric

3789 bounded_subset_closed_interval ~> bounded_subset_cbox

3790 mem_interval_componentwiseI ~> mem_box_componentwiseI

3791 convex_box ~> convex_prod

3792 rel_interior_real_interval ~> rel_interior_real_box

3793 convex_interval ~> convex_box

3794 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox

3795 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox

3796 content_closed_interval' ~> content_cbox'

3797 elementary_subset_interval ~> elementary_subset_box

3798 diameter_closed_interval ~> diameter_cbox

3799 frontier_closed_interval ~> frontier_cbox

3800 frontier_open_interval ~> frontier_box

3801 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric

3802 closure_open_interval ~> closure_box

3803 open_closed_interval_convex ~> open_cbox_convex

3804 open_interval_midpoint ~> box_midpoint

3805 content_image_affinity_interval ~> content_image_affinity_cbox

3806 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval

3807 bounded_interval ~> bounded_closed_interval + bounded_boxes

3809 - respective theorems for intervals over the reals:

3810 content_closed_interval + content_cbox

3811 has_integral + has_integral_real

3812 fine_division_exists + fine_division_exists_real

3813 has_integral_null + has_integral_null_real

3814 tagged_division_union_interval + tagged_division_union_interval_real

3815 has_integral_const + has_integral_const_real

3816 integral_const + integral_const_real

3817 has_integral_bound + has_integral_bound_real

3818 integrable_continuous + integrable_continuous_real

3819 integrable_subinterval + integrable_subinterval_real

3820 has_integral_reflect_lemma + has_integral_reflect_lemma_real

3821 integrable_reflect + integrable_reflect_real

3822 integral_reflect + integral_reflect_real

3823 image_affinity_interval + image_affinity_cbox

3824 image_smult_interval + image_smult_cbox

3825 integrable_const + integrable_const_ivl

3826 integrable_on_subinterval + integrable_on_subcbox

3828 - renamed theorems:

3829 derivative_linear ~> has_derivative_bounded_linear

3830 derivative_is_linear ~> has_derivative_linear

3831 bounded_linear_imp_linear ~> bounded_linear.linear

3833 * HOL-Probability:

3834 - Renamed positive_integral to nn_integral:

3836 . Renamed all lemmas "*positive_integral*" to *nn_integral*"

3837 positive_integral_positive ~> nn_integral_nonneg

3839 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.

3841 - replaced the Lebesgue integral on real numbers by the more general

3842 Bochner integral for functions into a real-normed vector space.

3844 integral_zero ~> integral_zero / integrable_zero

3845 integral_minus ~> integral_minus / integrable_minus

3846 integral_add ~> integral_add / integrable_add

3847 integral_diff ~> integral_diff / integrable_diff

3848 integral_setsum ~> integral_setsum / integrable_setsum

3849 integral_multc ~> integral_mult_left / integrable_mult_left

3850 integral_cmult ~> integral_mult_right / integrable_mult_right

3851 integral_triangle_inequality~> integral_norm_bound

3852 integrable_nonneg ~> integrableI_nonneg

3853 integral_positive ~> integral_nonneg_AE

3854 integrable_abs_iff ~> integrable_abs_cancel

3855 positive_integral_lim_INF ~> nn_integral_liminf

3856 lebesgue_real_affine ~> lborel_real_affine

3857 borel_integral_has_integral ~> has_integral_lebesgue_integral

3858 integral_indicator ~>

3859 integral_real_indicator / integrable_real_indicator

3860 positive_integral_fst ~> nn_integral_fst'

3861 positive_integral_fst_measurable ~> nn_integral_fst

3862 positive_integral_snd_measurable ~> nn_integral_snd

3864 integrable_fst_measurable ~>

3865 integral_fst / integrable_fst / AE_integrable_fst

3867 integrable_snd_measurable ~>

3868 integral_snd / integrable_snd / AE_integrable_snd

3870 integral_monotone_convergence ~>

3871 integral_monotone_convergence / integrable_monotone_convergence

3873 integral_monotone_convergence_at_top ~>

3874 integral_monotone_convergence_at_top /

3875 integrable_monotone_convergence_at_top

3877 has_integral_iff_positive_integral_lebesgue ~>

3878 has_integral_iff_has_bochner_integral_lebesgue_nonneg

3880 lebesgue_integral_has_integral ~>

3881 has_integral_integrable_lebesgue_nonneg

3883 positive_integral_lebesgue_has_integral ~>

3884 integral_has_integral_lebesgue_nonneg /

3885 integrable_has_integral_lebesgue_nonneg

3887 lebesgue_integral_real_affine ~>

3888 nn_integral_real_affine

3890 has_integral_iff_positive_integral_lborel ~>

3891 integral_has_integral_nonneg / integrable_has_integral_nonneg

3893 The following theorems where removed:

3895 lebesgue_integral_nonneg

3896 lebesgue_integral_uminus

3897 lebesgue_integral_cmult

3898 lebesgue_integral_multc

3899 lebesgue_integral_cmult_nonneg

3900 integral_cmul_indicator

3901 integral_real

3903 - Formalized properties about exponentially, Erlang, and normal

3904 distributed random variables.

3906 * HOL-Decision_Procs: Separate command 'approximate' for approximative

3907 computation in src/HOL/Decision_Procs/Approximation. Minor

3908 INCOMPATIBILITY.

3911 *** Scala ***

3913 * The signature and semantics of Document.Snapshot.cumulate_markup /

3914 select_markup have been clarified. Markup is now traversed in the

3915 order of reports given by the prover: later markup is usually more

3916 specific and may override results accumulated so far. The elements

3917 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.

3919 * Substantial reworking of internal PIDE protocol communication

3920 channels. INCOMPATIBILITY.

3923 *** ML ***

3925 * Subtle change of semantics of Thm.eq_thm: theory stamps are not

3926 compared (according to Thm.thm_ord), but assumed to be covered by the

3927 current background theory. Thus equivalent data produced in different

3928 branches of the theory graph usually coincides (e.g. relevant for

3929 theory merge). Note that the softer Thm.eq_thm_prop is often more

3930 appropriate than Thm.eq_thm.

3932 * Proper context for basic Simplifier operations: rewrite_rule,

3933 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to

3934 pass runtime Proof.context (and ensure that the simplified entity

3935 actually belongs to it).

3937 * Proper context discipline for read_instantiate and instantiate_tac:

3938 variables that are meant to become schematic need to be given as

3939 fixed, and are generalized by the explicit context of local variables.

3940 This corresponds to Isar attributes "where" and "of" with 'for'

3941 declaration. INCOMPATIBILITY, also due to potential change of indices

3942 of schematic variables.

3944 * Moved ML_Compiler.exn_trace and other operations on exceptions to

3945 structure Runtime. Minor INCOMPATIBILITY.

3947 * Discontinued old Toplevel.debug in favour of system option

3948 "ML_exception_trace", which may be also declared within the context

3949 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.

3951 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor

3952 INCOMPATIBILITY.

3954 * Configuration option "ML_print_depth" controls the pretty-printing

3955 depth of the ML compiler within the context. The old print_depth in

3956 ML is still available as default_print_depth, but rarely used. Minor

3957 INCOMPATIBILITY.

3959 * Toplevel function "use" refers to raw ML bootstrap environment,

3960 without Isar context nor antiquotations. Potential INCOMPATIBILITY.

3961 Note that 'ML_file' is the canonical command to load ML files into the

3962 formal context.

3964 * Simplified programming interface to define ML antiquotations, see

3965 structure ML_Antiquotation. Minor INCOMPATIBILITY.

3967 * ML antiquotation @{here} refers to its source position, which is

3968 occasionally useful for experimentation and diagnostic purposes.

3970 * ML antiquotation @{path} produces a Path.T value, similarly to

3971 Path.explode, but with compile-time check against the file-system and

3972 some PIDE markup. Note that unlike theory source, ML does not have a

3973 well-defined master directory, so an absolute symbolic path

3974 specification is usually required, e.g. "~~/src/HOL".

3976 * ML antiquotation @{print} inlines a function to print an arbitrary

3977 ML value, which is occasionally useful for diagnostic or demonstration

3978 purposes.

3981 *** System ***

3983 * Proof General with its traditional helper scripts is now an optional

3984 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle

3985 component repository http://isabelle.in.tum.de/components/. Note that

3986 the "system" manual provides general explanations about add-on

3987 components, especially those that are not bundled with the release.

3989 * The raw Isabelle process executable has been renamed from

3990 "isabelle-process" to "isabelle_process", which conforms to common

3991 shell naming conventions, and allows to define a shell function within

3992 the Isabelle environment to avoid dynamic path lookup. Rare

3993 incompatibility for old tools that do not use the ISABELLE_PROCESS

3994 settings variable.

3996 * Former "isabelle tty" has been superseded by "isabelle console",

3997 with implicit build like "isabelle jedit", and without the mostly

3998 obsolete Isar TTY loop.

4000 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER

4001 and PDF_VIEWER now refer to the actual programs, not shell

4002 command-lines. Discontinued option -c: invocation may be asynchronous

4003 via desktop environment, without any special precautions. Potential

4004 INCOMPATIBILITY with ambitious private settings.

4006 * Removed obsolete "isabelle unsymbolize". Note that the usual format

4007 for email communication is the Unicode rendering of Isabelle symbols,

4008 as produced by Isabelle/jEdit, for example.

4010 * Removed obsolete tool "wwwfind". Similar functionality may be

4011 integrated into Isabelle/jEdit eventually.

4013 * Improved 'display_drafts' concerning desktop integration and

4014 repeated invocation in PIDE front-end: re-use single file

4015 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.

4017 * Session ROOT specifications require explicit 'document_files' for

4018 robust dependencies on LaTeX sources. Only these explicitly given

4019 files are copied to the document output directory, before document

4020 processing is started.

4022 * Windows: support for regular TeX installation (e.g. MiKTeX) instead

4023 of TeX Live from Cygwin.

4027 New in Isabelle2013-2 (December 2013)

4028 -------------------------------------

4030 *** Prover IDE -- Isabelle/Scala/jEdit ***

4032 * More robust editing of running commands with internal forks,

4033 e.g. non-terminating 'by' steps.

4035 * More relaxed Sledgehammer panel: avoid repeated application of query

4036 after edits surrounding the command location.

4038 * More status information about commands that are interrupted

4039 accidentally (via physical event or Poly/ML runtime system signal,

4040 e.g. out-of-memory).

4043 *** System ***

4045 * More robust termination of external processes managed by

4046 Isabelle/ML: support cancellation of tasks within the range of

4047 milliseconds, as required for PIDE document editing with automatically

4048 tried tools (e.g. Sledgehammer).

4050 * Reactivated Isabelle/Scala kill command for external processes on

4051 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a

4052 workaround for some Debian/Ubuntu Linux versions from 2013.

4056 New in Isabelle2013-1 (November 2013)

4057 -------------------------------------

4059 *** General ***

4061 * Discontinued obsolete 'uses' within theory header. Note that

4062 commands like 'ML_file' work without separate declaration of file

4063 dependencies. Minor INCOMPATIBILITY.

4065 * Discontinued redundant 'use' command, which was superseded by

4066 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.

4068 * Simplified subscripts within identifiers, using plain \<^sub>

4069 instead of the second copy \<^isub> and \<^isup>. Superscripts are

4070 only for literal tokens within notation; explicit mixfix annotations

4071 for consts or fixed variables may be used as fall-back for unusual

4072 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in

4073 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to

4074 standardize symbols as a starting point for further manual cleanup.

4075 The ML reference variable "legacy_isub_isup" may be set as temporary

4076 workaround, to make the prover accept a subset of the old identifier

4077 syntax.

4079 * Document antiquotations: term style "isub" has been renamed to

4080 "sub". Minor INCOMPATIBILITY.

4082 * Uniform management of "quick_and_dirty" as system option (see also

4083 "isabelle options"), configuration option within the context (see also

4084 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor

4085 INCOMPATIBILITY, need to use more official Isabelle means to access

4086 quick_and_dirty, instead of historical poking into mutable reference.

4088 * Renamed command 'print_configs' to 'print_options'. Minor

4089 INCOMPATIBILITY.

4091 * Proper diagnostic command 'print_state'. Old 'pr' (with its

4092 implicit change of some global references) is retained for now as

4093 control command, e.g. for ProofGeneral 3.7.x.

4095 * Discontinued 'print_drafts' command with its old-fashioned PS output

4096 and Unix command-line print spooling. Minor INCOMPATIBILITY: use

4097 'display_drafts' instead and print via the regular document viewer.

4099 * Updated and extended "isar-ref" and "implementation" manual,

4100 eliminated old "ref" manual.

4103 *** Prover IDE -- Isabelle/Scala/jEdit ***

4105 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or

4106 Documentation panel.

4108 * Dockable window "Documentation" provides access to Isabelle

4109 documentation.

4111 * Dockable window "Find" provides query operations for formal entities

4112 (GUI front-end to 'find_theorems' command).

4114 * Dockable window "Sledgehammer" manages asynchronous / parallel

4115 sledgehammer runs over existing document sources, independently of

4116 normal editing and checking process.

4118 * Dockable window "Timing" provides an overview of relevant command

4119 timing information, depending on option jedit_timing_threshold. The

4120 same timing information is shown in the extended tooltip of the

4121 command keyword, when hovering the mouse over it while the CONTROL or

4122 COMMAND modifier is pressed.

4124 * Improved dockable window "Theories": Continuous checking of proof

4125 document (visible and required parts) may be controlled explicitly,

4126 using check box or shortcut "C+e ENTER". Individual theory nodes may

4127 be marked explicitly as required and checked in full, using check box

4128 or shortcut "C+e SPACE".

4130 * Improved completion mechanism, which is now managed by the

4131 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle

4132 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).

4134 * Standard jEdit keyboard shortcut C+b complete-word is remapped to

4135 isabelle.complete for explicit completion in Isabelle sources.

4136 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts

4137 to resolve conflict.

4139 * Improved support of various "minor modes" for Isabelle NEWS,

4140 options, session ROOT etc., with completion and SideKick tree view.

4142 * Strictly monotonic document update, without premature cancellation of

4143 running transactions that are still needed: avoid reset/restart of

4144 such command executions while editing.

4146 * Support for asynchronous print functions, as overlay to existing

4147 document content.

4149 * Support for automatic tools in HOL, which try to prove or disprove

4150 toplevel theorem statements.

4152 * Action isabelle.reset-font-size resets main text area font size

4153 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see

4154 also "Plugin Options / Isabelle / General"). It can be bound to some

4155 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).

4157 * File specifications in jEdit (e.g. file browser) may refer to

4158 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued

4159 obsolete $ISABELLE_HOME_WINDOWS variable.

4161 * Improved support for Linux look-and-feel "GTK+", see also "Utilities

4162 / Global Options / Appearance".

4164 * Improved support of native Mac OS X functionality via "MacOSX"

4165 plugin, which is now enabled by default.

4168 *** Pure ***

4170 * Commands 'interpretation' and 'sublocale' are now target-sensitive.

4171 In particular, 'interpretation' allows for non-persistent

4172 interpretation within "context ... begin ... end" blocks offering a

4173 light-weight alternative to 'sublocale'. See "isar-ref" manual for

4174 details.

4176 * Improved locales diagnostic command 'print_dependencies'.

4178 * Discontinued obsolete 'axioms' command, which has been marked as

4179 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'

4180 instead, while observing its uniform scope for polymorphism.

4182 * Discontinued empty name bindings in 'axiomatization'.

4183 INCOMPATIBILITY.

4185 * System option "proofs" has been discontinued. Instead the global

4186 state of Proofterm.proofs is persistently compiled into logic images

4187 as required, notably HOL-Proofs. Users no longer need to change

4188 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.

4190 * Syntax translation functions (print_translation etc.) always depend

4191 on Proof.context. Discontinued former "(advanced)" option -- this is

4192 now the default. Minor INCOMPATIBILITY.

4194 * Former global reference trace_unify_fail is now available as

4195 configuration option "unify_trace_failure" (global context only).

4197 * SELECT_GOAL now retains the syntactic context of the overall goal

4198 state (schematic variables etc.). Potential INCOMPATIBILITY in rare

4199 situations.

4202 *** HOL ***

4204 * Stronger precedence of syntax for big intersection and union on

4205 sets, in accordance with corresponding lattice operations.

4206 INCOMPATIBILITY.

4208 * Notation "{p:A. P}" now allows tuple patterns as well.

4210 * Nested case expressions are now translated in a separate check phase

4211 rather than during parsing. The data for case combinators is separated

4212 from the datatype package. The declaration attribute

4213 "case_translation" can be used to register new case combinators:

4215 declare [[case_translation case_combinator constructor1 ... constructorN]]

4217 * Code generator:

4218 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /

4219 'code_instance'.

4220 - 'code_identifier' declares name hints for arbitrary identifiers in

4221 generated code, subsuming 'code_modulename'.

4223 See the isar-ref manual for syntax diagrams, and the HOL theories for

4224 examples.

4226 * Attibute 'code': 'code' now declares concrete and abstract code

4227 equations uniformly. Use explicit 'code equation' and 'code abstract'

4228 to distinguish both when desired.

4230 * Discontinued theories Code_Integer and Efficient_Nat by a more

4231 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,

4232 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code

4233 generation for details. INCOMPATIBILITY.

4235 * Numeric types are mapped by default to target language numerals:

4236 natural (replaces former code_numeral) and integer (replaces former

4237 code_int). Conversions are available as integer_of_natural /

4238 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and

4239 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in

4240 ML). INCOMPATIBILITY.

4242 * Function package: For mutually recursive functions f and g, separate

4243 cases rules f.cases and g.cases are generated instead of unusable

4244 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,

4245 in the case that the unusable rule was used nevertheless.

4247 * Function package: For each function f, new rules f.elims are

4248 generated, which eliminate equalities of the form "f x = t".

4250 * New command 'fun_cases' derives ad-hoc elimination rules for

4251 function equations as simplified instances of f.elims, analogous to

4252 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.

4254 * Lifting:

4255 - parametrized correspondence relations are now supported:

4256 + parametricity theorems for the raw term can be specified in

4257 the command lift_definition, which allow us to generate stronger

4258 transfer rules

4259 + setup_lifting generates stronger transfer rules if parametric

4260 correspondence relation can be generated

4261 + various new properties of the relator must be specified to support

4262 parametricity

4263 + parametricity theorem for the Quotient relation can be specified

4264 - setup_lifting generates domain rules for the Transfer package

4265 - stronger reflexivity prover of respectfulness theorems for type

4266 copies

4267 - ===> and --> are now local. The symbols can be introduced

4268 by interpreting the locale lifting_syntax (typically in an

4269 anonymous context)

4270 - Lifting/Transfer relevant parts of Library/Quotient_* are now in

4271 Main. Potential INCOMPATIBILITY

4272 - new commands for restoring and deleting Lifting/Transfer context:

4273 lifting_forget, lifting_update

4274 - the command print_quotmaps was renamed to print_quot_maps.

4275 INCOMPATIBILITY

4277 * Transfer:

4278 - better support for domains in Transfer: replace Domainp T

4279 by the actual invariant in a transferred goal

4280 - transfer rules can have as assumptions other transfer rules

4281 - Experimental support for transferring from the raw level to the

4282 abstract level: Transfer.transferred attribute

4283 - Attribute version of the transfer method: untransferred attribute

4285 * Reification and reflection:

4286 - Reification is now directly available in HOL-Main in structure

4287 "Reification".

4288 - Reflection now handles multiple lists with variables also.

4289 - The whole reflection stack has been decomposed into conversions.

4290 INCOMPATIBILITY.

4292 * Revised devices for recursive definitions over finite sets:

4293 - Only one fundamental fold combinator on finite set remains:

4294 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b

4295 This is now identity on infinite sets.

4296 - Locales ("mini packages") for fundamental definitions with

4297 Finite_Set.fold: folding, folding_idem.

4298 - Locales comm_monoid_set, semilattice_order_set and

4299 semilattice_neutr_order_set for big operators on sets.

4300 See theory Big_Operators for canonical examples.

4301 Note that foundational constants comm_monoid_set.F and

4302 semilattice_set.F correspond to former combinators fold_image

4303 and fold1 respectively. These are now gone. You may use

4304 those foundational constants as substitutes, but it is

4305 preferable to interpret the above locales accordingly.

4306 - Dropped class ab_semigroup_idem_mult (special case of lattice,

4307 no longer needed in connection with Finite_Set.fold etc.)

4308 - Fact renames:

4309 card.union_inter ~> card_Un_Int [symmetric]

4310 card.union_disjoint ~> card_Un_disjoint

4311 INCOMPATIBILITY.

4313 * Locale hierarchy for abstract orderings and (semi)lattices.

4315 * Complete_Partial_Order.admissible is defined outside the type class

4316 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the

4317 class predicate assumption or sort constraint when possible.

4318 INCOMPATIBILITY.

4320 * Introduce type class "conditionally_complete_lattice": Like a

4321 complete lattice but does not assume the existence of the top and

4322 bottom elements. Allows to generalize some lemmas about reals and

4323 extended reals. Removed SupInf and replaced it by the instantiation

4324 of conditionally_complete_lattice for real. Renamed lemmas about

4325 conditionally-complete lattice from Sup_... to cSup_... and from

4326 Inf_... to cInf_... to avoid hidding of similar complete lattice

4327 lemmas.

4329 * Introduce type class linear_continuum as combination of

4330 conditionally-complete lattices and inner dense linorders which have

4331 more than one element. INCOMPATIBILITY.

4333 * Introduced type classes order_top and order_bot. The old classes top

4334 and bot only contain the syntax without assumptions. INCOMPATIBILITY:

4335 Rename bot -> order_bot, top -> order_top

4337 * Introduce type classes "no_top" and "no_bot" for orderings without

4338 top and bottom elements.

4340 * Split dense_linorder into inner_dense_order and no_top, no_bot.

4342 * Complex_Main: Unify and move various concepts from

4343 HOL-Multivariate_Analysis to HOL-Complex_Main.

4345 - Introduce type class (lin)order_topology and

4346 linear_continuum_topology. Allows to generalize theorems about

4347 limits and order. Instances are reals and extended reals.

4349 - continuous and continuos_on from Multivariate_Analysis:

4350 "continuous" is the continuity of a function at a filter. "isCont"

4351 is now an abbrevitation: "isCont x f == continuous (at _) f".

4353 Generalized continuity lemmas from isCont to continuous on an

4354 arbitrary filter.

4356 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove

4357 compactness of closed intervals on reals. Continuous functions

4358 attain infimum and supremum on compact sets. The inverse of a

4359 continuous function is continuous, when the function is continuous

4360 on a compact set.

4362 - connected from Multivariate_Analysis. Use it to prove the

4363 intermediate value theorem. Show connectedness of intervals on

4364 linear_continuum_topology).

4366 - first_countable_topology from Multivariate_Analysis. Is used to

4367 show equivalence of properties on the neighbourhood filter of x and

4368 on all sequences converging to x.

4370 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved

4371 theorems from Library/FDERIV.thy to Deriv.thy and base the

4372 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV

4373 which are restricted to sets, i.e. to represent derivatives from

4374 left or right.

4376 - Removed the within-filter. It is replaced by the principal filter:

4378 F within X = inf F (principal X)

4380 - Introduce "at x within U" as a single constant, "at x" is now an

4381 abbreviation for "at x within UNIV"

4383 - Introduce named theorem collections tendsto_intros,

4384 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems

4385 in tendsto_intros (or FDERIV_intros) are also available as

4386 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side

4387 is replaced by a congruence rule. This allows to apply them as

4388 intro rules and then proving equivalence by the simplifier.

4390 - Restructured theories in HOL-Complex_Main:

4392 + Moved RealDef and RComplete into Real

4394 + Introduced Topological_Spaces and moved theorems about

4395 topological spaces, filters, limits and continuity to it

4397 + Renamed RealVector to Real_Vector_Spaces

4399 + Split Lim, SEQ, Series into Topological_Spaces,

4400 Real_Vector_Spaces, and Limits

4402 + Moved Ln and Log to Transcendental

4404 + Moved theorems about continuity from Deriv to Topological_Spaces

4406 - Remove various auxiliary lemmas.

4408 INCOMPATIBILITY.

4410 * Nitpick:

4411 - Added option "spy".

4412 - Reduce incidence of "too high arity" errors.

4414 * Sledgehammer:

4415 - Renamed option:

4416 isar_shrink ~> isar_compress

4417 INCOMPATIBILITY.

4418 - Added options "isar_try0", "spy".

4419 - Better support for "isar_proofs".

4420 - MaSh has been fined-tuned and now runs as a local server.

4422 * Improved support for ad hoc overloading of constants (see also

4423 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).

4425 * Library/Polynomial.thy:

4426 - Use lifting for primitive definitions.

4427 - Explicit conversions from and to lists of coefficients, used for

4428 generated code.

4429 - Replaced recursion operator poly_rec by fold_coeffs.

4430 - Prefer pre-existing gcd operation for gcd.

4431 - Fact renames:

4432 poly_eq_iff ~> poly_eq_poly_eq_iff

4433 poly_ext ~> poly_eqI

4434 expand_poly_eq ~> poly_eq_iff

4435 IMCOMPATIBILITY.

4437 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and

4438 case_of_simps to convert function definitions between a list of

4439 equations with patterns on the lhs and a single equation with case

4440 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.

4442 * New Library/FSet.thy: type of finite sets defined as a subtype of

4443 sets defined by Lifting/Transfer.

4445 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.

4447 * Consolidation of library theories on product orders:

4449 Product_Lattice ~> Product_Order -- pointwise order on products

4450 Product_ord ~> Product_Lexorder -- lexicographic order on products

4452 INCOMPATIBILITY.

4454 * Imperative-HOL: The MREC combinator is considered legacy and no

4455 longer included by default. INCOMPATIBILITY, use partial_function

4456 instead, or import theory Legacy_Mrec as a fallback.

4458 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and

4459 ~~/src/HOL/Algebra/poly. Existing theories should be based on

4460 ~~/src/HOL/Library/Polynomial instead. The latter provides

4461 integration with HOL's type classes for rings. INCOMPATIBILITY.

4463 * HOL-BNF:

4464 - Various improvements to BNF-based (co)datatype package, including

4465 new commands "primrec_new", "primcorec", and

4466 "datatype_new_compat", as well as documentation. See

4467 "datatypes.pdf" for details.

4468 - New "coinduction" method to avoid some boilerplate (compared to

4469 coinduct).

4470 - Renamed keywords:

4471 data ~> datatype_new

4472 codata ~> codatatype

4473 bnf_def ~> bnf

4474 - Renamed many generated theorems, including

4475 discs ~> disc

4476 map_comp' ~> map_comp

4477 map_id' ~> map_id

4478 sels ~> sel

4479 set_map' ~> set_map

4480 sets ~> set

4481 IMCOMPATIBILITY.

4484 *** ML ***

4486 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function

4487 "check_property" allows to check specifications of the form "ALL x y

4488 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its

4489 Examples.thy in particular.

4491 * Improved printing of exception trace in Poly/ML 5.5.1, with regular

4492 tracing output in the command transaction context instead of physical

4493 stdout. See also Toplevel.debug, Toplevel.debugging and

4494 ML_Compiler.exn_trace.

4496 * ML type "theory" is now immutable, without any special treatment of

4497 drafts or linear updates (which could lead to "stale theory" errors in

4498 the past). Discontinued obsolete operations like Theory.copy,

4499 Theory.checkpoint, and the auxiliary type theory_ref. Minor

4500 INCOMPATIBILITY.

4502 * More uniform naming of goal functions for skipped proofs:

4504 Skip_Proof.prove ~> Goal.prove_sorry

4505 Skip_Proof.prove_global ~> Goal.prove_sorry_global

4507 Minor INCOMPATIBILITY.

4509 * Simplifier tactics and tools use proper Proof.context instead of

4510 historic type simpset. Old-style declarations like addsimps,

4511 addsimprocs etc. operate directly on Proof.context. Raw type simpset

4512 retains its use as snapshot of the main Simplifier context, using

4513 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port

4514 old tools by making them depend on (ctxt : Proof.context) instead of

4515 (ss : simpset), then turn (simpset_of ctxt) into ctxt.

4517 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)

4518 operate on Proof.context instead of claset, for uniformity with addIs,

4519 addEs, addDs etc. Note that claset_of and put_claset allow to manage

4520 clasets separately from the context.

4522 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.

4523 INCOMPATIBILITY, use @{context} instead.

4525 * Antiquotation @{theory_context A} is similar to @{theory A}, but

4526 presents the result as initial Proof.context.

4529 *** System ***

4531 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by

4532 "isabelle build" in Isabelle2013. INCOMPATIBILITY.

4534 * Discontinued obsolete isabelle-process options -f and -u (former

4535 administrative aliases of option -e). Minor INCOMPATIBILITY.

4537 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND

4538 settings variable.

4540 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic

4541 document formats: dvi.gz, ps, ps.gz -- the default document format is

4542 always pdf.

4544 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to

4545 specify global resources of the JVM process run by isabelle build.

4547 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows

4548 to run Isabelle/Scala source files as standalone programs.

4550 * Improved "isabelle keywords" tool (for old-style ProofGeneral

4551 keyword tables): use Isabelle/Scala operations, which inspect outer

4552 syntax without requiring to build sessions first.

4554 * Sessions may be organized via 'chapter' specifications in the ROOT

4555 file, which determines a two-level hierarchy of browser info. The old

4556 tree-like organization via implicit sub-session relation (with its

4557 tendency towards erratic fluctuation of URLs) has been discontinued.

4558 The default chapter is called "Unsorted". Potential INCOMPATIBILITY

4559 for HTML presentation of theories.

4563 New in Isabelle2013 (February 2013)

4564 -----------------------------------

4566 *** General ***

4568 * Theorem status about oracles and unfinished/failed future proofs is

4569 no longer printed by default, since it is incompatible with

4570 incremental / parallel checking of the persistent document model. ML

4571 function Thm.peek_status may be used to inspect a snapshot of the

4572 ongoing evaluation process. Note that in batch mode --- notably

4573 isabelle build --- the system ensures that future proofs of all

4574 accessible theorems in the theory context are finished (as before).

4576 * Configuration option show_markup controls direct inlining of markup

4577 into the printed representation of formal entities --- notably type

4578 and sort constraints. This enables Prover IDE users to retrieve that

4579 information via tooltips in the output window, for example.

4581 * Command 'ML_file' evaluates ML text from a file directly within the

4582 theory, without any predeclaration via 'uses' in the theory header.

4584 * Old command 'use' command and corresponding keyword 'uses' in the

4585 theory header are legacy features and will be discontinued soon.

4586 Tools that load their additional source files may imitate the

4587 'ML_file' implementation, such that the system can take care of

4588 dependencies properly.

4590 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which

4591 is called fastforce / fast_force_tac already since Isabelle2011-1.

4593 * Updated and extended "isar-ref" and "implementation" manual, reduced

4594 remaining material in old "ref" manual.

4596 * Improved support for auxiliary contexts that indicate block structure

4597 for specifications. Nesting of "context fixes ... context assumes ..."

4598 and "class ... context ...".

4600 * Attribute "consumes" allows a negative value as well, which is

4601 interpreted relatively to the total number of premises of the rule in

4602 the target context. This form of declaration is stable when exported

4603 from a nested 'context' with additional assumptions. It is the

4604 preferred form for definitional packages, notably cases/rules produced

4605 in HOL/inductive and HOL/function.

4607 * More informative error messages for Isar proof commands involving

4608 lazy enumerations (method applications etc.).

4610 * Refined 'help' command to retrieve outer syntax commands according

4611 to name patterns (with clickable results).

4614 *** Prover IDE -- Isabelle/Scala/jEdit ***

4616 * Parallel terminal proofs ('by') are enabled by default, likewise

4617 proofs that are built into packages like 'datatype', 'function'. This

4618 allows to "run ahead" checking the theory specifications on the

4619 surface, while the prover is still crunching on internal

4620 justifications. Unfinished / cancelled proofs are restarted as

4621 required to complete full proof checking eventually.

4623 * Improved output panel with tooltips, hyperlinks etc. based on the

4624 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of

4625 tooltips leads to some window that supports the same recursively,

4626 which can lead to stacks of tooltips as the semantic document content

4627 is explored. ESCAPE closes the whole stack, individual windows may be

4628 closed separately, or detached to become independent jEdit dockables.

4630 * Improved support for commands that produce graph output: the text

4631 message contains a clickable area to open a new instance of the graph

4632 browser on demand.

4634 * More robust incremental parsing of outer syntax (partial comments,

4635 malformed symbols). Changing the balance of open/close quotes and

4636 comment delimiters works more conveniently with unfinished situations

4637 that frequently occur in user interaction.

4639 * More efficient painting and improved reactivity when editing large

4640 files. More scalable management of formal document content.

4642 * Smarter handling of tracing messages: prover process pauses after

4643 certain number of messages per command transaction, with some user

4644 dialog to stop or continue. This avoids swamping the front-end with

4645 potentially infinite message streams.

4647 * More plugin options and preferences, based on Isabelle/Scala. The

4648 jEdit plugin option panel provides access to some Isabelle/Scala

4649 options, including tuning parameters for editor reactivity and color

4650 schemes.

4652 * Dockable window "Symbols" provides some editing support for Isabelle

4653 symbols.

4655 * Dockable window "Monitor" shows ML runtime statistics. Note that

4656 continuous display of the chart slows down the system.

4658 * Improved editing support for control styles: subscript, superscript,

4659 bold, reset of style -- operating on single symbols or text

4660 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.

4662 * Actions isabelle.increase-font-size and isabelle.decrease-font-size

4663 adjust the main text area font size, and its derivatives for output,

4664 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often

4665 need to be adapted to local keyboard layouts.

4667 * More reactive completion popup by default: use \t (TAB) instead of

4668 \n (NEWLINE) to minimize intrusion into regular flow of editing. See

4669 also "Plugin Options / SideKick / General / Code Completion Options".

4671 * Implicit check and build dialog of the specified logic session

4672 image. For example, HOL, HOLCF, HOL-Nominal can be produced on

4673 demand, without bundling big platform-dependent heap images in the

4674 Isabelle distribution.

4676 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates

4677 from Oracle provide better multi-platform experience. This version is

4678 now bundled exclusively with Isabelle.

4681 *** Pure ***

4683 * Code generation for Haskell: restrict unqualified imports from

4684 Haskell Prelude to a small set of fundamental operations.

4686 * Command 'export_code': relative file names are interpreted

4687 relatively to master directory of current theory rather than the

4688 rather arbitrary current working directory. INCOMPATIBILITY.

4690 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,

4691 use regular rule composition via "OF" / "THEN", or explicit proof

4692 structure instead. Note that Isabelle/ML provides a variety of

4693 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied

4694 with some care where this is really required.

4696 * Command 'typ' supports an additional variant with explicit sort

4697 constraint, to infer and check the most general type conforming to a

4698 given sort. Example (in HOL):

4700 typ "_ * _ * bool * unit" :: finite

4702 * Command 'locale_deps' visualizes all locales and their relations as

4703 a Hasse diagram.

4706 *** HOL ***

4708 * Sledgehammer:

4710 - Added MaSh relevance filter based on machine-learning; see the

4711 Sledgehammer manual for details.

4712 - Polished Isar proofs generated with "isar_proofs" option.

4713 - Rationalized type encodings ("type_enc" option).

4714 - Renamed "kill_provers" subcommand to "kill_all".

4715 - Renamed options:

4716 isar_proof ~> isar_proofs

4717 isar_shrink_factor ~> isar_shrink

4718 max_relevant ~> max_facts

4719 relevance_thresholds ~> fact_thresholds

4721 * Quickcheck: added an optimisation for equality premises. It is

4722 switched on by default, and can be switched off by setting the

4723 configuration quickcheck_optimise_equality to false.

4725 * Quotient: only one quotient can be defined by quotient_type

4726 INCOMPATIBILITY.

4728 * Lifting:

4729 - generation of an abstraction function equation in lift_definition

4730 - quot_del attribute

4731 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)

4733 * Simproc "finite_Collect" rewrites set comprehensions into pointfree

4734 expressions.

4736 * Preprocessing of the code generator rewrites set comprehensions into

4737 pointfree expressions.

4739 * The SMT solver Z3 has now by default a restricted set of directly

4740 supported features. For the full set of features (div/mod, nonlinear

4741 arithmetic, datatypes/records) with potential proof reconstruction

4742 failures, enable the configuration option "z3_with_extensions". Minor

4743 INCOMPATIBILITY.

4745 * Simplified 'typedef' specifications: historical options for implicit

4746 set definition and alternative name have been discontinued. The

4747 former behavior of "typedef (open) t = A" is now the default, but

4748 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories

4749 accordingly.

4751 * Removed constant "chars"; prefer "Enum.enum" on type "char"

4752 directly. INCOMPATIBILITY.

4754 * Moved operation product, sublists and n_lists from theory Enum to

4755 List. INCOMPATIBILITY.

4757 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.

4759 * Class "comm_monoid_diff" formalises properties of bounded

4760 subtraction, with natural numbers and multisets as typical instances.

4762 * Added combinator "Option.these" with type "'a option set => 'a set".

4764 * Theory "Transitive_Closure": renamed lemmas

4766 reflcl_tranclp -> reflclp_tranclp

4767 rtranclp_reflcl -> rtranclp_reflclp

4769 INCOMPATIBILITY.

4771 * Theory "Rings": renamed lemmas (in class semiring)

4773 left_distrib ~> distrib_right

4774 right_distrib ~> distrib_left

4776 INCOMPATIBILITY.

4778 * Generalized the definition of limits:

4780 - Introduced the predicate filterlim (LIM x F. f x :> G) which

4781 expresses that when the input values x converge to F then the

4782 output f x converges to G.

4784 - Added filters for convergence to positive (at_top) and negative

4785 infinity (at_bot).

4787 - Moved infinity in the norm (at_infinity) from

4788 Multivariate_Analysis to Complex_Main.

4790 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>

4791 at_top".

4793 INCOMPATIBILITY.

4795 * Theory "Library/Option_ord" provides instantiation of option type to

4796 lattice type classes.

4798 * Theory "Library/Multiset": renamed

4800 constant fold_mset ~> Multiset.fold

4801 fact fold_mset_commute ~> fold_mset_comm

4803 INCOMPATIBILITY.

4805 * Renamed theory Library/List_Prefix to Library/Sublist, with related

4806 changes as follows.

4808 - Renamed constants (and related lemmas)

4810 prefix ~> prefixeq

4811 strict_prefix ~> prefix

4813 - Replaced constant "postfix" by "suffixeq" with swapped argument

4814 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped

4815 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.

4816 Renamed lemmas accordingly.

4818 - Added constant "list_hembeq" for homeomorphic embedding on

4819 lists. Added abbreviation "sublisteq" for special case

4820 "list_hembeq (op =)".

4822 - Theory Library/Sublist no longer provides "order" and "bot" type

4823 class instances for the prefix order (merely corresponding locale

4824 interpretations). The type class instances are now in theory

4825 Library/Prefix_Order.

4827 - The sublist relation of theory Library/Sublist_Order is now based

4828 on "Sublist.sublisteq". Renamed lemmas accordingly:

4830 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff

4831 le_list_append_mono ~> Sublist.list_hembeq_append_mono

4832 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2

4833 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD

4834 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'

4835 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq

4836 le_list_drop_Cons ~> Sublist.sublisteq_Cons'

4837 le_list_drop_many ~> Sublist.sublisteq_drop_many

4838 le_list_filter_left ~> Sublist.sublisteq_filter_left

4839 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many

4840 le_list_rev_take_iff ~> Sublist.sublisteq_append

4841 le_list_same_length ~> Sublist.sublisteq_same_length

4842 le_list_take_many_iff ~> Sublist.sublisteq_append'

4843 less_eq_list.drop ~> less_eq_list_drop

4844 less_eq_list.induct ~> less_eq_list_induct

4845 not_le_list_length ~> Sublist.not_sublisteq_length

4847 INCOMPATIBILITY.

4849 * New theory Library/Countable_Set.

4851 * Theory Library/Debug and Library/Parallel provide debugging and

4852 parallel execution for code generated towards Isabelle/ML.

4854 * Theory Library/FuncSet: Extended support for Pi and extensional and

4855 introduce the extensional dependent function space "PiE". Replaced

4856 extensional_funcset by an abbreviation, and renamed lemmas from

4857 extensional_funcset to PiE as follows:

4859 extensional_empty ~> PiE_empty

4860 extensional_funcset_empty_domain ~> PiE_empty_domain

4861 extensional_funcset_empty_range ~> PiE_empty_range

4862 extensional_funcset_arb ~> PiE_arb

4863 extensional_funcset_mem ~> PiE_mem

4864 extensional_funcset_extend_domainI ~> PiE_fun_upd

4865 extensional_funcset_restrict_domain ~> fun_upd_in_PiE

4866 extensional_funcset_extend_domain_eq ~> PiE_insert_eq

4867 card_extensional_funcset ~> card_PiE

4868 finite_extensional_funcset ~> finite_PiE

4870 INCOMPATIBILITY.

4872 * Theory Library/FinFun: theory of almost everywhere constant

4873 functions (supersedes the AFP entry "Code Generation for Functions as

4874 Data").

4876 * Theory Library/Phantom: generic phantom type to make a type

4877 parameter appear in a constant's type. This alternative to adding

4878 TYPE('a) as another parameter avoids unnecessary closures in generated

4879 code.

4881 * Theory Library/RBT_Impl: efficient construction of red-black trees

4882 from sorted associative lists. Merging two trees with rbt_union may

4883 return a structurally different tree than before. Potential

4884 INCOMPATIBILITY.

4886 * Theory Library/IArray: immutable arrays with code generation.

4888 * Theory Library/Finite_Lattice: theory of finite lattices.

4890 * HOL/Multivariate_Analysis: replaced

4892 "basis :: 'a::euclidean_space => nat => real"

4893 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"

4895 on euclidean spaces by using the inner product "_ \<bullet> _" with

4896 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by

4897 "SUM i : Basis. f i * r i".

4899 With this change the following constants are also changed or removed:

4901 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)

4902 a $$ i ~> inner a i (where i : Basis)

4903 cart_base i removed

4904 \<pi>, \<pi>' removed

4906 Theorems about these constants where removed.

4908 Renamed lemmas:

4910 component_le_norm ~> Basis_le_norm

4911 euclidean_eq ~> euclidean_eq_iff

4912 differential_zero_maxmin_component ~> differential_zero_maxmin_cart

4913 euclidean_simps ~> inner_simps

4914 independent_basis ~> independent_Basis

4915 span_basis ~> span_Basis

4916 in_span_basis ~> in_span_Basis

4917 norm_bound_component_le ~> norm_boound_Basis_le

4918 norm_bound_component_lt ~> norm_boound_Basis_lt

4919 component_le_infnorm ~> Basis_le_infnorm

4921 INCOMPATIBILITY.

4923 * HOL/Probability:

4925 - Added simproc "measurable" to automatically prove measurability.

4927 - Added induction rules for sigma sets with disjoint union

4928 (sigma_sets_induct_disjoint) and for Borel-measurable functions

4929 (borel_measurable_induct).

4931 - Added the Daniell-Kolmogorov theorem (the existence the limit of a

4932 projective family).

4934 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the

4935 AFP entry "Ordinals_and_Cardinals").

4937 * HOL/BNF: New (co)datatype package based on bounded natural functors

4938 with support for mixed, nested recursion and interesting non-free

4939 datatypes.

4941 * HOL/Finite_Set and Relation: added new set and relation operations

4942 expressed by Finite_Set.fold.

4944 * New theory HOL/Library/RBT_Set: implementation of sets by red-black

4945 trees for the code generator.

4947 * HOL/Library/RBT and HOL/Library/Mapping have been converted to

4948 Lifting/Transfer.

4949 possible INCOMPATIBILITY.

4951 * HOL/Set: renamed Set.project -> Set.filter

4952 INCOMPATIBILITY.

4955 *** Document preparation ***

4957 * Dropped legacy antiquotations "term_style" and "thm_style", since

4958 styles may be given as arguments to "term" and "thm" already.

4959 Discontinued legacy styles "prem1" .. "prem19".

4961 * Default LaTeX rendering for \<euro> is now based on eurosym package,

4962 instead of slightly exotic babel/greek.

4964 * Document variant NAME may use different LaTeX entry point

4965 document/root_NAME.tex if that file exists, instead of the common

4966 document/root.tex.

4968 * Simplified custom document/build script, instead of old-style

4969 document/IsaMakefile. Minor INCOMPATIBILITY.

4972 *** ML ***

4974 * The default limit for maximum number of worker threads is now 8,

4975 instead of 4, in correspondence to capabilities of contemporary

4976 hardware and Poly/ML runtime system.

4978 * Type Seq.results and related operations support embedded error

4979 messages within lazy enumerations, and thus allow to provide

4980 informative errors in the absence of any usable results.

4982 * Renamed Position.str_of to Position.here to emphasize that this is a

4983 formal device to inline positions into message text, but not

4984 necessarily printing visible text.

4987 *** System ***

4989 * Advanced support for Isabelle sessions and build management, see

4990 "system" manual for the chapter of that name, especially the "isabelle

4991 build" tool and its examples. The "isabelle mkroot" tool prepares

4992 session root directories for use with "isabelle build", similar to

4993 former "isabelle mkdir" for "isabelle usedir". Note that this affects

4994 document preparation as well. INCOMPATIBILITY, isabelle usedir /

4995 mkdir / make are rendered obsolete.

4997 * Discontinued obsolete Isabelle/build script, it is superseded by the

4998 regular isabelle build tool. For example:

5000 isabelle build -s -b HOL

5002 * Discontinued obsolete "isabelle makeall".

5004 * Discontinued obsolete IsaMakefile and ROOT.ML files from the

5005 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that

5006 provides some traditional targets that invoke "isabelle build". Note

5007 that this is inefficient! Applications of Isabelle/HOL involving

5008 "isabelle make" should be upgraded to use "isabelle build" directly.

5010 * The "isabelle options" tool prints Isabelle system options, as

5011 required for "isabelle build", for example.

5013 * The "isabelle logo" tool produces EPS and PDF format simultaneously.

5014 Minor INCOMPATIBILITY in command-line options.

5016 * The "isabelle install" tool has now a simpler command-line. Minor

5017 INCOMPATIBILITY.

5019 * The "isabelle components" tool helps to resolve add-on components

5020 that are not bundled, or referenced from a bare-bones repository

5021 version of Isabelle.

5023 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general

5024 platform family: "linux", "macos", "windows".

5026 * The ML system is configured as regular component, and no longer

5027 picked up from some surrounding directory. Potential INCOMPATIBILITY

5028 for home-made settings.

5030 * Improved ML runtime statistics (heap, threads, future tasks etc.).

5032 * Discontinued support for Poly/ML 5.2.1, which was the last version

5033 without exception positions and advanced ML compiler/toplevel

5034 configuration.

5036 * Discontinued special treatment of Proof General -- no longer guess

5037 PROOFGENERAL_HOME based on accidental file-system layout. Minor

5038 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS

5039 settings manually, or use a Proof General version that has been

5040 bundled as Isabelle component.

5044 New in Isabelle2012 (May 2012)

5045 ------------------------------

5047 *** General ***

5049 * Prover IDE (PIDE) improvements:

5051 - more robust Sledgehammer integration (as before the sledgehammer

5052 command-line needs to be typed into the source buffer)

5053 - markup for bound variables

5054 - markup for types of term variables (displayed as tooltips)

5055 - support for user-defined Isar commands within the running session

5056 - improved support for Unicode outside original 16bit range

5057 e.g. glyph for \<A> (thanks to jEdit 4.5.1)

5059 * Forward declaration of outer syntax keywords within the theory

5060 header -- minor INCOMPATIBILITY for user-defined commands. Allow new

5061 commands to be used in the same theory where defined.

5063 * Auxiliary contexts indicate block structure for specifications with

5064 additional parameters and assumptions. Such unnamed contexts may be

5065 nested within other targets, like 'theory', 'locale', 'class',

5066 'instantiation' etc. Results from the local context are generalized

5067 accordingly and applied to the enclosing target context. Example:

5069 context

5070 fixes x y z :: 'a

5071 assumes xy: "x = y" and yz: "y = z"

5072 begin

5074 lemma my_trans: "x = z" using xy yz by simp

5076 end

5078 thm my_trans

5080 The most basic application is to factor-out context elements of

5081 several fixes/assumes/shows theorem statements, e.g. see

5082 ~~/src/HOL/Isar_Examples/Group_Context.thy

5084 Any other local theory specification element works within the "context

5085 ... begin ... end" block as well.

5087 * Bundled declarations associate attributed fact expressions with a

5088 given name in the context. These may be later included in other

5089 contexts. This allows to manage context extensions casually, without

5090 the logical dependencies of locales and locale interpretation. See

5091 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.

5093 * Commands 'lemmas' and 'theorems' allow local variables using 'for'

5094 declaration, and results are standardized before being stored. Thus

5095 old-style "standard" after instantiation or composition of facts

5096 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of

5097 indices of schematic variables.

5099 * Rule attributes in local theory declarations (e.g. locale or class)

5100 are now statically evaluated: the resulting theorem is stored instead

5101 of the original expression. INCOMPATIBILITY in rare situations, where

5102 the historic accident of dynamic re-evaluation in interpretations

5103 etc. was exploited.

5105 * New tutorial "Programming and Proving in Isabelle/HOL"

5106 ("prog-prove"). It completely supersedes "A Tutorial Introduction to

5107 Structured Isar Proofs" ("isar-overview"), which has been removed. It

5108 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order

5109 Logic" as the recommended beginners tutorial, but does not cover all

5110 of the material of that old tutorial.

5112 * Updated and extended reference manuals: "isar-ref",

5113 "implementation", "system"; reduced remaining material in old "ref"

5114 manual.

5117 *** Pure ***

5119 * Command 'definition' no longer exports the foundational "raw_def"

5120 into the user context. Minor INCOMPATIBILITY, may use the regular

5121 "def" result with attribute "abs_def" to imitate the old version.

5123 * Attribute "abs_def" turns an equation of the form "f x y == t" into

5124 "f == %x y. t", which ensures that "simp" or "unfold" steps always

5125 expand it. This also works for object-logic equality. (Formerly

5126 undocumented feature.)

5128 * Sort constraints are now propagated in simultaneous statements, just

5129 like type constraints. INCOMPATIBILITY in rare situations, where

5130 distinct sorts used to be assigned accidentally. For example:

5132 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"

5134 lemma "P (x::'a)" and "Q (y::'a::bar)"

5135 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"

5137 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more

5138 tolerant against multiple unifiers, as long as the final result is

5139 unique. (As before, rules are composed in canonical right-to-left

5140 order to accommodate newly introduced premises.)

5142 * Renamed some inner syntax categories:

5144 num ~> num_token

5145 xnum ~> xnum_token

5146 xstr ~> str_token

5148 Minor INCOMPATIBILITY. Note that in practice "num_const" or

5149 "num_position" etc. are mainly used instead (which also include

5150 position information via constraints).

5152 * Simplified configuration options for syntax ambiguity: see

5153 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref

5154 manual. Minor INCOMPATIBILITY.

5156 * Discontinued configuration option "syntax_positions": atomic terms

5157 in parse trees are always annotated by position constraints.

5159 * Old code generator for SML and its commands 'code_module',

5160 'code_library', 'consts_code', 'types_code' have been discontinued.

5161 Use commands of the generic code generator instead. INCOMPATIBILITY.

5163 * Redundant attribute "code_inline" has been discontinued. Use

5164 "code_unfold" instead. INCOMPATIBILITY.

5166 * Dropped attribute "code_unfold_post" in favor of the its dual

5167 "code_abbrev", which yields a common pattern in definitions like

5169 definition [code_abbrev]: "f = t"

5171 INCOMPATIBILITY.

5173 * Obsolete 'types' command has been discontinued. Use 'type_synonym'

5174 instead. INCOMPATIBILITY.

5176 * Discontinued old "prems" fact, which used to refer to the accidental

5177 collection of foundational premises in the context (already marked as

5178 legacy since Isabelle2011).

5181 *** HOL ***

5183 * Type 'a set is now a proper type constructor (just as before

5184 Isabelle2008). Definitions mem_def and Collect_def have disappeared.

5185 Non-trivial INCOMPATIBILITY. For developments keeping predicates and

5186 sets separate, it is often sufficient to rephrase some set S that has

5187 been accidentally used as predicates by "%x. x : S", and some

5188 predicate P that has been accidentally used as set by "{x. P x}".

5189 Corresponding proofs in a first step should be pruned from any

5190 tinkering with former theorems mem_def and Collect_def as far as

5191 possible.

5193 For developments which deliberately mix predicates and sets, a

5194 planning step is necessary to determine what should become a predicate

5195 and what a set. It can be helpful to carry out that step in

5196 Isabelle2011-1 before jumping right into the current release.

5198 * Code generation by default implements sets as container type rather

5199 than predicates. INCOMPATIBILITY.

5201 * New type synonym 'a rel = ('a * 'a) set

5203 * The representation of numerals has changed. Datatype "num"

5204 represents strictly positive binary numerals, along with functions

5205 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent

5206 positive and negated numeric literals, respectively. See also

5207 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some

5208 user theories may require adaptations as follows:

5210 - Theorems with number_ring or number_semiring constraints: These

5211 classes are gone; use comm_ring_1 or comm_semiring_1 instead.

5213 - Theories defining numeric types: Remove number, number_semiring,

5214 and number_ring instances. Defer all theorems about numerals until

5215 after classes one and semigroup_add have been instantiated.

5217 - Numeral-only simp rules: Replace each rule having a "number_of v"

5218 pattern with two copies, one for numeral and one for neg_numeral.

5220 - Theorems about subclasses of semiring_1 or ring_1: These classes

5221 automatically support numerals now, so more simp rules and

5222 simprocs may now apply within the proof.

5224 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:

5225 Redefine using other integer operations.

5227 * Transfer: New package intended to generalize the existing

5228 "descending" method and related theorem attributes from the Quotient

5229 package. (Not all functionality is implemented yet, but future

5230 development will focus on Transfer as an eventual replacement for the

5231 corresponding parts of the Quotient package.)

5233 - transfer_rule attribute: Maintains a collection of transfer rules,

5234 which relate constants at two different types. Transfer rules may

5235 relate different type instances of the same polymorphic constant,

5236 or they may relate an operation on a raw type to a corresponding

5237 operation on an abstract type (quotient or subtype). For example:

5239 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map

5240 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int

5242 - transfer method: Replaces a subgoal on abstract types with an

5243 equivalent subgoal on the corresponding raw types. Constants are

5244 replaced with corresponding ones according to the transfer rules.

5245 Goals are generalized over all free variables by default; this is

5246 necessary for variables whose types change, but can be overridden

5247 for specific variables with e.g. "transfer fixing: x y z". The

5248 variant transfer' method allows replacing a subgoal with one that

5249 is logically stronger (rather than equivalent).

5251 - relator_eq attribute: Collects identity laws for relators of

5252 various type constructors, e.g. "list_all2 (op =) = (op =)". The

5253 transfer method uses these lemmas to infer transfer rules for

5254 non-polymorphic constants on the fly.

5256 - transfer_prover method: Assists with proving a transfer rule for a

5257 new constant, provided the constant is defined in terms of other

5258 constants that already have transfer rules. It should be applied

5259 after unfolding the constant definitions.

5261 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer

5262 from type nat to type int.

5264 * Lifting: New package intended to generalize the quotient_definition

5265 facility of the Quotient package; designed to work with Transfer.

5267 - lift_definition command: Defines operations on an abstract type in

5268 terms of a corresponding operation on a representation

5269 type. Example syntax:

5271 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"

5272 is List.insert

5274 Users must discharge a respectfulness proof obligation when each

5275 constant is defined. (For a type copy, i.e. a typedef with UNIV,

5276 the proof is discharged automatically.) The obligation is

5277 presented in a user-friendly, readable form; a respectfulness

5278 theorem in the standard format and a transfer rule are generated

5279 by the package.

5281 - Integration with code_abstype: For typedefs (e.g. subtypes

5282 corresponding to a datatype invariant, such as dlist),

5283 lift_definition generates a code certificate theorem and sets up

5284 code generation for each constant.

5286 - setup_lifting command: Sets up the Lifting package to work with a

5287 user-defined type. The user must provide either a quotient theorem

5288 or a type_definition theorem. The package configures transfer

5289 rules for equality and quantifiers on the type, and sets up the

5290 lift_definition command to work with the type.

5292 - Usage examples: See Quotient_Examples/Lift_DList.thy,

5293 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,

5294 Word/Word.thy and Library/Float.thy.

5296 * Quotient package:

5298 - The 'quotient_type' command now supports a 'morphisms' option with

5299 rep and abs functions, similar to typedef.

5301 - 'quotient_type' sets up new types to work with the Lifting and

5302 Transfer packages, as with 'setup_lifting'.

5304 - The 'quotient_definition' command now requires the user to prove a

5305 respectfulness property at the point where the constant is

5306 defined, similar to lift_definition; INCOMPATIBILITY.

5308 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems

5309 accordingly, INCOMPATIBILITY.

5311 * New diagnostic command 'find_unused_assms' to find potentially

5312 superfluous assumptions in theorems using Quickcheck.

5314 * Quickcheck:

5316 - Quickcheck returns variable assignments as counterexamples, which

5317 allows to reveal the underspecification of functions under test.

5318 For example, refuting "hd xs = x", it presents the variable

5319 assignment xs = [] and x = a1 as a counterexample, assuming that

5320 any property is false whenever "hd []" occurs in it.

5322 These counterexample are marked as potentially spurious, as

5323 Quickcheck also returns "xs = []" as a counterexample to the

5324 obvious theorem "hd xs = hd xs".

5326 After finding a potentially spurious counterexample, Quickcheck

5327 continues searching for genuine ones.

5329 By default, Quickcheck shows potentially spurious and genuine

5330 counterexamples. The option "genuine_only" sets quickcheck to only

5331 show genuine counterexamples.

5333 - The command 'quickcheck_generator' creates random and exhaustive

5334 value generators for a given type and operations.

5336 It generates values by using the operations as if they were

5337 constructors of that type.

5339 - Support for multisets.

5341 - Added "use_subtype" options.

5343 - Added "quickcheck_locale" configuration to specify how to process

5344 conjectures in a locale context.

5346 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option

5347 and affecting 'rat' and 'real'.

5349 * Sledgehammer:

5350 - Integrated more tightly with SPASS, as described in the ITP 2012

5351 paper "More SPASS with Isabelle".

5352 - Made it try "smt" as a fallback if "metis" fails or times out.

5353 - Added support for the following provers: Alt-Ergo (via Why3 and

5354 TFF1), iProver, iProver-Eq.

5355 - Sped up the minimizer.

5356 - Added "lam_trans", "uncurry_aliases", and "minimize" options.

5357 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").

5358 - Renamed "sound" option to "strict".

5360 * Metis: Added possibility to specify lambda translations scheme as a

5361 parenthesized argument (e.g., "by (metis (lifting) ...)").

5363 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".

5365 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.

5367 * New "case_product" attribute to generate a case rule doing multiple

5368 case distinctions at the same time. E.g.

5370 list.exhaust [case_product nat.exhaust]

5372 produces a rule which can be used to perform case distinction on both

5373 a list and a nat.

5375 * New "eventually_elim" method as a generalized variant of the

5376 eventually_elim* rules. Supports structured proofs.

5378 * Typedef with implicit set definition is considered legacy. Use

5379 "typedef (open)" form instead, which will eventually become the

5380 default.

5382 * Record: code generation can be switched off manually with

5384 declare [[record_coden = false]] -- "default true"

5386 * Datatype: type parameters allow explicit sort constraints.

5388 * Concrete syntax for case expressions includes constraints for source

5389 positions, and thus produces Prover IDE markup for its bindings.

5390 INCOMPATIBILITY for old-style syntax translations that augment the

5391 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of

5392 one_case.

5394 * Clarified attribute "mono_set": pure declaration without modifying

5395 the result of the fact expression.

5397 * More default pred/set conversions on a couple of relation operations

5398 and predicates. Added powers of predicate relations. Consolidation

5399 of some relation theorems:

5401 converse_def ~> converse_unfold

5402 rel_comp_def ~> relcomp_unfold

5403 symp_def ~> (modified, use symp_def and sym_def instead)

5404 transp_def ~> transp_trans

5405 Domain_def ~> Domain_unfold

5406 Range_def ~> Domain_converse [symmetric]

5408 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.

5410 See theory "Relation" for examples for making use of pred/set

5411 conversions by means of attributes "to_set" and "to_pred".

5413 INCOMPATIBILITY.

5415 * Renamed facts about the power operation on relations, i.e., relpow

5416 to match the constant's name:

5418 rel_pow_1 ~> relpow_1

5419 rel_pow_0_I ~> relpow_0_I

5420 rel_pow_Suc_I ~> relpow_Suc_I

5421 rel_pow_Suc_I2 ~> relpow_Suc_I2

5422 rel_pow_0_E ~> relpow_0_E

5423 rel_pow_Suc_E ~> relpow_Suc_E

5424 rel_pow_E ~> relpow_E

5425 rel_pow_Suc_D2 ~> relpow_Suc_D2

5426 rel_pow_Suc_E2 ~> relpow_Suc_E2

5427 rel_pow_Suc_D2' ~> relpow_Suc_D2'

5428 rel_pow_E2 ~> relpow_E2

5429 rel_pow_add ~> relpow_add

5430 rel_pow_commute ~> relpow

5431 rel_pow_empty ~> relpow_empty:

5432 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow

5433 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl

5434 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow

5435 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow

5436 rel_pow_fun_conv ~> relpow_fun_conv

5437 rel_pow_finite_bounded1 ~> relpow_finite_bounded1

5438 rel_pow_finite_bounded ~> relpow_finite_bounded

5439 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow

5440 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow

5441 single_valued_rel_pow ~> single_valued_relpow

5443 INCOMPATIBILITY.

5445 * Theory Relation: Consolidated constant name for relation composition

5446 and corresponding theorem names:

5448 - Renamed constant rel_comp to relcomp.

5450 - Dropped abbreviation pred_comp. Use relcompp instead.

5452 - Renamed theorems:

5454 rel_compI ~> relcompI

5455 rel_compEpair ~> relcompEpair

5456 rel_compE ~> relcompE

5457 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq

5458 rel_comp_empty1 ~> relcomp_empty1

5459 rel_comp_mono ~> relcomp_mono

5460 rel_comp_subset_Sigma ~> relcomp_subset_Sigma

5461 rel_comp_distrib ~> relcomp_distrib

5462 rel_comp_distrib2 ~> relcomp_distrib2

5463 rel_comp_UNION_distrib ~> relcomp_UNION_distrib

5464 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2

5465 single_valued_rel_comp ~> single_valued_relcomp

5466 rel_comp_def ~> relcomp_unfold

5467 converse_rel_comp ~> converse_relcomp

5468 pred_compI ~> relcomppI

5469 pred_compE ~> relcomppE

5470 pred_comp_bot1 ~> relcompp_bot1

5471 pred_comp_bot2 ~> relcompp_bot2

5472 transp_pred_comp_less_eq ~> transp_relcompp_less_eq

5473 pred_comp_mono ~> relcompp_mono

5474 pred_comp_distrib ~> relcompp_distrib

5475 pred_comp_distrib2 ~> relcompp_distrib2

5476 converse_pred_comp ~> converse_relcompp

5478 finite_rel_comp ~> finite_relcomp

5480 set_rel_comp ~> set_relcomp

5482 INCOMPATIBILITY.

5484 * Theory Divides: Discontinued redundant theorems about div and mod.

5485 INCOMPATIBILITY, use the corresponding generic theorems instead.

5487 DIVISION_BY_ZERO ~> div_by_0, mod_by_0

5488 zdiv_self ~> div_self

5489 zmod_self ~> mod_self

5490 zdiv_zero ~> div_0

5491 zmod_zero ~> mod_0

5492 zdiv_zmod_equality ~> div_mod_equality2

5493 zdiv_zmod_equality2 ~> div_mod_equality

5494 zmod_zdiv_trivial ~> mod_div_trivial

5495 zdiv_zminus_zminus ~> div_minus_minus

5496 zmod_zminus_zminus ~> mod_minus_minus

5497 zdiv_zminus2 ~> div_minus_right

5498 zmod_zminus2 ~> mod_minus_right

5499 zdiv_minus1_right ~> div_minus1_right

5500 zmod_minus1_right ~> mod_minus1_right

5501 zdvd_mult_div_cancel ~> dvd_mult_div_cancel

5502 zmod_zmult1_eq ~> mod_mult_right_eq

5503 zpower_zmod ~> power_mod

5504 zdvd_zmod ~> dvd_mod

5505 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd

5506 mod_mult_distrib ~> mult_mod_left

5507 mod_mult_distrib2 ~> mult_mod_right

5509 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use

5510 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.

5512 * Finite_Set.fold now qualified. INCOMPATIBILITY.

5514 * Consolidated theorem names concerning fold combinators:

5516 inf_INFI_fold_inf ~> inf_INF_fold_inf

5517 sup_SUPR_fold_sup ~> sup_SUP_fold_sup

5518 INFI_fold_inf ~> INF_fold_inf

5519 SUPR_fold_sup ~> SUP_fold_sup

5520 union_set ~> union_set_fold

5521 minus_set ~> minus_set_fold

5522 INFI_set_fold ~> INF_set_fold

5523 SUPR_set_fold ~> SUP_set_fold

5524 INF_code ~> INF_set_foldr

5525 SUP_code ~> SUP_set_foldr

5526 foldr.simps ~> foldr.simps (in point-free formulation)

5527 foldr_fold_rev ~> foldr_conv_fold

5528 foldl_fold ~> foldl_conv_fold

5529 foldr_foldr ~> foldr_conv_foldl

5530 foldl_foldr ~> foldl_conv_foldr

5531 fold_set_remdups ~> fold_set_fold_remdups

5532 fold_set ~> fold_set_fold

5533 fold1_set ~> fold1_set_fold

5535 INCOMPATIBILITY.

5537 * Dropped rarely useful theorems concerning fold combinators:

5538 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,

5539 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,

5540 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,

5541 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,

5542 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,

5543 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.

5544 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"

5545 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be

5546 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by

5547 unfolding "foldr_conv_fold" and "foldl_conv_fold".

5549 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,

5550 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,

5551 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,

5552 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding

5553 lemmas over fold rather than foldr, or make use of lemmas

5554 fold_conv_foldr and fold_rev.

5556 * Congruence rules Option.map_cong and Option.bind_cong for recursion

5557 through option types.

5559 * "Transitive_Closure.ntrancl": bounded transitive closure on

5560 relations.

5562 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.

5564 * Theory Int: Discontinued many legacy theorems specific to type int.

5565 INCOMPATIBILITY, use the corresponding generic theorems instead.

5567 zminus_zminus ~> minus_minus

5568 zminus_0 ~> minus_zero

5569 zminus_zadd_distrib ~> minus_add_distrib

5570 zadd_commute ~> add_commute

5571 zadd_assoc ~> add_assoc

5572 zadd_left_commute ~> add_left_commute

5573 zadd_ac ~> add_ac

5574 zmult_ac ~> mult_ac

5575 zadd_0 ~> add_0_left

5576 zadd_0_right ~> add_0_right

5577 zadd_zminus_inverse2 ~> left_minus

5578 zmult_zminus ~> mult_minus_left

5579 zmult_commute ~> mult_commute

5580 zmult_assoc ~> mult_assoc

5581 zadd_zmult_distrib ~> left_distrib

5582 zadd_zmult_distrib2 ~> right_distrib

5583 zdiff_zmult_distrib ~> left_diff_distrib

5584 zdiff_zmult_distrib2 ~> right_diff_distrib

5585 zmult_1 ~> mult_1_left

5586 zmult_1_right ~> mult_1_right

5587 zle_refl ~> order_refl

5588 zle_trans ~> order_trans

5589 zle_antisym ~> order_antisym

5590 zle_linear ~> linorder_linear

5591 zless_linear ~> linorder_less_linear

5592 zadd_left_mono ~> add_left_mono

5593 zadd_strict_right_mono ~> add_strict_right_mono

5594 zadd_zless_mono ~> add_less_le_mono

5595 int_0_less_1 ~> zero_less_one

5596 int_0_neq_1 ~> zero_neq_one

5597 zless_le ~> less_le

5598 zpower_zadd_distrib ~> power_add

5599 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff

5600 zero_le_zpower_abs ~> zero_le_power_abs

5602 * Theory Deriv: Renamed

5604 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing

5606 * Theory Library/Multiset: Improved code generation of multisets.

5608 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets

5609 are expressed via type classes again. The special syntax

5610 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant

5611 setsum_set, which is now subsumed by Big_Operators.setsum.

5612 INCOMPATIBILITY.

5614 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,

5615 use theory HOL/Library/Nat_Bijection instead.

5617 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black

5618 trees is now inside a type class context. Names of affected

5619 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for

5620 theories working directly with raw red-black trees, adapt the names as

5621 follows:

5623 Operations:

5624 bulkload -> rbt_bulkload

5625 del_from_left -> rbt_del_from_left

5626 del_from_right -> rbt_del_from_right

5627 del -> rbt_del

5628 delete -> rbt_delete

5629 ins -> rbt_ins

5630 insert -> rbt_insert

5631 insertw -> rbt_insert_with

5632 insert_with_key -> rbt_insert_with_key

5633 map_entry -> rbt_map_entry

5634 lookup -> rbt_lookup

5635 sorted -> rbt_sorted

5636 tree_greater -> rbt_greater

5637 tree_less -> rbt_less

5638 tree_less_symbol -> rbt_less_symbol

5639 union -> rbt_union

5640 union_with -> rbt_union_with

5641 union_with_key -> rbt_union_with_key

5643 Lemmas:

5644 balance_left_sorted -> balance_left_rbt_sorted

5645 balance_left_tree_greater -> balance_left_rbt_greater

5646 balance_left_tree_less -> balance_left_rbt_less

5647 balance_right_sorted -> balance_right_rbt_sorted

5648 balance_right_tree_greater -> balance_right_rbt_greater

5649 balance_right_tree_less -> balance_right_rbt_less

5650 balance_sorted -> balance_rbt_sorted

5651 balance_tree_greater -> balance_rbt_greater

5652 balance_tree_less -> balance_rbt_less

5653 bulkload_is_rbt -> rbt_bulkload_is_rbt

5654 combine_sorted -> combine_rbt_sorted

5655 combine_tree_greater -> combine_rbt_greater

5656 combine_tree_less -> combine_rbt_less

5657 delete_in_tree -> rbt_delete_in_tree

5658 delete_is_rbt -> rbt_delete_is_rbt

5659 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater

5660 del_from_left_tree_less -> rbt_del_from_left_rbt_less

5661 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater

5662 del_from_right_tree_less -> rbt_del_from_right_rbt_less

5663 del_in_tree -> rbt_del_in_tree

5664 del_inv1_inv2 -> rbt_del_inv1_inv2

5665 del_sorted -> rbt_del_rbt_sorted

5666 del_tree_greater -> rbt_del_rbt_greater

5667 del_tree_less -> rbt_del_rbt_less

5668 dom_lookup_Branch -> dom_rbt_lookup_Branch

5669 entries_lookup -> entries_rbt_lookup

5670 finite_dom_lookup -> finite_dom_rbt_lookup

5671 insert_sorted -> rbt_insert_rbt_sorted

5672 insertw_is_rbt -> rbt_insertw_is_rbt

5673 insertwk_is_rbt -> rbt_insertwk_is_rbt

5674 insertwk_sorted -> rbt_insertwk_rbt_sorted

5675 insertw_sorted -> rbt_insertw_rbt_sorted

5676 ins_sorted -> ins_rbt_sorted

5677 ins_tree_greater -> ins_rbt_greater

5678 ins_tree_less -> ins_rbt_less

5679 is_rbt_sorted -> is_rbt_rbt_sorted

5680 lookup_balance -> rbt_lookup_balance

5681 lookup_bulkload -> rbt_lookup_rbt_bulkload

5682 lookup_delete -> rbt_lookup_rbt_delete

5683 lookup_Empty -> rbt_lookup_Empty

5684 lookup_from_in_tree -> rbt_lookup_from_in_tree

5685 lookup_in_tree -> rbt_lookup_in_tree

5686 lookup_ins -> rbt_lookup_ins

5687 lookup_insert -> rbt_lookup_rbt_insert

5688 lookup_insertw -> rbt_lookup_rbt_insertw

5689 lookup_insertwk -> rbt_lookup_rbt_insertwk

5690 lookup_keys -> rbt_lookup_keys

5691 lookup_map -> rbt_lookup_map

5692 lookup_map_entry -> rbt_lookup_rbt_map_entry

5693 lookup_tree_greater -> rbt_lookup_rbt_greater

5694 lookup_tree_less -> rbt_lookup_rbt_less

5695 lookup_union -> rbt_lookup_rbt_union

5696 map_entry_color_of -> rbt_map_entry_color_of

5697 map_entry_inv1 -> rbt_map_entry_inv1

5698 map_entry_inv2 -> rbt_map_entry_inv2

5699 map_entry_is_rbt -> rbt_map_entry_is_rbt

5700 map_entry_sorted -> rbt_map_entry_rbt_sorted

5701 map_entry_tree_greater -> rbt_map_entry_rbt_greater

5702 map_entry_tree_less -> rbt_map_entry_rbt_less

5703 map_tree_greater -> map_rbt_greater

5704 map_tree_less -> map_rbt_less

5705 map_sorted -> map_rbt_sorted

5706 paint_sorted -> paint_rbt_sorted

5707 paint_lookup -> paint_rbt_lookup

5708 paint_tree_greater -> paint_rbt_greater

5709 paint_tree_less -> paint_rbt_less

5710 sorted_entries -> rbt_sorted_entries

5711 tree_greater_eq_trans -> rbt_greater_eq_trans

5712 tree_greater_nit -> rbt_greater_nit

5713 tree_greater_prop -> rbt_greater_prop

5714 tree_greater_simps -> rbt_greater_simps

5715 tree_greater_trans -> rbt_greater_trans

5716 tree_less_eq_trans -> rbt_less_eq_trans

5717 tree_less_nit -> rbt_less_nit

5718 tree_less_prop -> rbt_less_prop

5719 tree_less_simps -> rbt_less_simps

5720 tree_less_trans -> rbt_less_trans

5721 tree_ord_props -> rbt_ord_props

5722 union_Branch -> rbt_union_Branch

5723 union_is_rbt -> rbt_union_is_rbt

5724 unionw_is_rbt -> rbt_unionw_is_rbt

5725 unionwk_is_rbt -> rbt_unionwk_is_rbt

5726 unionwk_sorted -> rbt_unionwk_rbt_sorted

5728 * Theory HOL/Library/Float: Floating point numbers are now defined as

5729 a subset of the real numbers. All operations are defined using the

5730 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.

5732 Changed Operations:

5733 float_abs -> abs

5734 float_nprt -> nprt

5735 float_pprt -> pprt

5736 pow2 -> use powr

5737 round_down -> float_round_down

5738 round_up -> float_round_up

5739 scale -> exponent

5741 Removed Operations:

5742 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod

5744 Renamed Lemmas:

5745 abs_float_def -> Float.compute_float_abs

5746 bitlen_ge0 -> bitlen_nonneg

5747 bitlen.simps -> Float.compute_bitlen

5748 float_components -> Float_mantissa_exponent

5749 float_divl.simps -> Float.compute_float_divl

5750 float_divr.simps -> Float.compute_float_divr

5751 float_eq_odd -> mult_powr_eq_mult_powr_iff

5752 float_power -> real_of_float_power

5753 lapprox_posrat_def -> Float.compute_lapprox_posrat

5754 lapprox_rat.simps -> Float.compute_lapprox_rat

5755 le_float_def' -> Float.compute_float_le

5756 le_float_def -> less_eq_float.rep_eq

5757 less_float_def' -> Float.compute_float_less

5758 less_float_def -> less_float.rep_eq

5759 normfloat_def -> Float.compute_normfloat

5760 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0

5761 normfloat -> normfloat_def

5762 normfloat_unique -> use normfloat_def

5763 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral

5764 one_float_def -> Float.compute_float_one

5765 plus_float_def -> Float.compute_float_plus

5766 rapprox_posrat_def -> Float.compute_rapprox_posrat

5767 rapprox_rat.simps -> Float.compute_rapprox_rat

5768 real_of_float_0 -> zero_float.rep_eq

5769 real_of_float_1 -> one_float.rep_eq

5770 real_of_float_abs -> abs_float.rep_eq

5771 real_of_float_add -> plus_float.rep_eq

5772 real_of_float_minus -> uminus_float.rep_eq

5773 real_of_float_mult -> times_float.rep_eq

5774 real_of_float_simp -> Float.rep_eq

5775 real_of_float_sub -> minus_float.rep_eq

5776 round_down.simps -> Float.compute_float_round_down

5777 round_up.simps -> Float.compute_float_round_up

5778 times_float_def -> Float.compute_float_times

5779 uminus_float_def -> Float.compute_float_uminus

5780 zero_float_def -> Float.compute_float_zero

5782 Lemmas not necessary anymore, use the transfer method:

5783 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,

5784 float_divr, float_le_simp, float_less1_mantissa_bound,

5785 float_less_simp, float_less_zero, float_le_zero,

5786 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,

5787 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,

5788 lapprox_rat_bottom, normalized_float, rapprox_posrat,

5789 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,

5790 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,

5791 round_up, zero_le_float, zero_less_float

5793 * New theory HOL/Library/DAList provides an abstract type for

5794 association lists with distinct keys.

5796 * Session HOL/IMP: Added new theory of abstract interpretation of

5797 annotated commands.

5799 * Session HOL-Import: Re-implementation from scratch is faster,

5800 simpler, and more scalable. Requires a proof bundle, which is

5801 available as an external component. Discontinued old (and mostly

5802 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.

5804 * Session HOL-Word: Discontinued many redundant theorems specific to

5805 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems

5806 instead.

5808 word_sub_alt ~> word_sub_wi

5809 word_add_alt ~> word_add_def

5810 word_mult_alt ~> word_mult_def

5811 word_minus_alt ~> word_minus_def

5812 word_0_alt ~> word_0_wi

5813 word_1_alt ~> word_1_wi

5814 word_add_0 ~> add_0_left

5815 word_add_0_right ~> add_0_right

5816 word_mult_1 ~> mult_1_left

5817 word_mult_1_right ~> mult_1_right

5818 word_add_commute ~> add_commute

5819 word_add_assoc ~> add_assoc

5820 word_add_left_commute ~> add_left_commute

5821 word_mult_commute ~> mult_commute

5822 word_mult_assoc ~> mult_assoc

5823 word_mult_left_commute ~> mult_left_commute

5824 word_left_distrib ~> left_distrib

5825 word_right_distrib ~> right_distrib

5826 word_left_minus ~> left_minus

5827 word_diff_0_right ~> diff_0_right

5828 word_diff_self ~> diff_self

5829 word_sub_def ~> diff_minus

5830 word_diff_minus ~> diff_minus

5831 word_add_ac ~> add_ac

5832 word_mult_ac ~> mult_ac

5833 word_plus_ac0 ~> add_0_left add_0_right add_ac

5834 word_times_ac1 ~> mult_1_left mult_1_right mult_ac

5835 word_order_trans ~> order_trans

5836 word_order_refl ~> order_refl

5837 word_order_antisym ~> order_antisym

5838 word_order_linear ~> linorder_linear

5839 lenw1_zero_neq_one ~> zero_neq_one

5840 word_number_of_eq ~> number_of_eq

5841 word_of_int_add_hom ~> wi_hom_add

5842 word_of_int_sub_hom ~> wi_hom_sub

5843 word_of_int_mult_hom ~> wi_hom_mult

5844 word_of_int_minus_hom ~> wi_hom_neg

5845 word_of_int_succ_hom ~> wi_hom_succ

5846 word_of_int_pred_hom ~> wi_hom_pred

5847 word_of_int_0_hom ~> word_0_wi

5848 word_of_int_1_hom ~> word_1_wi

5850 * Session HOL-Word: New proof method "word_bitwise" for splitting

5851 machine word equalities and inequalities into logical circuits,

5852 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,

5853 multiplication, shifting by constants, bitwise operators and numeric

5854 constants. Requires fixed-length word types, not 'a word. Solves

5855 many standard word identities outright and converts more into first

5856 order problems amenable to blast or similar. See also examples in

5857 HOL/Word/Examples/WordExamples.thy.

5859 * Session HOL-Probability: Introduced the type "'a measure" to

5860 represent measures, this replaces the records 'a algebra and 'a

5861 measure_space. The locales based on subset_class now have two

5862 locale-parameters the space \<Omega> and the set of measurable sets M.

5863 The product of probability spaces uses now the same constant as the

5864 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)

5865 measure". Most constants are defined now outside of locales and gain

5866 an additional parameter, like null_sets, almost_eventually or \<mu>'.

5867 Measure space constructions for distributions and densities now got

5868 their own constants distr and density. Instead of using locales to

5869 describe measure spaces with a finite space, the measure count_space

5870 and point_measure is introduced. INCOMPATIBILITY.

5872 Renamed constants:

5873 measure -> emeasure

5874 finite_measure.\<mu>' -> measure

5875 product_algebra_generator -> prod_algebra

5876 product_prob_space.emb -> prod_emb

5877 product_prob_space.infprod_algebra -> PiM

5879 Removed locales:

5880 completeable_measure_space

5881 finite_measure_space

5882 finite_prob_space

5883 finite_product_finite_prob_space

5884 finite_product_sigma_algebra

5885 finite_sigma_algebra

5886 measure_space

5887 pair_finite_prob_space

5888 pair_finite_sigma_algebra

5889 pair_finite_space

5890 pair_sigma_algebra

5891 product_sigma_algebra

5893 Removed constants:

5894 conditional_space

5895 distribution -> use distr measure, or distributed predicate

5896 image_space

5897 joint_distribution -> use distr measure, or distributed predicate

5898 pair_measure_generator

5899 product_prob_space.infprod_algebra -> use PiM

5900 subvimage

5902 Replacement theorems:

5903 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite

5904 finite_measure.empty_measure -> measure_empty

5905 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq

5906 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq

5907 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably

5908 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure

5909 finite_measure.finite_measure -> finite_measure.emeasure_finite

5910 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton

5911 finite_measure.positive_measure' -> measure_nonneg

5912 finite_measure.real_measure -> finite_measure.emeasure_real

5913 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb

5914 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite

5915 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty

5916 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed

5917 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple

5918 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple

5919 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple

5920 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple

5921 information_space.entropy_commute -> information_space.entropy_commute_simple

5922 information_space.entropy_eq -> information_space.entropy_simple_distributed

5923 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed

5924 information_space.entropy_positive -> information_space.entropy_nonneg_simple

5925 information_space.entropy_uniform_max -> information_space.entropy_uniform

5926 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq

5927 information_space.KL_eq_0 -> information_space.KL_same_eq_0

5928 information_space.KL_ge_0 -> information_space.KL_nonneg

5929 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed

5930 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple

5931 Int_stable_cuboids -> Int_stable_atLeastAtMost

5932 Int_stable_product_algebra_generator -> positive_integral

5933 measure_preserving -> equality "distr M N f = N" "f : measurable M N"

5934 measure_space.additive -> emeasure_additive

5935 measure_space.AE_iff_null_set -> AE_iff_null

5936 measure_space.almost_everywhere_def -> eventually_ae_filter

5937 measure_space.almost_everywhere_vimage -> AE_distrD

5938 measure_space.continuity_from_above -> INF_emeasure_decseq

5939 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq

5940 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq

5941 measure_space.continuity_from_below -> SUP_emeasure_incseq

5942 measure_space_density -> emeasure_density

5943 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density

5944 measure_space.integrable_vimage -> integrable_distr

5945 measure_space.integral_translated_density -> integral_density

5946 measure_space.integral_vimage -> integral_distr

5947 measure_space.measure_additive -> plus_emeasure

5948 measure_space.measure_compl -> emeasure_compl

5949 measure_space.measure_countable_increasing -> emeasure_countable_increasing

5950 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably

5951 measure_space.measure_decseq -> decseq_emeasure

5952 measure_space.measure_Diff -> emeasure_Diff

5953 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set

5954 measure_space.measure_eq_0 -> emeasure_eq_0

5955 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite

5956 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton

5957 measure_space.measure_incseq -> incseq_emeasure

5958 measure_space.measure_insert -> emeasure_insert

5959 measure_space.measure_mono -> emeasure_mono

5960 measure_space.measure_not_negative -> emeasure_not_MInf

5961 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq

5962 measure_space.measure_setsum -> setsum_emeasure

5963 measure_space.measure_setsum_split -> setsum_emeasure_cover

5964 measure_space.measure_space_vimage -> emeasure_distr

5965 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite

5966 measure_space.measure_subadditive -> subadditive

5967 measure_space.measure_top -> emeasure_space

5968 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0

5969 measure_space.measure_Un_null_set -> emeasure_Un_null_set

5970 measure_space.positive_integral_translated_density -> positive_integral_density

5971 measure_space.positive_integral_vimage -> positive_integral_distr

5972 measure_space.real_continuity_from_above -> Lim_measure_decseq

5973 measure_space.real_continuity_from_below -> Lim_measure_incseq

5974 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably

5975 measure_space.real_measure_Diff -> measure_Diff

5976 measure_space.real_measure_finite_Union -> measure_finite_Union

5977 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton

5978 measure_space.real_measure_subadditive -> measure_subadditive

5979 measure_space.real_measure_Union -> measure_Union

5980 measure_space.real_measure_UNION -> measure_UNION

5981 measure_space.simple_function_vimage -> simple_function_comp

5982 measure_space.simple_integral_vimage -> simple_integral_distr

5983 measure_space.simple_integral_vimage -> simple_integral_distr

5984 measure_unique_Int_stable -> measure_eqI_generator_eq

5985 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq

5986 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1

5987 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2

5988 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1

5989 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2

5990 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff

5991 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap

5992 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'

5993 pair_sigma_algebra.sets_swap -> sets_pair_swap

5994 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1

5995 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2

5996 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap

5997 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2

5998 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt

5999 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times

6000 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM

6001 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq

6002 prob_space.measure_space_1 -> prob_space.emeasure_space_1

6003 prob_space.prob_space_vimage -> prob_space_distr

6004 prob_space.random_variable_restrict -> measurable_restrict

6005 prob_space_unique_Int_stable -> measure_eqI_prob_space

6006 product_algebraE -> prod_algebraE_all

6007 product_algebra_generator_der -> prod_algebra_eq_finite

6008 product_algebra_generator_into_space -> prod_algebra_sets_into_space

6009 product_algebraI -> sets_PiM_I_finite

6010 product_measure_exists -> product_sigma_finite.sigma_finite

6011 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator

6012 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb

6013 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty

6014 product_prob_space.measurable_component -> measurable_component_singleton

6015 product_prob_space.measurable_emb -> measurable_prod_emb

6016 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single

6017 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton

6018 product_prob_space.measure_emb -> emeasure_prod_emb

6019 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict

6020 product_sigma_algebra.product_algebra_into_space -> space_closed

6021 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge

6022 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton

6023 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge

6024 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable

6025 sets_product_algebra -> sets_PiM

6026 sigma_algebra.measurable_sigma -> measurable_measure_of

6027 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint

6028 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr

6029 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq

6030 space_product_algebra -> space_PiM

6032 * Session HOL-TPTP: support to parse and import TPTP problems (all

6033 languages) into Isabelle/HOL.

6036 *** FOL ***

6038 * New "case_product" attribute (see HOL).

6041 *** ZF ***

6043 * Greater support for structured proofs involving induction or case

6044 analysis.

6046 * Much greater use of mathematical symbols.

6048 * Removal of many ML theorem bindings. INCOMPATIBILITY.

6051 *** ML ***

6053 * Antiquotation @{keyword "name"} produces a parser for outer syntax

6054 from a minor keyword introduced via theory header declaration.

6056 * Antiquotation @{command_spec "name"} produces the

6057 Outer_Syntax.command_spec from a major keyword introduced via theory

6058 header declaration; it can be passed to Outer_Syntax.command etc.

6060 * Local_Theory.define no longer hard-wires default theorem name

6061 "foo_def", but retains the binding as given. If that is Binding.empty

6062 / Attrib.empty_binding, the result is not registered as user-level

6063 fact. The Local_Theory.define_internal variant allows to specify a

6064 non-empty name (used for the foundation in the background theory),

6065 while omitting the fact binding in the user-context. Potential

6066 INCOMPATIBILITY for derived definitional packages: need to specify

6067 naming policy for primitive definitions more explicitly.

6069 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in

6070 conformance with similar operations in structure Term and Logic.

6072 * Antiquotation @{attributes [...]} embeds attribute source

6073 representation into the ML text, which is particularly useful with

6074 declarations like Local_Theory.note.

6076 * Structure Proof_Context follows standard naming scheme. Old

6077 ProofContext has been discontinued. INCOMPATIBILITY.

6079 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle

6080 change of semantics: update is applied to auxiliary local theory

6081 context as well.

6083 * Modernized some old-style infix operations:

6085 addeqcongs ~> Simplifier.add_eqcong

6086 deleqcongs ~> Simplifier.del_eqcong

6087 addcongs ~> Simplifier.add_cong

6088 delcongs ~> Simplifier.del_cong

6089 setmksimps ~> Simplifier.set_mksimps

6090 setmkcong ~> Simplifier.set_mkcong

6091 setmksym ~> Simplifier.set_mksym

6092 setmkeqTrue ~> Simplifier.set_mkeqTrue

6093 settermless ~> Simplifier.set_termless

6094 setsubgoaler ~> Simplifier.set_subgoaler

6095 addsplits ~> Splitter.add_split

6096 delsplits ~> Splitter.del_split

6099 *** System ***

6101 * USER_HOME settings variable points to cross-platform user home

6102 directory, which coincides with HOME on POSIX systems only. Likewise,

6103 the Isabelle path specification "~" now expands to $USER_HOME, instead

6104 of former $HOME. A different default for USER_HOME may be set

6105 explicitly in shell environment, before Isabelle settings are

6106 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where

6107 the generic user home was intended.

6109 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name

6110 notation, which is useful for the jEdit file browser, for example.

6112 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar

6113 (not just JRE).

6117 New in Isabelle2011-1 (October 2011)

6118 ------------------------------------

6120 *** General ***

6122 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as

6123 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.

6125 - Management of multiple theory files directly from the editor

6126 buffer store -- bypassing the file-system (no requirement to save

6127 files for checking).

6129 - Markup of formal entities within the text buffer, with semantic

6130 highlighting, tooltips and hyperlinks to jump to defining source

6131 positions.

6133 - Improved text rendering, with sub/superscripts in the source

6134 buffer (including support for copy/paste wrt. output panel, HTML

6135 theory output and other non-Isabelle text boxes).

6137 - Refined scheduling of proof checking and printing of results,

6138 based on interactive editor view. (Note: jEdit folding and

6139 narrowing allows to restrict buffer perspectives explicitly.)

6141 - Reduced CPU performance requirements, usable on machines with few

6142 cores.

6144 - Reduced memory requirements due to pruning of unused document

6145 versions (garbage collection).

6147 See also ~~/src/Tools/jEdit/README.html for further information,

6148 including some remaining limitations.

6150 * Theory loader: source files are exclusively located via the master

6151 directory of each theory node (where the .thy file itself resides).

6152 The global load path (such as src/HOL/Library) has been discontinued.

6153 Note that the path element ~~ may be used to reference theories in the

6154 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".

6155 INCOMPATIBILITY.

6157 * Theory loader: source files are identified by content via SHA1

6158 digests. Discontinued former path/modtime identification and optional

6159 ISABELLE_FILE_IDENT plugin scripts.

6161 * Parallelization of nested Isar proofs is subject to

6162 Goal.parallel_proofs_threshold (default 100). See also isabelle

6163 usedir option -Q.

6165 * Name space: former unsynchronized references are now proper

6166 configuration options, with more conventional names:

6168 long_names ~> names_long

6169 short_names ~> names_short

6170 unique_names ~> names_unique

6172 Minor INCOMPATIBILITY, need to declare options in context like this:

6174 declare [[names_unique = false]]

6176 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note

6177 that the result needs to be unique, which means fact specifications

6178 may have to be refined after enriching a proof context.

6180 * Attribute "case_names" has been refined: the assumptions in each case

6181 can be named now by following the case name with [name1 name2 ...].

6183 * Isabelle/Isar reference manual has been updated and extended:

6184 - "Synopsis" provides a catalog of main Isar language concepts.

6185 - Formal references in syntax diagrams, via @{rail} antiquotation.

6186 - Updated material from classic "ref" manual, notably about

6187 "Classical Reasoner".

6190 *** HOL ***

6192 * Class bot and top require underlying partial order rather than

6193 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.

6195 * Class complete_lattice: generalized a couple of lemmas from sets;

6196 generalized theorems INF_cong and SUP_cong. New type classes for

6197 complete boolean algebras and complete linear orders. Lemmas

6198 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in

6199 class complete_linorder.

6201 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,

6202 Sup_fun_def, Inf_apply, Sup_apply.

6204 Removed redundant lemmas (the right hand side gives hints how to

6205 replace them for (metis ...), or (simp only: ...) proofs):

6207 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]

6208 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]

6209 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right

6210 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right

6211 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right

6212 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right

6213 Inter_def ~> INF_def, image_def

6214 Union_def ~> SUP_def, image_def

6215 INT_eq ~> INF_def, and image_def

6216 UN_eq ~> SUP_def, and image_def

6217 INF_subset ~> INF_superset_mono [OF _ order_refl]

6219 More consistent and comprehensive names:

6221 INTER_eq_Inter_image ~> INF_def

6222 UNION_eq_Union_image ~> SUP_def

6223 INFI_def ~> INF_def

6224 SUPR_def ~> SUP_def

6225 INF_leI ~> INF_lower

6226 INF_leI2 ~> INF_lower2

6227 le_INFI ~> INF_greatest

6228 le_SUPI ~> SUP_upper

6229 le_SUPI2 ~> SUP_upper2

6230 SUP_leI ~> SUP_least

6231 INFI_bool_eq ~> INF_bool_eq

6232 SUPR_bool_eq ~> SUP_bool_eq

6233 INFI_apply ~> INF_apply

6234 SUPR_apply ~> SUP_apply

6235 INTER_def ~> INTER_eq

6236 UNION_def ~> UNION_eq

6238 INCOMPATIBILITY.

6240 * Renamed theory Complete_Lattice to Complete_Lattices.

6241 INCOMPATIBILITY.

6243 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,

6244 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,

6245 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,

6246 Sup_insert are now declared as [simp]. INCOMPATIBILITY.

6248 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,

6249 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,

6250 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor

6251 INCOMPATIBILITY.

6253 * Added syntactic classes "inf" and "sup" for the respective

6254 constants. INCOMPATIBILITY: Changes in the argument order of the

6255 (mostly internal) locale predicates for some derived classes.

6257 * Theorem collections ball_simps and bex_simps do not contain theorems

6258 referring to UNION any longer; these have been moved to collection

6259 UN_ball_bex_simps. INCOMPATIBILITY.

6261 * Theory Archimedean_Field: floor now is defined as parameter of a