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

NEWS

author | wenzelm |

Wed May 02 19:18:29 2018 +0200 (2018-05-02) | |

changeset 68067 | b91c4acc1aaf |

parent 68033 | ad4b8b6892c3 |

child 68073 | fad29d2a17a5 |

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

clarified menu actions;

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 * Marginal comments need to be written exclusively in the new-style form

13 "\<comment> \<open>text\<close>", old ASCII variants like "-- {* ... *}" are no longer

14 supported. INCOMPATIBILITY, use the command-line tool "isabelle

15 update_comments" to update existing theory files.

17 * Old-style inner comments (* ... *) within the term language are legacy

18 and will be discontinued soon: use formal comments "\<comment> \<open>...\<close>" or "\<^cancel>\<open>...\<close>"

19 instead.

21 * The "op <infix-op>" syntax for infix operators has been replaced by

22 "(<infix-op>)". If <infix-op> begins or ends with a "*", there needs to

23 be a space between the "*" and the corresponding parenthesis.

24 INCOMPATIBILITY.

25 There is an Isabelle tool "update_op" that converts theory and ML files

26 to the new syntax. Because it is based on regular expression matching,

27 the result may need a bit of manual postprocessing. Invoking "isabelle

28 update_op" converts all files in the current directory (recursively).

29 In case you want to exclude conversion of ML files (because the tool

30 frequently also converts ML's "op" syntax), use option "-m".

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

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

34 object-logic equality or equivalence.

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

37 to refer to unqualified theories from the parent session.

38 INCOMPATIBILITY for old developments that have not been updated to

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

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

42 INCOMPATIBILITY.

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

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

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

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

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

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

51 without specific Prover IDE management.

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

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

55 context.

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

58 accessible ROOT file is processed only once. This facilitates

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

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

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

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

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

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

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

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

72 *** Isabelle/jEdit Prover IDE ***

74 * System options "spell_checker_include" and "spell_checker_exclude"

75 supersede former "spell_checker_elements" to determine regions of text

76 that are subject to spell-checking. Minor INCOMPATIBILITY.

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

79 follow links to theories and document files etc.

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

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

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

85 for session selection:

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

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

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

89 - option -F focuses on the specified logic session

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

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

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

94 Examples:

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

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

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

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

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

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

102 arguments into this format.

104 * Completion provides templates for named symbols with arguments,

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

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

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

110 notably bibtex database files and ML files.

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

113 plain-text document draft. Both are available via the menu "Plugins /

114 Isabelle".

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

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

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

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

120 Unicode content when saving the file.

122 * Update to jedit-5.5.0, the latest release.

125 *** Isabelle/VSCode Prover IDE ***

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

128 Isabelle/jEdit.

131 *** Document preparation ***

133 * Formal comments work uniformly in outer syntax, inner syntax (term

134 language), Isabelle/ML and some other embedded languages of Isabelle.

135 See also "Document comments" in the isar-ref manual. The following forms

136 are supported:

138 - marginal text comment: \<comment> \<open>\<dots>\<close>

139 - canceled source: \<^cancel>\<open>\<dots>\<close>

140 - raw LaTeX: \<^latex>\<open>\<dots>\<close>

142 * Outside of the inner theory body, the default presentation context is

143 theory Pure. Thus elementary antiquotations may be used in markup

144 commands (e.g. 'chapter', 'section', 'text') and formal comments.

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

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

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

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

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

152 of option "document_tags" to these commands.

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

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

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

157 \isactrlconstUNDERSCOREname.

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

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

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

163 session name verbatim.

165 * Document preparation with skip_proofs option now preserves the content

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

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

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

170 latex and bibtex process. Minor INCOMPATIBILITY.

173 *** Isar ***

175 * Command 'interpret' no longer exposes resulting theorems as literal

176 facts, notably for the \<open>prop\<close> notation or the "fact" proof method. This

177 improves modularity of proofs and scalability of locale interpretation.

178 Rare INCOMPATIBILITY, need to refer to explicitly named facts instead

179 (e.g. use 'find_theorems' or 'try' to figure this out).

181 * Rewrites clauses (keyword 'rewrites') were moved into the locale

182 expression syntax, where they are part of locale instances. In

183 interpretation commands rewrites clauses now need to occur before

184 'for' and 'defines'. Minor INCOMPATIBILITY.

186 * For rewrites clauses, if activating a locale instance fails, fall

187 back to reading the clause first. This helps avoid qualification of

188 locale instances where the qualifier's sole purpose is avoiding

189 duplicate constant declarations.

192 *** Pure ***

194 * The inner syntax category "sort" now includes notation "_" for the

195 dummy sort: it is effectively ignored in type-inference.

198 *** HOL ***

200 * Clarified relationship of characters, strings and code generation:

202 * Type "char" is now a proper datatype of 8-bit values.

204 * Conversions "nat_of_char" and "char_of_nat" are gone; use more

205 general conversions "of_char" and "char_of" with suitable

206 type constraints instead.

208 * The zero character is just written "CHR 0x00", not

209 "0" any longer.

211 * Type "String.literal" (for code generation) is now isomorphic

212 to lists of 7-bit (ASCII) values; concrete values can be written

213 as "STR ''...''" for sequences of printable characters and

214 "STR 0x..." for one single ASCII code point given

215 as hexadecimal numeral.

217 * Type "String.literal" supports concatenation "... + ..."

218 for all standard target languages.

220 * Theory Library/Code_Char is gone; study the explanations concerning

221 "String.literal" in the tutorial on code generation to get an idea

222 how target-language string literals can be converted to HOL string

223 values and vice versa.

225 * Imperative-HOL: operation "raise" directly takes a value of type

226 "String.literal" as argument, not type "string".

228 INCOMPATIBILITY.

230 * Abstract bit operations as part of Main: push_bit, take_bit,

231 drop_bit.

233 * New, more general, axiomatization of complete_distrib_lattice.

234 The former axioms:

235 "sup x (Inf X) = Inf (sup x ` X)" and "inf x (Sup X) = Sup (inf x ` X)"

236 are replaced by

237 "Inf (Sup ` A) <= Sup (Inf ` {f ` A | f . (! Y \<in> A . f Y \<in> Y)})"

238 The instantiations of sets and functions as complete_distrib_lattice

239 are moved to Hilbert_Choice.thy because their proofs need the Hilbert

240 choice operator. The dual of this property is also proved in

241 Hilbert_Choice.thy.

243 * New syntax for the minimum/maximum of a function over a finite set:

244 MIN x\<in>A. B and even MIN x. B (only useful for finite types), also

245 MAX.

247 * Clarifed theorem names:

249 Min.antimono ~> Min.subset_imp

250 Max.antimono ~> Max.subset_imp

252 Minor INCOMPATIBILITY.

254 * A new command parametric_constant for proving parametricity of

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

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

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

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

259 some examples.

261 * SMT module:

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

263 with a solver other than Z3. INCOMPATIBILITY.

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

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

266 option has been added to control this. INCOMPATIBILITY.

268 * Datatypes:

269 - The legacy command 'old_datatype', provided by

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

272 * Theory HOL-Computational_Algebra.Polynomial_Factorial does not provide

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

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

275 INCOMPATIBILITY.

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

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

279 INCOMPATIBILITY.

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

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

283 interpretation of abstract locales. INCOMPATIBILITY.

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

286 INCOMPATIBILITY.

288 * The relator rel_filter on filters has been strengthened to its

289 canonical categorical definition with better properties. INCOMPATIBILITY.

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

293 * Session HOL-Analysis: Moebius functions, the Riemann mapping

294 theorem, the Vitali covering theorem, change-of-variables results for

295 integration and measures.

297 * Class linordered_semiring_1 covers zero_less_one also, ruling out

298 pathologic instances. Minor INCOMPATIBILITY.

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

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

303 abbreviation. INCOMPATIBILITY.

305 * Code generation: Code generation takes an explicit option

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

309 *** System ***

311 * The command-line tools "isabelle server" and "isabelle client" provide

312 access to the Isabelle Server: it supports responsive session management

313 and concurrent use of theories, based on Isabelle/PIDE infrastructure.

314 See also the "system" manual.

316 * The command-line tool "isabelle update_comments" normalizes formal

317 comments in outer syntax as follows: \<comment> \<open>text\<close> (whith a single space to

318 approximate the appearance in document output). This is more specific

319 than former "isabelle update_cartouches -c": the latter tool option has

320 been discontinued.

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

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

324 anymore.

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

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

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

330 repository for the generated session files.

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

333 support has been discontinued.

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

336 longer supported.

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

339 been renamed to ISABELLE_TOOL_JAVA_OPTIONS and JEDIT_JAVA_OPTIONS,

340 instead of former 32/64 variants. INCOMPATIBILITY.

342 * Old settings ISABELLE_PLATFORM and ISABELLE_WINDOWS_PLATFORM should be

343 phased out due to unclear preference of 32bit vs. 64bit architecture.

344 Explicit GNU bash expressions are now preferred, for example (with

345 quotes):

347 #Posix executables (Unix or Cygwin), with preference for 64bit

348 "${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}"

350 #native Windows or Unix executables, with preference for 64bit

351 "${ISABELLE_WINDOWS_PLATFORM64:-${ISABELLE_WINDOWS_PLATFORM32:-${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}}}"

353 #native Windows (32bit) or Unix executables (preference for 64bit)

354 "${ISABELLE_WINDOWS_PLATFORM32:-${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}}"

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

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

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

359 - option -f: forces a fresh build

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

362 corresponding environment values into account, when determining the

363 up-to-date status of a session.

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

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

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

369 PIDE markup for identifier bindings.

371 * ISABELLE_LATEX and ISABELLE_PDFLATEX now include platform-specific

372 options for improved error reporting. Potential INCOMPATIBILITY with

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

375 * The bundled Poly/ML 5.7.1 now uses The GNU Multiple Precision

376 Arithmetic Library (libgmp) on all platforms, notably Mac OS X with

377 32/64 bit.

381 New in Isabelle2017 (October 2017)

382 ----------------------------------

384 *** General ***

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

387 Isabelle/PIDE front-end, see also

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

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

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

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

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

394 Technically, VSCode is based on the Electron application framework

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

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

397 modules around a Language Server implementation.

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

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

401 just the theory base name as before).

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

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

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

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

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

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

409 imports" helps to update theory imports.

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

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

413 leads to the follow renamings:

415 CTT/Main.thy ~> CTT/CTT.thy

416 ZF/Main.thy ~> ZF/ZF.thy

417 ZF/Main_ZF.thy ~> ZF/ZF.thy

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

419 ZF/ZF.thy ~> ZF/ZF_Base.thy

421 INCOMPATIBILITY.

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

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

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

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

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

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

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

432 antiquotations:

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

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

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

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

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

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

441 src/HOL/Decision_Procs/Commutative_Ring.thy and

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

443 tutorial on code generation.

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

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

449 arbitrary theory hierarchies independently of the underlying logic

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

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

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

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

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

456 changes of formal document content. Theory dependencies are always

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

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

459 effectively always enabled.

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

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

463 buffers.

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

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

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

468 represented by a different border color.

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

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

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

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

475 document in the default web browser.

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

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

479 used for formal checking.

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

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

483 enabled at all times.

485 * Update to current jedit-5.4.0.

488 *** Pure ***

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

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

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

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

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

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

497 ignored with warnings if syntactically malformed.

498 - Explicitly global code declarations yield errors if syntactically

499 malformed.

500 - Default code declarations are silently ignored if syntactically

501 malformed.

502 Minor INCOMPATIBILITY.

504 * Clarified and standardized internal data bookkeeping of code

505 declarations: history of serials allows to track potentially

506 non-monotonous declarations appropriately. Minor INCOMPATIBILITY.

509 *** HOL ***

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

513 * SMT module:

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

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

516 disabled by default.

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

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

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

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

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

523 INCOMPATIBILITY.

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

526 terms without free variables are always evaluated using plain evaluation

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

528 INCOMPATIBILITY.

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

531 of "Complex_Main").

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

534 Minor INCOMPATIBILITY.

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

537 INCOMPATIBILITY.

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

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

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

543 transp, antisymp, single_valuedp instead. INCOMPATIBILITY.

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

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

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

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

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

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

554 * Named theorems mod_simps covers various congruence rules concerning

555 mod, replacing former zmod_simps. INCOMPATIBILITY.

557 * Swapped orientation of congruence rules mod_add_left_eq,

558 mod_add_right_eq, mod_add_eq, mod_mult_left_eq, mod_mult_right_eq,

559 mod_mult_eq, mod_minus_eq, mod_diff_left_eq, mod_diff_right_eq,

560 mod_diff_eq. INCOMPATIBILITY.

562 * Generalized some facts:

563 measure_induct_rule

564 measure_induct

565 zminus_zmod ~> mod_minus_eq

566 zdiff_zmod_left ~> mod_diff_left_eq

567 zdiff_zmod_right ~> mod_diff_right_eq

568 zmod_eq_dvd_iff ~> mod_eq_dvd_iff

569 INCOMPATIBILITY.

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

572 euclidean_(semi)ring, euclidean_(semi)ring_cancel,

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

574 euclidean size.

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

577 - Euclidean induction is available as rule eucl_induct.

578 - Constants Euclidean_Algorithm.gcd, Euclidean_Algorithm.lcm,

579 Euclidean_Algorithm.Gcd and Euclidean_Algorithm.Lcm allow

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

581 - Coefficients obtained by extended euclidean algorithm are

582 available as "bezout_coefficients".

583 INCOMPATIBILITY.

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

586 totient function previously hidden as solitary example in theory

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

588 the literature. Minor INCOMPATIBILITY.

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

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

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

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

595 been renamed to bij_swap_compose_bij. INCOMPATIBILITY.

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

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

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

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

602 space. INCOMPATIBILITY.

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

605 INCOMPATIBILITY.

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

608 replacement syntax has been removed. INCOMPATIBILITY, standard syntax

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

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

612 syntax (ASCII)

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

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

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

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

618 multisets have been renamed:

620 msetless_cancel_numerals ~> msetsubset_cancel

621 msetle_cancel_numerals ~> msetsubset_eq_cancel

623 INCOMPATIBILITY.

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

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

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

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

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

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

633 Curve Theorem and the Great Picard Theorem.

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

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

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

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

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

642 theories, notably Euclidean_Algorithm, Factorial_Ring,

643 Formal_Power_Series, Fraction_Field, Fundamental_Theorem_Algebra,

644 Normalized_Fraction, Polynomial_FPS, Polynomial, Primes. Minor

645 INCOMPATIBILITY.

648 *** System ***

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

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

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

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

655 "Application File Format" in the sense of

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

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

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

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

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

662 builds (according to parallel_subproofs_threshold).

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

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

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

667 unchanged.

669 * Isabelle settings variable ISABELLE_SCALA_BUILD_OPTIONS has been

670 renamed to ISABELLE_SCALAC_OPTIONS. Rare INCOMPATIBILITY.

672 * Isabelle settings variables ISABELLE_WINDOWS_PLATFORM,

673 ISABELLE_WINDOWS_PLATFORM32, ISABELLE_WINDOWS_PLATFORM64 indicate the

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

675 is analogous to ISABELLE_PLATFORM, ISABELLE_PLATFORM32,

676 ISABELLE_PLATFORM64.

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

679 the Isabelle application bundle for Linux. See also

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

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

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

684 serves as example for alternative PIDE front-ends.

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

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

689 isabelle imports -I -a

690 isabelle imports -U -a

691 isabelle imports -U -i -a

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

696 New in Isabelle2016-1 (December 2016)

697 -------------------------------------

699 *** General ***

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

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

703 INCOMPATIBILITY.

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

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

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

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

708 result the subgoal may be split into several subgoals.

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

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

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

714 bundle foo

715 begin

716 declare a [simp]

717 declare b [intro]

718 end

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

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

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

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

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

726 discontinued.

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

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

730 quotes when sub-languages are nested.

732 * Mixfix annotations support general block properties, with syntax

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

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

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

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

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

739 statements without object-logic judgment.

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

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

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

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

746 examples.

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

749 instances) are generated into companion object of corresponding type

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

752 * Solve direct: option "solve_direct_strict_warnings" gives explicit

753 warnings for lemma statements with trivial proofs.

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

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

759 system option editor_generated_input_delay (in addition to existing

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

761 reactivity and CPU usage.

763 * Syntactic indentation according to Isabelle outer syntax. Action

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

765 command keywords and some command substructure. Action

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

767 according to command keywords only; see also option

768 "jedit_indent_newline".

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

771 number of subgoals. This requires information of ongoing document

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

773 quickly; see also option "jedit_script_indent" and

774 "jedit_script_indent_limit".

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

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

778 structure of theory specifications is treated as well.

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

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

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

784 e.g. 'context', 'notepad'.

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

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

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

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

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

793 systematic renaming.

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

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

797 theorem statement.

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

800 situations where old ASCII notation may be updated.

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

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

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

805 inaccessible via keyboard completion).

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

808 following independent stages:

810 src/Pure/ROOT0.ML

811 src/Pure/ROOT.ML

812 src/Pure/Pure.thy

813 src/Pure/ML_Bootstrap.thy

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

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

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

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

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

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

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

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

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

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

827 * Additional abbreviations for syntactic completion may be specified

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

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

830 new 'abbrevs' section.

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

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

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

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

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

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

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

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

841 old keymaps.

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

844 and diverse:

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

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

848 @{dir NAME} -- check for directory

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

851 have to be changed.

854 *** Document preparation ***

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

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

859 existing antiquotation @{class}.

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

862 this allows special forms of document output.

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

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

866 derivatives.

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

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

871 Isabelle2015).

874 *** Isar ***

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

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

878 'definition', 'inductive', 'function'.

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

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

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

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

884 context: INCOMPATIBILITY.

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

887 optional abstraction over local parameters. The syntax resembles

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

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

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

892 context.

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

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

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

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

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

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

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

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

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

906 INCOMPATIBILITY.

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

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

910 definitions.

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

913 expression, e.g.

915 (use facts in simp)

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

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

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

922 *** Pure ***

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

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

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

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

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

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

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

932 regardless of the actual parameters that are provided. Rare

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

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

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

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

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

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

940 INCOMPATIBILITY, need to provide explicit type constraints for Pure

941 types where this is really intended.

944 *** HOL ***

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

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

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

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

950 quantifier-free propositional logic with linear real arithmetic

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

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

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

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

957 break existing proofs. INCOMPATIBILITY.

959 * Sledgehammer:

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

961 - Produce syntactically correct Vampire 4.0 problem files.

963 * (Co)datatype package:

964 - New commands for defining corecursive functions and reasoning about

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

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

967 method. See 'isabelle doc corec'.

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

969 citizen in bounded natural functors.

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

971 to the map function.

972 - 'bnf' automatically discharges reflexive proof obligations.

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

974 terms of map and set

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

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

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

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

979 - Renamed lemmas:

980 rel_prod_apply ~> rel_prod_inject

981 pred_prod_apply ~> pred_prod_inject

982 INCOMPATIBILITY.

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

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

985 equivalent) form.

986 INCOMPATIBILITY.

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

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

990 which exposed details of the internal fixpoint construction and was

991 hard to use. INCOMPATIBILITY.

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

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

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

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

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

1000 eliminated altogether.

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

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

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

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

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

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

1008 INCOMPATIBILITY in rare situations.

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

1011 INCOMPATIBILITY.

1013 * Renamed constants and corresponding theorems:

1015 setsum ~> sum

1016 setprod ~> prod

1017 listsum ~> sum_list

1018 listprod ~> prod_list

1020 INCOMPATIBILITY.

1022 * Sligthly more standardized theorem names:

1023 sgn_times ~> sgn_mult

1024 sgn_mult' ~> Real_Vector_Spaces.sgn_mult

1025 divide_zero_left ~> div_0

1026 zero_mod_left ~> mod_0

1027 divide_zero ~> div_by_0

1028 divide_1 ~> div_by_1

1029 nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left

1030 div_mult_self1_is_id ~> nonzero_mult_div_cancel_left

1031 nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right

1032 div_mult_self2_is_id ~> nonzero_mult_div_cancel_right

1033 is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left

1034 is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right

1035 mod_div_equality ~> div_mult_mod_eq

1036 mod_div_equality2 ~> mult_div_mod_eq

1037 mod_div_equality3 ~> mod_div_mult_eq

1038 mod_div_equality4 ~> mod_mult_div_eq

1039 minus_div_eq_mod ~> minus_div_mult_eq_mod

1040 minus_div_eq_mod2 ~> minus_mult_div_eq_mod

1041 minus_mod_eq_div ~> minus_mod_eq_div_mult

1042 minus_mod_eq_div2 ~> minus_mod_eq_mult_div

1043 div_mod_equality' ~> minus_mod_eq_div_mult [symmetric]

1044 mod_div_equality' ~> minus_div_mult_eq_mod [symmetric]

1045 zmod_zdiv_equality ~> mult_div_mod_eq [symmetric]

1046 zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric]

1047 Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

1048 mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

1049 zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric]

1050 div_1 ~> div_by_Suc_0

1051 mod_1 ~> mod_by_Suc_0

1052 INCOMPATIBILITY.

1054 * New type class "idom_abs_sgn" specifies algebraic properties

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

1056 disappeared. Slight INCOMPATIBILITY.

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

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

1061 corresponding to {0..255}.

1063 - Logical representation:

1064 * 0 is instantiated to the ASCII zero character.

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

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

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

1068 are non-canonical.

1069 - Printing and parsing:

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

1071 (as before).

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

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

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

1075 is parsable for every numeral expression n.

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

1077 printed as their logical representation.

1078 - Explicit conversions from and to the natural numbers are

1079 provided as char_of_nat, nat_of_char (as before).

1080 - The auxiliary nibble type has been discontinued.

1082 INCOMPATIBILITY.

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

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

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

1087 infix "mod" syntax. INCOMPATIBILITY.

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

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

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

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

1093 easily recovered by composition with eq_refl. Minor INCOMPATIBILITY.

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

1096 equation in term output. Minor INCOMPATIBILITY.

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

1099 which renders those abstract effectively.

1101 * Command 'export_code' checks given constants for abstraction

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

1103 interface for the generated code.

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

1106 spelt out explicitly.

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

1109 explicitly provided auxiliary definitions for required type class

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

1111 tutorial on code generation for details.

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

1114 products.

1116 * Locale bijection establishes convenient default simp rules such as

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

1119 * Abstract locales semigroup, abel_semigroup, semilattice,

1120 semilattice_neutr, ordering, ordering_top, semilattice_order,

1121 semilattice_neutr_order, comm_monoid_set, semilattice_set,

1122 semilattice_neutr_set, semilattice_order_set,

1123 semilattice_order_neutr_set monoid_list, comm_monoid_list,

1124 comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified

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

1126 INCOMPATIBILITY.

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

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

1130 lifting_syntax begin ... end". Minor INCOMPATIBILITY.

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

1133 INCOMPATIBILITY.

1135 nat_less_cases -- removed, use linorder_cases instead

1136 inv_image_comp -- removed, use image_inv_f_f instead

1137 image_surj_f_inv_f ~> image_f_inv_f

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

1140 groups to semi-groups that are also monoids:

1141 le_add_same_cancel1

1142 le_add_same_cancel2

1143 less_add_same_cancel1

1144 less_add_same_cancel2

1145 add_le_same_cancel1

1146 add_le_same_cancel2

1147 add_less_same_cancel1

1148 add_less_same_cancel2

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

1151 superseeded by a more general version:

1152 less_add_cancel_left_greater_zero ~> less_add_same_cancel1

1153 less_add_cancel_right_greater_zero ~> less_add_same_cancel2

1154 less_eq_add_cancel_left_greater_eq_zero ~> le_add_same_cancel1

1155 less_eq_add_cancel_right_greater_eq_zero ~> le_add_same_cancel2

1156 less_eq_add_cancel_left_less_eq_zero ~> add_le_same_cancel1

1157 less_eq_add_cancel_right_less_eq_zero ~> add_le_same_cancel2

1158 less_add_cancel_left_less_zero ~> add_less_same_cancel1

1159 less_add_cancel_right_less_zero ~> add_less_same_cancel2

1160 INCOMPATIBILITY.

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

1163 resemble the f.split naming convention, INCOMPATIBILITY.

1165 * Added class topological_monoid.

1167 * The following theorems have been renamed:

1169 setsum_left_distrib ~> sum_distrib_right

1170 setsum_right_distrib ~> sum_distrib_left

1172 INCOMPATIBILITY.

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

1175 INCOMPATIBILITY.

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

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

1179 A)".

1181 * Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY.

1183 * The type class ordered_comm_monoid_add is now called

1184 ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add

1185 is introduced as the combination of ordered_ab_semigroup_add +

1186 comm_monoid_add. INCOMPATIBILITY.

1188 * Introduced the type classes canonically_ordered_comm_monoid_add and

1189 dioid.

1191 * Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When

1192 instantiating linordered_semiring_strict and ordered_ab_group_add, an

1193 explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might

1194 be required. INCOMPATIBILITY.

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

1197 of a more general type also:

1198 lcm_left_commute_nat ~> lcm.left_commute

1199 lcm_left_commute_int ~> lcm.left_commute

1200 gcd_left_commute_nat ~> gcd.left_commute

1201 gcd_left_commute_int ~> gcd.left_commute

1202 gcd_greatest_iff_nat ~> gcd_greatest_iff

1203 gcd_greatest_iff_int ~> gcd_greatest_iff

1204 coprime_dvd_mult_nat ~> coprime_dvd_mult

1205 coprime_dvd_mult_int ~> coprime_dvd_mult

1206 zpower_numeral_even ~> power_numeral_even

1207 gcd_mult_cancel_nat ~> gcd_mult_cancel

1208 gcd_mult_cancel_int ~> gcd_mult_cancel

1209 div_gcd_coprime_nat ~> div_gcd_coprime

1210 div_gcd_coprime_int ~> div_gcd_coprime

1211 zpower_numeral_odd ~> power_numeral_odd

1212 zero_less_int_conv ~> of_nat_0_less_iff

1213 gcd_greatest_nat ~> gcd_greatest

1214 gcd_greatest_int ~> gcd_greatest

1215 coprime_mult_nat ~> coprime_mult

1216 coprime_mult_int ~> coprime_mult

1217 lcm_commute_nat ~> lcm.commute

1218 lcm_commute_int ~> lcm.commute

1219 int_less_0_conv ~> of_nat_less_0_iff

1220 gcd_commute_nat ~> gcd.commute

1221 gcd_commute_int ~> gcd.commute

1222 Gcd_insert_nat ~> Gcd_insert

1223 Gcd_insert_int ~> Gcd_insert

1224 of_int_int_eq ~> of_int_of_nat_eq

1225 lcm_least_nat ~> lcm_least

1226 lcm_least_int ~> lcm_least

1227 lcm_assoc_nat ~> lcm.assoc

1228 lcm_assoc_int ~> lcm.assoc

1229 int_le_0_conv ~> of_nat_le_0_iff

1230 int_eq_0_conv ~> of_nat_eq_0_iff

1231 Gcd_empty_nat ~> Gcd_empty

1232 Gcd_empty_int ~> Gcd_empty

1233 gcd_assoc_nat ~> gcd.assoc

1234 gcd_assoc_int ~> gcd.assoc

1235 zero_zle_int ~> of_nat_0_le_iff

1236 lcm_dvd2_nat ~> dvd_lcm2

1237 lcm_dvd2_int ~> dvd_lcm2

1238 lcm_dvd1_nat ~> dvd_lcm1

1239 lcm_dvd1_int ~> dvd_lcm1

1240 gcd_zero_nat ~> gcd_eq_0_iff

1241 gcd_zero_int ~> gcd_eq_0_iff

1242 gcd_dvd2_nat ~> gcd_dvd2

1243 gcd_dvd2_int ~> gcd_dvd2

1244 gcd_dvd1_nat ~> gcd_dvd1

1245 gcd_dvd1_int ~> gcd_dvd1

1246 int_numeral ~> of_nat_numeral

1247 lcm_ac_nat ~> ac_simps

1248 lcm_ac_int ~> ac_simps

1249 gcd_ac_nat ~> ac_simps

1250 gcd_ac_int ~> ac_simps

1251 abs_int_eq ~> abs_of_nat

1252 zless_int ~> of_nat_less_iff

1253 zdiff_int ~> of_nat_diff

1254 zadd_int ~> of_nat_add

1255 int_mult ~> of_nat_mult

1256 int_Suc ~> of_nat_Suc

1257 inj_int ~> inj_of_nat

1258 int_1 ~> of_nat_1

1259 int_0 ~> of_nat_0

1260 Lcm_empty_nat ~> Lcm_empty

1261 Lcm_empty_int ~> Lcm_empty

1262 Lcm_insert_nat ~> Lcm_insert

1263 Lcm_insert_int ~> Lcm_insert

1264 comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd

1265 comp_fun_idem_gcd_int ~> comp_fun_idem_gcd

1266 comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm

1267 comp_fun_idem_lcm_int ~> comp_fun_idem_lcm

1268 Lcm_eq_0 ~> Lcm_eq_0_I

1269 Lcm0_iff ~> Lcm_0_iff

1270 Lcm_dvd_int ~> Lcm_least

1271 divides_mult_nat ~> divides_mult

1272 divides_mult_int ~> divides_mult

1273 lcm_0_nat ~> lcm_0_right

1274 lcm_0_int ~> lcm_0_right

1275 lcm_0_left_nat ~> lcm_0_left

1276 lcm_0_left_int ~> lcm_0_left

1277 dvd_gcd_D1_nat ~> dvd_gcdD1

1278 dvd_gcd_D1_int ~> dvd_gcdD1

1279 dvd_gcd_D2_nat ~> dvd_gcdD2

1280 dvd_gcd_D2_int ~> dvd_gcdD2

1281 coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff

1282 coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff

1283 realpow_minus_mult ~> power_minus_mult

1284 realpow_Suc_le_self ~> power_Suc_le_self

1285 dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest

1286 INCOMPATIBILITY.

1288 * Renamed HOL/Quotient_Examples/FSet.thy to

1289 HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY.

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

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

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

1294 "unbundle finfun_syntax" to imitate import of

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

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

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

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

1300 once.

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

1303 set_mset rather than count.

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

1306 by default.

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

1309 equations count_eq_zero_iff and not_in_iff.

1311 - Rules count_inI and in_countE obtain facts of the form

1312 "count M a = n" from membership.

1314 - Rules count_in_diffI and in_diff_countE obtain facts of the form

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

1317 INCOMPATIBILITY.

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

1320 displaying equations in functional programming style --- variables

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

1322 underscores.

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

1325 build partial equivalence relations from a predicate and an equivalence

1326 relation.

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

1329 everywhere fix bijections.

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

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

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

1334 denominator is normalized wrt. unit factors).

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

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

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

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

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

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

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

1346 principle, Residue theorem, Schwarz Lemma.

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

1349 polytopes, and the Krein–Milman Minkowski theorem.

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

1352 libraries: homeomorphisms, continuous function extensions, invariance of

1353 domain.

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

1356 changed from ereal to ennreal, INCOMPATIBILITY.

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

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

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

1362 Probability Mass Functions.

1364 * Session HOL-Probability: theory Random_Permutations contains some

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

1366 folding over a list in random order.

1368 * Session HOL-Probability: theory SPMF formalises discrete

1369 subprobability distributions.

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

1372 normalised to distinguish which ordering the theorems are about

1374 mset_less_eqI ~> mset_subset_eqI

1375 mset_less_insertD ~> mset_subset_insertD

1376 mset_less_eq_count ~> mset_subset_eq_count

1377 mset_less_diff_self ~> mset_subset_diff_self

1378 mset_le_exists_conv ~> mset_subset_eq_exists_conv

1379 mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel

1380 mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel

1381 mset_le_mono_add ~> mset_subset_eq_mono_add

1382 mset_le_add_left ~> mset_subset_eq_add_left

1383 mset_le_add_right ~> mset_subset_eq_add_right

1384 mset_le_single ~> mset_subset_eq_single

1385 mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute

1386 diff_le_self ~> diff_subset_eq_self

1387 mset_leD ~> mset_subset_eqD

1388 mset_lessD ~> mset_subsetD

1389 mset_le_insertD ~> mset_subset_eq_insertD

1390 mset_less_of_empty ~> mset_subset_of_empty

1391 mset_less_size ~> mset_subset_size

1392 wf_less_mset_rel ~> wf_subset_mset_rel

1393 count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq

1394 mset_remdups_le ~> mset_remdups_subset_eq

1395 ms_lesseq_impl ~> subset_eq_mset_impl

1397 Some functions have been renamed:

1398 ms_lesseq_impl -> subset_eq_mset_impl

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

1401 #\<subseteq># ~> \<le>

1402 #\<subset># ~> <

1403 le_multiset ~> less_eq_multiset

1404 less_multiset ~> le_multiset

1405 INCOMPATIBILITY.

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

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

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

1410 interpretations "multiset_linorder" and "multiset_wellorder" have been

1411 replaced by instantiations. INCOMPATIBILITY.

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

1414 been renamed:

1416 le_multiset_def ~> less_eq_multiset_def

1417 less_multiset_def ~> le_multiset_def

1418 less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset

1419 mult_less_not_refl ~> mset_le_not_refl

1420 mult_less_trans ~> mset_le_trans

1421 mult_less_not_sym ~> mset_le_not_sym

1422 mult_less_asym ~> mset_le_asym

1423 mult_less_irrefl ~> mset_le_irrefl

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

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

1427 le_multiset_total ~> less_eq_multiset_total

1428 less_multiset_right_total ~> subset_eq_imp_le_multiset

1429 le_multiset_empty_left ~> less_eq_multiset_empty_left

1430 le_multiset_empty_right ~> less_eq_multiset_empty_right

1431 less_multiset_empty_right ~> le_multiset_empty_left

1432 less_multiset_empty_left ~> le_multiset_empty_right

1433 union_less_diff_plus ~> union_le_diff_plus

1434 ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset

1435 less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty

1436 le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty

1437 INCOMPATIBILITY.

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

1440 INCOMPATIBILITY.

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

1443 INCOMPATIBILITY, use the following replacements:

1445 le_multiset_plus_plus_left_iff ~> add_less_cancel_right

1446 less_multiset_plus_plus_left_iff ~> add_less_cancel_right

1447 le_multiset_plus_plus_right_iff ~> add_less_cancel_left

1448 less_multiset_plus_plus_right_iff ~> add_less_cancel_left

1449 add_eq_self_empty_iff ~> add_cancel_left_right

1450 mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right

1451 mset_less_add_bothsides ~> subset_mset.add_less_cancel_right

1452 mset_le_add_bothsides ~> subset_mset.add_less_cancel_right

1453 empty_inter ~> subset_mset.inf_bot_left

1454 inter_empty ~> subset_mset.inf_bot_right

1455 empty_sup ~> subset_mset.sup_bot_left

1456 sup_empty ~> subset_mset.sup_bot_right

1457 bdd_below_multiset ~> subset_mset.bdd_above_bot

1458 subset_eq_empty ~> subset_mset.le_zero_eq

1459 le_empty ~> subset_mset.le_zero_eq

1460 mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero

1461 mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero

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

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

1465 additional typeclasses order_bot, no_top,

1466 ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add,

1467 linordered_cancel_ab_semigroup_add, and

1468 ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY.

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

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

1472 INCOMPATIBILITY.

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

1475 interpretations ordered_ab_semigroup_monoid_add_imp_le and

1476 bounded_lattice_bot. INCOMPATIBILITY.

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

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

1480 removed or changed:

1482 single_not_empty ~> add_mset_not_empty or empty_not_add_mset

1483 fold_mset_insert ~> fold_mset_add_mset

1484 image_mset_insert ~> image_mset_add_mset

1485 union_single_eq_diff

1486 multi_self_add_other_not_self

1487 diff_single_eq_union

1488 INCOMPATIBILITY.

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

1491 to use add_mset instead of single:

1493 mset_add

1494 multi_self_add_other_not_self

1495 diff_single_eq_union

1496 union_single_eq_diff

1497 union_single_eq_member

1498 add_eq_conv_diff

1499 insert_noteq_member

1500 add_eq_conv_ex

1501 multi_member_split

1502 multiset_add_sub_el_shuffle

1503 mset_subset_eq_insertD

1504 mset_subset_insertD

1505 insert_subset_eq_iff

1506 insert_union_subset_iff

1507 multi_psub_of_add_self

1508 inter_add_left1

1509 inter_add_left2

1510 inter_add_right1

1511 inter_add_right2

1512 sup_union_left1

1513 sup_union_left2

1514 sup_union_right1

1515 sup_union_right2

1516 size_eq_Suc_imp_eq_union

1517 multi_nonempty_split

1518 mset_insort

1519 mset_update

1520 mult1I

1521 less_add

1522 mset_zip_take_Cons_drop_twice

1523 rel_mset_Zero

1524 msed_map_invL

1525 msed_map_invR

1526 msed_rel_invL

1527 msed_rel_invR

1528 le_multiset_right_total

1529 multiset_induct

1530 multiset_induct2_size

1531 multiset_induct2

1532 INCOMPATIBILITY.

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

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

1536 element:

1538 image_mset

1539 mset

1540 replicate_mset

1541 mult1

1542 pred_mset

1543 rel_mset'

1544 mset_insort

1546 INCOMPATIBILITY.

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

1549 attributes of some multiset theorems have been changed:

1551 insert_DiffM [] ~> [simp]

1552 insert_DiffM2 [simp] ~> []

1553 diff_add_mset_swap [simp]

1554 fold_mset_add_mset [simp]

1555 diff_diff_add [simp] (for multisets only)

1556 diff_cancel [simp] ~> []

1557 count_single [simp] ~> []

1558 set_mset_single [simp] ~> []

1559 size_multiset_single [simp] ~> []

1560 size_single [simp] ~> []

1561 image_mset_single [simp] ~> []

1562 mset_subset_eq_mono_add_right_cancel [simp] ~> []

1563 mset_subset_eq_mono_add_left_cancel [simp] ~> []

1564 fold_mset_single [simp] ~> []

1565 subset_eq_empty [simp] ~> []

1566 empty_sup [simp] ~> []

1567 sup_empty [simp] ~> []

1568 inter_empty [simp] ~> []

1569 empty_inter [simp] ~> []

1570 INCOMPATIBILITY.

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

1573 the second cases of multiset_induct, multiset_induct2_size,

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

1575 INCOMPATIBILITY.

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

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

1579 natural numbers. INCOMPATIBILITY.

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

1582 multisets:

1584 msetsum ~> sum_mset

1585 msetprod ~> prod_mset

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

1588 and union of multisets have been changed:

1590 #\<inter> ~> \<inter>#

1591 #\<union> ~> \<union>#

1593 INCOMPATIBILITY.

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

1596 one_step_implies_mult_aux on multisets has been removed, use

1597 one_step_implies_mult instead. INCOMPATIBILITY.

1599 * Session HOL-Library: theory Complete_Partial_Order2 provides reasoning

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

1601 and about admissibility conditions for fixpoint inductions.

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

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

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

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

1607 future different type class instantiation for polynomials over factorial

1608 rings. INCOMPATIBILITY.

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

1611 the following renaming

1613 prefixeq -> prefix

1614 prefix -> strict_prefix

1615 suffixeq -> suffix

1616 suffix -> strict_suffix

1618 Added theory of longest common prefixes.

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

1621 Generalisation of predicate "prime" and introduction of predicates

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

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

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

1625 "prime_nat_iff". INCOMPATIBILITY.

1627 * Session Old_Number_Theory has been removed, after porting remaining

1628 theories.

1630 * Session HOL-Types_To_Sets provides an experimental extension of

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

1634 *** ML ***

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

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

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

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

1640 INCOMPATIBILITY.

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

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

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

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

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

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

1648 superseded by General.Div.

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

1651 the argument is a plain file. Minor INCOMPATIBILITY.

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

1654 with approximative output quality.

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

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

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

1660 This is particularly useful for conditional compilation, without

1661 requiring separate files.

1663 * Option ML_exception_debugger controls detailed exception trace via the

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

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

1666 debugger information requires consirable time and space: main

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

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

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

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

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

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

1674 balanced blocks of Local_Theory.open_target versus

1675 Local_Theory.close_target instead. Rare INCOMPATIBILITY.

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

1678 replaced by structure Timeout, with slightly different signature.

1679 INCOMPATIBILITY.

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

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

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

1684 File.full_path). Potential INCOMPATIBILITY.

1686 * Binding.empty_atts supersedes Thm.empty_binding and

1687 Attrib.empty_binding. Minor INCOMPATIBILITY.

1690 *** System ***

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

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

1695 much less disk space.

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

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

1699 particular:

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

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

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

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

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

1707 prover front-ends should use ML_Process or Isabelle_Process in

1708 Isabelle/Scala. INCOMPATIBILITY.

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

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

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

1713 return code 1.

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

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

1717 servers with separate CPU/memory modules.

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

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

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

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

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

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

1726 by default).

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

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

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

1731 resulting log files.

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

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

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

1736 implicit default via option -p.

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

1739 bootstrapping Isabelle/Pure interactively.

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

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

1743 Isabelle/ML or Isabelle/Scala.

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

1746 settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64,

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

1748 ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been

1749 discontinued. Potential INCOMPATIBILITY.

1751 * The Isabelle system environment always ensures that the main

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

1753 "isabelle_scala_script".

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

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

1757 Isabelle_Tool.Body.

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

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

1761 produce robust shell scripts under program control, without worrying

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

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

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

1765 been discontinued.

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

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

1769 but without the Isabelle settings environment.

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

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

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

1774 that Path specifications need to be resolved remotely via

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

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

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

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

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

1781 connection).

1785 New in Isabelle2016 (February 2016)

1786 -----------------------------------

1788 *** General ***

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

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

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

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

1794 examples that do require HOL.

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

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

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

1800 without any special print mode. Important ASCII replacement syntax

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

1802 has been removed (see below).

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

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

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

1808 context has been discontinued. Rare INCOMPATIBILITY, use explicit

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

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

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

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

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

1815 meaning.

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

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

1819 to update old sources.

1821 * Toplevel theorem statements have been simplified as follows:

1823 theorems ~> lemmas

1824 schematic_lemma ~> schematic_goal

1825 schematic_theorem ~> schematic_goal

1826 schematic_corollary ~> schematic_goal

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

1829 accordingly.

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

1832 'theorem'.

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

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

1836 deferred definitions require a surrounding 'overloading' block.

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

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

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

1843 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',

1844 'SML_file_no_debug' control compilation of sources with or without

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

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

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

1848 any effect on the running ML program.

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

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

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

1853 update.

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

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

1857 enable option "editor_output_state".

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

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

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

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

1863 visibility.

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

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

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

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

1869 panel.

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

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

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

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

1876 implicit: a popup will show up unconditionally.

1878 * Additional abbreviations for syntactic completion may be specified in

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

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

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

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

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

1885 suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.

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

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

1889 the editor.

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

1892 instead of former C+e LEFT.

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

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

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

1897 instead.

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

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

1901 single-instance applications seen on common GUI desktops.

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

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

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

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

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

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

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

1914 *** Document preparation ***

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

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

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

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

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

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

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

1925 follows:

1927 \<^item> itemize

1928 \<^enum> enumerate

1929 \<^descr> description

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

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

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

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

1935 standard Isabelle fonts provide glyphs to render important control

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

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

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

1940 standard LaTeX macros of the same names.

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

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

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

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

1946 cartouche tokens seen in theory sources.

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

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

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

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

1952 or terminal spaces are ignored.

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

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

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

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

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

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

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

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

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

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

1968 documentation, with a hyperlink in the Prover IDE.

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

1971 entities of the Isar language.

1973 * HTML presentation uses the standard IsabelleText font and Unicode

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

1975 print mode "HTML" loses its special meaning.

1978 *** Isar ***

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

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

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

1983 example:

1985 have result: "C x y"

1986 if "A x" and "B y"

1987 for x :: 'a and y :: 'a

1988 <proof>

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

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

1992 corresponds to a raw proof block like this:

1994 {

1995 fix x :: 'a and y :: 'a

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

1997 have "C x y" <proof>

1998 }

1999 note result = this

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

2002 instead of 'assume' above.

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

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

2007 assume result: "C x y"

2008 if "A x" and "B y"

2009 for x :: 'a and y :: 'a

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

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

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

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

2016 example:

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

2020 is equivalent to:

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

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

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

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

2027 follows:

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

2031 or:

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

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

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

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

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

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

2042 of the local context elements yet.

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

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

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

2048 then have something

2049 proof cases

2050 case a

2051 then show ?thesis <proof>

2052 next

2053 case b

2054 then show ?thesis <proof>

2055 next

2056 case c

2057 then show ?thesis <proof>

2058 qed

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

2062 case a: (c xs)

2063 case a [attributes]: (c xs)

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

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

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

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

2069 and always put attributes in front.

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

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

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

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

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

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

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

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

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

2082 supply [simp] = a

2083 proof

2084 show A by simp

2085 next

2086 show A by simp

2087 qed

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

2090 proof body as well, abstracted over relevant parameters.

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

2093 parameter scope for of each clause.

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

2096 statements: result is abstracted over unknowns.

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

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

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

2101 manual.

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

2104 ('apply' scripts).

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

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

2108 example:

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

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

2112 proof goal_cases

2113 case (1 x)

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

2115 next

2116 case (2 y z)

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

2118 qed

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

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

2122 proof goal_cases

2123 case prems: 1

2124 then show ?case using prems sorry

2125 next

2126 case prems: 2

2127 then show ?case using prems sorry

2128 qed

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

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

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

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

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

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

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

2139 occasionally useful for demonstration and testing purposes.

2142 *** Pure ***

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

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

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

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

2149 * Keyword 'rewrites' identifies rewrite morphisms in interpretation

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

2152 * More gentle suppression of syntax along locale morphisms while

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

2154 would be suppressed for morphisms except term identity. Now

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

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

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

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

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

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

2162 begin

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

2164 end

2166 locale morphism =

2167 left: struct composition + right: struct composition'

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

2169 begin

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

2171 end

2173 * Command 'global_interpretation' issues interpretations into global

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

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

2177 'defines'.

2179 * Command 'permanent_interpretation' has been discontinued. Use

2180 'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.

2182 * Command 'print_definitions' prints dependencies of definitional

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

2185 * Configuration option rule_insts_schematic has been discontinued

2186 (intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.

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

2189 INCOMPATIBILITY in situations where the previous misbehaviour has been

2190 exploited.

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

2193 operations behave more similar to abbreviations. Potential

2194 INCOMPATIBILITY in exotic situations.

2197 *** HOL ***

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

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

2201 global collection of overloaded constant / type definitions into

2202 account. Type definitions with open dependencies on overloaded

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

2204 provides extra robustness in theory construction. Rare INCOMPATIBILITY.

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

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

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

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

2210 Option.is_none_def. Occasional INCOMPATIBILITY in applications.

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

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

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

2215 simplify porting old theories:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

2244 INCOMPATIBILITY, use plain "::" instead.

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

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

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

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

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

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

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

2254 definition and its monotonicity result. Rare INCOMPATIBILITY.

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

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

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

2259 also subject to "inductive_internals". Rare INCOMPATIBILITY.

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

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

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

2264 INCOMPATIBILITY.

2266 * Combinator to represent case distinction on products is named

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

2268 theorem aliasses have been retained.

2270 Consolidated facts:

2271 PairE ~> prod.exhaust

2272 Pair_eq ~> prod.inject

2273 pair_collapse ~> prod.collapse

2274 Pair_fst_snd_eq ~> prod_eq_iff

2275 split_twice ~> prod.case_distrib

2276 split_weak_cong ~> prod.case_cong_weak

2277 split_split ~> prod.split

2278 split_split_asm ~> prod.split_asm

2279 splitI ~> case_prodI

2280 splitD ~> case_prodD

2281 splitI2 ~> case_prodI2

2282 splitI2' ~> case_prodI2'

2283 splitE ~> case_prodE

2284 splitE' ~> case_prodE'

2285 split_pair ~> case_prod_Pair

2286 split_eta ~> case_prod_eta

2287 split_comp ~> case_prod_comp

2288 mem_splitI ~> mem_case_prodI

2289 mem_splitI2 ~> mem_case_prodI2

2290 mem_splitE ~> mem_case_prodE

2291 The_split ~> The_case_prod

2292 cond_split_eta ~> cond_case_prod_eta

2293 Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE

2294 Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI

2295 in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq

2296 Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD

2297 Collect_split_Grp_inD ~> Collect_case_prod_Grp_in

2298 Domain_Collect_split ~> Domain_Collect_case_prod

2299 Image_Collect_split ~> Image_Collect_case_prod

2300 Range_Collect_split ~> Range_Collect_case_prod

2301 Eps_split ~> Eps_case_prod

2302 Eps_split_eq ~> Eps_case_prod_eq

2303 split_rsp ~> case_prod_rsp

2304 curry_split ~> curry_case_prod

2305 split_curry ~> case_prod_curry

2307 Changes in structure HOLogic:

2308 split_const ~> case_prod_const

2309 mk_split ~> mk_case_prod

2310 mk_psplits ~> mk_ptupleabs

2311 strip_psplits ~> strip_ptupleabs

2313 INCOMPATIBILITY.

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

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

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

2318 abbreviates of_int for that type. Other overloaded instances of 'real'

2319 have been replaced by 'real_of_ereal' and 'real_of_float'.

2321 Consolidated facts (among others):

2322 real_of_nat_le_iff -> of_nat_le_iff

2323 real_of_nat_numeral of_nat_numeral

2324 real_of_int_zero of_int_0

2325 real_of_nat_zero of_nat_0

2326 real_of_one of_int_1

2327 real_of_int_add of_int_add

2328 real_of_nat_add of_nat_add

2329 real_of_int_diff of_int_diff

2330 real_of_nat_diff of_nat_diff

2331 floor_subtract floor_diff_of_int

2332 real_of_int_inject of_int_eq_iff

2333 real_of_int_gt_zero_cancel_iff of_int_0_less_iff

2334 real_of_int_ge_zero_cancel_iff of_int_0_le_iff

2335 real_of_nat_ge_zero of_nat_0_le_iff

2336 real_of_int_ceiling_ge le_of_int_ceiling

2337 ceiling_less_eq ceiling_less_iff

2338 ceiling_le_eq ceiling_le_iff

2339 less_floor_eq less_floor_iff

2340 floor_less_eq floor_less_iff

2341 floor_divide_eq_div floor_divide_of_int_eq

2342 real_of_int_zero_cancel of_nat_eq_0_iff

2343 ceiling_real_of_int ceiling_of_int

2345 INCOMPATIBILITY.

2347 * Theory Map: lemma map_of_is_SomeD was a clone of map_of_SomeD and has

2348 been removed. INCOMPATIBILITY.

2350 * Quickcheck setup for finite sets.

2352 * Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.

2354 * Sledgehammer:

2355 - The MaSh relevance filter has been sped up.

2356 - Proof reconstruction has been improved, to minimize the incidence of

2357 cases where Sledgehammer gives a proof that does not work.

2358 - Auto Sledgehammer now minimizes and preplays the results.

2359 - Handle Vampire 4.0 proof output without raising exception.

2360 - Eliminated "MASH" environment variable. Use the "MaSh" option in

2361 Isabelle/jEdit instead. INCOMPATIBILITY.

2362 - Eliminated obsolete "blocking" option and related subcommands.

2364 * Nitpick:

2365 - Fixed soundness bug in translation of "finite" predicate.

2366 - Fixed soundness bug in "destroy_constrs" optimization.

2367 - Fixed soundness bug in translation of "rat" type.

2368 - Removed "check_potential" and "check_genuine" options.

2369 - Eliminated obsolete "blocking" option.

2371 * (Co)datatype package:

2372 - New commands "lift_bnf" and "copy_bnf" for lifting (copying) a BNF

2373 structure on the raw type to an abstract type defined using typedef.

2374 - Always generate "case_transfer" theorem.

2375 - For mutual types, generate slightly stronger "rel_induct",

2376 "rel_coinduct", and "coinduct" theorems. INCOMPATIBILITY.

2377 - Allow discriminators and selectors with the same name as the type

2378 being defined.

2379 - Avoid various internal name clashes (e.g., 'datatype f = f').

2381 * Transfer: new methods for interactive debugging of 'transfer' and

2382 'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',

2383 'transfer_prover_start' and 'transfer_prover_end'.

2385 * New diagnostic command print_record for displaying record definitions.

2387 * Division on integers is bootstrapped directly from division on

2388 naturals and uses generic numeral algorithm for computations. Slight

2389 INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former

2390 simprocs binary_int_div and binary_int_mod

2392 * Tightened specification of class semiring_no_zero_divisors. Minor

2393 INCOMPATIBILITY.

2395 * Class algebraic_semidom introduces common algebraic notions of

2396 integral (semi)domains, particularly units. Although logically subsumed

2397 by fields, is is not a super class of these in order not to burden

2398 fields with notions that are trivial there.

2400 * Class normalization_semidom specifies canonical representants for

2401 equivalence classes of associated elements in an integral (semi)domain.

2402 This formalizes associated elements as well.

2404 * Abstract specification of gcd/lcm operations in classes semiring_gcd,

2405 semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute

2406 and gcd_int.commute are subsumed by gcd.commute, as well as

2407 gcd_nat.assoc and gcd_int.assoc by gcd.assoc.

2409 * Former constants Fields.divide (_ / _) and Divides.div (_ div _) are

2410 logically unified to Rings.divide in syntactic type class Rings.divide,

2411 with infix syntax (_ div _). Infix syntax (_ / _) for field division is

2412 added later as abbreviation in class Fields.inverse. INCOMPATIBILITY,

2413 instantiations must refer to Rings.divide rather than the former

2414 separate constants, hence infix syntax (_ / _) is usually not available

2415 during instantiation.

2417 * New cancellation simprocs for boolean algebras to cancel complementary

2418 terms for sup and inf. For example, "sup x (sup y (- x))" simplifies to

2419 "top". INCOMPATIBILITY.

2421 * Class uniform_space introduces uniform spaces btw topological spaces

2422 and metric spaces. Minor INCOMPATIBILITY: open_<type>_def needs to be

2423 introduced in the form of an uniformity. Some constants are more general

2424 now, it may be necessary to add type class constraints.

2426 open_real_def \<leadsto> open_dist

2427 open_complex_def \<leadsto> open_dist

2429 * Library/Monad_Syntax: notation uses symbols \<bind> and \<then>. INCOMPATIBILITY.

2431 * Library/Multiset:

2432 - Renamed multiset inclusion operators:

2433 < ~> <#

2434 > ~> >#

2435 <= ~> <=#

2436 >= ~> >=#

2437 \<le> ~> \<le>#

2438 \<ge> ~> \<ge>#

2439 INCOMPATIBILITY.

2440 - Added multiset inclusion operator syntax:

2441 \<subset>#

2442 \<subseteq>#

2443 \<supset>#

2444 \<supseteq>#

2445 - "'a multiset" is no longer an instance of the "order",

2446 "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",

2447 "semilattice_inf", and "semilattice_sup" type classes. The theorems

2448 previously provided by these type classes (directly or indirectly)

2449 are now available through the "subset_mset" interpretation

2450 (e.g. add_mono ~> subset_mset.add_mono).

2451 INCOMPATIBILITY.

2452 - Renamed conversions:

2453 multiset_of ~> mset

2454 multiset_of_set ~> mset_set

2455 set_of ~> set_mset

2456 INCOMPATIBILITY

2457 - Renamed lemmas:

2458 mset_le_def ~> subseteq_mset_def

2459 mset_less_def ~> subset_mset_def

2460 less_eq_multiset.rep_eq ~> subseteq_mset_def

2461 INCOMPATIBILITY

2462 - Removed lemmas generated by lift_definition:

2463 less_eq_multiset.abs_eq, less_eq_multiset.rsp,

2464 less_eq_multiset.transfer, less_eq_multiset_def

2465 INCOMPATIBILITY

2467 * Library/Omega_Words_Fun: Infinite words modeled as functions nat \<Rightarrow> 'a.

2469 * Library/Bourbaki_Witt_Fixpoint: Added formalisation of the

2470 Bourbaki-Witt fixpoint theorem for increasing functions in

2471 chain-complete partial orders.

2473 * Library/Old_Recdef: discontinued obsolete 'defer_recdef' command.

2474 Minor INCOMPATIBILITY, use 'function' instead.

2476 * Library/Periodic_Fun: a locale that provides convenient lemmas for

2477 periodic functions.

2479 * Library/Formal_Power_Series: proper definition of division (with

2480 remainder) for formal power series; instances for Euclidean Ring and

2481 GCD.

2483 * HOL-Imperative_HOL: obsolete theory Legacy_Mrec has been removed.

2485 * HOL-Statespace: command 'statespace' uses mandatory qualifier for

2486 import of parent, as for general 'locale' expressions. INCOMPATIBILITY,

2487 remove '!' and add '?' as required.

2489 * HOL-Decision_Procs: The "approximation" method works with "powr"

2490 (exponentiation on real numbers) again.

2492 * HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour

2493 integrals (= complex path integrals), Cauchy's integral theorem, winding

2494 numbers and Cauchy's integral formula, Liouville theorem, Fundamental

2495 Theorem of Algebra. Ported from HOL Light.

2497 * HOL-Multivariate_Analysis: topological concepts such as connected

2498 components, homotopic paths and the inside or outside of a set.

2500 * HOL-Multivariate_Analysis: radius of convergence of power series and

2501 various summability tests; Harmonic numbers and the Euler–Mascheroni

2502 constant; the Generalised Binomial Theorem; the complex and real

2503 Gamma/log-Gamma/Digamma/ Polygamma functions and their most important

2504 properties.

2506 * HOL-Probability: The central limit theorem based on Levy's uniqueness

2507 and continuity theorems, weak convergence, and characterisitc functions.

2509 * HOL-Data_Structures: new and growing session of standard data

2510 structures.

2513 *** ML ***

2515 * The following combinators for low-level profiling of the ML runtime

2516 system are available:

2518 profile_time (*CPU time*)

2519 profile_time_thread (*CPU time on this thread*)

2520 profile_allocations (*overall heap allocations*)

2522 * Antiquotation @{undefined} or \<^undefined> inlines (raise Match).

2524 * Antiquotation @{method NAME} inlines the (checked) name of the given

2525 Isar proof method.

2527 * Pretty printing of Poly/ML compiler output in Isabelle has been

2528 improved: proper treatment of break offsets and blocks with consistent

2529 breaks.

2531 * The auxiliary module Pure/display.ML has been eliminated. Its

2532 elementary thm print operations are now in Pure/more_thm.ML and thus

2533 called Thm.pretty_thm, Thm.string_of_thm etc. INCOMPATIBILITY.

2535 * Simproc programming interfaces have been simplified:

2536 Simplifier.make_simproc and Simplifier.define_simproc supersede various

2537 forms of Simplifier.mk_simproc, Simplifier.simproc_global etc. Note that

2538 term patterns for the left-hand sides are specified with implicitly

2539 fixed variables, like top-level theorem statements. INCOMPATIBILITY.

2541 * Instantiation rules have been re-organized as follows:

2543 Thm.instantiate (*low-level instantiation with named arguments*)

2544 Thm.instantiate' (*version with positional arguments*)

2546 Drule.infer_instantiate (*instantiation with type inference*)

2547 Drule.infer_instantiate' (*version with positional arguments*)

2549 The LHS only requires variable specifications, instead of full terms.

2550 Old cterm_instantiate is superseded by infer_instantiate.

2551 INCOMPATIBILITY, need to re-adjust some ML names and types accordingly.

2553 * Old tactic shorthands atac, rtac, etac, dtac, ftac have been

2554 discontinued. INCOMPATIBILITY, use regular assume_tac, resolve_tac etc.

2555 instead (with proper context).

2557 * Thm.instantiate (and derivatives) no longer require the LHS of the

2558 instantiation to be certified: plain variables are given directly.

2560 * Subgoal.SUBPROOF and Subgoal.FOCUS combinators use anonymous

2561 quasi-bound variables (like the Simplifier), instead of accidentally

2562 named local fixes. This has the potential to improve stability of proof

2563 tools, but can also cause INCOMPATIBILITY for tools that don't observe

2564 the proof context discipline.

2566 * Isar proof methods are based on a slightly more general type

2567 context_tactic, which allows to change the proof context dynamically

2568 (e.g. to update cases) and indicate explicit Seq.Error results. Former

2569 METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are

2570 provided in src/Pure/Isar/method.ML for convenience. INCOMPATIBILITY.

2573 *** System ***

2575 * Command-line tool "isabelle console" enables print mode "ASCII".

2577 * Command-line tool "isabelle update_then" expands old Isar command

2578 conflations:

2580 hence ~> then have

2581 thus ~> then show

2583 This syntax is more orthogonal and improves readability and

2584 maintainability of proofs.

2586 * Global session timeout is multiplied by timeout_scale factor. This

2587 allows to adjust large-scale tests (e.g. AFP) to overall hardware

2588 performance.

2590 * Property values in etc/symbols may contain spaces, if written with the

2591 replacement character "␣" (Unicode point 0x2324). For example:

2593 \<star> code: 0x0022c6 group: operator font: Deja␣Vu␣Sans␣Mono

2595 * Java runtime environment for x86_64-windows allows to use larger heap

2596 space.

2598 * Java runtime options are determined separately for 32bit vs. 64bit

2599 platforms as follows.

2601 - Isabelle desktop application: platform-specific files that are

2602 associated with the main app bundle

2604 - isabelle jedit: settings

2605 JEDIT_JAVA_SYSTEM_OPTIONS

2606 JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64

2608 - isabelle build: settings

2609 ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64

2611 * Bash shell function "jvmpath" has been renamed to "platform_path": it

2612 is relevant both for Poly/ML and JVM processes.

2614 * Poly/ML default platform architecture may be changed from 32bit to

2615 64bit via system option ML_system_64. A system restart (and rebuild) is

2616 required after change.

2618 * Poly/ML 5.6 runs natively on x86-windows and x86_64-windows, which

2619 both allow larger heap space than former x86-cygwin.

2621 * Heap images are 10-15% smaller due to less wasteful persistent theory

2622 content (using ML type theory_id instead of theory);

2626 New in Isabelle2015 (May 2015)

2627 ------------------------------

2629 *** General ***

2631 * Local theory specification commands may have a 'private' or

2632 'qualified' modifier to restrict name space accesses to the local scope,

2633 as provided by some "context begin ... end" block. For example:

2635 context

2636 begin

2638 private definition ...

2639 private lemma ...

2641 qualified definition ...

2642 qualified lemma ...

2644 lemma ...

2645 theorem ...

2647 end

2649 * Command 'experiment' opens an anonymous locale context with private

2650 naming policy.

2652 * Command 'notepad' requires proper nesting of begin/end and its proof

2653 structure in the body: 'oops' is no longer supported here. Minor

2654 INCOMPATIBILITY, use 'sorry' instead.

2656 * Command 'named_theorems' declares a dynamic fact within the context,

2657 together with an attribute to maintain the content incrementally. This

2658 supersedes functor Named_Thms in Isabelle/ML, but with a subtle change

2659 of semantics due to external visual order vs. internal reverse order.

2661 * 'find_theorems': search patterns which are abstractions are

2662 schematically expanded before search. Search results match the naive

2663 expectation more closely, particularly wrt. abbreviations.

2664 INCOMPATIBILITY.

2666 * Commands 'method_setup' and 'attribute_setup' now work within a local

2667 theory context.

2669 * Outer syntax commands are managed authentically within the theory

2670 context, without implicit global state. Potential for accidental

2671 INCOMPATIBILITY, make sure that required theories are really imported.

2673 * Historical command-line terminator ";" is no longer accepted (and

2674 already used differently in Isar). Minor INCOMPATIBILITY, use "isabelle

2675 update_semicolons" to remove obsolete semicolons from old theory

2676 sources.

2678 * Structural composition of proof methods (meth1; meth2) in Isar

2679 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.

2681 * The Eisbach proof method language allows to define new proof methods

2682 by combining existing ones with their usual syntax. The "match" proof

2683 method provides basic fact/term matching in addition to

2684 premise/conclusion matching through Subgoal.focus, and binds fact names

2685 from matches as well as term patterns within matches. The Isabelle

2686 documentation provides an entry "eisbach" for the Eisbach User Manual.

2687 Sources and various examples are in ~~/src/HOL/Eisbach/.

2690 *** Prover IDE -- Isabelle/Scala/jEdit ***

2692 * Improved folding mode "isabelle" based on Isar syntax. Alternatively,

2693 the "sidekick" mode may be used for document structure.

2695 * Extended bracket matching based on Isar language structure. System

2696 option jedit_structure_limit determines maximum number of lines to scan

2697 in the buffer.

2699 * Support for BibTeX files: context menu, context-sensitive token

2700 marker, SideKick parser.

2702 * Document antiquotation @{cite} provides formal markup, which is

2703 interpreted semi-formally based on .bib files that happen to be open in

2704 the editor (hyperlinks, completion etc.).

2706 * Less waste of vertical space via negative line spacing (see Global

2707 Options / Text Area).

2709 * Improved graphview panel with optional output of PNG or PDF, for

2710 display of 'thy_deps', 'class_deps' etc.

2712 * The commands 'thy_deps' and 'class_deps' allow optional bounds to

2713 restrict the visualized hierarchy.

2715 * Improved scheduling for asynchronous print commands (e.g. provers

2716 managed by the Sledgehammer panel) wrt. ongoing document processing.

2719 *** Document preparation ***

2721 * Document markup commands 'chapter', 'section', 'subsection',

2722 'subsubsection', 'text', 'txt', 'text_raw' work uniformly in any

2723 context, even before the initial 'theory' command. Obsolete proof

2724 commands 'sect', 'subsect', 'subsubsect', 'txt_raw' have been

2725 discontinued, use 'section', 'subsection', 'subsubsection', 'text_raw'

2726 instead. The old 'header' command is still retained for some time, but

2727 should be replaced by 'chapter', 'section' etc. (using "isabelle

2728 update_header"). Minor INCOMPATIBILITY.

2730 * Official support for "tt" style variants, via \isatt{...} or

2731 \begin{isabellett}...\end{isabellett}. The somewhat fragile \verb or

2732 verbatim environment of LaTeX is no longer used. This allows @{ML} etc.

2733 as argument to other macros (such as footnotes).

2735 * Document antiquotation @{verbatim} prints ASCII text literally in "tt"

2736 style.

2738 * Discontinued obsolete option "document_graph": session_graph.pdf is

2739 produced unconditionally for HTML browser_info and PDF-LaTeX document.

2741 * Diagnostic commands and document markup commands within a proof do not

2742 affect the command tag for output. Thus commands like 'thm' are subject

2743 to proof document structure, and no longer "stick out" accidentally.

2744 Commands 'text' and 'txt' merely differ in the LaTeX style, not their

2745 tags. Potential INCOMPATIBILITY in exotic situations.

2747 * System option "pretty_margin" is superseded by "thy_output_margin",

2748 which is also accessible via document antiquotation option "margin".

2749 Only the margin for document output may be changed, but not the global

2750 pretty printing: that is 76 for plain console output, and adapted

2751 dynamically in GUI front-ends. Implementations of document

2752 antiquotations need to observe the margin explicitly according to

2753 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.

2755 * Specification of 'document_files' in the session ROOT file is

2756 mandatory for document preparation. The legacy mode with implicit

2757 copying of the document/ directory is no longer supported. Minor

2758 INCOMPATIBILITY.

2761 *** Pure ***

2763 * Proof methods with explicit instantiation ("rule_tac", "subgoal_tac"

2764 etc.) allow an optional context of local variables ('for' declaration):

2765 these variables become schematic in the instantiated theorem; this

2766 behaviour is analogous to 'for' in attributes "where" and "of".

2767 Configuration option rule_insts_schematic (default false) controls use

2768 of schematic variables outside the context. Minor INCOMPATIBILITY,

2769 declare rule_insts_schematic = true temporarily and update to use local

2770 variable declarations or dummy patterns instead.

2772 * Explicit instantiation via attributes "where", "of", and proof methods

2773 "rule_tac" with derivatives like "subgoal_tac" etc. admit dummy patterns

2774 ("_") that stand for anonymous local variables.

2776 * Generated schematic variables in standard format of exported facts are

2777 incremented to avoid material in the proof context. Rare

2778 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to

2779 different index.

2781 * Lexical separation of signed and unsigned numerals: categories "num"

2782 and "float" are unsigned. INCOMPATIBILITY: subtle change in precedence

2783 of numeral signs, particularly in expressions involving infix syntax

2784 like "(- 1) ^ n".

2786 * Old inner token category "xnum" has been discontinued. Potential

2787 INCOMPATIBILITY for exotic syntax: may use mixfix grammar with "num"

2788 token category instead.

2791 *** HOL ***

2793 * New (co)datatype package:

2794 - The 'datatype_new' command has been renamed 'datatype'. The old

2795 command of that name is now called 'old_datatype' and is provided

2796 by "~~/src/HOL/Library/Old_Datatype.thy". See

2797 'isabelle doc datatypes' for information on porting.

2798 INCOMPATIBILITY.

2799 - Renamed theorems:

2800 disc_corec ~> corec_disc

2801 disc_corec_iff ~> corec_disc_iff

2802 disc_exclude ~> distinct_disc

2803 disc_exhaust ~> exhaust_disc

2804 disc_map_iff ~> map_disc_iff

2805 sel_corec ~> corec_sel

2806 sel_exhaust ~> exhaust_sel

2807 sel_map ~> map_sel

2808 sel_set ~> set_sel

2809 sel_split ~> split_sel

2810 sel_split_asm ~> split_sel_asm

2811 strong_coinduct ~> coinduct_strong

2812 weak_case_cong ~> case_cong_weak

2813 INCOMPATIBILITY.

2814 - The "no_code" option to "free_constructors", "datatype_new", and

2815 "codatatype" has been renamed "plugins del: code".

2816 INCOMPATIBILITY.

2817 - The rules "set_empty" have been removed. They are easy

2818 consequences of other set rules "by auto".

2819 INCOMPATIBILITY.

2820 - The rule "set_cases" is now registered with the "[cases set]"

2821 attribute. This can influence the behavior of the "cases" proof

2822 method when more than one case rule is applicable (e.g., an

2823 assumption is of the form "w : set ws" and the method "cases w"

2824 is invoked). The solution is to specify the case rule explicitly

2825 (e.g. "cases w rule: widget.exhaust").

2826 INCOMPATIBILITY.

2827 - Renamed theories:

2828 BNF_Comp ~> BNF_Composition

2829 BNF_FP_Base ~> BNF_Fixpoint_Base

2830 BNF_GFP ~> BNF_Greatest_Fixpoint

2831 BNF_LFP ~> BNF_Least_Fixpoint

2832 BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions

2833 Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions

2834 INCOMPATIBILITY.

2835 - Lifting and Transfer setup for basic HOL types sum and prod (also

2836 option) is now performed by the BNF package. Theories Lifting_Sum,

2837 Lifting_Product and Lifting_Option from Main became obsolete and

2838 were removed. Changed definitions of the relators rel_prod and

2839 rel_sum (using inductive).

2840 INCOMPATIBILITY: use rel_prod.simps and rel_sum.simps instead

2841 of rel_prod_def and rel_sum_def.

2842 Minor INCOMPATIBILITY: (rarely used by name) transfer theorem names

2843 changed (e.g. map_prod_transfer ~> prod.map_transfer).

2844 - Parametricity theorems for map functions, relators, set functions,

2845 constructors, case combinators, discriminators, selectors and

2846 (co)recursors are automatically proved and registered as transfer

2847 rules.

2849 * Old datatype package:

2850 - The old 'datatype' command has been renamed 'old_datatype', and

2851 'rep_datatype' has been renamed 'old_rep_datatype'. They are

2852 provided by "~~/src/HOL/Library/Old_Datatype.thy". See

2853 'isabelle doc datatypes' for information on porting.

2854 INCOMPATIBILITY.

2855 - Renamed theorems:

2856 weak_case_cong ~> case_cong_weak

2857 INCOMPATIBILITY.

2858 - Renamed theory:

2859 ~~/src/HOL/Datatype.thy ~> ~~/src/HOL/Library/Old_Datatype.thy

2860 INCOMPATIBILITY.

2862 * Nitpick:

2863 - Fixed soundness bug related to the strict and non-strict subset

2864 operations.

2866 * Sledgehammer:

2867 - CVC4 is now included with Isabelle instead of CVC3 and run by

2868 default.

2869 - Z3 is now always enabled by default, now that it is fully open

2870 source. The "z3_non_commercial" option is discontinued.

2871 - Minimization is now always enabled by default.

2872 Removed sub-command:

2873 min

2874 - Proof reconstruction, both one-liners and Isar, has been

2875 dramatically improved.

2876 - Improved support for CVC4 and veriT.

2878 * Old and new SMT modules:

2879 - The old 'smt' method has been renamed 'old_smt' and moved to

2880 'src/HOL/Library/Old_SMT.thy'. It is provided for compatibility,

2881 until applications have been ported to use the new 'smt' method. For

2882 the method to work, an older version of Z3 (e.g. Z3 3.2 or 4.0) must

2883 be installed, and the environment variable "OLD_Z3_SOLVER" must

2884 point to it.

2885 INCOMPATIBILITY.

2886 - The 'smt2' method has been renamed 'smt'.

2887 INCOMPATIBILITY.

2888 - New option 'smt_reconstruction_step_timeout' to limit the

2889 reconstruction time of Z3 proof steps in the new 'smt' method.

2890 - New option 'smt_statistics' to display statistics of the new 'smt'

2891 method, especially runtime statistics of Z3 proof reconstruction.

2893 * Lifting: command 'lift_definition' allows to execute lifted constants

2894 that have as a return type a datatype containing a subtype. This

2895 overcomes long-time limitations in the area of code generation and

2896 lifting, and avoids tedious workarounds.

2898 * Command and antiquotation "value" provide different evaluation slots

2899 (again), where the previous strategy (NBE after ML) serves as default.

2900 Minor INCOMPATIBILITY.

2902 * Add NO_MATCH-simproc, allows to check for syntactic non-equality.

2904 * field_simps: Use NO_MATCH-simproc for distribution rules, to avoid

2905 non-termination in case of distributing a division. With this change

2906 field_simps is in some cases slightly less powerful, if it fails try to

2907 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.

2909 * Separate class no_zero_divisors has been given up in favour of fully

2910 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.

2912 * Class linordered_semidom really requires no zero divisors.

2913 INCOMPATIBILITY.

2915 * Classes division_ring, field and linordered_field always demand

2916 "inverse 0 = 0". Given up separate classes division_ring_inverse_zero,

2917 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.

2919 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit

2920 additive inverse operation. INCOMPATIBILITY.

2922 * Complex powers and square roots. The functions "ln" and "powr" are now

2923 overloaded for types real and complex, and 0 powr y = 0 by definition.

2924 INCOMPATIBILITY: type constraints may be necessary.

2926 * The functions "sin" and "cos" are now defined for any type of sort

2927 "{real_normed_algebra_1,banach}" type, so in particular on "real" and

2928 "complex" uniformly. Minor INCOMPATIBILITY: type constraints may be

2929 needed.

2931 * New library of properties of the complex transcendental functions sin,

2932 cos, tan, exp, Ln, Arctan, Arcsin, Arccos. Ported from HOL Light.

2934 * The factorial function, "fact", now has type "nat => 'a" (of a sort

2935 that admits numeric types including nat, int, real and complex.

2936 INCOMPATIBILITY: an expression such as "fact 3 = 6" may require a type

2937 constraint, and the combination "real (fact k)" is likely to be

2938 unsatisfactory. If a type conversion is still necessary, then use

2939 "of_nat (fact k)" or "real_of_nat (fact k)".

2941 * Removed functions "natfloor" and "natceiling", use "nat o floor" and

2942 "nat o ceiling" instead. A few of the lemmas have been retained and

2943 adapted: in their names "natfloor"/"natceiling" has been replaced by

2944 "nat_floor"/"nat_ceiling".

2946 * Qualified some duplicated fact names required for boostrapping the

2947 type class hierarchy:

2948 ab_add_uminus_conv_diff ~> diff_conv_add_uminus

2949 field_inverse_zero ~> inverse_zero

2950 field_divide_inverse ~> divide_inverse

2951 field_inverse ~> left_inverse

2952 Minor INCOMPATIBILITY.

2954 * Eliminated fact duplicates:

2955 mult_less_imp_less_right ~> mult_right_less_imp_less

2956 mult_less_imp_less_left ~> mult_left_less_imp_less

2957 Minor INCOMPATIBILITY.

2959 * Fact consolidation: even_less_0_iff is subsumed by

2960 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).

2962 * Generalized and consolidated some theorems concerning divsibility:

2963 dvd_reduce ~> dvd_add_triv_right_iff

2964 dvd_plus_eq_right ~> dvd_add_right_iff

2965 dvd_plus_eq_left ~> dvd_add_left_iff

2966 Minor INCOMPATIBILITY.

2968 * "even" and "odd" are mere abbreviations for "2 dvd _" and "~ 2 dvd _"

2969 and part of theory Main.

2970 even_def ~> even_iff_mod_2_eq_zero

2971 INCOMPATIBILITY.

2973 * Lemma name consolidation: divide_Numeral1 ~> divide_numeral_1. Minor

2974 INCOMPATIBILITY.

2976 * Bootstrap of listsum as special case of abstract product over lists.

2977 Fact rename:

2978 listsum_def ~> listsum.eq_foldr

2979 INCOMPATIBILITY.

2981 * Product over lists via constant "listprod".

2983 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to

2984 Cons_nth_drop_Suc.

2986 * New infrastructure for compiling, running, evaluating and testing

2987 generated code in target languages in HOL/Library/Code_Test. See

2988 HOL/Codegenerator_Test/Code_Test* for examples.

2990 * Library/Multiset:

2991 - Introduced "replicate_mset" operation.

2992 - Introduced alternative characterizations of the multiset ordering in

2993 "Library/Multiset_Order".

2994 - Renamed multiset ordering:

2995 <# ~> #<#

2996 <=# ~> #<=#

2997 \<subset># ~> #\<subset>#

2998 \<subseteq># ~> #\<subseteq>#

2999 INCOMPATIBILITY.

3000 - Introduced abbreviations for ill-named multiset operations:

3001 <#, \<subset># abbreviate < (strict subset)

3002 <=#, \<le>#, \<subseteq># abbreviate <= (subset or equal)

3003 INCOMPATIBILITY.

3004 - Renamed

3005 in_multiset_of ~> in_multiset_in_set

3006 Multiset.fold ~> fold_mset

3007 Multiset.filter ~> filter_mset

3008 INCOMPATIBILITY.

3009 - Removed mcard, is equal to size.

3010 - Added attributes:

3011 image_mset.id [simp]

3012 image_mset_id [simp]

3013 elem_multiset_of_set [simp, intro]

3014 comp_fun_commute_plus_mset [simp]

3015 comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]

3016 in_mset_fold_plus_iff [iff]

3017 set_of_Union_mset [simp]

3018 in_Union_mset_iff [iff]

3019 INCOMPATIBILITY.

3021 * Library/Sum_of_Squares: simplified and improved "sos" method. Always

3022 use local CSDP executable, which is much faster than the NEOS server.

3023 The "sos_cert" functionality is invoked as "sos" with additional

3024 argument. Minor INCOMPATIBILITY.

3026 * HOL-Decision_Procs: New counterexample generator quickcheck

3027 [approximation] for inequalities of transcendental functions. Uses

3028 hardware floating point arithmetic to randomly discover potential

3029 counterexamples. Counterexamples are certified with the "approximation"

3030 method. See HOL/Decision_Procs/ex/Approximation_Quickcheck_Ex.thy for

3031 examples.

3033 * HOL-Probability: Reworked measurability prover

3034 - applies destructor rules repeatedly

3035 - removed application splitting (replaced by destructor rule)

3036 - added congruence rules to rewrite measure spaces under the sets

3037 projection

3039 * New proof method "rewrite" (in theory ~~/src/HOL/Library/Rewrite) for

3040 single-step rewriting with subterm selection based on patterns.

3043 *** ML ***

3045 * Subtle change of name space policy: undeclared entries are now

3046 considered inaccessible, instead of accessible via the fully-qualified

3047 internal name. This mainly affects Name_Space.intern (and derivatives),

3048 which may produce an unexpected Long_Name.hidden prefix. Note that

3049 contemporary applications use the strict Name_Space.check (and

3050 derivatives) instead, which is not affected by the change. Potential

3051 INCOMPATIBILITY in rare applications of Name_Space.intern.

3053 * Subtle change of error semantics of Toplevel.proof_of: regular user

3054 ERROR instead of internal Toplevel.UNDEF.

3056 * Basic combinators map, fold, fold_map, split_list, apply are available

3057 as parameterized antiquotations, e.g. @{map 4} for lists of quadruples.

3059 * Renamed "pairself" to "apply2", in accordance to @{apply 2}.

3060 INCOMPATIBILITY.

3062 * Former combinators NAMED_CRITICAL and CRITICAL for central critical

3063 sections have been discontinued, in favour of the more elementary

3064 Multithreading.synchronized and its high-level derivative

3065 Synchronized.var (which is usually sufficient in applications). Subtle

3066 INCOMPATIBILITY: synchronized access needs to be atomic and cannot be

3067 nested.

3069 * Synchronized.value (ML) is actually synchronized (as in Scala): subtle

3070 change of semantics with minimal potential for INCOMPATIBILITY.

3072 * The main operations to certify logical entities are Thm.ctyp_of and

3073 Thm.cterm_of with a local context; old-style global theory variants are

3074 available as Thm.global_ctyp_of and Thm.global_cterm_of.

3075 INCOMPATIBILITY.

3077 * Elementary operations in module Thm are no longer pervasive.

3078 INCOMPATIBILITY, need to use qualified Thm.prop_of, Thm.cterm_of,

3079 Thm.term_of etc.

3081 * Proper context for various elementary tactics: assume_tac,

3082 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,

3083 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.

3085 * Tactical PARALLEL_ALLGOALS is the most common way to refer to

3086 PARALLEL_GOALS.

3088 * Goal.prove_multi is superseded by the fully general Goal.prove_common,

3089 which also allows to specify a fork priority.

3091 * Antiquotation @{command_spec "COMMAND"} is superseded by

3092 @{command_keyword COMMAND} (usually without quotes and with PIDE

3093 markup). Minor INCOMPATIBILITY.

3095 * Cartouches within ML sources are turned into values of type

3096 Input.source (with formal position information).

3099 *** System ***

3101 * The Isabelle tool "update_cartouches" changes theory files to use

3102 cartouches instead of old-style {* verbatim *} or `alt_string` tokens.

3104 * The Isabelle tool "build" provides new options -X, -k, -x.

3106 * Discontinued old-fashioned "codegen" tool. Code generation can always

3107 be externally triggered using an appropriate ROOT file plus a

3108 corresponding theory. Parametrization is possible using environment

3109 variables, or ML snippets in the most extreme cases. Minor

3110 INCOMPATIBILITY.

3112 * JVM system property "isabelle.threads" determines size of Scala thread

3113 pool, like Isabelle system option "threads" for ML.

3115 * JVM system property "isabelle.laf" determines the default Swing

3116 look-and-feel, via internal class name or symbolic name as in the jEdit

3117 menu Global Options / Appearance.

3119 * Support for Proof General and Isar TTY loop has been discontinued.

3120 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.

3124 New in Isabelle2014 (August 2014)

3125 ---------------------------------

3127 *** General ***

3129 * Support for official Standard ML within the Isabelle context.

3130 Command 'SML_file' reads and evaluates the given Standard ML file.

3131 Toplevel bindings are stored within the theory context; the initial

3132 environment is restricted to the Standard ML implementation of

3133 Poly/ML, without the add-ons of Isabelle/ML. Commands 'SML_import'

3134 and 'SML_export' allow to exchange toplevel bindings between the two

3135 separate environments. See also ~~/src/Tools/SML/Examples.thy for

3136 some examples.

3138 * Standard tactics and proof methods such as "clarsimp", "auto" and

3139 "safe" now preserve equality hypotheses "x = expr" where x is a free

3140 variable. Locale assumptions and chained facts containing "x"

3141 continue to be useful. The new method "hypsubst_thin" and the

3142 configuration option "hypsubst_thin" (within the attribute name space)

3143 restore the previous behavior. INCOMPATIBILITY, especially where

3144 induction is done after these methods or when the names of free and

3145 bound variables clash. As first approximation, old proofs may be

3146 repaired by "using [[hypsubst_thin = true]]" in the critical spot.

3148 * More static checking of proof methods, which allows the system to

3149 form a closure over the concrete syntax. Method arguments should be

3150 processed in the original proof context as far as possible, before

3151 operating on the goal state. In any case, the standard discipline for

3152 subgoal-addressing needs to be observed: no subgoals or a subgoal

3153 number that is out of range produces an empty result sequence, not an

3154 exception. Potential INCOMPATIBILITY for non-conformant tactical

3155 proof tools.

3157 * Lexical syntax (inner and outer) supports text cartouches with

3158 arbitrary nesting, and without escapes of quotes etc. The Prover IDE

3159 supports input via ` (backquote).

3161 * The outer syntax categories "text" (for formal comments and document

3162 markup commands) and "altstring" (for literal fact references) allow

3163 cartouches as well, in addition to the traditional mix of quotations.

3165 * Syntax of document antiquotation @{rail} now uses \<newline> instead

3166 of "\\", to avoid the optical illusion of escaped backslash within

3167 string token. General renovation of its syntax using text cartouches.

3168 Minor INCOMPATIBILITY.

3170 * Discontinued legacy_isub_isup, which was a temporary workaround for

3171 Isabelle/ML in Isabelle2013-1. The prover process no longer accepts

3172 old identifier syntax with \<^isub> or \<^isup>. Potential

3173 INCOMPATIBILITY.

3175 * Document antiquotation @{url} produces markup for the given URL,

3176 which results in an active hyperlink within the text.

3178 * Document antiquotation @{file_unchecked} is like @{file}, but does

3179 not check existence within the file-system.

3181 * Updated and extended manuals: codegen, datatypes, implementation,

3182 isar-ref, jedit, system.

3185 *** Prover IDE -- Isabelle/Scala/jEdit ***

3187 * Improved Document panel: simplified interaction where every single

3188 mouse click (re)opens document via desktop environment or as jEdit

3189 buffer.

3191 * Support for Navigator plugin (with toolbar buttons), with connection

3192 to PIDE hyperlinks.

3194 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.

3195 Open text buffers take precedence over copies within the file-system.

3197 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for

3198 auxiliary ML files.

3200 * Improved syntactic and semantic completion mechanism, with simple

3201 templates, completion language context, name-space completion,

3202 file-name completion, spell-checker completion.

3204 * Refined GUI popup for completion: more robust key/mouse event

3205 handling and propagation to enclosing text area -- avoid loosing

3206 keystrokes with slow / remote graphics displays.

3208 * Completion popup supports both ENTER and TAB (default) to select an

3209 item, depending on Isabelle options.

3211 * Refined insertion of completion items wrt. jEdit text: multiple

3212 selections, rectangular selections, rectangular selection as "tall

3213 caret".

3215 * Integrated spell-checker for document text, comments etc. with

3216 completion popup and context-menu.

3218 * More general "Query" panel supersedes "Find" panel, with GUI access

3219 to commands 'find_theorems' and 'find_consts', as well as print

3220 operations for the context. Minor incompatibility in keyboard

3221 shortcuts etc.: replace action isabelle-find by isabelle-query.

3223 * Search field for all output panels ("Output", "Query", "Info" etc.)

3224 to highlight text via regular expression.

3226 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /

3227 General") allows to specify additional print modes for the prover

3228 process, without requiring old-fashioned command-line invocation of

3229 "isabelle jedit -m MODE".

3231 * More support for remote files (e.g. http) using standard Java

3232 networking operations instead of jEdit virtual file-systems.

3234 * Empty editors buffers that are no longer required (e.g.\ via theory

3235 imports) are automatically removed from the document model.

3237 * Improved monitor panel.

3239 * Improved Console/Scala plugin: more uniform scala.Console output,

3240 more robust treatment of threads and interrupts.

3242 * Improved management of dockable windows: clarified keyboard focus

3243 and window placement wrt. main editor view; optional menu item to

3244 "Detach" a copy where this makes sense.

3246 * New Simplifier Trace panel provides an interactive view of the

3247 simplification process, enabled by the "simp_trace_new" attribute

3248 within the context.

3251 *** Pure ***

3253 * Low-level type-class commands 'classes', 'classrel', 'arities' have

3254 been discontinued to avoid the danger of non-trivial axiomatization

3255 that is not immediately visible. INCOMPATIBILITY, use regular

3256 'instance' command with proof. The required OFCLASS(...) theorem

3257 might be postulated via 'axiomatization' beforehand, or the proof

3258 finished trivially if the underlying class definition is made vacuous

3259 (without any assumptions). See also Isabelle/ML operations

3260 Axclass.class_axiomatization, Axclass.classrel_axiomatization,

3261 Axclass.arity_axiomatization.

3263 * Basic constants of Pure use more conventional names and are always

3264 qualified. Rare INCOMPATIBILITY, but with potentially serious

3265 consequences, notably for tools in Isabelle/ML. The following

3266 renaming needs to be applied:

3268 == ~> Pure.eq

3269 ==> ~> Pure.imp

3270 all ~> Pure.all

3271 TYPE ~> Pure.type

3272 dummy_pattern ~> Pure.dummy_pattern

3274 Systematic porting works by using the following theory setup on a

3275 *previous* Isabelle version to introduce the new name accesses for the

3276 old constants:

3278 setup {*

3279 fn thy => thy

3280 |> Sign.root_path

3281 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="

3282 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"

3283 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"

3284 |> Sign.restore_naming thy

3285 *}

3287 Thus ML antiquotations like @{const_name Pure.eq} may be used already.

3288 Later the application is moved to the current Isabelle version, and

3289 the auxiliary aliases are deleted.

3291 * Attributes "where" and "of" allow an optional context of local

3292 variables ('for' declaration): these variables become schematic in the

3293 instantiated theorem.

3295 * Obsolete attribute "standard" has been discontinued (legacy since

3296 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context

3297 where instantiations with schematic variables are intended (for

3298 declaration commands like 'lemmas' or attributes like "of"). The

3299 following temporary definition may help to port old applications:

3301 attribute_setup standard =

3302 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"

3304 * More thorough check of proof context for goal statements and

3305 attributed fact expressions (concerning background theory, declared

3306 hyps). Potential INCOMPATIBILITY, tools need to observe standard

3307 context discipline. See also Assumption.add_assumes and the more

3308 primitive Thm.assume_hyps.

3310 * Inner syntax token language allows regular quoted strings "..."

3311 (only makes sense in practice, if outer syntax is delimited

3312 differently, e.g. via cartouches).

3314 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,

3315 but the latter is retained some time as Proof General legacy.

3317 * Code generator preprocessor: explicit control of simp tracing on a

3318 per-constant basis. See attribute "code_preproc".

3321 *** HOL ***

3323 * Code generator: enforce case of identifiers only for strict target

3324 language requirements. INCOMPATIBILITY.

3326 * Code generator: explicit proof contexts in many ML interfaces.

3327 INCOMPATIBILITY.

3329 * Code generator: minimize exported identifiers by default. Minor

3330 INCOMPATIBILITY.

3332 * Code generation for SML and OCaml: dropped arcane "no_signatures"

3333 option. Minor INCOMPATIBILITY.

3335 * "declare [[code abort: ...]]" replaces "code_abort ...".

3336 INCOMPATIBILITY.

3338 * "declare [[code drop: ...]]" drops all code equations associated

3339 with the given constants.

3341 * Code generations are provided for make, fields, extend and truncate

3342 operations on records.

3344 * Command and antiquotation "value" are now hardcoded against nbe and

3345 ML. Minor INCOMPATIBILITY.

3347 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.

3349 * The symbol "\<newline>" may be used within char or string literals

3350 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.

3352 * Qualified String.implode and String.explode. INCOMPATIBILITY.

3354 * Simplifier: Enhanced solver of preconditions of rewrite rules can

3355 now deal with conjunctions. For help with converting proofs, the old

3356 behaviour of the simplifier can be restored like this: declare/using

3357 [[simp_legacy_precond]]. This configuration option will disappear

3358 again in the future. INCOMPATIBILITY.

3360 * Simproc "finite_Collect" is no longer enabled by default, due to

3361 spurious crashes and other surprises. Potential INCOMPATIBILITY.

3363 * Moved new (co)datatype package and its dependencies from session

3364 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',

3365 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now

3366 part of theory "Main".

3368 Theory renamings:

3369 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)

3370 Library/Wfrec.thy ~> Wfrec.thy

3371 Library/Zorn.thy ~> Zorn.thy

3372 Cardinals/Order_Relation.thy ~> Order_Relation.thy

3373 Library/Order_Union.thy ~> Cardinals/Order_Union.thy

3374 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy

3375 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy

3376 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy

3377 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy

3378 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy

3379 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy

3380 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy

3381 BNF/BNF_Comp.thy ~> BNF_Comp.thy

3382 BNF/BNF_Def.thy ~> BNF_Def.thy

3383 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy

3384 BNF/BNF_GFP.thy ~> BNF_GFP.thy

3385 BNF/BNF_LFP.thy ~> BNF_LFP.thy

3386 BNF/BNF_Util.thy ~> BNF_Util.thy

3387 BNF/Coinduction.thy ~> Coinduction.thy

3388 BNF/More_BNFs.thy ~> Library/More_BNFs.thy

3389 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy

3390 BNF/Examples/* ~> BNF_Examples/*

3392 New theories:

3393 Wellorder_Extension.thy (split from Zorn.thy)

3394 Library/Cardinal_Notations.thy

3395 Library/BNF_Axomatization.thy

3396 BNF_Examples/Misc_Primcorec.thy

3397 BNF_Examples/Stream_Processor.thy

3399 Discontinued theories:

3400 BNF/BNF.thy

3401 BNF/Equiv_Relations_More.thy

3403 INCOMPATIBILITY.

3405 * New (co)datatype package:

3406 - Command 'primcorec' is fully implemented.

3407 - Command 'datatype_new' generates size functions ("size_xxx" and

3408 "size") as required by 'fun'.

3409 - BNFs are integrated with the Lifting tool and new-style

3410 (co)datatypes with Transfer.

3411 - Renamed commands:

3412 datatype_new_compat ~> datatype_compat

3413 primrec_new ~> primrec

3414 wrap_free_constructors ~> free_constructors

3415 INCOMPATIBILITY.

3416 - The generated constants "xxx_case" and "xxx_rec" have been renamed

3417 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").

3418 INCOMPATIBILITY.

3419 - The constant "xxx_(un)fold" and related theorems are no longer

3420 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually

3421 using "prim(co)rec".

3422 INCOMPATIBILITY.

3423 - No discriminators are generated for nullary constructors by

3424 default, eliminating the need for the odd "=:" syntax.

3425 INCOMPATIBILITY.

3426 - No discriminators or selectors are generated by default by

3427 "datatype_new", unless custom names are specified or the new

3428 "discs_sels" option is passed.

3429 INCOMPATIBILITY.

3431 * Old datatype package:

3432 - The generated theorems "xxx.cases" and "xxx.recs" have been

3433 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->

3434 "sum.case"). INCOMPATIBILITY.

3435 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have

3436 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,

3437 "prod_case" ~> "case_prod"). INCOMPATIBILITY.

3439 * The types "'a list" and "'a option", their set and map functions,

3440 their relators, and their selectors are now produced using the new

3441 BNF-based datatype package.

3443 Renamed constants:

3444 Option.set ~> set_option

3445 Option.map ~> map_option

3446 option_rel ~> rel_option

3448 Renamed theorems:

3449 set_def ~> set_rec[abs_def]

3450 map_def ~> map_rec[abs_def]

3451 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")

3452 option.recs ~> option.rec

3453 list_all2_def ~> list_all2_iff

3454 set.simps ~> set_simps (or the slightly different "list.set")

3455 map.simps ~> list.map

3456 hd.simps ~> list.sel(1)

3457 tl.simps ~> list.sel(2-3)

3458 the.simps ~> option.sel

3460 INCOMPATIBILITY.

3462 * The following map functions and relators have been renamed:

3463 sum_map ~> map_sum

3464 map_pair ~> map_prod

3465 prod_rel ~> rel_prod

3466 sum_rel ~> rel_sum

3467 fun_rel ~> rel_fun

3468 set_rel ~> rel_set

3469 filter_rel ~> rel_filter

3470 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")

3471 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")

3472 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")

3474 INCOMPATIBILITY.

3476 * Lifting and Transfer:

3477 - a type variable as a raw type is supported

3478 - stronger reflexivity prover

3479 - rep_eq is always generated by lift_definition

3480 - setup for Lifting/Transfer is now automated for BNFs

3481 + holds for BNFs that do not contain a dead variable

3482 + relator_eq, relator_mono, relator_distr, relator_domain,

3483 relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,

3484 right_unique, right_total, left_unique, left_total are proved

3485 automatically

3486 + definition of a predicator is generated automatically

3487 + simplification rules for a predicator definition are proved

3488 automatically for datatypes

3489 - consolidation of the setup of Lifting/Transfer

3490 + property that a relator preservers reflexivity is not needed any

3491 more

3492 Minor INCOMPATIBILITY.

3493 + left_total and left_unique rules are now transfer rules

3494 (reflexivity_rule attribute not needed anymore)

3495 INCOMPATIBILITY.

3496 + Domainp does not have to be a separate assumption in

3497 relator_domain theorems (=> more natural statement)

3498 INCOMPATIBILITY.

3499 - registration of code equations is more robust

3500 Potential INCOMPATIBILITY.

3501 - respectfulness proof obligation is preprocessed to a more readable

3502 form

3503 Potential INCOMPATIBILITY.

3504 - eq_onp is always unfolded in respectfulness proof obligation

3505 Potential INCOMPATIBILITY.

3506 - unregister lifting setup for Code_Numeral.integer and

3507 Code_Numeral.natural

3508 Potential INCOMPATIBILITY.

3509 - Lifting.invariant -> eq_onp

3510 INCOMPATIBILITY.

3512 * New internal SAT solver "cdclite" that produces models and proof

3513 traces. This solver replaces the internal SAT solvers "enumerate" and

3514 "dpll". Applications that explicitly used one of these two SAT

3515 solvers should use "cdclite" instead. In addition, "cdclite" is now

3516 the default SAT solver for the "sat" and "satx" proof methods and

3517 corresponding tactics; the old default can be restored using "declare

3518 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.

3520 * SMT module: A new version of the SMT module, temporarily called

3521 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,

3522 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also

3523 supported as oracles. Yices is no longer supported, because no version

3524 of the solver can handle both SMT-LIB 2 and quantifiers.

3526 * Activation of Z3 now works via "z3_non_commercial" system option

3527 (without requiring restart), instead of former settings variable

3528 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu

3529 Plugin Options / Isabelle / General.

3531 * Sledgehammer:

3532 - Z3 can now produce Isar proofs.

3533 - MaSh overhaul:

3534 . New SML-based learning algorithms eliminate the dependency on

3535 Python and increase performance and reliability.

3536 . MaSh and MeSh are now used by default together with the

3537 traditional MePo (Meng-Paulson) relevance filter. To disable

3538 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin

3539 Options / Isabelle / General to "none".

3540 - New option:

3541 smt_proofs

3542 - Renamed options:

3543 isar_compress ~> compress

3544 isar_try0 ~> try0

3546 INCOMPATIBILITY.

3548 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.

3550 * Nitpick:

3551 - Fixed soundness bug whereby mutually recursive datatypes could

3552 take infinite values.

3553 - Fixed soundness bug with low-level number functions such as

3554 "Abs_Integ" and "Rep_Integ".

3555 - Removed "std" option.

3556 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to

3557 "hide_types".

3559 * Metis: Removed legacy proof method 'metisFT'. Use 'metis

3560 (full_types)' instead. INCOMPATIBILITY.

3562 * Try0: Added 'algebra' and 'meson' to the set of proof methods.

3564 * Adjustion of INF and SUP operations:

3565 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.

3566 - Consolidated theorem names containing INFI and SUPR: have INF and

3567 SUP instead uniformly.

3568 - More aggressive normalization of expressions involving INF and Inf

3569 or SUP and Sup.

3570 - INF_image and SUP_image do not unfold composition.

3571 - Dropped facts INF_comp, SUP_comp.

3572 - Default congruence rules strong_INF_cong and strong_SUP_cong, with

3573 simplifier implication in premises. Generalize and replace former

3574 INT_cong, SUP_cong

3576 INCOMPATIBILITY.

3578 * SUP and INF generalized to conditionally_complete_lattice.

3580 * Swapped orientation of facts image_comp and vimage_comp:

3582 image_compose ~> image_comp [symmetric]

3583 image_comp ~> image_comp [symmetric]

3584 vimage_compose ~> vimage_comp [symmetric]

3585 vimage_comp ~> vimage_comp [symmetric]

3587 INCOMPATIBILITY.

3589 * Theory reorganization: split of Big_Operators.thy into

3590 Groups_Big.thy and Lattices_Big.thy.

3592 * Consolidated some facts about big group operators:

3594 setsum_0' ~> setsum.neutral

3595 setsum_0 ~> setsum.neutral_const

3596 setsum_addf ~> setsum.distrib

3597 setsum_cartesian_product ~> setsum.cartesian_product

3598 setsum_cases ~> setsum.If_cases

3599 setsum_commute ~> setsum.commute

3600 setsum_cong ~> setsum.cong

3601 setsum_delta ~> setsum.delta

3602 setsum_delta' ~> setsum.delta'

3603 setsum_diff1' ~> setsum.remove

3604 setsum_empty ~> setsum.empty

3605 setsum_infinite ~> setsum.infinite

3606 setsum_insert ~> setsum.insert

3607 setsum_inter_restrict'' ~> setsum.inter_filter

3608 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left

3609 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right

3610 setsum_mono_zero_left ~> setsum.mono_neutral_left

3611 setsum_mono_zero_right ~> setsum.mono_neutral_right

3612 setsum_reindex ~> setsum.reindex

3613 setsum_reindex_cong ~> setsum.reindex_cong

3614 setsum_reindex_nonzero ~> setsum.reindex_nontrivial

3615 setsum_restrict_set ~> setsum.inter_restrict

3616 setsum_Plus ~> setsum.Plus

3617 setsum_setsum_restrict ~> setsum.commute_restrict

3618 setsum_Sigma ~> setsum.Sigma

3619 setsum_subset_diff ~> setsum.subset_diff

3620 setsum_Un_disjoint ~> setsum.union_disjoint

3621 setsum_UN_disjoint ~> setsum.UNION_disjoint

3622 setsum_Un_Int ~> setsum.union_inter

3623 setsum_Union_disjoint ~> setsum.Union_disjoint

3624 setsum_UNION_zero ~> setsum.Union_comp

3625 setsum_Un_zero ~> setsum.union_inter_neutral

3626 strong_setprod_cong ~> setprod.strong_cong

3627 strong_setsum_cong ~> setsum.strong_cong

3628 setprod_1' ~> setprod.neutral

3629 setprod_1 ~> setprod.neutral_const

3630 setprod_cartesian_product ~> setprod.cartesian_product

3631 setprod_cong ~> setprod.cong

3632 setprod_delta ~> setprod.delta

3633 setprod_delta' ~> setprod.delta'

3634 setprod_empty ~> setprod.empty

3635 setprod_infinite ~> setprod.infinite

3636 setprod_insert ~> setprod.insert

3637 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left

3638 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right

3639 setprod_mono_one_left ~> setprod.mono_neutral_left

3640 setprod_mono_one_right ~> setprod.mono_neutral_right

3641 setprod_reindex ~> setprod.reindex

3642 setprod_reindex_cong ~> setprod.reindex_cong

3643 setprod_reindex_nonzero ~> setprod.reindex_nontrivial

3644 setprod_Sigma ~> setprod.Sigma

3645 setprod_subset_diff ~> setprod.subset_diff

3646 setprod_timesf ~> setprod.distrib

3647 setprod_Un2 ~> setprod.union_diff2

3648 setprod_Un_disjoint ~> setprod.union_disjoint

3649 setprod_UN_disjoint ~> setprod.UNION_disjoint

3650 setprod_Un_Int ~> setprod.union_inter

3651 setprod_Union_disjoint ~> setprod.Union_disjoint

3652 setprod_Un_one ~> setprod.union_inter_neutral

3654 Dropped setsum_cong2 (simple variant of setsum.cong).

3655 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)

3656 Dropped setsum_reindex_id, setprod_reindex_id

3657 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).

3659 INCOMPATIBILITY.

3661 * Abolished slightly odd global lattice interpretation for min/max.

3663 Fact consolidations:

3664 min_max.inf_assoc ~> min.assoc

3665 min_max.inf_commute ~> min.commute

3666 min_max.inf_left_commute ~> min.left_commute

3667 min_max.inf_idem ~> min.idem

3668 min_max.inf_left_idem ~> min.left_idem

3669 min_max.inf_right_idem ~> min.right_idem

3670 min_max.sup_assoc ~> max.assoc

3671 min_max.sup_commute ~> max.commute

3672 min_max.sup_left_commute ~> max.left_commute

3673 min_max.sup_idem ~> max.idem

3674 min_max.sup_left_idem ~> max.left_idem

3675 min_max.sup_inf_distrib1 ~> max_min_distrib2

3676 min_max.sup_inf_distrib2 ~> max_min_distrib1

3677 min_max.inf_sup_distrib1 ~> min_max_distrib2

3678 min_max.inf_sup_distrib2 ~> min_max_distrib1

3679 min_max.distrib ~> min_max_distribs

3680 min_max.inf_absorb1 ~> min.absorb1

3681 min_max.inf_absorb2 ~> min.absorb2

3682 min_max.sup_absorb1 ~> max.absorb1

3683 min_max.sup_absorb2 ~> max.absorb2

3684 min_max.le_iff_inf ~> min.absorb_iff1

3685 min_max.le_iff_sup ~> max.absorb_iff2

3686 min_max.inf_le1 ~> min.cobounded1

3687 min_max.inf_le2 ~> min.cobounded2

3688 le_maxI1, min_max.sup_ge1 ~> max.cobounded1

3689 le_maxI2, min_max.sup_ge2 ~> max.cobounded2

3690 min_max.le_infI1 ~> min.coboundedI1

3691 min_max.le_infI2 ~> min.coboundedI2

3692 min_max.le_supI1 ~> max.coboundedI1

3693 min_max.le_supI2 ~> max.coboundedI2

3694 min_max.less_infI1 ~> min.strict_coboundedI1

3695 min_max.less_infI2 ~> min.strict_coboundedI2

3696 min_max.less_supI1 ~> max.strict_coboundedI1

3697 min_max.less_supI2 ~> max.strict_coboundedI2

3698 min_max.inf_mono ~> min.mono

3699 min_max.sup_mono ~> max.mono

3700 min_max.le_infI, min_max.inf_greatest ~> min.boundedI

3701 min_max.le_supI, min_max.sup_least ~> max.boundedI

3702 min_max.le_inf_iff ~> min.bounded_iff

3703 min_max.le_sup_iff ~> max.bounded_iff

3705 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,

3706 min.left_commute, min.left_idem, max.commute, max.assoc,

3707 max.left_commute, max.left_idem directly.

3709 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,

3710 min.cobounded2, max.cobounded1m max.cobounded2 directly.

3712 For min_ac or max_ac, prefer more general collection ac_simps.

3714 INCOMPATIBILITY.

3716 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>

3717 Inf_fin_le_Sup_fin. INCOMPATIBILITY.

3719 * Qualified constant names Wellfounded.acc, Wellfounded.accp.

3720 INCOMPATIBILITY.

3722 * Fact generalization and consolidation:

3723 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1

3725 INCOMPATIBILITY.

3727 * Purely algebraic definition of even. Fact generalization and

3728 consolidation:

3729 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd

3730 even_zero_(nat|int) ~> even_zero

3732 INCOMPATIBILITY.

3734 * Abolished neg_numeral.

3735 - Canonical representation for minus one is "- 1".

3736 - Canonical representation for other negative numbers is "- (numeral _)".

3737 - When devising rule sets for number calculation, consider the

3738 following canonical cases: 0, 1, numeral _, - 1, - numeral _.

3739 - HOLogic.dest_number also recognizes numerals in non-canonical forms

3740 like "numeral One", "- numeral One", "- 0" and even "- ... - _".

3741 - Syntax for negative numerals is mere input syntax.

3743 INCOMPATIBILITY.

3745 * Reduced name variants for rules on associativity and commutativity:

3747 add_assoc ~> add.assoc

3748 add_commute ~> add.commute

3749 add_left_commute ~> add.left_commute

3750 mult_assoc ~> mult.assoc

3751 mult_commute ~> mult.commute

3752 mult_left_commute ~> mult.left_commute

3753 nat_add_assoc ~> add.assoc

3754 nat_add_commute ~> add.commute

3755 nat_add_left_commute ~> add.left_commute

3756 nat_mult_assoc ~> mult.assoc

3757 nat_mult_commute ~> mult.commute

3758 eq_assoc ~> iff_assoc

3759 eq_left_commute ~> iff_left_commute

3761 INCOMPATIBILITY.

3763 * Fact collections add_ac and mult_ac are considered old-fashioned.

3764 Prefer ac_simps instead, or specify rules

3765 (add|mult).(assoc|commute|left_commute) individually.

3767 * Elimination of fact duplicates:

3768 equals_zero_I ~> minus_unique

3769 diff_eq_0_iff_eq ~> right_minus_eq

3770 nat_infinite ~> infinite_UNIV_nat

3771 int_infinite ~> infinite_UNIV_int

3773 INCOMPATIBILITY.

3775 * Fact name consolidation:

3776 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus

3777 minus_le_self_iff ~> neg_less_eq_nonneg

3778 le_minus_self_iff ~> less_eq_neg_nonpos

3779 neg_less_nonneg ~> neg_less_pos

3780 less_minus_self_iff ~> less_neg_neg [simp]

3782 INCOMPATIBILITY.

3784 * More simplification rules on unary and binary minus:

3785 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,

3786 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,

3787 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,

3788 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,

3789 minus_add_cancel, uminus_add_conv_diff. These correspondingly have

3790 been taken away from fact collections algebra_simps and field_simps.

3791 INCOMPATIBILITY.

3793 To restore proofs, the following patterns are helpful:

3795 a) Arbitrary failing proof not involving "diff_def":

3796 Consider simplification with algebra_simps or field_simps.

3798 b) Lifting rules from addition to subtraction:

3799 Try with "using <rule for addition> of [... "- _" ...]" by simp".

3801 c) Simplification with "diff_def": just drop "diff_def".

3802 Consider simplification with algebra_simps or field_simps;

3803 or the brute way with

3804 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".

3806 * Introduce bdd_above and bdd_below in theory

3807 Conditionally_Complete_Lattices, use them instead of explicitly

3808 stating boundedness of sets.

3810 * ccpo.admissible quantifies only over non-empty chains to allow more

3811 syntax-directed proof rules; the case of the empty chain shows up as

3812 additional case in fixpoint induction proofs. INCOMPATIBILITY.

3814 * Removed and renamed theorems in Series:

3815 summable_le ~> suminf_le

3816 suminf_le ~> suminf_le_const

3817 series_pos_le ~> setsum_le_suminf

3818 series_pos_less ~> setsum_less_suminf

3819 suminf_ge_zero ~> suminf_nonneg

3820 suminf_gt_zero ~> suminf_pos

3821 suminf_gt_zero_iff ~> suminf_pos_iff

3822 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ

3823 suminf_0_le ~> suminf_nonneg [rotate]

3824 pos_summable ~> summableI_nonneg_bounded

3825 ratio_test ~> summable_ratio_test

3827 removed series_zero, replaced by sums_finite

3829 removed auxiliary lemmas:

3831 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,

3832 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,

3833 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,

3834 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,

3835 summable_convergent_sumr_iff, sumr_diff_mult_const

3837 INCOMPATIBILITY.

3839 * Replace (F)DERIV syntax by has_derivative:

3840 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"

3842 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"

3844 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax

3846 - removed constant isDiff

3848 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as

3849 input syntax.

3851 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.

3853 - Renamed FDERIV_... lemmas to has_derivative_...

3855 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV

3857 - removed DERIV_intros, has_derivative_eq_intros

3859 - introduced derivative_intros and deriative_eq_intros which

3860 includes now rules for DERIV, has_derivative and

3861 has_vector_derivative.

3863 - Other renamings:

3864 differentiable_def ~> real_differentiable_def

3865 differentiableE ~> real_differentiableE

3866 fderiv_def ~> has_derivative_at

3867 field_fderiv_def ~> field_has_derivative_at

3868 isDiff_der ~> differentiable_def

3869 deriv_fderiv ~> has_field_derivative_def

3870 deriv_def ~> DERIV_def

3872 INCOMPATIBILITY.

3874 * Include more theorems in continuous_intros. Remove the

3875 continuous_on_intros, isCont_intros collections, these facts are now

3876 in continuous_intros.

3878 * Theorems about complex numbers are now stated only using Re and Im,

3879 the Complex constructor is not used anymore. It is possible to use

3880 primcorec to defined the behaviour of a complex-valued function.

3882 Removed theorems about the Complex constructor from the simpset, they

3883 are available as the lemma collection legacy_Complex_simps. This

3884 especially removes

3886 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".

3888 Instead the reverse direction is supported with

3889 Complex_eq: "Complex a b = a + \<i> * b"

3891 Moved csqrt from Fundamental_Algebra_Theorem to Complex.

3893 Renamings:

3894 Re/Im ~> complex.sel

3895 complex_Re/Im_zero ~> zero_complex.sel

3896 complex_Re/Im_add ~> plus_complex.sel

3897 complex_Re/Im_minus ~> uminus_complex.sel

3898 complex_Re/Im_diff ~> minus_complex.sel

3899 complex_Re/Im_one ~> one_complex.sel

3900 complex_Re/Im_mult ~> times_complex.sel

3901 complex_Re/Im_inverse ~> inverse_complex.sel

3902 complex_Re/Im_scaleR ~> scaleR_complex.sel

3903 complex_Re/Im_i ~> ii.sel

3904 complex_Re/Im_cnj ~> cnj.sel

3905 Re/Im_cis ~> cis.sel

3907 complex_divide_def ~> divide_complex_def

3908 complex_norm_def ~> norm_complex_def

3909 cmod_def ~> norm_complex_de

3911 Removed theorems:

3912 complex_zero_def

3913 complex_add_def

3914 complex_minus_def

3915 complex_diff_def

3916 complex_one_def

3917 complex_mult_def

3918 complex_inverse_def

3919 complex_scaleR_def

3921 INCOMPATIBILITY.

3923 * Theory Lubs moved HOL image to HOL-Library. It is replaced by

3924 Conditionally_Complete_Lattices. INCOMPATIBILITY.

3926 * HOL-Library: new theory src/HOL/Library/Tree.thy.

3928 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it

3929 is subsumed by session Kleene_Algebra in AFP.

3931 * HOL-Library / theory RBT: various constants and facts are hidden;

3932 lifting setup is unregistered. INCOMPATIBILITY.

3934 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.

3936 * HOL-Word: bit representations prefer type bool over type bit.

3937 INCOMPATIBILITY.

3939 * HOL-Word:

3940 - Abandoned fact collection "word_arith_alts", which is a duplicate

3941 of "word_arith_wis".

3942 - Dropped first (duplicated) element in fact collections

3943 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",

3944 "uint_word_arith_bintrs".

3946 * HOL-Number_Theory:

3947 - consolidated the proofs of the binomial theorem

3948 - the function fib is again of type nat => nat and not overloaded

3949 - no more references to Old_Number_Theory in the HOL libraries

3950 (except the AFP)

3952 INCOMPATIBILITY.

3954 * HOL-Multivariate_Analysis:

3955 - Type class ordered_real_vector for ordered vector spaces.

3956 - New theory Complex_Basic_Analysis defining complex derivatives,

3957 holomorphic functions, etc., ported from HOL Light's canal.ml.

3958 - Changed order of ordered_euclidean_space to be compatible with

3959 pointwise ordering on products. Therefore instance of

3960 conditionally_complete_lattice and ordered_real_vector.

3961 INCOMPATIBILITY: use box instead of greaterThanLessThan or

3962 explicit set-comprehensions with eucl_less for other (half-)open

3963 intervals.

3964 - removed dependencies on type class ordered_euclidean_space with

3965 introduction of "cbox" on euclidean_space

3966 - renamed theorems:

3967 interval ~> box

3968 mem_interval ~> mem_box

3969 interval_eq_empty ~> box_eq_empty

3970 interval_ne_empty ~> box_ne_empty

3971 interval_sing(1) ~> cbox_sing

3972 interval_sing(2) ~> box_sing

3973 subset_interval_imp ~> subset_box_imp

3974 subset_interval ~> subset_box

3975 open_interval ~> open_box

3976 closed_interval ~> closed_cbox

3977 interior_closed_interval ~> interior_cbox

3978 bounded_closed_interval ~> bounded_cbox

3979 compact_interval ~> compact_cbox

3980 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric

3981 bounded_subset_closed_interval ~> bounded_subset_cbox

3982 mem_interval_componentwiseI ~> mem_box_componentwiseI

3983 convex_box ~> convex_prod

3984 rel_interior_real_interval ~> rel_interior_real_box

3985 convex_interval ~> convex_box

3986 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox

3987 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox

3988 content_closed_interval' ~> content_cbox'

3989 elementary_subset_interval ~> elementary_subset_box

3990 diameter_closed_interval ~> diameter_cbox

3991 frontier_closed_interval ~> frontier_cbox

3992 frontier_open_interval ~> frontier_box

3993 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric

3994 closure_open_interval ~> closure_box

3995 open_closed_interval_convex ~> open_cbox_convex

3996 open_interval_midpoint ~> box_midpoint

3997 content_image_affinity_interval ~> content_image_affinity_cbox

3998 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval

3999 bounded_interval ~> bounded_closed_interval + bounded_boxes

4001 - respective theorems for intervals over the reals:

4002 content_closed_interval + content_cbox

4003 has_integral + has_integral_real

4004 fine_division_exists + fine_division_exists_real

4005 has_integral_null + has_integral_null_real

4006 tagged_division_union_interval + tagged_division_union_interval_real

4007 has_integral_const + has_integral_const_real

4008 integral_const + integral_const_real

4009 has_integral_bound + has_integral_bound_real

4010 integrable_continuous + integrable_continuous_real

4011 integrable_subinterval + integrable_subinterval_real

4012 has_integral_reflect_lemma + has_integral_reflect_lemma_real

4013 integrable_reflect + integrable_reflect_real

4014 integral_reflect + integral_reflect_real

4015 image_affinity_interval + image_affinity_cbox

4016 image_smult_interval + image_smult_cbox

4017 integrable_const + integrable_const_ivl

4018 integrable_on_subinterval + integrable_on_subcbox

4020 - renamed theorems:

4021 derivative_linear ~> has_derivative_bounded_linear

4022 derivative_is_linear ~> has_derivative_linear

4023 bounded_linear_imp_linear ~> bounded_linear.linear

4025 * HOL-Probability:

4026 - Renamed positive_integral to nn_integral:

4028 . Renamed all lemmas "*positive_integral*" to *nn_integral*"

4029 positive_integral_positive ~> nn_integral_nonneg

4031 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.

4033 - replaced the Lebesgue integral on real numbers by the more general

4034 Bochner integral for functions into a real-normed vector space.

4036 integral_zero ~> integral_zero / integrable_zero

4037 integral_minus ~> integral_minus / integrable_minus

4038 integral_add ~> integral_add / integrable_add

4039 integral_diff ~> integral_diff / integrable_diff

4040 integral_setsum ~> integral_setsum / integrable_setsum

4041 integral_multc ~> integral_mult_left / integrable_mult_left

4042 integral_cmult ~> integral_mult_right / integrable_mult_right

4043 integral_triangle_inequality~> integral_norm_bound

4044 integrable_nonneg ~> integrableI_nonneg

4045 integral_positive ~> integral_nonneg_AE

4046 integrable_abs_iff ~> integrable_abs_cancel

4047 positive_integral_lim_INF ~> nn_integral_liminf

4048 lebesgue_real_affine ~> lborel_real_affine

4049 borel_integral_has_integral ~> has_integral_lebesgue_integral

4050 integral_indicator ~>

4051 integral_real_indicator / integrable_real_indicator

4052 positive_integral_fst ~> nn_integral_fst'

4053 positive_integral_fst_measurable ~> nn_integral_fst

4054 positive_integral_snd_measurable ~> nn_integral_snd

4056 integrable_fst_measurable ~>

4057 integral_fst / integrable_fst / AE_integrable_fst

4059 integrable_snd_measurable ~>

4060 integral_snd / integrable_snd / AE_integrable_snd

4062 integral_monotone_convergence ~>

4063 integral_monotone_convergence / integrable_monotone_convergence

4065 integral_monotone_convergence_at_top ~>

4066 integral_monotone_convergence_at_top /

4067 integrable_monotone_convergence_at_top

4069 has_integral_iff_positive_integral_lebesgue ~>

4070 has_integral_iff_has_bochner_integral_lebesgue_nonneg

4072 lebesgue_integral_has_integral ~>

4073 has_integral_integrable_lebesgue_nonneg

4075 positive_integral_lebesgue_has_integral ~>

4076 integral_has_integral_lebesgue_nonneg /

4077 integrable_has_integral_lebesgue_nonneg

4079 lebesgue_integral_real_affine ~>

4080 nn_integral_real_affine

4082 has_integral_iff_positive_integral_lborel ~>

4083 integral_has_integral_nonneg / integrable_has_integral_nonneg

4085 The following theorems where removed:

4087 lebesgue_integral_nonneg

4088 lebesgue_integral_uminus

4089 lebesgue_integral_cmult

4090 lebesgue_integral_multc

4091 lebesgue_integral_cmult_nonneg

4092 integral_cmul_indicator

4093 integral_real

4095 - Formalized properties about exponentially, Erlang, and normal

4096 distributed random variables.

4098 * HOL-Decision_Procs: Separate command 'approximate' for approximative

4099 computation in src/HOL/Decision_Procs/Approximation. Minor

4100 INCOMPATIBILITY.

4103 *** Scala ***

4105 * The signature and semantics of Document.Snapshot.cumulate_markup /

4106 select_markup have been clarified. Markup is now traversed in the

4107 order of reports given by the prover: later markup is usually more

4108 specific and may override results accumulated so far. The elements

4109 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.

4111 * Substantial reworking of internal PIDE protocol communication

4112 channels. INCOMPATIBILITY.

4115 *** ML ***

4117 * Subtle change of semantics of Thm.eq_thm: theory stamps are not

4118 compared (according to Thm.thm_ord), but assumed to be covered by the

4119 current background theory. Thus equivalent data produced in different

4120 branches of the theory graph usually coincides (e.g. relevant for

4121 theory merge). Note that the softer Thm.eq_thm_prop is often more

4122 appropriate than Thm.eq_thm.

4124 * Proper context for basic Simplifier operations: rewrite_rule,

4125 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to

4126 pass runtime Proof.context (and ensure that the simplified entity

4127 actually belongs to it).

4129 * Proper context discipline for read_instantiate and instantiate_tac:

4130 variables that are meant to become schematic need to be given as

4131 fixed, and are generalized by the explicit context of local variables.

4132 This corresponds to Isar attributes "where" and "of" with 'for'

4133 declaration. INCOMPATIBILITY, also due to potential change of indices

4134 of schematic variables.

4136 * Moved ML_Compiler.exn_trace and other operations on exceptions to

4137 structure Runtime. Minor INCOMPATIBILITY.

4139 * Discontinued old Toplevel.debug in favour of system option

4140 "ML_exception_trace", which may be also declared within the context

4141 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.

4143 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor

4144 INCOMPATIBILITY.

4146 * Configuration option "ML_print_depth" controls the pretty-printing

4147 depth of the ML compiler within the context. The old print_depth in

4148 ML is still available as default_print_depth, but rarely used. Minor

4149 INCOMPATIBILITY.

4151 * Toplevel function "use" refers to raw ML bootstrap environment,

4152 without Isar context nor antiquotations. Potential INCOMPATIBILITY.

4153 Note that 'ML_file' is the canonical command to load ML files into the

4154 formal context.

4156 * Simplified programming interface to define ML antiquotations, see

4157 structure ML_Antiquotation. Minor INCOMPATIBILITY.

4159 * ML antiquotation @{here} refers to its source position, which is

4160 occasionally useful for experimentation and diagnostic purposes.

4162 * ML antiquotation @{path} produces a Path.T value, similarly to

4163 Path.explode, but with compile-time check against the file-system and

4164 some PIDE markup. Note that unlike theory source, ML does not have a

4165 well-defined master directory, so an absolute symbolic path

4166 specification is usually required, e.g. "~~/src/HOL".

4168 * ML antiquotation @{print} inlines a function to print an arbitrary

4169 ML value, which is occasionally useful for diagnostic or demonstration

4170 purposes.

4173 *** System ***

4175 * Proof General with its traditional helper scripts is now an optional

4176 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle

4177 component repository http://isabelle.in.tum.de/components/. Note that

4178 the "system" manual provides general explanations about add-on

4179 components, especially those that are not bundled with the release.

4181 * The raw Isabelle process executable has been renamed from

4182 "isabelle-process" to "isabelle_process", which conforms to common

4183 shell naming conventions, and allows to define a shell function within

4184 the Isabelle environment to avoid dynamic path lookup. Rare

4185 incompatibility for old tools that do not use the ISABELLE_PROCESS

4186 settings variable.

4188 * Former "isabelle tty" has been superseded by "isabelle console",

4189 with implicit build like "isabelle jedit", and without the mostly

4190 obsolete Isar TTY loop.

4192 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER

4193 and PDF_VIEWER now refer to the actual programs, not shell

4194 command-lines. Discontinued option -c: invocation may be asynchronous

4195 via desktop environment, without any special precautions. Potential

4196 INCOMPATIBILITY with ambitious private settings.

4198 * Removed obsolete "isabelle unsymbolize". Note that the usual format

4199 for email communication is the Unicode rendering of Isabelle symbols,

4200 as produced by Isabelle/jEdit, for example.

4202 * Removed obsolete tool "wwwfind". Similar functionality may be

4203 integrated into Isabelle/jEdit eventually.

4205 * Improved 'display_drafts' concerning desktop integration and

4206 repeated invocation in PIDE front-end: re-use single file

4207 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.

4209 * Session ROOT specifications require explicit 'document_files' for

4210 robust dependencies on LaTeX sources. Only these explicitly given

4211 files are copied to the document output directory, before document

4212 processing is started.

4214 * Windows: support for regular TeX installation (e.g. MiKTeX) instead

4215 of TeX Live from Cygwin.

4219 New in Isabelle2013-2 (December 2013)

4220 -------------------------------------

4222 *** Prover IDE -- Isabelle/Scala/jEdit ***

4224 * More robust editing of running commands with internal forks,

4225 e.g. non-terminating 'by' steps.

4227 * More relaxed Sledgehammer panel: avoid repeated application of query

4228 after edits surrounding the command location.

4230 * More status information about commands that are interrupted

4231 accidentally (via physical event or Poly/ML runtime system signal,

4232 e.g. out-of-memory).

4235 *** System ***

4237 * More robust termination of external processes managed by

4238 Isabelle/ML: support cancellation of tasks within the range of

4239 milliseconds, as required for PIDE document editing with automatically

4240 tried tools (e.g. Sledgehammer).

4242 * Reactivated Isabelle/Scala kill command for external processes on

4243 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a

4244 workaround for some Debian/Ubuntu Linux versions from 2013.

4248 New in Isabelle2013-1 (November 2013)

4249 -------------------------------------

4251 *** General ***

4253 * Discontinued obsolete 'uses' within theory header. Note that

4254 commands like 'ML_file' work without separate declaration of file

4255 dependencies. Minor INCOMPATIBILITY.

4257 * Discontinued redundant 'use' command, which was superseded by

4258 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.

4260 * Simplified subscripts within identifiers, using plain \<^sub>

4261 instead of the second copy \<^isub> and \<^isup>. Superscripts are

4262 only for literal tokens within notation; explicit mixfix annotations

4263 for consts or fixed variables may be used as fall-back for unusual

4264 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in

4265 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to

4266 standardize symbols as a starting point for further manual cleanup.

4267 The ML reference variable "legacy_isub_isup" may be set as temporary

4268 workaround, to make the prover accept a subset of the old identifier

4269 syntax.

4271 * Document antiquotations: term style "isub" has been renamed to

4272 "sub". Minor INCOMPATIBILITY.

4274 * Uniform management of "quick_and_dirty" as system option (see also

4275 "isabelle options"), configuration option within the context (see also

4276 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor

4277 INCOMPATIBILITY, need to use more official Isabelle means to access

4278 quick_and_dirty, instead of historical poking into mutable reference.

4280 * Renamed command 'print_configs' to 'print_options'. Minor

4281 INCOMPATIBILITY.

4283 * Proper diagnostic command 'print_state'. Old 'pr' (with its

4284 implicit change of some global references) is retained for now as

4285 control command, e.g. for ProofGeneral 3.7.x.

4287 * Discontinued 'print_drafts' command with its old-fashioned PS output

4288 and Unix command-line print spooling. Minor INCOMPATIBILITY: use

4289 'display_drafts' instead and print via the regular document viewer.

4291 * Updated and extended "isar-ref" and "implementation" manual,

4292 eliminated old "ref" manual.

4295 *** Prover IDE -- Isabelle/Scala/jEdit ***

4297 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or

4298 Documentation panel.

4300 * Dockable window "Documentation" provides access to Isabelle

4301 documentation.

4303 * Dockable window "Find" provides query operations for formal entities

4304 (GUI front-end to 'find_theorems' command).

4306 * Dockable window "Sledgehammer" manages asynchronous / parallel

4307 sledgehammer runs over existing document sources, independently of

4308 normal editing and checking process.

4310 * Dockable window "Timing" provides an overview of relevant command

4311 timing information, depending on option jedit_timing_threshold. The

4312 same timing information is shown in the extended tooltip of the

4313 command keyword, when hovering the mouse over it while the CONTROL or

4314 COMMAND modifier is pressed.

4316 * Improved dockable window "Theories": Continuous checking of proof

4317 document (visible and required parts) may be controlled explicitly,

4318 using check box or shortcut "C+e ENTER". Individual theory nodes may

4319 be marked explicitly as required and checked in full, using check box

4320 or shortcut "C+e SPACE".

4322 * Improved completion mechanism, which is now managed by the

4323 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle

4324 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).

4326 * Standard jEdit keyboard shortcut C+b complete-word is remapped to

4327 isabelle.complete for explicit completion in Isabelle sources.

4328 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts

4329 to resolve conflict.

4331 * Improved support of various "minor modes" for Isabelle NEWS,

4332 options, session ROOT etc., with completion and SideKick tree view.

4334 * Strictly monotonic document update, without premature cancellation of

4335 running transactions that are still needed: avoid reset/restart of

4336 such command executions while editing.

4338 * Support for asynchronous print functions, as overlay to existing

4339 document content.

4341 * Support for automatic tools in HOL, which try to prove or disprove

4342 toplevel theorem statements.

4344 * Action isabelle.reset-font-size resets main text area font size

4345 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see

4346 also "Plugin Options / Isabelle / General"). It can be bound to some

4347 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).

4349 * File specifications in jEdit (e.g. file browser) may refer to

4350 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued

4351 obsolete $ISABELLE_HOME_WINDOWS variable.

4353 * Improved support for Linux look-and-feel "GTK+", see also "Utilities

4354 / Global Options / Appearance".

4356 * Improved support of native Mac OS X functionality via "MacOSX"

4357 plugin, which is now enabled by default.

4360 *** Pure ***

4362 * Commands 'interpretation' and 'sublocale' are now target-sensitive.

4363 In particular, 'interpretation' allows for non-persistent

4364 interpretation within "context ... begin ... end" blocks offering a

4365 light-weight alternative to 'sublocale'. See "isar-ref" manual for

4366 details.

4368 * Improved locales diagnostic command 'print_dependencies'.

4370 * Discontinued obsolete 'axioms' command, which has been marked as

4371 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'

4372 instead, while observing its uniform scope for polymorphism.

4374 * Discontinued empty name bindings in 'axiomatization'.

4375 INCOMPATIBILITY.

4377 * System option "proofs" has been discontinued. Instead the global

4378 state of Proofterm.proofs is persistently compiled into logic images

4379 as required, notably HOL-Proofs. Users no longer need to change

4380 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.

4382 * Syntax translation functions (print_translation etc.) always depend

4383 on Proof.context. Discontinued former "(advanced)" option -- this is

4384 now the default. Minor INCOMPATIBILITY.

4386 * Former global reference trace_unify_fail is now available as

4387 configuration option "unify_trace_failure" (global context only).

4389 * SELECT_GOAL now retains the syntactic context of the overall goal

4390 state (schematic variables etc.). Potential INCOMPATIBILITY in rare

4391 situations.

4394 *** HOL ***

4396 * Stronger precedence of syntax for big intersection and union on

4397 sets, in accordance with corresponding lattice operations.

4398 INCOMPATIBILITY.

4400 * Notation "{p:A. P}" now allows tuple patterns as well.

4402 * Nested case expressions are now translated in a separate check phase

4403 rather than during parsing. The data for case combinators is separated

4404 from the datatype package. The declaration attribute

4405 "case_translation" can be used to register new case combinators:

4407 declare [[case_translation case_combinator constructor1 ... constructorN]]

4409 * Code generator:

4410 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /

4411 'code_instance'.

4412 - 'code_identifier' declares name hints for arbitrary identifiers in

4413 generated code, subsuming 'code_modulename'.

4415 See the isar-ref manual for syntax diagrams, and the HOL theories for

4416 examples.

4418 * Attibute 'code': 'code' now declares concrete and abstract code

4419 equations uniformly. Use explicit 'code equation' and 'code abstract'

4420 to distinguish both when desired.

4422 * Discontinued theories Code_Integer and Efficient_Nat by a more

4423 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,

4424 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code

4425 generation for details. INCOMPATIBILITY.

4427 * Numeric types are mapped by default to target language numerals:

4428 natural (replaces former code_numeral) and integer (replaces former

4429 code_int). Conversions are available as integer_of_natural /

4430 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and

4431 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in

4432 ML). INCOMPATIBILITY.

4434 * Function package: For mutually recursive functions f and g, separate

4435 cases rules f.cases and g.cases are generated instead of unusable

4436 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,

4437 in the case that the unusable rule was used nevertheless.

4439 * Function package: For each function f, new rules f.elims are

4440 generated, which eliminate equalities of the form "f x = t".

4442 * New command 'fun_cases' derives ad-hoc elimination rules for

4443 function equations as simplified instances of f.elims, analogous to

4444 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.

4446 * Lifting:

4447 - parametrized correspondence relations are now supported:

4448 + parametricity theorems for the raw term can be specified in

4449 the command lift_definition, which allow us to generate stronger

4450 transfer rules

4451 + setup_lifting generates stronger transfer rules if parametric

4452 correspondence relation can be generated

4453 + various new properties of the relator must be specified to support

4454 parametricity

4455 + parametricity theorem for the Quotient relation can be specified

4456 - setup_lifting generates domain rules for the Transfer package

4457 - stronger reflexivity prover of respectfulness theorems for type

4458 copies

4459 - ===> and --> are now local. The symbols can be introduced

4460 by interpreting the locale lifting_syntax (typically in an

4461 anonymous context)

4462 - Lifting/Transfer relevant parts of Library/Quotient_* are now in

4463 Main. Potential INCOMPATIBILITY

4464 - new commands for restoring and deleting Lifting/Transfer context:

4465 lifting_forget, lifting_update

4466 - the command print_quotmaps was renamed to print_quot_maps.

4467 INCOMPATIBILITY

4469 * Transfer:

4470 - better support for domains in Transfer: replace Domainp T

4471 by the actual invariant in a transferred goal

4472 - transfer rules can have as assumptions other transfer rules

4473 - Experimental support for transferring from the raw level to the

4474 abstract level: Transfer.transferred attribute

4475 - Attribute version of the transfer method: untransferred attribute

4477 * Reification and reflection:

4478 - Reification is now directly available in HOL-Main in structure

4479 "Reification".

4480 - Reflection now handles multiple lists with variables also.

4481 - The whole reflection stack has been decomposed into conversions.

4482 INCOMPATIBILITY.

4484 * Revised devices for recursive definitions over finite sets:

4485 - Only one fundamental fold combinator on finite set remains:

4486 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b

4487 This is now identity on infinite sets.

4488 - Locales ("mini packages") for fundamental definitions with

4489 Finite_Set.fold: folding, folding_idem.

4490 - Locales comm_monoid_set, semilattice_order_set and

4491 semilattice_neutr_order_set for big operators on sets.

4492 See theory Big_Operators for canonical examples.

4493 Note that foundational constants comm_monoid_set.F and

4494 semilattice_set.F correspond to former combinators fold_image

4495 and fold1 respectively. These are now gone. You may use

4496 those foundational constants as substitutes, but it is

4497 preferable to interpret the above locales accordingly.

4498 - Dropped class ab_semigroup_idem_mult (special case of lattice,

4499 no longer needed in connection with Finite_Set.fold etc.)

4500 - Fact renames:

4501 card.union_inter ~> card_Un_Int [symmetric]

4502 card.union_disjoint ~> card_Un_disjoint

4503 INCOMPATIBILITY.

4505 * Locale hierarchy for abstract orderings and (semi)lattices.

4507 * Complete_Partial_Order.admissible is defined outside the type class

4508 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the

4509 class predicate assumption or sort constraint when possible.

4510 INCOMPATIBILITY.

4512 * Introduce type class "conditionally_complete_lattice": Like a

4513 complete lattice but does not assume the existence of the top and

4514 bottom elements. Allows to generalize some lemmas about reals and

4515 extended reals. Removed SupInf and replaced it by the instantiation

4516 of conditionally_complete_lattice for real. Renamed lemmas about

4517 conditionally-complete lattice from Sup_... to cSup_... and from

4518 Inf_... to cInf_... to avoid hidding of similar complete lattice

4519 lemmas.

4521 * Introduce type class linear_continuum as combination of

4522 conditionally-complete lattices and inner dense linorders which have

4523 more than one element. INCOMPATIBILITY.

4525 * Introduced type classes order_top and order_bot. The old classes top

4526 and bot only contain the syntax without assumptions. INCOMPATIBILITY:

4527 Rename bot -> order_bot, top -> order_top

4529 * Introduce type classes "no_top" and "no_bot" for orderings without

4530 top and bottom elements.

4532 * Split dense_linorder into inner_dense_order and no_top, no_bot.

4534 * Complex_Main: Unify and move various concepts from

4535 HOL-Multivariate_Analysis to HOL-Complex_Main.

4537 - Introduce type class (lin)order_topology and

4538 linear_continuum_topology. Allows to generalize theorems about

4539 limits and order. Instances are reals and extended reals.

4541 - continuous and continuos_on from Multivariate_Analysis:

4542 "continuous" is the continuity of a function at a filter. "isCont"

4543 is now an abbrevitation: "isCont x f == continuous (at _) f".

4545 Generalized continuity lemmas from isCont to continuous on an

4546 arbitrary filter.

4548 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove

4549 compactness of closed intervals on reals. Continuous functions

4550 attain infimum and supremum on compact sets. The inverse of a

4551 continuous function is continuous, when the function is continuous

4552 on a compact set.

4554 - connected from Multivariate_Analysis. Use it to prove the

4555 intermediate value theorem. Show connectedness of intervals on

4556 linear_continuum_topology).

4558 - first_countable_topology from Multivariate_Analysis. Is used to

4559 show equivalence of properties on the neighbourhood filter of x and

4560 on all sequences converging to x.

4562 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved

4563 theorems from Library/FDERIV.thy to Deriv.thy and base the

4564 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV

4565 which are restricted to sets, i.e. to represent derivatives from

4566 left or right.

4568 - Removed the within-filter. It is replaced by the principal filter:

4570 F within X = inf F (principal X)

4572 - Introduce "at x within U" as a single constant, "at x" is now an

4573 abbreviation for "at x within UNIV"

4575 - Introduce named theorem collections tendsto_intros,

4576 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems

4577 in tendsto_intros (or FDERIV_intros) are also available as

4578 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side

4579 is replaced by a congruence rule. This allows to apply them as

4580 intro rules and then proving equivalence by the simplifier.

4582 - Restructured theories in HOL-Complex_Main:

4584 + Moved RealDef and RComplete into Real

4586 + Introduced Topological_Spaces and moved theorems about

4587 topological spaces, filters, limits and continuity to it

4589 + Renamed RealVector to Real_Vector_Spaces

4591 + Split Lim, SEQ, Series into Topological_Spaces,

4592 Real_Vector_Spaces, and Limits

4594 + Moved Ln and Log to Transcendental

4596 + Moved theorems about continuity from Deriv to Topological_Spaces

4598 - Remove various auxiliary lemmas.

4600 INCOMPATIBILITY.

4602 * Nitpick:

4603 - Added option "spy".

4604 - Reduce incidence of "too high arity" errors.

4606 * Sledgehammer:

4607 - Renamed option:

4608 isar_shrink ~> isar_compress

4609 INCOMPATIBILITY.

4610 - Added options "isar_try0", "spy".

4611 - Better support for "isar_proofs".

4612 - MaSh has been fined-tuned and now runs as a local server.

4614 * Improved support for ad hoc overloading of constants (see also

4615 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).

4617 * Library/Polynomial.thy:

4618 - Use lifting for primitive definitions.

4619 - Explicit conversions from and to lists of coefficients, used for

4620 generated code.

4621 - Replaced recursion operator poly_rec by fold_coeffs.

4622 - Prefer pre-existing gcd operation for gcd.

4623 - Fact renames:

4624 poly_eq_iff ~> poly_eq_poly_eq_iff

4625 poly_ext ~> poly_eqI

4626 expand_poly_eq ~> poly_eq_iff

4627 IMCOMPATIBILITY.

4629 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and

4630 case_of_simps to convert function definitions between a list of

4631 equations with patterns on the lhs and a single equation with case

4632 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.

4634 * New Library/FSet.thy: type of finite sets defined as a subtype of

4635 sets defined by Lifting/Transfer.

4637 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.

4639 * Consolidation of library theories on product orders:

4641 Product_Lattice ~> Product_Order -- pointwise order on products

4642 Product_ord ~> Product_Lexorder -- lexicographic order on products

4644 INCOMPATIBILITY.

4646 * Imperative-HOL: The MREC combinator is considered legacy and no

4647 longer included by default. INCOMPATIBILITY, use partial_function

4648 instead, or import theory Legacy_Mrec as a fallback.

4650 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and

4651 ~~/src/HOL/Algebra/poly. Existing theories should be based on

4652 ~~/src/HOL/Library/Polynomial instead. The latter provides

4653 integration with HOL's type classes for rings. INCOMPATIBILITY.

4655 * HOL-BNF:

4656 - Various improvements to BNF-based (co)datatype package, including

4657 new commands "primrec_new", "primcorec", and

4658 "datatype_new_compat", as well as documentation. See

4659 "datatypes.pdf" for details.

4660 - New "coinduction" method to avoid some boilerplate (compared to

4661 coinduct).

4662 - Renamed keywords:

4663 data ~> datatype_new

4664 codata ~> codatatype

4665 bnf_def ~> bnf

4666 - Renamed many generated theorems, including

4667 discs ~> disc

4668 map_comp' ~> map_comp

4669 map_id' ~> map_id

4670 sels ~> sel

4671 set_map' ~> set_map

4672 sets ~> set

4673 IMCOMPATIBILITY.

4676 *** ML ***

4678 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function

4679 "check_property" allows to check specifications of the form "ALL x y

4680 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its

4681 Examples.thy in particular.

4683 * Improved printing of exception trace in Poly/ML 5.5.1, with regular

4684 tracing output in the command transaction context instead of physical

4685 stdout. See also Toplevel.debug, Toplevel.debugging and

4686 ML_Compiler.exn_trace.

4688 * ML type "theory" is now immutable, without any special treatment of

4689 drafts or linear updates (which could lead to "stale theory" errors in

4690 the past). Discontinued obsolete operations like Theory.copy,

4691 Theory.checkpoint, and the auxiliary type theory_ref. Minor

4692 INCOMPATIBILITY.

4694 * More uniform naming of goal functions for skipped proofs:

4696 Skip_Proof.prove ~> Goal.prove_sorry

4697 Skip_Proof.prove_global ~> Goal.prove_sorry_global

4699 Minor INCOMPATIBILITY.

4701 * Simplifier tactics and tools use proper Proof.context instead of

4702 historic type simpset. Old-style declarations like addsimps,

4703 addsimprocs etc. operate directly on Proof.context. Raw type simpset

4704 retains its use as snapshot of the main Simplifier context, using

4705 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port

4706 old tools by making them depend on (ctxt : Proof.context) instead of

4707 (ss : simpset), then turn (simpset_of ctxt) into ctxt.

4709 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)

4710 operate on Proof.context instead of claset, for uniformity with addIs,

4711 addEs, addDs etc. Note that claset_of and put_claset allow to manage

4712 clasets separately from the context.

4714 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.

4715 INCOMPATIBILITY, use @{context} instead.

4717 * Antiquotation @{theory_context A} is similar to @{theory A}, but

4718 presents the result as initial Proof.context.

4721 *** System ***

4723 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by

4724 "isabelle build" in Isabelle2013. INCOMPATIBILITY.

4726 * Discontinued obsolete isabelle-process options -f and -u (former

4727 administrative aliases of option -e). Minor INCOMPATIBILITY.

4729 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND

4730 settings variable.

4732 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic

4733 document formats: dvi.gz, ps, ps.gz -- the default document format is

4734 always pdf.

4736 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to

4737 specify global resources of the JVM process run by isabelle build.

4739 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows

4740 to run Isabelle/Scala source files as standalone programs.

4742 * Improved "isabelle keywords" tool (for old-style ProofGeneral

4743 keyword tables): use Isabelle/Scala operations, which inspect outer

4744 syntax without requiring to build sessions first.

4746 * Sessions may be organized via 'chapter' specifications in the ROOT

4747 file, which determines a two-level hierarchy of browser info. The old

4748 tree-like organization via implicit sub-session relation (with its

4749 tendency towards erratic fluctuation of URLs) has been discontinued.

4750 The default chapter is called "Unsorted". Potential INCOMPATIBILITY

4751 for HTML presentation of theories.

4755 New in Isabelle2013 (February 2013)

4756 -----------------------------------

4758 *** General ***

4760 * Theorem status about oracles and unfinished/failed future proofs is

4761 no longer printed by default, since it is incompatible with

4762 incremental / parallel checking of the persistent document model. ML

4763 function Thm.peek_status may be used to inspect a snapshot of the

4764 ongoing evaluation process. Note that in batch mode --- notably

4765 isabelle build --- the system ensures that future proofs of all

4766 accessible theorems in the theory context are finished (as before).

4768 * Configuration option show_markup controls direct inlining of markup

4769 into the printed representation of formal entities --- notably type

4770 and sort constraints. This enables Prover IDE users to retrieve that

4771 information via tooltips in the output window, for example.

4773 * Command 'ML_file' evaluates ML text from a file directly within the

4774 theory, without any predeclaration via 'uses' in the theory header.

4776 * Old command 'use' command and corresponding keyword 'uses' in the

4777 theory header are legacy features and will be discontinued soon.

4778 Tools that load their additional source files may imitate the

4779 'ML_file' implementation, such that the system can take care of

4780 dependencies properly.

4782 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which

4783 is called fastforce / fast_force_tac already since Isabelle2011-1.

4785 * Updated and extended "isar-ref" and "implementation" manual, reduced

4786 remaining material in old "ref" manual.

4788 * Improved support for auxiliary contexts that indicate block structure

4789 for specifications. Nesting of "context fixes ... context assumes ..."

4790 and "class ... context ...".

4792 * Attribute "consumes" allows a negative value as well, which is

4793 interpreted relatively to the total number of premises of the rule in

4794 the target context. This form of declaration is stable when exported

4795 from a nested 'context' with additional assumptions. It is the

4796 preferred form for definitional packages, notably cases/rules produced

4797 in HOL/inductive and HOL/function.

4799 * More informative error messages for Isar proof commands involving

4800 lazy enumerations (method applications etc.).

4802 * Refined 'help' command to retrieve outer syntax commands according

4803 to name patterns (with clickable results).

4806 *** Prover IDE -- Isabelle/Scala/jEdit ***

4808 * Parallel terminal proofs ('by') are enabled by default, likewise

4809 proofs that are built into packages like 'datatype', 'function'. This

4810 allows to "run ahead" checking the theory specifications on the

4811 surface, while the prover is still crunching on internal

4812 justifications. Unfinished / cancelled proofs are restarted as

4813 required to complete full proof checking eventually.

4815 * Improved output panel with tooltips, hyperlinks etc. based on the

4816 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of

4817 tooltips leads to some window that supports the same recursively,

4818 which can lead to stacks of tooltips as the semantic document content

4819 is explored. ESCAPE closes the whole stack, individual windows may be

4820 closed separately, or detached to become independent jEdit dockables.

4822 * Improved support for commands that produce graph output: the text

4823 message contains a clickable area to open a new instance of the graph

4824 browser on demand.

4826 * More robust incremental parsing of outer syntax (partial comments,

4827 malformed symbols). Changing the balance of open/close quotes and

4828 comment delimiters works more conveniently with unfinished situations

4829 that frequently occur in user interaction.

4831 * More efficient painting and improved reactivity when editing large

4832 files. More scalable management of formal document content.

4834 * Smarter handling of tracing messages: prover process pauses after

4835 certain number of messages per command transaction, with some user

4836 dialog to stop or continue. This avoids swamping the front-end with

4837 potentially infinite message streams.

4839 * More plugin options and preferences, based on Isabelle/Scala. The

4840 jEdit plugin option panel provides access to some Isabelle/Scala

4841 options, including tuning parameters for editor reactivity and color

4842 schemes.

4844 * Dockable window "Symbols" provides some editing support for Isabelle

4845 symbols.

4847 * Dockable window "Monitor" shows ML runtime statistics. Note that

4848 continuous display of the chart slows down the system.

4850 * Improved editing support for control styles: subscript, superscript,

4851 bold, reset of style -- operating on single symbols or text

4852 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.

4854 * Actions isabelle.increase-font-size and isabelle.decrease-font-size

4855 adjust the main text area font size, and its derivatives for output,

4856 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often

4857 need to be adapted to local keyboard layouts.

4859 * More reactive completion popup by default: use \t (TAB) instead of

4860 \n (NEWLINE) to minimize intrusion into regular flow of editing. See

4861 also "Plugin Options / SideKick / General / Code Completion Options".

4863 * Implicit check and build dialog of the specified logic session

4864 image. For example, HOL, HOLCF, HOL-Nominal can be produced on

4865 demand, without bundling big platform-dependent heap images in the

4866 Isabelle distribution.

4868 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates

4869 from Oracle provide better multi-platform experience. This version is

4870 now bundled exclusively with Isabelle.

4873 *** Pure ***

4875 * Code generation for Haskell: restrict unqualified imports from

4876 Haskell Prelude to a small set of fundamental operations.

4878 * Command 'export_code': relative file names are interpreted

4879 relatively to master directory of current theory rather than the

4880 rather arbitrary current working directory. INCOMPATIBILITY.

4882 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,

4883 use regular rule composition via "OF" / "THEN", or explicit proof

4884 structure instead. Note that Isabelle/ML provides a variety of

4885 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied

4886 with some care where this is really required.

4888 * Command 'typ' supports an additional variant with explicit sort

4889 constraint, to infer and check the most general type conforming to a

4890 given sort. Example (in HOL):

4892 typ "_ * _ * bool * unit" :: finite

4894 * Command 'locale_deps' visualizes all locales and their relations as

4895 a Hasse diagram.

4898 *** HOL ***

4900 * Sledgehammer:

4902 - Added MaSh relevance filter based on machine-learning; see the

4903 Sledgehammer manual for details.

4904 - Polished Isar proofs generated with "isar_proofs" option.

4905 - Rationalized type encodings ("type_enc" option).

4906 - Renamed "kill_provers" subcommand to "kill_all".

4907 - Renamed options:

4908 isar_proof ~> isar_proofs

4909 isar_shrink_factor ~> isar_shrink

4910 max_relevant ~> max_facts

4911 relevance_thresholds ~> fact_thresholds

4913 * Quickcheck: added an optimisation for equality premises. It is

4914 switched on by default, and can be switched off by setting the

4915 configuration quickcheck_optimise_equality to false.

4917 * Quotient: only one quotient can be defined by quotient_type

4918 INCOMPATIBILITY.

4920 * Lifting:

4921 - generation of an abstraction function equation in lift_definition

4922 - quot_del attribute

4923 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)

4925 * Simproc "finite_Collect" rewrites set comprehensions into pointfree

4926 expressions.

4928 * Preprocessing of the code generator rewrites set comprehensions into

4929 pointfree expressions.

4931 * The SMT solver Z3 has now by default a restricted set of directly

4932 supported features. For the full set of features (div/mod, nonlinear

4933 arithmetic, datatypes/records) with potential proof reconstruction

4934 failures, enable the configuration option "z3_with_extensions". Minor

4935 INCOMPATIBILITY.

4937 * Simplified 'typedef' specifications: historical options for implicit

4938 set definition and alternative name have been discontinued. The

4939 former behavior of "typedef (open) t = A" is now the default, but

4940 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories

4941 accordingly.

4943 * Removed constant "chars"; prefer "Enum.enum" on type "char"

4944 directly. INCOMPATIBILITY.

4946 * Moved operation product, sublists and n_lists from theory Enum to

4947 List. INCOMPATIBILITY.

4949 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.

4951 * Class "comm_monoid_diff" formalises properties of bounded

4952 subtraction, with natural numbers and multisets as typical instances.

4954 * Added combinator "Option.these" with type "'a option set => 'a set".

4956 * Theory "Transitive_Closure": renamed lemmas

4958 reflcl_tranclp -> reflclp_tranclp

4959 rtranclp_reflcl -> rtranclp_reflclp

4961 INCOMPATIBILITY.

4963 * Theory "Rings": renamed lemmas (in class semiring)

4965 left_distrib ~> distrib_right

4966 right_distrib ~> distrib_left

4968 INCOMPATIBILITY.

4970 * Generalized the definition of limits:

4972 - Introduced the predicate filterlim (LIM x F. f x :> G) which

4973 expresses that when the input values x converge to F then the

4974 output f x converges to G.

4976 - Added filters for convergence to positive (at_top) and negative

4977 infinity (at_bot).

4979 - Moved infinity in the norm (at_infinity) from

4980 Multivariate_Analysis to Complex_Main.

4982 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>

4983 at_top".

4985 INCOMPATIBILITY.

4987 * Theory "Library/Option_ord" provides instantiation of option type to

4988 lattice type classes.

4990 * Theory "Library/Multiset": renamed

4992 constant fold_mset ~> Multiset.fold

4993 fact fold_mset_commute ~> fold_mset_comm

4995 INCOMPATIBILITY.

4997 * Renamed theory Library/List_Prefix to Library/Sublist, with related

4998 changes as follows.

5000 - Renamed constants (and related lemmas)

5002 prefix ~> prefixeq

5003 strict_prefix ~> prefix

5005 - Replaced constant "postfix" by "suffixeq" with swapped argument

5006 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped

5007 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.

5008 Renamed lemmas accordingly.

5010 - Added constant "list_hembeq" for homeomorphic embedding on

5011 lists. Added abbreviation "sublisteq" for special case

5012 "list_hembeq (op =)".

5014 - Theory Library/Sublist no longer provides "order" and "bot" type

5015 class instances for the prefix order (merely corresponding locale

5016 interpretations). The type class instances are now in theory

5017 Library/Prefix_Order.

5019 - The sublist relation of theory Library/Sublist_Order is now based

5020 on "Sublist.sublisteq". Renamed lemmas accordingly:

5022 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff

5023 le_list_append_mono ~> Sublist.list_hembeq_append_mono

5024 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2

5025 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD

5026 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'

5027 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq

5028 le_list_drop_Cons ~> Sublist.sublisteq_Cons'

5029 le_list_drop_many ~> Sublist.sublisteq_drop_many

5030 le_list_filter_left ~> Sublist.sublisteq_filter_left

5031 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many

5032 le_list_rev_take_iff ~> Sublist.sublisteq_append

5033 le_list_same_length ~> Sublist.sublisteq_same_length

5034 le_list_take_many_iff ~> Sublist.sublisteq_append'

5035 less_eq_list.drop ~> less_eq_list_drop

5036 less_eq_list.induct ~> less_eq_list_induct

5037 not_le_list_length ~> Sublist.not_sublisteq_length

5039 INCOMPATIBILITY.

5041 * New theory Library/Countable_Set.

5043 * Theory Library/Debug and Library/Parallel provide debugging and

5044 parallel execution for code generated towards Isabelle/ML.

5046 * Theory Library/FuncSet: Extended support for Pi and extensional and

5047 introduce the extensional dependent function space "PiE". Replaced

5048 extensional_funcset by an abbreviation, and renamed lemmas from

5049 extensional_funcset to PiE as follows:

5051 extensional_empty ~> PiE_empty

5052 extensional_funcset_empty_domain ~> PiE_empty_domain

5053 extensional_funcset_empty_range ~> PiE_empty_range

5054 extensional_funcset_arb ~> PiE_arb

5055 extensional_funcset_mem ~> PiE_mem

5056 extensional_funcset_extend_domainI ~> PiE_fun_upd

5057 extensional_funcset_restrict_domain ~> fun_upd_in_PiE

5058 extensional_funcset_extend_domain_eq ~> PiE_insert_eq

5059 card_extensional_funcset ~> card_PiE

5060 finite_extensional_funcset ~> finite_PiE

5062 INCOMPATIBILITY.

5064 * Theory Library/FinFun: theory of almost everywhere constant

5065 functions (supersedes the AFP entry "Code Generation for Functions as

5066 Data").

5068 * Theory Library/Phantom: generic phantom type to make a type

5069 parameter appear in a constant's type. This alternative to adding

5070 TYPE('a) as another parameter avoids unnecessary closures in generated

5071 code.

5073 * Theory Library/RBT_Impl: efficient construction of red-black trees

5074 from sorted associative lists. Merging two trees with rbt_union may

5075 return a structurally different tree than before. Potential

5076 INCOMPATIBILITY.

5078 * Theory Library/IArray: immutable arrays with code generation.

5080 * Theory Library/Finite_Lattice: theory of finite lattices.

5082 * HOL/Multivariate_Analysis: replaced

5084 "basis :: 'a::euclidean_space => nat => real"

5085 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"

5087 on euclidean spaces by using the inner product "_ \<bullet> _" with

5088 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by

5089 "SUM i : Basis. f i * r i".

5091 With this change the following constants are also changed or removed:

5093 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)

5094 a $$ i ~> inner a i (where i : Basis)

5095 cart_base i removed

5096 \<pi>, \<pi>' removed

5098 Theorems about these constants where removed.

5100 Renamed lemmas:

5102 component_le_norm ~> Basis_le_norm

5103 euclidean_eq ~> euclidean_eq_iff

5104 differential_zero_maxmin_component ~> differential_zero_maxmin_cart

5105 euclidean_simps ~> inner_simps

5106 independent_basis ~> independent_Basis

5107 span_basis ~> span_Basis

5108 in_span_basis ~> in_span_Basis

5109 norm_bound_component_le ~> norm_boound_Basis_le

5110 norm_bound_component_lt ~> norm_boound_Basis_lt

5111 component_le_infnorm ~> Basis_le_infnorm

5113 INCOMPATIBILITY.

5115 * HOL/Probability:

5117 - Added simproc "measurable" to automatically prove measurability.

5119 - Added induction rules for sigma sets with disjoint union

5120 (sigma_sets_induct_disjoint) and for Borel-measurable functions

5121 (borel_measurable_induct).

5123 - Added the Daniell-Kolmogorov theorem (the existence the limit of a

5124 projective family).

5126 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the

5127 AFP entry "Ordinals_and_Cardinals").

5129 * HOL/BNF: New (co)datatype package based on bounded natural functors

5130 with support for mixed, nested recursion and interesting non-free

5131 datatypes.

5133 * HOL/Finite_Set and Relation: added new set and relation operations

5134 expressed by Finite_Set.fold.

5136 * New theory HOL/Library/RBT_Set: implementation of sets by red-black

5137 trees for the code generator.

5139 * HOL/Library/RBT and HOL/Library/Mapping have been converted to

5140 Lifting/Transfer.

5141 possible INCOMPATIBILITY.

5143 * HOL/Set: renamed Set.project -> Set.filter

5144 INCOMPATIBILITY.

5147 *** Document preparation ***

5149 * Dropped legacy antiquotations "term_style" and "thm_style", since

5150 styles may be given as arguments to "term" and "thm" already.

5151 Discontinued legacy styles "prem1" .. "prem19".

5153 * Default LaTeX rendering for \<euro> is now based on eurosym package,

5154 instead of slightly exotic babel/greek.

5156 * Document variant NAME may use different LaTeX entry point

5157 document/root_NAME.tex if that file exists, instead of the common

5158 document/root.tex.

5160 * Simplified custom document/build script, instead of old-style

5161 document/IsaMakefile. Minor INCOMPATIBILITY.

5164 *** ML ***

5166 * The default limit for maximum number of worker threads is now 8,

5167 instead of 4, in correspondence to capabilities of contemporary

5168 hardware and Poly/ML runtime system.

5170 * Type Seq.results and related operations support embedded error

5171 messages within lazy enumerations, and thus allow to provide

5172 informative errors in the absence of any usable results.

5174 * Renamed Position.str_of to Position.here to emphasize that this is a

5175 formal device to inline positions into message text, but not

5176 necessarily printing visible text.

5179 *** System ***

5181 * Advanced support for Isabelle sessions and build management, see

5182 "system" manual for the chapter of that name, especially the "isabelle

5183 build" tool and its examples. The "isabelle mkroot" tool prepares

5184 session root directories for use with "isabelle build", similar to

5185 former "isabelle mkdir" for "isabelle usedir". Note that this affects

5186 document preparation as well. INCOMPATIBILITY, isabelle usedir /

5187 mkdir / make are rendered obsolete.

5189 * Discontinued obsolete Isabelle/build script, it is superseded by the

5190 regular isabelle build tool. For example:

5192 isabelle build -s -b HOL

5194 * Discontinued obsolete "isabelle makeall".

5196 * Discontinued obsolete IsaMakefile and ROOT.ML files from the

5197 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that

5198 provides some traditional targets that invoke "isabelle build". Note

5199 that this is inefficient! Applications of Isabelle/HOL involving

5200 "isabelle make" should be upgraded to use "isabelle build" directly.

5202 * The "isabelle options" tool prints Isabelle system options, as

5203 required for "isabelle build", for example.

5205 * The "isabelle logo" tool produces EPS and PDF format simultaneously.

5206 Minor INCOMPATIBILITY in command-line options.

5208 * The "isabelle install" tool has now a simpler command-line. Minor

5209 INCOMPATIBILITY.

5211 * The "isabelle components" tool helps to resolve add-on components

5212 that are not bundled, or referenced from a bare-bones repository

5213 version of Isabelle.

5215 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general

5216 platform family: "linux", "macos", "windows".

5218 * The ML system is configured as regular component, and no longer

5219 picked up from some surrounding directory. Potential INCOMPATIBILITY

5220 for home-made settings.

5222 * Improved ML runtime statistics (heap, threads, future tasks etc.).

5224 * Discontinued support for Poly/ML 5.2.1, which was the last version

5225 without exception positions and advanced ML compiler/toplevel

5226 configuration.

5228 * Discontinued special treatment of Proof General -- no longer guess

5229 PROOFGENERAL_HOME based on accidental file-system layout. Minor

5230 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS

5231 settings manually, or use a Proof General version that has been

5232 bundled as Isabelle component.

5236 New in Isabelle2012 (May 2012)

5237 ------------------------------

5239 *** General ***

5241 * Prover IDE (PIDE) improvements:

5243 - more robust Sledgehammer integration (as before the sledgehammer

5244 command-line needs to be typed into the source buffer)

5245 - markup for bound variables

5246 - markup for types of term variables (displayed as tooltips)

5247 - support for user-defined Isar commands within the running session

5248 - improved support for Unicode outside original 16bit range

5249 e.g. glyph for \<A> (thanks to jEdit 4.5.1)

5251 * Forward declaration of outer syntax keywords within the theory

5252 header -- minor INCOMPATIBILITY for user-defined commands. Allow new

5253 commands to be used in the same theory where defined.

5255 * Auxiliary contexts indicate block structure for specifications with

5256 additional parameters and assumptions. Such unnamed contexts may be

5257 nested within other targets, like 'theory', 'locale', 'class',

5258 'instantiation' etc. Results from the local context are generalized

5259 accordingly and applied to the enclosing target context. Example:

5261 context

5262 fixes x y z :: 'a

5263 assumes xy: "x = y" and yz: "y = z"

5264 begin

5266 lemma my_trans: "x = z" using xy yz by simp

5268 end

5270 thm my_trans

5272 The most basic application is to factor-out context elements of

5273 several fixes/assumes/shows theorem statements, e.g. see

5274 ~~/src/HOL/Isar_Examples/Group_Context.thy

5276 Any other local theory specification element works within the "context

5277 ... begin ... end" block as well.

5279 * Bundled declarations associate attributed fact expressions with a

5280 given name in the context. These may be later included in other

5281 contexts. This allows to manage context extensions casually, without

5282 the logical dependencies of locales and locale interpretation. See

5283 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.

5285 * Commands 'lemmas' and 'theorems' allow local variables using 'for'

5286 declaration, and results are standardized before being stored. Thus

5287 old-style "standard" after instantiation or composition of facts

5288 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of

5289 indices of schematic variables.

5291 * Rule attributes in local theory declarations (e.g. locale or class)

5292 are now statically evaluated: the resulting theorem is stored instead

5293 of the original expression. INCOMPATIBILITY in rare situations, where

5294 the historic accident of dynamic re-evaluation in interpretations

5295 etc. was exploited.

5297 * New tutorial "Programming and Proving in Isabelle/HOL"

5298 ("prog-prove"). It completely supersedes "A Tutorial Introduction to

5299 Structured Isar Proofs" ("isar-overview"), which has been removed. It

5300 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order

5301 Logic" as the recommended beginners tutorial, but does not cover all

5302 of the material of that old tutorial.

5304 * Updated and extended reference manuals: "isar-ref",

5305 "implementation", "system"; reduced remaining material in old "ref"

5306 manual.

5309 *** Pure ***

5311 * Command 'definition' no longer exports the foundational "raw_def"

5312 into the user context. Minor INCOMPATIBILITY, may use the regular

5313 "def" result with attribute "abs_def" to imitate the old version.

5315 * Attribute "abs_def" turns an equation of the form "f x y == t" into

5316 "f == %x y. t", which ensures that "simp" or "unfold" steps always

5317 expand it. This also works for object-logic equality. (Formerly

5318 undocumented feature.)

5320 * Sort constraints are now propagated in simultaneous statements, just

5321 like type constraints. INCOMPATIBILITY in rare situations, where

5322 distinct sorts used to be assigned accidentally. For example:

5324 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"

5326 lemma "P (x::'a)" and "Q (y::'a::bar)"

5327 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"

5329 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more

5330 tolerant against multiple unifiers, as long as the final result is

5331 unique. (As before, rules are composed in canonical right-to-left

5332 order to accommodate newly introduced premises.)

5334 * Renamed some inner syntax categories:

5336 num ~> num_token

5337 xnum ~> xnum_token

5338 xstr ~> str_token

5340 Minor INCOMPATIBILITY. Note that in practice "num_const" or

5341 "num_position" etc. are mainly used instead (which also include

5342 position information via constraints).

5344 * Simplified configuration options for syntax ambiguity: see

5345 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref

5346 manual. Minor INCOMPATIBILITY.

5348 * Discontinued configuration option "syntax_positions": atomic terms

5349 in parse trees are always annotated by position constraints.

5351 * Old code generator for SML and its commands 'code_module',

5352 'code_library', 'consts_code', 'types_code' have been discontinued.

5353 Use commands of the generic code generator instead. INCOMPATIBILITY.

5355 * Redundant attribute "code_inline" has been discontinued. Use

5356 "code_unfold" instead. INCOMPATIBILITY.

5358 * Dropped attribute "code_unfold_post" in favor of the its dual

5359 "code_abbrev", which yields a common pattern in definitions like

5361 definition [code_abbrev]: "f = t"

5363 INCOMPATIBILITY.

5365 * Obsolete 'types' command has been discontinued. Use 'type_synonym'

5366 instead. INCOMPATIBILITY.

5368 * Discontinued old "prems" fact, which used to refer to the accidental

5369 collection of foundational premises in the context (already marked as

5370 legacy since Isabelle2011).

5373 *** HOL ***

5375 * Type 'a set is now a proper type constructor (just as before

5376 Isabelle2008). Definitions mem_def and Collect_def have disappeared.

5377 Non-trivial INCOMPATIBILITY. For developments keeping predicates and

5378 sets separate, it is often sufficient to rephrase some set S that has

5379 been accidentally used as predicates by "%x. x : S", and some

5380 predicate P that has been accidentally used as set by "{x. P x}".

5381 Corresponding proofs in a first step should be pruned from any

5382 tinkering with former theorems mem_def and Collect_def as far as

5383 possible.

5385 For developments which deliberately mix predicates and sets, a

5386 planning step is necessary to determine what should become a predicate

5387 and what a set. It can be helpful to carry out that step in

5388 Isabelle2011-1 before jumping right into the current release.

5390 * Code generation by default implements sets as container type rather

5391 than predicates. INCOMPATIBILITY.

5393 * New type synonym 'a rel = ('a * 'a) set

5395 * The representation of numerals has changed. Datatype "num"

5396 represents strictly positive binary numerals, along with functions

5397 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent

5398 positive and negated numeric literals, respectively. See also

5399 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some

5400 user theories may require adaptations as follows:

5402 - Theorems with number_ring or number_semiring constraints: These

5403 classes are gone; use comm_ring_1 or comm_semiring_1 instead.

5405 - Theories defining numeric types: Remove number, number_semiring,

5406 and number_ring instances. Defer all theorems about numerals until

5407 after classes one and semigroup_add have been instantiated.

5409 - Numeral-only simp rules: Replace each rule having a "number_of v"

5410 pattern with two copies, one for numeral and one for neg_numeral.

5412 - Theorems about subclasses of semiring_1 or ring_1: These classes

5413 automatically support numerals now, so more simp rules and

5414 simprocs may now apply within the proof.

5416 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:

5417 Redefine using other integer operations.

5419 * Transfer: New package intended to generalize the existing

5420 "descending" method and related theorem attributes from the Quotient

5421 package. (Not all functionality is implemented yet, but future

5422 development will focus on Transfer as an eventual replacement for the

5423 corresponding parts of the Quotient package.)

5425 - transfer_rule attribute: Maintains a collection of transfer rules,

5426 which relate constants at two different types. Transfer rules may

5427 relate different type instances of the same polymorphic constant,

5428 or they may relate an operation on a raw type to a corresponding

5429 operation on an abstract type (quotient or subtype). For example:

5431 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map

5432 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int

5434 - transfer method: Replaces a subgoal on abstract types with an

5435 equivalent subgoal on the corresponding raw types. Constants are

5436 replaced with corresponding ones according to the transfer rules.

5437 Goals are generalized over all free variables by default; this is

5438 necessary for variables whose types change, but can be overridden

5439 for specific variables with e.g. "transfer fixing: x y z". The

5440 variant transfer' method allows replacing a subgoal with one that

5441 is logically stronger (rather than equivalent).

5443 - relator_eq attribute: Collects identity laws for relators of

5444 various type constructors, e.g. "list_all2 (op =) = (op =)". The

5445 transfer method uses these lemmas to infer transfer rules for

5446 non-polymorphic constants on the fly.

5448 - transfer_prover method: Assists with proving a transfer rule for a

5449 new constant, provided the constant is defined in terms of other

5450 constants that already have transfer rules. It should be applied

5451 after unfolding the constant definitions.

5453 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer

5454 from type nat to type int.

5456 * Lifting: New package intended to generalize the quotient_definition

5457 facility of the Quotient package; designed to work with Transfer.

5459 - lift_definition command: Defines operations on an abstract type in

5460 terms of a corresponding operation on a representation

5461 type. Example syntax:

5463 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"

5464 is List.insert

5466 Users must discharge a respectfulness proof obligation when each

5467 constant is defined. (For a type copy, i.e. a typedef with UNIV,

5468 the proof is discharged automatically.) The obligation is

5469 presented in a user-friendly, readable form; a respectfulness

5470 theorem in the standard format and a transfer rule are generated

5471 by the package.

5473 - Integration with code_abstype: For typedefs (e.g. subtypes

5474 corresponding to a datatype invariant, such as dlist),

5475 lift_definition generates a code certificate theorem and sets up

5476 code generation for each constant.

5478 - setup_lifting command: Sets up the Lifting package to work with a

5479 user-defined type. The user must provide either a quotient theorem

5480 or a type_definition theorem. The package configures transfer

5481 rules for equality and quantifiers on the type, and sets up the

5482 lift_definition command to work with the type.

5484 - Usage examples: See Quotient_Examples/Lift_DList.thy,

5485 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,

5486 Word/Word.thy and Library/Float.thy.

5488 * Quotient package:

5490 - The 'quotient_type' command now supports a 'morphisms' option with

5491 rep and abs functions, similar to typedef.

5493 - 'quotient_type' sets up new types to work with the Lifting and

5494 Transfer packages, as with 'setup_lifting'.

5496 - The 'quotient_definition' command now requires the user to prove a

5497 respectfulness property at the point where the constant is

5498 defined, similar to lift_definition; INCOMPATIBILITY.

5500 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems

5501 accordingly, INCOMPATIBILITY.

5503 * New diagnostic command 'find_unused_assms' to find potentially

5504 superfluous assumptions in theorems using Quickcheck.

5506 * Quickcheck:

5508 - Quickcheck returns variable assignments as counterexamples, which

5509 allows to reveal the underspecification of functions under test.

5510 For example, refuting "hd xs = x", it presents the variable

5511 assignment xs = [] and x = a1 as a counterexample, assuming that

5512 any property is false whenever "hd []" occurs in it.

5514 These counterexample are marked as potentially spurious, as

5515 Quickcheck also returns "xs = []" as a counterexample to the

5516 obvious theorem "hd xs = hd xs".

5518 After finding a potentially spurious counterexample, Quickcheck

5519 continues searching for genuine ones.

5521 By default, Quickcheck shows potentially spurious and genuine

5522 counterexamples. The option "genuine_only" sets quickcheck to only

5523 show genuine counterexamples.

5525 - The command 'quickcheck_generator' creates random and exhaustive

5526 value generators for a given type and operations.

5528 It generates values by using the operations as if they were

5529 constructors of that type.

5531 - Support for multisets.

5533 - Added "use_subtype" options.

5535 - Added "quickcheck_locale" configuration to specify how to process

5536 conjectures in a locale context.

5538 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option

5539 and affecting 'rat' and 'real'.

5541 * Sledgehammer:

5542 - Integrated more tightly with SPASS, as described in the ITP 2012

5543 paper "More SPASS with Isabelle".

5544 - Made it try "smt" as a fallback if "metis" fails or times out.

5545 - Added support for the following provers: Alt-Ergo (via Why3 and

5546 TFF1), iProver, iProver-Eq.

5547 - Sped up the minimizer.

5548 - Added "lam_trans", "uncurry_aliases", and "minimize" options.

5549 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").

5550 - Renamed "sound" option to "strict".

5552 * Metis: Added possibility to specify lambda translations scheme as a

5553 parenthesized argument (e.g., "by (metis (lifting) ...)").

5555 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".

5557 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.

5559 * New "case_product" attribute to generate a case rule doing multiple

5560 case distinctions at the same time. E.g.

5562 list.exhaust [case_product nat.exhaust]

5564 produces a rule which can be used to perform case distinction on both

5565 a list and a nat.

5567 * New "eventually_elim" method as a generalized variant of the

5568 eventually_elim* rules. Supports structured proofs.

5570 * Typedef with implicit set definition is considered legacy. Use

5571 "typedef (open)" form instead, which will eventually become the

5572 default.

5574 * Record: code generation can be switched off manually with

5576 declare [[record_coden = false]] -- "default true"

5578 * Datatype: type parameters allow explicit sort constraints.

5580 * Concrete syntax for case expressions includes constraints for source

5581 positions, and thus produces Prover IDE markup for its bindings.

5582 INCOMPATIBILITY for old-style syntax translations that augment the

5583 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of

5584 one_case.

5586 * Clarified attribute "mono_set": pure declaration without modifying

5587 the result of the fact expression.

5589 * More default pred/set conversions on a couple of relation operations

5590 and predicates. Added powers of predicate relations. Consolidation

5591 of some relation theorems:

5593 converse_def ~> converse_unfold

5594 rel_comp_def ~> relcomp_unfold

5595 symp_def ~> (modified, use symp_def and sym_def instead)

5596 transp_def ~> transp_trans

5597 Domain_def ~> Domain_unfold

5598 Range_def ~> Domain_converse [symmetric]

5600 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.

5602 See theory "Relation" for examples for making use of pred/set

5603 conversions by means of attributes "to_set" and "to_pred".

5605 INCOMPATIBILITY.

5607 * Renamed facts about the power operation on relations, i.e., relpow

5608 to match the constant's name:

5610 rel_pow_1 ~> relpow_1

5611 rel_pow_0_I ~> relpow_0_I

5612 rel_pow_Suc_I ~> relpow_Suc_I

5613 rel_pow_Suc_I2 ~> relpow_Suc_I2

5614 rel_pow_0_E ~> relpow_0_E

5615 rel_pow_Suc_E ~> relpow_Suc_E

5616 rel_pow_E ~> relpow_E

5617 rel_pow_Suc_D2 ~> relpow_Suc_D2

5618 rel_pow_Suc_E2 ~> relpow_Suc_E2

5619 rel_pow_Suc_D2' ~> relpow_Suc_D2'

5620 rel_pow_E2 ~> relpow_E2

5621 rel_pow_add ~> relpow_add

5622 rel_pow_commute ~> relpow

5623 rel_pow_empty ~> relpow_empty:

5624 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow

5625 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl

5626 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow

5627 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow

5628 rel_pow_fun_conv ~> relpow_fun_conv

5629 rel_pow_finite_bounded1 ~> relpow_finite_bounded1

5630 rel_pow_finite_bounded ~> relpow_finite_bounded

5631 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow

5632 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow

5633 single_valued_rel_pow ~> single_valued_relpow

5635 INCOMPATIBILITY.

5637 * Theory Relation: Consolidated constant name for relation composition

5638 and corresponding theorem names:

5640 - Renamed constant rel_comp to relcomp.

5642 - Dropped abbreviation pred_comp. Use relcompp instead.

5644 - Renamed theorems:

5646 rel_compI ~> relcompI

5647 rel_compEpair ~> relcompEpair

5648 rel_compE ~> relcompE

5649 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq

5650 rel_comp_empty1 ~> relcomp_empty1

5651 rel_comp_mono ~> relcomp_mono

5652 rel_comp_subset_Sigma ~> relcomp_subset_Sigma

5653 rel_comp_distrib ~> relcomp_distrib

5654 rel_comp_distrib2 ~> relcomp_distrib2

5655 rel_comp_UNION_distrib ~> relcomp_UNION_distrib

5656 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2

5657 single_valued_rel_comp ~> single_valued_relcomp

5658 rel_comp_def ~> relcomp_unfold

5659 converse_rel_comp ~> converse_relcomp

5660 pred_compI ~> relcomppI

5661 pred_compE ~> relcomppE

5662 pred_comp_bot1 ~> relcompp_bot1

5663 pred_comp_bot2 ~> relcompp_bot2

5664 transp_pred_comp_less_eq ~> transp_relcompp_less_eq

5665 pred_comp_mono ~> relcompp_mono

5666 pred_comp_distrib ~> relcompp_distrib

5667 pred_comp_distrib2 ~> relcompp_distrib2

5668 converse_pred_comp ~> converse_relcompp

5670 finite_rel_comp ~> finite_relcomp

5672 set_rel_comp ~> set_relcomp

5674 INCOMPATIBILITY.

5676 * Theory Divides: Discontinued redundant theorems about div and mod.

5677 INCOMPATIBILITY, use the corresponding generic theorems instead.

5679 DIVISION_BY_ZERO ~> div_by_0, mod_by_0

5680 zdiv_self ~> div_self

5681 zmod_self ~> mod_self

5682 zdiv_zero ~> div_0

5683 zmod_zero ~> mod_0

5684 zdiv_zmod_equality ~> div_mod_equality2

5685 zdiv_zmod_equality2 ~> div_mod_equality

5686 zmod_zdiv_trivial ~> mod_div_trivial

5687 zdiv_zminus_zminus ~> div_minus_minus

5688 zmod_zminus_zminus ~> mod_minus_minus

5689 zdiv_zminus2 ~> div_minus_right

5690 zmod_zminus2 ~> mod_minus_right

5691 zdiv_minus1_right ~> div_minus1_right

5692 zmod_minus1_right ~> mod_minus1_right

5693 zdvd_mult_div_cancel ~> dvd_mult_div_cancel

5694 zmod_zmult1_eq ~> mod_mult_right_eq

5695 zpower_zmod ~> power_mod

5696 zdvd_zmod ~> dvd_mod

5697 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd

5698 mod_mult_distrib ~> mult_mod_left

5699 mod_mult_distrib2 ~> mult_mod_right

5701 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use

5702 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.

5704 * Finite_Set.fold now qualified. INCOMPATIBILITY.

5706 * Consolidated theorem names concerning fold combinators:

5708 inf_INFI_fold_inf ~> inf_INF_fold_inf

5709 sup_SUPR_fold_sup ~> sup_SUP_fold_sup

5710 INFI_fold_inf ~> INF_fold_inf

5711 SUPR_fold_sup ~> SUP_fold_sup

5712 union_set ~> union_set_fold

5713 minus_set ~> minus_set_fold

5714 INFI_set_fold ~> INF_set_fold

5715 SUPR_set_fold ~> SUP_set_fold

5716 INF_code ~> INF_set_foldr

5717 SUP_code ~> SUP_set_foldr

5718 foldr.simps ~> foldr.simps (in point-free formulation)

5719 foldr_fold_rev ~> foldr_conv_fold

5720 foldl_fold ~> foldl_conv_fold

5721 foldr_foldr ~> foldr_conv_foldl

5722 foldl_foldr ~> foldl_conv_foldr

5723 fold_set_remdups ~> fold_set_fold_remdups

5724 fold_set ~> fold_set_fold

5725 fold1_set ~> fold1_set_fold

5727 INCOMPATIBILITY.

5729 * Dropped rarely useful theorems concerning fold combinators:

5730 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,

5731 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,

5732 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,

5733 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,

5734 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,

5735 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.

5736 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"

5737 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be

5738 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by

5739 unfolding "foldr_conv_fold" and "foldl_conv_fold".

5741 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,

5742 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,

5743 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,

5744 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding

5745 lemmas over fold rather than foldr, or make use of lemmas

5746 fold_conv_foldr and fold_rev.

5748 * Congruence rules Option.map_cong and Option.bind_cong for recursion

5749 through option types.

5751 * "Transitive_Closure.ntrancl": bounded transitive closure on

5752 relations.

5754 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.

5756 * Theory Int: Discontinued many legacy theorems specific to type int.

5757 INCOMPATIBILITY, use the corresponding generic theorems instead.

5759 zminus_zminus ~> minus_minus

5760 zminus_0 ~> minus_zero

5761 zminus_zadd_distrib ~> minus_add_distrib

5762 zadd_commute ~> add_commute

5763 zadd_assoc ~> add_assoc

5764 zadd_left_commute ~> add_left_commute

5765 zadd_ac ~> add_ac

5766 zmult_ac ~> mult_ac

5767 zadd_0 ~> add_0_left

5768 zadd_0_right ~> add_0_right

5769 zadd_zminus_inverse2 ~> left_minus

5770 zmult_zminus ~> mult_minus_left

5771 zmult_commute ~> mult_commute

5772 zmult_assoc ~> mult_assoc

5773 zadd_zmult_distrib ~> left_distrib

5774 zadd_zmult_distrib2 ~> right_distrib

5775 zdiff_zmult_distrib ~> left_diff_distrib

5776 zdiff_zmult_distrib2 ~> right_diff_distrib

5777 zmult_1 ~> mult_1_left

5778 zmult_1_right ~> mult_1_right

5779 zle_refl ~> order_refl

5780 zle_trans ~> order_trans

5781 zle_antisym ~> order_antisym

5782 zle_linear ~> linorder_linear

5783 zless_linear ~> linorder_less_linear

5784 zadd_left_mono ~> add_left_mono

5785 zadd_strict_right_mono ~> add_strict_right_mono

5786 zadd_zless_mono ~> add_less_le_mono

5787 int_0_less_1 ~> zero_less_one

5788 int_0_neq_1 ~> zero_neq_one

5789 zless_le ~> less_le

5790 zpower_zadd_distrib ~> power_add

5791 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff

5792 zero_le_zpower_abs ~> zero_le_power_abs

5794 * Theory Deriv: Renamed

5796 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing

5798 * Theory Library/Multiset: Improved code generation of multisets.

5800 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets

5801 are expressed via type classes again. The special syntax

5802 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant

5803 setsum_set, which is now subsumed by Big_Operators.setsum.

5804 INCOMPATIBILITY.

5806 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,

5807 use theory HOL/Library/Nat_Bijection instead.

5809 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black

5810 trees is now inside a type class context. Names of affected

5811 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for

5812 theories working directly with raw red-black trees, adapt the names as

5813 follows:

5815 Operations:

5816 bulkload -> rbt_bulkload

5817 del_from_left -> rbt_del_from_left

5818 del_from_right -> rbt_del_from_right

5819 del -> rbt_del

5820 delete -> rbt_delete

5821 ins -> rbt_ins

5822 insert -> rbt_insert

5823 insertw -> rbt_insert_with

5824 insert_with_key -> rbt_insert_with_key

5825 map_entry -> rbt_map_entry

5826 lookup -> rbt_lookup

5827 sorted -> rbt_sorted

5828 tree_greater -> rbt_greater

5829 tree_less -> rbt_less

5830 tree_less_symbol -> rbt_less_symbol

5831 union -> rbt_union

5832 union_with -> rbt_union_with

5833 union_with_key -> rbt_union_with_key

5835 Lemmas:

5836 balance_left_sorted -> balance_left_rbt_sorted

5837 balance_left_tree_greater -> balance_left_rbt_greater

5838 balance_left_tree_less -> balance_left_rbt_less

5839 balance_right_sorted -> balance_right_rbt_sorted

5840 balance_right_tree_greater -> balance_right_rbt_greater

5841 balance_right_tree_less -> balance_right_rbt_less

5842 balance_sorted -> balance_rbt_sorted

5843 balance_tree_greater -> balance_rbt_greater

5844 balance_tree_less -> balance_rbt_less

5845 bulkload_is_rbt -> rbt_bulkload_is_rbt

5846 combine_sorted -> combine_rbt_sorted

5847 combine_tree_greater -> combine_rbt_greater

5848 combine_tree_less -> combine_rbt_less

5849 delete_in_tree -> rbt_delete_in_tree

5850 delete_is_rbt -> rbt_delete_is_rbt

5851 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater

5852 del_from_left_tree_less -> rbt_del_from_left_rbt_less

5853 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater

5854 del_from_right_tree_less -> rbt_del_from_right_rbt_less

5855 del_in_tree -> rbt_del_in_tree

5856 del_inv1_inv2 -> rbt_del_inv1_inv2

5857 del_sorted -> rbt_del_rbt_sorted

5858 del_tree_greater -> rbt_del_rbt_greater

5859 del_tree_less -> rbt_del_rbt_less

5860 dom_lookup_Branch -> dom_rbt_lookup_Branch

5861 entries_lookup -> entries_rbt_lookup

5862 finite_dom_lookup -> finite_dom_rbt_lookup

5863 insert_sorted -> rbt_insert_rbt_sorted

5864 insertw_is_rbt -> rbt_insertw_is_rbt

5865 insertwk_is_rbt -> rbt_insertwk_is_rbt

5866 insertwk_sorted -> rbt_insertwk_rbt_sorted

5867 insertw_sorted -> rbt_insertw_rbt_sorted

5868 ins_sorted -> ins_rbt_sorted

5869 ins_tree_greater -> ins_rbt_greater

5870 ins_tree_less -> ins_rbt_less

5871 is_rbt_sorted -> is_rbt_rbt_sorted

5872 lookup_balance -> rbt_lookup_balance

5873 lookup_bulkload -> rbt_lookup_rbt_bulkload

5874 lookup_delete -> rbt_lookup_rbt_delete

5875 lookup_Empty -> rbt_lookup_Empty

5876 lookup_from_in_tree -> rbt_lookup_from_in_tree

5877 lookup_in_tree -> rbt_lookup_in_tree

5878 lookup_ins -> rbt_lookup_ins

5879 lookup_insert -> rbt_lookup_rbt_insert

5880 lookup_insertw -> rbt_lookup_rbt_insertw

5881 lookup_insertwk -> rbt_lookup_rbt_insertwk

5882 lookup_keys -> rbt_lookup_keys

5883 lookup_map -> rbt_lookup_map

5884 lookup_map_entry -> rbt_lookup_rbt_map_entry

5885 lookup_tree_greater -> rbt_lookup_rbt_greater

5886 lookup_tree_less -> rbt_lookup_rbt_less

5887 lookup_union -> rbt_lookup_rbt_union

5888 map_entry_color_of -> rbt_map_entry_color_of

5889 map_entry_inv1 -> rbt_map_entry_inv1

5890 map_entry_inv2 -> rbt_map_entry_inv2

5891 map_entry_is_rbt -> rbt_map_entry_is_rbt

5892 map_entry_sorted -> rbt_map_entry_rbt_sorted

5893 map_entry_tree_greater -> rbt_map_entry_rbt_greater

5894 map_entry_tree_less -> rbt_map_entry_rbt_less

5895 map_tree_greater -> map_rbt_greater

5896 map_tree_less -> map_rbt_less

5897 map_sorted -> map_rbt_sorted

5898 paint_sorted -> paint_rbt_sorted

5899 paint_lookup -> paint_rbt_lookup

5900 paint_tree_greater -> paint_rbt_greater

5901 paint_tree_less -> paint_rbt_less

5902 sorted_entries -> rbt_sorted_entries

5903 tree_greater_eq_trans -> rbt_greater_eq_trans

5904 tree_greater_nit -> rbt_greater_nit

5905 tree_greater_prop -> rbt_greater_prop

5906 tree_greater_simps -> rbt_greater_simps

5907 tree_greater_trans -> rbt_greater_trans

5908 tree_less_eq_trans -> rbt_less_eq_trans

5909 tree_less_nit -> rbt_less_nit

5910 tree_less_prop -> rbt_less_prop

5911 tree_less_simps -> rbt_less_simps

5912 tree_less_trans -> rbt_less_trans

5913 tree_ord_props -> rbt_ord_props

5914 union_Branch -> rbt_union_Branch

5915 union_is_rbt -> rbt_union_is_rbt

5916 unionw_is_rbt -> rbt_unionw_is_rbt

5917 unionwk_is_rbt -> rbt_unionwk_is_rbt

5918 unionwk_sorted -> rbt_unionwk_rbt_sorted

5920 * Theory HOL/Library/Float: Floating point numbers are now defined as

5921 a subset of the real numbers. All operations are defined using the

5922 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.

5924 Changed Operations:

5925 float_abs -> abs

5926 float_nprt -> nprt

5927 float_pprt -> pprt

5928 pow2 -> use powr

5929 round_down -> float_round_down

5930 round_up -> float_round_up

5931 scale -> exponent

5933 Removed Operations:

5934 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod

5936 Renamed Lemmas:

5937 abs_float_def -> Float.compute_float_abs

5938 bitlen_ge0 -> bitlen_nonneg

5939 bitlen.simps -> Float.compute_bitlen

5940 float_components -> Float_mantissa_exponent

5941 float_divl.simps -> Float.compute_float_divl

5942 float_divr.simps -> Float.compute_float_divr

5943 float_eq_odd -> mult_powr_eq_mult_powr_iff

5944 float_power -> real_of_float_power

5945 lapprox_posrat_def -> Float.compute_lapprox_posrat

5946 lapprox_rat.simps -> Float.compute_lapprox_rat

5947 le_float_def' -> Float.compute_float_le

5948 le_float_def -> less_eq_float.rep_eq

5949 less_float_def' -> Float.compute_float_less

5950 less_float_def -> less_float.rep_eq

5951 normfloat_def -> Float.compute_normfloat

5952 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0

5953 normfloat -> normfloat_def

5954 normfloat_unique -> use normfloat_def

5955 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral

5956 one_float_def -> Float.compute_float_one

5957 plus_float_def -> Float.compute_float_plus

5958 rapprox_posrat_def -> Float.compute_rapprox_posrat

5959 rapprox_rat.simps -> Float.compute_rapprox_rat

5960 real_of_float_0 -> zero_float.rep_eq

5961 real_of_float_1 -> one_float.rep_eq

5962 real_of_float_abs -> abs_float.rep_eq

5963 real_of_float_add -> plus_float.rep_eq

5964 real_of_float_minus -> uminus_float.rep_eq

5965 real_of_float_mult -> times_float.rep_eq

5966 real_of_float_simp -> Float.rep_eq

5967 real_of_float_sub -> minus_float.rep_eq

5968 round_down.simps -> Float.compute_float_round_down

5969 round_up.simps -> Float.compute_float_round_up

5970 times_float_def -> Float.compute_float_times

5971 uminus_float_def -> Float.compute_float_uminus

5972 zero_float_def -> Float.compute_float_zero

5974 Lemmas not necessary anymore, use the transfer method:

5975 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,

5976 float_divr, float_le_simp, float_less1_mantissa_bound,

5977 float_less_simp, float_less_zero, float_le_zero,

5978 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,

5979 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,

5980 lapprox_rat_bottom, normalized_float, rapprox_posrat,

5981 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,

5982 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,

5983 round_up, zero_le_float, zero_less_float

5985 * New theory HOL/Library/DAList provides an abstract type for

5986 association lists with distinct keys.

5988 * Session HOL/IMP: Added new theory of abstract interpretation of

5989 annotated commands.

5991 * Session HOL-Import: Re-implementation from scratch is faster,

5992 simpler, and more scalable. Requires a proof bundle, which is

5993 available as an external component. Discontinued old (and mostly

5994 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.

5996 * Session HOL-Word: Discontinued many redundant theorems specific to

5997 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems

5998 instead.

6000 word_sub_alt ~> word_sub_wi

6001 word_add_alt ~> word_add_def

6002 word_mult_alt ~> word_mult_def

6003 word_minus_alt ~> word_minus_def

6004 word_0_alt ~> word_0_wi

6005 word_1_alt ~> word_1_wi

6006 word_add_0 ~> add_0_left

6007 word_add_0_right ~> add_0_right

6008 word_mult_1 ~> mult_1_left

6009 word_mult_1_right ~> mult_1_right

6010 word_add_commute ~> add_commute

6011 word_add_assoc ~> add_assoc

6012 word_add_left_commute ~> add_left_commute

6013 word_mult_commute ~> mult_commute

6014 word_mult_assoc ~> mult_assoc

6015 word_mult_left_commute ~> mult_left_commute

6016 word_left_distrib ~> left_distrib

6017 word_right_distrib ~> right_distrib

6018 word_left_minus ~> left_minus

6019 word_diff_0_right ~> diff_0_right

6020 word_diff_self ~> diff_self

6021 word_sub_def ~> diff_minus

6022 word_diff_minus ~> diff_minus

6023 word_add_ac ~> add_ac

6024 word_mult_ac ~> mult_ac

6025 word_plus_ac0 ~> add_0_left add_0_right add_ac

6026 word_times_ac1 ~> mult_1_left mult_1_right mult_ac

6027 word_order_trans ~> order_trans

6028 word_order_refl ~> order_refl

6029 word_order_antisym ~> order_antisym

6030 word_order_linear ~> linorder_linear

6031 lenw1_zero_neq_one ~> zero_neq_one

6032 word_number_of_eq ~> number_of_eq

6033 word_of_int_add_hom ~> wi_hom_add

6034 word_of_int_sub_hom ~> wi_hom_sub

6035 word_of_int_mult_hom ~> wi_hom_mult

6036 word_of_int_minus_hom ~> wi_hom_neg

6037 word_of_int_succ_hom ~> wi_hom_succ

6038 word_of_int_pred_hom ~> wi_hom_pred

6039 word_of_int_0_hom ~> word_0_wi

6040 word_of_int_1_hom ~> word_1_wi

6042 * Session HOL-Word: New proof method "word_bitwise" for splitting

6043 machine word equalities and inequalities into logical circuits,

6044 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,

6045 multiplication, shifting by constants, bitwise operators and numeric

6046 constants. Requires fixed-length word types, not 'a word. Solves

6047 many standard word identities outright and converts more into first

6048 order problems amenable to blast or similar. See also examples in

6049 HOL/Word/Examples/WordExamples.thy.

6051 * Session HOL-Probability: Introduced the type "'a measure" to

6052 represent measures, this replaces the records 'a algebra and 'a

6053 measure_space. The locales based on subset_class now have two

6054 locale-parameters the space \<Omega> and the set of measurable sets M.

6055 The product of probability spaces uses now the same constant as the

6056 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)

6057 measure". Most constants are defined now outside of locales and gain

6058 an additional parameter, like null_sets, almost_eventually or \<mu>'.

6059 Measure space constructions for distributions and densities now got

6060 their own constants distr and density. Instead of using locales to

6061 describe measure spaces with a finite space, the measure count_space

6062 and point_measure is introduced. INCOMPATIBILITY.

6064 Renamed constants:

6065 measure -> emeasure

6066 finite_measure.\<mu>' -> measure

6067 product_algebra_generator -> prod_algebra

6068 product_prob_space.emb -> prod_emb

6069 product_prob_space.infprod_algebra -> PiM

6071 Removed locales:

6072 completeable_measure_space

6073 finite_measure_space

6074 finite_prob_space

6075 finite_product_finite_prob_space

6076 finite_product_sigma_algebra

6077 finite_sigma_algebra

6078 measure_space

6079 pair_finite_prob_space

6080 pair_finite_sigma_algebra

6081 pair_finite_space

6082 pair_sigma_algebra

6083 product_sigma_algebra

6085 Removed constants:

6086 conditional_space

6087 distribution -> use distr measure, or distributed predicate

6088 image_space

6089 joint_distribution -> use distr measure, or distributed predicate

6090 pair_measure_generator

6091 product_prob_space.infprod_algebra -> use PiM

6092 subvimage

6094 Replacement theorems:

6095 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite

6096 finite_measure.empty_measure -> measure_empty

6097 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq

6098 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq

6099 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably

6100 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure

6101 finite_measure.finite_measure -> finite_measure.emeasure_finite

6102 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton

6103 finite_measure.positive_measure' -> measure_nonneg

6104 finite_measure.real_measure -> finite_measure.emeasure_real

6105 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb

6106 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite

6107 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty

6108 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed

6109 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple

6110 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple

6111 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple

6112 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple

6113 information_space.entropy_commute -> information_space.entropy_commute_simple

6114 information_space.entropy_eq -> information_space.entropy_simple_distributed

6115 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed

6116 information_space.entropy_positive -> information_space.entropy_nonneg_simple

6117 information_space.entropy_uniform_max -> information_space.entropy_uniform

6118 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq

6119 information_space.KL_eq_0 -> information_space.KL_same_eq_0

6120 information_space.KL_ge_0 -> information_space.KL_nonneg

6121 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed

6122 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple

6123 Int_stable_cuboids -> Int_stable_atLeastAtMost

6124 Int_stable_product_algebra_generator -> positive_integral

6125 measure_preserving -> equality "distr M N f = N" "f : measurable M N"

6126 measure_space.additive -> emeasure_additive

6127 measure_space.AE_iff_null_set -> AE_iff_null

6128 measure_space.almost_everywhere_def -> eventually_ae_filter

6129 measure_space.almost_everywhere_vimage -> AE_distrD

6130 measure_space.continuity_from_above -> INF_emeasure_decseq

6131 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq

6132 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq

6133 measure_space.continuity_from_below -> SUP_emeasure_incseq

6134 measure_space_density -> emeasure_density

6135 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density

6136 measure_space.integrable_vimage -> integrable_distr

6137 measure_space.integral_translated_density -> integral_density

6138 measure_space.integral_vimage -> integral_distr

6139 measure_space.measure_additive -> plus_emeasure

6140 measure_space.measure_compl -> emeasure_compl

6141 measure_space.measure_countable_increasing -> emeasure_countable_increasing

6142 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably

6143 measure_space.measure_decseq -> decseq_emeasure

6144 measure_space.measure_Diff -> emeasure_Diff

6145 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set

6146 measure_space.measure_eq_0 -> emeasure_eq_0

6147 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite

6148 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton

6149 measure_space.measure_incseq -> incseq_emeasure

6150 measure_space.measure_insert -> emeasure_insert

6151 measure_space.measure_mono -> emeasure_mono

6152 measure_space.measure_not_negative -> emeasure_not_MInf

6153 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq

6154 measure_space.measure_setsum -> setsum_emeasure

6155 measure_space.measure_setsum_split -> setsum_emeasure_cover

6156 measure_space.measure_space_vimage -> emeasure_distr

6157 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite

6158 measure_space.measure_subadditive -> subadditive

6159 measure_space.measure_top -> emeasure_space

6160 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0

6161 measure_space.measure_Un_null_set -> emeasure_Un_null_set

6162 measure_space.positive_integral_translated_density -> positive_integral_density

6163 measure_space.positive_integral_vimage -> positive_integral_distr

6164 measure_space.real_continuity_from_above -> Lim_measure_decseq

6165 measure_space.real_continuity_from_below -> Lim_measure_incseq

6166 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably

6167 measure_space.real_measure_Diff -> measure_Diff

6168 measure_space.real_measure_finite_Union -> measure_finite_Union

6169 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton

6170 measure_space.real_measure_subadditive -> measure_subadditive

6171 measure_space.real_measure_Union -> measure_Union

6172 measure_space.real_measure_UNION -> measure_UNION

6173 measure_space.simple_function_vimage -> simple_function_comp

6174 measure_space.simple_integral_vimage -> simple_integral_distr

6175 measure_space.simple_integral_vimage -> simple_integral_distr

6176 measure_unique_Int_stable -> measure_eqI_generator_eq

6177 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq

6178 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1

6179 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2

6180 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1

6181 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2

6182 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff

6183 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap

6184 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'

6185 pair_sigma_algebra.sets_swap -> sets_pair_swap

6186 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1

6187 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2

6188 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap

6189 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2

6190 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt

6191 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times

6192 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM

6193 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq

6194 prob_space.measure_space_1 -> prob_space.emeasure_space_1

6195 prob_space.prob_space_vimage -> prob_space_distr

6196 prob_space.random_variable_restrict -> measurable_restrict

6197 prob_space_unique_Int_stable -> measure_eqI_prob_space

6198 product_algebraE -> prod_algebraE_all

6199 product_algebra_generator_der -> prod_algebra_eq_finite

6200 product_algebra_generator_into_space -> prod_algebra_sets_into_space

6201 product_algebraI -> sets_PiM_I_finite

6202 product_measure_exists -> product_sigma_finite.sigma_finite

6203 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator

6204 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb

6205 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty

6206 product_prob_space.measurable_component -> measurable_component_singleton

6207 product_prob_space.measurable_emb -> measurable_prod_emb

6208 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single

6209 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton

6210 product_prob_space.measure_emb -> emeasure_prod_emb

6211 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict

6212 product_sigma_algebra.product_algebra_into_space -> space_closed

6213 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge

6214 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton

6215 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge

6216 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable

6217 sets_product_algebra -> sets_PiM

6218 sigma_algebra.measurable_sigma -> measurable_measure_of

6219 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint

6220 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr

6221 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq

6222 space_product_algebra -> space_PiM

6224 * Session HOL-TPTP: support to parse and import TPTP problems (all

6225 languages) into Isabelle/HOL.

6228 *** FOL ***

6230 * New "case_product" attribute (see HOL).

6233 *** ZF ***

6235 * Greater support for structured proofs involving induction or case

6236 analysis.

6238 * Much greater use of mathematical symbols.

6240 * Removal of many ML theorem bindings. INCOMPATIBILITY.

6243 *** ML ***

6245 * Antiquotation @{keyword "name"} produces a parser for outer syntax

6246 from a minor keyword introduced via theory header declaration.

6248 * Antiquotation @{command_spec "name"} produces the

6249 Outer_Syntax.command_spec from a major keyword introduced via theory

6250 header declaration; it can be passed to Outer_Syntax.command etc.

6252 * Local_Theory.define no longer hard-wires default theorem name

6253 "foo_def", but retains the binding as given. If that is Binding.empty

6254 / Attrib.empty_binding, the result is no