NEWS
author nipkow
Wed Jan 10 15:21:49 2018 +0100 (17 months ago)
changeset 67398 5eb932e604a2
parent 67395 b39d596b77ce
child 67400 bbed46f40cf5
permissions -rw-r--r--
Manual updates towards conversion of "op" syntax
     1 Isabelle NEWS -- history of user-relevant changes
     2 =================================================
     3 
     4 (Note: Isabelle/jEdit shows a tree-view of the NEWS file in Sidekick.)
     5 
     6 
     7 New in this Isabelle version
     8 ----------------------------
     9 
    10 *** General ***
    11 
    12 * The "op <infix-op>" syntax for infix opertors has been replaced by
    13 "(<infix-op>)". INCOMPATIBILITY.
    14 There is an Isabelle tool "update_op" that converts theory and ML files
    15 to the new syntax. Because it is based on regular expression matching,
    16 the result may need a bit of manual postprocessing. Invoking "isabelle
    17 update_op" converts all files in the current directory (recursively).
    18 In case you want to exclude conversion of ML files (because the tool
    19 frequently also converts ML's "op" syntax), use option "-m".
    20 
    21 * The old 'def' command has been discontinued (legacy since
    22 Isbelle2016-1). INCOMPATIBILITY, use 'define' instead -- usually with
    23 object-logic equality or equivalence.
    24 
    25 * Session-qualified theory names are mandatory: it is no longer possible
    26 to refer to unqualified theories from the parent session.
    27 INCOMPATIBILITY for old developments that have not been updated to
    28 Isabelle2017 yet (using the "isabelle imports" tool).
    29 
    30 * Theory header 'abbrevs' specifications need to be separated by 'and'.
    31 INCOMPATIBILITY.
    32 
    33 * Only the most fundamental theory names are global, usually the entry
    34 points to major logic sessions: Pure, Main, Complex_Main, HOLCF, IFOL,
    35 FOL, ZF, ZFC etc. INCOMPATIBILITY, need to use qualified names for
    36 formerly global "HOL-Probability.Probability" and "HOL-SPARK.SPARK".
    37 
    38 * Command 'external_file' declares the formal dependency on the given
    39 file name, such that the Isabelle build process knows about it, but
    40 without specific Prover IDE management.
    41 
    42 * Session ROOT entries no longer allow specification of 'files'. Rare
    43 INCOMPATIBILITY, use command 'external_file' within a proper theory
    44 context.
    45 
    46 * Session root directories may be specified multiple times: each
    47 accessible ROOT file is processed only once. This facilitates
    48 specification of $ISABELLE_HOME_USER/ROOTS or command-line options like
    49 -d or -D for "isabelle build" and "isabelle jedit". Example:
    50 
    51   isabelle build -D '~~/src/ZF'
    52 
    53 * The command 'display_drafts' has been discontinued. INCOMPATIBILITY,
    54 use action "isabelle.draft" (or "print") in Isabelle/jEdit instead.
    55 
    56 * Isabelle symbol "\<hyphen>" is rendered as explicit Unicode hyphen U+2010, to
    57 avoid unclear meaning of the old "soft hyphen" U+00AD. Rare
    58 INCOMPATIBILITY, e.g. copy-paste of historic Isabelle HTML output.
    59 
    60 
    61 *** Isabelle/jEdit Prover IDE ***
    62 
    63 * System options "spell_checker_include" and "spell_checker_exclude"
    64 supersede former "spell_checker_elements" to determine regions of text
    65 that are subject to spell-checking. Minor INCOMPATIBILITY.
    66 
    67 * PIDE markup for session ROOT files: allows to complete session names,
    68 follow links to theories and document files etc.
    69 
    70 * Completion supports theory header imports, using theory base name.
    71 E.g. "Prob" may be completed to "HOL-Probability.Probability".
    72 
    73 * The command-line tool "isabelle jedit" provides more flexible options
    74 for session selection:
    75   - options -P opens the parent session image of -l
    76   - options -A and -B modify the meaning of -l to produce a base
    77     image on the spot, based on the specified ancestor (or parent)
    78   - option -F focuses on the specified logic session
    79   - option -R has changed: it only opens the session ROOT entry
    80   - option -S sets up the development environment to edit the
    81     specified session: it abbreviates -B -F -R -l
    82 
    83   Examples:
    84     isabelle jedit -d '$AFP' -S Formal_SSA -A HOL
    85     isabelle jedit -d '$AFP' -S Formal_SSA -A HOL-Analysis
    86 
    87 * Named control symbols (without special Unicode rendering) are shown as
    88 bold-italic keyword. This is particularly useful for the short form of
    89 antiquotations with control symbol: \<^name>\<open>argument\<close>. The action
    90 "isabelle.antiquoted_cartouche" turns an antiquotation with 0 or 1
    91 arguments into this format.
    92 
    93 * Completion provides templates for named symbols with arguments,
    94 e.g. "\<comment> \<open>ARGUMENT\<close>" or "\<^emph>\<open>ARGUMENT\<close>".
    95 
    96 * Bibtex database files (.bib) are semantically checked.
    97 
    98 * Action "isabelle.preview" is able to present more file formats,
    99 notably bibtex database files and ML files.
   100 
   101 * Action "isabelle.draft" is similar to "isabelle.preview", but shows a
   102 plain-text document draft.
   103 
   104 * When loading text files, the Isabelle symbols encoding UTF-8-Isabelle
   105 is only used if there is no conflict with existing Unicode sequences in
   106 the file. Otherwise, the fallback encoding is plain UTF-8 and Isabelle
   107 symbols remain in literal \<symbol> form. This avoids accidental loss of
   108 Unicode content when saving the file.
   109 
   110 
   111 *** Isabelle/VSCode Prover IDE ***
   112 
   113 * HTML preview of theories and other file-formats similar to
   114 Isabelle/jEdit.
   115 
   116 
   117 *** Document preparation ***
   118 
   119 * Embedded languages such as inner syntax and ML may contain formal
   120 comments of the form "\<comment> \<open>text\<close>". As in marginal comments of outer
   121 syntax, antiquotations are interpreted wrt. the presentation context of
   122 the enclosing command.
   123 
   124 * Outside of the inner theory body, the default presentation context is
   125 theory Pure. Thus elementary antiquotations may be used in markup
   126 commands (e.g. 'chapter', 'section', 'text') and formal comments.
   127 
   128 * System option "document_tags" specifies a default for otherwise
   129 untagged commands. This is occasionally useful to control the global
   130 visibility of commands via session options (e.g. in ROOT).
   131 
   132 * Document markup commands ('section', 'text' etc.) are implicitly
   133 tagged as "document" and visible by default. This avoids the application
   134 of option "document_tags" to these commands.
   135 
   136 * Isabelle names are mangled into LaTeX macro names to allow the full
   137 identifier syntax with underscore, prime, digits. This is relevant for
   138 antiquotations in control symbol notation, e.g. \<^const_name> becomes
   139 \isactrlconstUNDERSCOREname.
   140 
   141 * Document antiquotation @{cite} now checks the given Bibtex entries
   142 against the Bibtex database files -- only in batch-mode session builds.
   143 
   144 * Document antiquotation @{session name} checks and prints the given
   145 session name verbatim.
   146 
   147 * Document preparation with skip_proofs option now preserves the content
   148 more accurately: only terminal proof steps ('by' etc.) are skipped.
   149 
   150 * Command-line tool "isabelle document" has been re-implemented in
   151 Isabelle/Scala, with simplified arguments and explicit errors from the
   152 latex and bibtex process. Minor INCOMPATIBILITY.
   153 
   154 
   155 *** HOL ***
   156 
   157 * A new command parametric_constant for proving parametricity of
   158 non-recursive definitions. For constants that are not fully parametric
   159 the command will infer conditions on relations (e.g., bi_unique,
   160 bi_total, or type class conditions such as "respects 0") sufficient for
   161 parametricity. See ~~/src/HOL/ex/Conditional_Parametricity_Examples for
   162 some examples.
   163 
   164 * SMT module:
   165   - The 'smt_oracle' option is now necessary when using the 'smt' method
   166     with a solver other than Z3. INCOMPATIBILITY.
   167   - The encoding to first-order logic is now more complete in the
   168     presence of higher-order quantifiers. An 'smt_explicit_application'
   169     option has been added to control this. INCOMPATIBILITY.
   170 
   171 * Datatypes:
   172   - The legacy command 'old_datatype', provided by
   173     '~~/src/HOL/Library/Old_Datatype.thy', has been removed. INCOMPATIBILITY.
   174 
   175 * Theory HOL-Computational_Algebra.Polynomial_Factorial does not provide
   176 instances of rat, real, complex as factorial rings etc. Import
   177 HOL-Computational_Algebra.Field_as_Ring explicitly in case of need.
   178 INCOMPATIBILITY.
   179 
   180 * Fact mod_mult_self4 (on nat) renamed to mod_mult_self3', to avoid
   181 clash with fact mod_mult_self4 (on more generic semirings).
   182 INCOMPATIBILITY.
   183 
   184 * Facts sum.commute(_restrict) and prod.commute(_restrict) renamed to
   185 sum.swap(_restrict) and prod.swap(_restrict), to avoid name clashes on
   186 interpretation of abstract locales. INCOMPATIBILITY.
   187 
   188 * Predicate pairwise_coprime abolished, use "pairwise coprime" instead.
   189 INCOMPATIBILITY.
   190 
   191 * HOL-Algebra: renamed (^) to [^]
   192 
   193 * Session HOL-Analysis: Moebius functions and the Riemann mapping
   194 theorem.
   195 
   196 * Class linordered_semiring_1 covers zero_less_one also, ruling out
   197 pathologic instances. Minor INCOMPATIBILITY.
   198 
   199 * Removed nat-int transfer machinery. Rare INCOMPATIBILITY.
   200 
   201 * Predicate coprime is now a real definition, not a mere
   202 abbreviation. INCOMPATIBILITY.
   203 
   204 * Code generation: Code generation takes an explicit option
   205 "case_insensitive" to accomodate case-insensitive file systems.
   206 
   207 
   208 *** System ***
   209 
   210 * Session ROOT entry: empty 'document_files' means there is no document
   211 for this session. There is no need to specify options [document = false]
   212 anymore.
   213 
   214 * The command-line tool "isabelle mkroot" now always produces a document
   215 outline: its options have been adapted accordingly. INCOMPATIBILITY.
   216 
   217 * The command-line tool "isabelle mkroot -I" initializes a Mercurial
   218 repository for the generated session files.
   219 
   220 * Linux and Windows/Cygwin is for x86_64 only. Old 32bit platform
   221 support has been discontinued.
   222 
   223 * Mac OS X 10.10 Yosemite is now the baseline version; Mavericks is no
   224 longer supported.
   225 
   226 * Java runtime is for x86_64 only. Corresponding Isabelle settings have
   227 been renamed to ISABELLE_TOOL_JAVA_OPTIONS and JEDIT_JAVA_OPTIONS,
   228 instead of former 32/64 variants. INCOMPATIBILITY.
   229 
   230 * Command-line tool "isabelle build" supports new options:
   231   - option -B NAME: include session NAME and all descendants
   232   - option -S: only observe changes of sources, not heap images
   233   - option -f: forces a fresh build
   234 
   235 * Command-line tool "isabelle build" takes "condition" options with the
   236 corresponding environment values into account, when determining the
   237 up-to-date status of a session.
   238 
   239 * Command-line tool "isabelle imports -I" also reports actual session
   240 imports. This helps to minimize the session dependency graph.
   241 
   242 * Update to current Poly/ML 5.7.1 with slightly improved performance and
   243 PIDE markup for identifier bindings.
   244 
   245 * ISABELLE_LATEX and ISABELLE_PDFLATEX now include platform-specific
   246 options for improved error reporting. Potential INCOMPATIBILITY with
   247 unusual LaTeX installations, may have to adapt these settings.
   248 
   249 
   250 
   251 New in Isabelle2017 (October 2017)
   252 ----------------------------------
   253 
   254 *** General ***
   255 
   256 * Experimental support for Visual Studio Code (VSCode) as alternative
   257 Isabelle/PIDE front-end, see also
   258 https://marketplace.visualstudio.com/items?itemName=makarius.Isabelle2017
   259 
   260 VSCode is a new type of application that continues the concepts of
   261 "programmer's editor" and "integrated development environment" towards
   262 fully semantic editing and debugging -- in a relatively light-weight
   263 manner. Thus it fits nicely on top of the Isabelle/PIDE infrastructure.
   264 Technically, VSCode is based on the Electron application framework
   265 (Node.js + Chromium browser + V8), which is implemented in JavaScript
   266 and TypeScript, while Isabelle/VSCode mainly consists of Isabelle/Scala
   267 modules around a Language Server implementation.
   268 
   269 * Theory names are qualified by the session name that they belong to.
   270 This affects imports, but not the theory name space prefix (which is
   271 just the theory base name as before).
   272 
   273 In order to import theories from other sessions, the ROOT file format
   274 provides a new 'sessions' keyword. In contrast, a theory that is
   275 imported in the old-fashioned manner via an explicit file-system path
   276 belongs to the current session, and might cause theory name conflicts
   277 later on. Theories that are imported from other sessions are excluded
   278 from the current session document. The command-line tool "isabelle
   279 imports" helps to update theory imports.
   280 
   281 * The main theory entry points for some non-HOL sessions have changed,
   282 to avoid confusion with the global name "Main" of the session HOL. This
   283 leads to the follow renamings:
   284 
   285   CTT/Main.thy    ~>  CTT/CTT.thy
   286   ZF/Main.thy     ~>  ZF/ZF.thy
   287   ZF/Main_ZF.thy  ~>  ZF/ZF.thy
   288   ZF/Main_ZFC.thy ~>  ZF/ZFC.thy
   289   ZF/ZF.thy       ~>  ZF/ZF_Base.thy
   290 
   291 INCOMPATIBILITY.
   292 
   293 * Commands 'alias' and 'type_alias' introduce aliases for constants and
   294 type constructors, respectively. This allows adhoc changes to name-space
   295 accesses within global or local theory contexts, e.g. within a 'bundle'.
   296 
   297 * Document antiquotations @{prf} and @{full_prf} output proof terms
   298 (again) in the same way as commands 'prf' and 'full_prf'.
   299 
   300 * Computations generated by the code generator can be embedded directly
   301 into ML, alongside with @{code} antiquotations, using the following
   302 antiquotations:
   303 
   304   @{computation ... terms: ... datatypes: ...} :
   305     ((term -> term) -> 'ml option -> 'a) -> Proof.context -> term -> 'a
   306   @{computation_conv ... terms: ... datatypes: ...} :
   307     (Proof.context -> 'ml -> conv) -> Proof.context -> conv
   308   @{computation_check terms: ... datatypes: ...} : Proof.context -> conv
   309 
   310 See src/HOL/ex/Computations.thy,
   311 src/HOL/Decision_Procs/Commutative_Ring.thy and
   312 src/HOL/Decision_Procs/Reflective_Field.thy for examples and the
   313 tutorial on code generation.
   314 
   315 
   316 *** Prover IDE -- Isabelle/Scala/jEdit ***
   317 
   318 * Session-qualified theory imports allow the Prover IDE to process
   319 arbitrary theory hierarchies independently of the underlying logic
   320 session image (e.g. option "isabelle jedit -l"), but the directory
   321 structure needs to be known in advance (e.g. option "isabelle jedit -d"
   322 or a line in the file $ISABELLE_HOME_USER/ROOTS).
   323 
   324 * The PIDE document model maintains file content independently of the
   325 status of jEdit editor buffers. Reloading jEdit buffers no longer causes
   326 changes of formal document content. Theory dependencies are always
   327 resolved internally, without the need for corresponding editor buffers.
   328 The system option "jedit_auto_load" has been discontinued: it is
   329 effectively always enabled.
   330 
   331 * The Theories dockable provides a "Purge" button, in order to restrict
   332 the document model to theories that are required for open editor
   333 buffers.
   334 
   335 * The Theories dockable indicates the overall status of checking of each
   336 entry. When all forked tasks of a theory are finished, the border is
   337 painted with thick lines; remaining errors in this situation are
   338 represented by a different border color.
   339 
   340 * Automatic indentation is more careful to avoid redundant spaces in
   341 intermediate situations. Keywords are indented after input (via typed
   342 characters or completion); see also option "jedit_indent_input".
   343 
   344 * Action "isabelle.preview" opens an HTML preview of the current theory
   345 document in the default web browser.
   346 
   347 * Command-line invocation "isabelle jedit -R -l LOGIC" opens the ROOT
   348 entry of the specified logic session in the editor, while its parent is
   349 used for formal checking.
   350 
   351 * The main Isabelle/jEdit plugin may be restarted manually (using the
   352 jEdit Plugin Manager), as long as the "Isabelle Base" plugin remains
   353 enabled at all times.
   354 
   355 * Update to current jedit-5.4.0.
   356 
   357 
   358 *** Pure ***
   359 
   360 * Deleting the last code equations for a particular function using
   361 [code del] results in function with no equations (runtime abort) rather
   362 than an unimplemented function (generation time abort). Use explicit
   363 [[code drop:]] to enforce the latter. Minor INCOMPATIBILITY.
   364 
   365 * Proper concept of code declarations in code.ML:
   366   - Regular code declarations act only on the global theory level, being
   367     ignored with warnings if syntactically malformed.
   368   - Explicitly global code declarations yield errors if syntactically
   369     malformed.
   370   - Default code declarations are silently ignored if syntactically
   371     malformed.
   372 Minor INCOMPATIBILITY.
   373 
   374 * Clarified and standardized internal data bookkeeping of code
   375 declarations: history of serials allows to track potentially
   376 non-monotonous declarations appropriately. Minor INCOMPATIBILITY.
   377 
   378 
   379 *** HOL ***
   380 
   381 * The Nunchaku model finder is now part of "Main".
   382 
   383 * SMT module:
   384   - A new option, 'smt_nat_as_int', has been added to translate 'nat' to
   385     'int' and benefit from the SMT solver's theory reasoning. It is
   386     disabled by default.
   387   - The legacy module "src/HOL/Library/Old_SMT.thy" has been removed.
   388   - Several small issues have been rectified in the 'smt' command.
   389 
   390 * (Co)datatype package: The 'size_gen_o_map' lemma is no longer
   391 generated for datatypes with type class annotations. As a result, the
   392 tactic that derives it no longer fails on nested datatypes. Slight
   393 INCOMPATIBILITY.
   394 
   395 * Command and antiquotation "value" with modified default strategy:
   396 terms without free variables are always evaluated using plain evaluation
   397 only, with no fallback on normalization by evaluation. Minor
   398 INCOMPATIBILITY.
   399 
   400 * Theories "GCD" and "Binomial" are already included in "Main" (instead
   401 of "Complex_Main").
   402 
   403 * Constant "surj" is a full input/output abbreviation (again).
   404 Minor INCOMPATIBILITY.
   405 
   406 * Dropped aliasses RangeP, DomainP for Rangep, Domainp respectively.
   407 INCOMPATIBILITY.
   408 
   409 * Renamed ii to imaginary_unit in order to free up ii as a variable
   410 name. The syntax \<i> remains available. INCOMPATIBILITY.
   411 
   412 * Dropped abbreviations transP, antisymP, single_valuedP; use constants
   413 transp, antisymp, single_valuedp instead. INCOMPATIBILITY.
   414 
   415 * Constant "subseq" in Topological_Spaces has been removed -- it is
   416 subsumed by "strict_mono". Some basic lemmas specific to "subseq" have
   417 been renamed accordingly, e.g. "subseq_o" -> "strict_mono_o" etc.
   418 
   419 * Theory List: "sublist" renamed to "nths" in analogy with "nth", and
   420 "sublisteq" renamed to "subseq". Minor INCOMPATIBILITY.
   421 
   422 * Theory List: new generic function "sorted_wrt".
   423 
   424 * Named theorems mod_simps covers various congruence rules concerning
   425 mod, replacing former zmod_simps. INCOMPATIBILITY.
   426 
   427 * Swapped orientation of congruence rules mod_add_left_eq,
   428 mod_add_right_eq, mod_add_eq, mod_mult_left_eq, mod_mult_right_eq,
   429 mod_mult_eq, mod_minus_eq, mod_diff_left_eq, mod_diff_right_eq,
   430 mod_diff_eq. INCOMPATIBILITY.
   431 
   432 * Generalized some facts:
   433     measure_induct_rule
   434     measure_induct
   435     zminus_zmod ~> mod_minus_eq
   436     zdiff_zmod_left ~> mod_diff_left_eq
   437     zdiff_zmod_right ~> mod_diff_right_eq
   438     zmod_eq_dvd_iff ~> mod_eq_dvd_iff
   439 INCOMPATIBILITY.
   440 
   441 * Algebraic type class hierarchy of euclidean (semi)rings in HOL:
   442 euclidean_(semi)ring, euclidean_(semi)ring_cancel,
   443 unique_euclidean_(semi)ring; instantiation requires provision of a
   444 euclidean size.
   445 
   446 * Theory "HOL-Number_Theory.Euclidean_Algorithm" has been reworked:
   447   - Euclidean induction is available as rule eucl_induct.
   448   - Constants Euclidean_Algorithm.gcd, Euclidean_Algorithm.lcm,
   449     Euclidean_Algorithm.Gcd and Euclidean_Algorithm.Lcm allow
   450     easy instantiation of euclidean (semi)rings as GCD (semi)rings.
   451   - Coefficients obtained by extended euclidean algorithm are
   452     available as "bezout_coefficients".
   453 INCOMPATIBILITY.
   454 
   455 * Theory "Number_Theory.Totient" introduces basic notions about Euler's
   456 totient function previously hidden as solitary example in theory
   457 Residues. Definition changed so that "totient 1 = 1" in agreement with
   458 the literature. Minor INCOMPATIBILITY.
   459 
   460 * New styles in theory "HOL-Library.LaTeXsugar":
   461   - "dummy_pats" for printing equations with "_" on the lhs;
   462   - "eta_expand" for printing eta-expanded terms.
   463 
   464 * Theory "HOL-Library.Permutations": theorem bij_swap_ompose_bij has
   465 been renamed to bij_swap_compose_bij. INCOMPATIBILITY.
   466 
   467 * New theory "HOL-Library.Going_To_Filter" providing the "f going_to F"
   468 filter for describing points x such that f(x) is in the filter F.
   469 
   470 * Theory "HOL-Library.Formal_Power_Series": constants X/E/L/F have been
   471 renamed to fps_X/fps_exp/fps_ln/fps_hypergeo to avoid polluting the name
   472 space. INCOMPATIBILITY.
   473 
   474 * Theory "HOL-Library.FinFun" has been moved to AFP (again).
   475 INCOMPATIBILITY.
   476 
   477 * Theory "HOL-Library.FuncSet": some old and rarely used ASCII
   478 replacement syntax has been removed. INCOMPATIBILITY, standard syntax
   479 with symbols should be used instead. The subsequent commands help to
   480 reproduce the old forms, e.g. to simplify porting old theories:
   481 
   482 syntax (ASCII)
   483   "_PiE" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set"  ("(3PIE _:_./ _)" 10)
   484   "_Pi"  :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set"  ("(3PI _:_./ _)" 10)
   485   "_lam" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> ('a \<Rightarrow> 'b)"  ("(3%_:_./ _)" [0,0,3] 3)
   486 
   487 * Theory "HOL-Library.Multiset": the simprocs on subsets operators of
   488 multisets have been renamed:
   489 
   490   msetless_cancel_numerals ~> msetsubset_cancel
   491   msetle_cancel_numerals ~> msetsubset_eq_cancel
   492 
   493 INCOMPATIBILITY.
   494 
   495 * Theory "HOL-Library.Pattern_Aliases" provides input and output syntax
   496 for pattern aliases as known from Haskell, Scala and ML.
   497 
   498 * Theory "HOL-Library.Uprod" formalizes the type of unordered pairs.
   499 
   500 * Session HOL-Analysis: more material involving arcs, paths, covering
   501 spaces, innessential maps, retracts, infinite products, simplicial
   502 complexes. Baire Category theorem. Major results include the Jordan
   503 Curve Theorem and the Great Picard Theorem.
   504 
   505 * Session HOL-Algebra has been extended by additional lattice theory:
   506 the Knaster-Tarski fixed point theorem and Galois Connections.
   507 
   508 * Sessions HOL-Computational_Algebra and HOL-Number_Theory: new notions
   509 of squarefreeness, n-th powers, and prime powers.
   510 
   511 * Session "HOL-Computional_Algebra" covers many previously scattered
   512 theories, notably Euclidean_Algorithm, Factorial_Ring,
   513 Formal_Power_Series, Fraction_Field, Fundamental_Theorem_Algebra,
   514 Normalized_Fraction, Polynomial_FPS, Polynomial, Primes. Minor
   515 INCOMPATIBILITY.
   516 
   517 
   518 *** System ***
   519 
   520 * Isabelle/Scala: the SQL module supports access to relational
   521 databases, either as plain file (SQLite) or full-scale server
   522 (PostgreSQL via local port or remote ssh connection).
   523 
   524 * Results of "isabelle build" are recorded as SQLite database (i.e.
   525 "Application File Format" in the sense of
   526 https://www.sqlite.org/appfileformat.html). This allows systematic
   527 access via operations from module Sessions.Store in Isabelle/Scala.
   528 
   529 * System option "parallel_proofs" is 1 by default (instead of more
   530 aggressive 2). This requires less heap space and avoids burning parallel
   531 CPU cycles, while full subproof parallelization is enabled for repeated
   532 builds (according to parallel_subproofs_threshold).
   533 
   534 * System option "record_proofs" allows to change the global
   535 Proofterm.proofs variable for a session. Regular values are are 0, 1, 2;
   536 a negative value means the current state in the ML heap image remains
   537 unchanged.
   538 
   539 * Isabelle settings variable ISABELLE_SCALA_BUILD_OPTIONS has been
   540 renamed to ISABELLE_SCALAC_OPTIONS. Rare INCOMPATIBILITY.
   541 
   542 * Isabelle settings variables ISABELLE_WINDOWS_PLATFORM,
   543 ISABELLE_WINDOWS_PLATFORM32, ISABELLE_WINDOWS_PLATFORM64 indicate the
   544 native Windows platform (independently of the Cygwin installation). This
   545 is analogous to ISABELLE_PLATFORM, ISABELLE_PLATFORM32,
   546 ISABELLE_PLATFORM64.
   547 
   548 * Command-line tool "isabelle build_docker" builds a Docker image from
   549 the Isabelle application bundle for Linux. See also
   550 https://hub.docker.com/r/makarius/isabelle
   551 
   552 * Command-line tool "isabelle vscode_server" provides a Language Server
   553 Protocol implementation, e.g. for the Visual Studio Code editor. It
   554 serves as example for alternative PIDE front-ends.
   555 
   556 * Command-line tool "isabelle imports" helps to maintain theory imports
   557 wrt. session structure. Examples for the main Isabelle distribution:
   558 
   559   isabelle imports -I -a
   560   isabelle imports -U -a
   561   isabelle imports -U -i -a
   562   isabelle imports -M -a -d '~~/src/Benchmarks'
   563 
   564 
   565 
   566 New in Isabelle2016-1 (December 2016)
   567 -------------------------------------
   568 
   569 *** General ***
   570 
   571 * Splitter in proof methods "simp", "auto" and friends:
   572   - The syntax "split add" has been discontinued, use plain "split",
   573     INCOMPATIBILITY.
   574   - For situations with many conditional or case expressions, there is
   575     an alternative splitting strategy that can be much faster. It is
   576     selected by writing "split!" instead of "split". It applies safe
   577     introduction and elimination rules after each split rule. As a
   578     result the subgoal may be split into several subgoals.
   579 
   580 * Command 'bundle' provides a local theory target to define a bundle
   581 from the body of specification commands (such as 'declare',
   582 'declaration', 'notation', 'lemmas', 'lemma'). For example:
   583 
   584 bundle foo
   585 begin
   586   declare a [simp]
   587   declare b [intro]
   588 end
   589 
   590 * Command 'unbundle' is like 'include', but works within a local theory
   591 context. Unlike "context includes ... begin", the effect of 'unbundle'
   592 on the target context persists, until different declarations are given.
   593 
   594 * Simplified outer syntax: uniform category "name" includes long
   595 identifiers. Former "xname" / "nameref" / "name reference" has been
   596 discontinued.
   597 
   598 * Embedded content (e.g. the inner syntax of types, terms, props) may be
   599 delimited uniformly via cartouches. This works better than old-fashioned
   600 quotes when sub-languages are nested.
   601 
   602 * Mixfix annotations support general block properties, with syntax
   603 "(\<open>x=a y=b z \<dots>\<close>". Notable property names are "indent", "consistent",
   604 "unbreakable", "markup". The existing notation "(DIGITS" is equivalent
   605 to "(\<open>indent=DIGITS\<close>". The former notation "(00" for unbreakable blocks
   606 is superseded by "(\<open>unbreabable\<close>" --- rare INCOMPATIBILITY.
   607 
   608 * Proof method "blast" is more robust wrt. corner cases of Pure
   609 statements without object-logic judgment.
   610 
   611 * Commands 'prf' and 'full_prf' are somewhat more informative (again):
   612 proof terms are reconstructed and cleaned from administrative thm nodes.
   613 
   614 * Code generator: config option "code_timing" triggers measurements of
   615 different phases of code generation. See src/HOL/ex/Code_Timing.thy for
   616 examples.
   617 
   618 * Code generator: implicits in Scala (stemming from type class
   619 instances) are generated into companion object of corresponding type
   620 class, to resolve some situations where ambiguities may occur.
   621 
   622 * Solve direct: option "solve_direct_strict_warnings" gives explicit
   623 warnings for lemma statements with trivial proofs.
   624 
   625 
   626 *** Prover IDE -- Isabelle/Scala/jEdit ***
   627 
   628 * More aggressive flushing of machine-generated input, according to
   629 system option editor_generated_input_delay (in addition to existing
   630 editor_input_delay for regular user edits). This may affect overall PIDE
   631 reactivity and CPU usage.
   632 
   633 * Syntactic indentation according to Isabelle outer syntax. Action
   634 "indent-lines" (shortcut C+i) indents the current line according to
   635 command keywords and some command substructure. Action
   636 "isabelle.newline" (shortcut ENTER) indents the old and the new line
   637 according to command keywords only; see also option
   638 "jedit_indent_newline".
   639 
   640 * Semantic indentation for unstructured proof scripts ('apply' etc.) via
   641 number of subgoals. This requires information of ongoing document
   642 processing and may thus lag behind, when the user is editing too
   643 quickly; see also option "jedit_script_indent" and
   644 "jedit_script_indent_limit".
   645 
   646 * Refined folding mode "isabelle" based on Isar syntax: 'next' and 'qed'
   647 are treated as delimiters for fold structure; 'begin' and 'end'
   648 structure of theory specifications is treated as well.
   649 
   650 * Command 'proof' provides information about proof outline with cases,
   651 e.g. for proof methods "cases", "induct", "goal_cases".
   652 
   653 * Completion templates for commands involving "begin ... end" blocks,
   654 e.g. 'context', 'notepad'.
   655 
   656 * Sidekick parser "isabelle-context" shows nesting of context blocks
   657 according to 'begin' and 'end' structure.
   658 
   659 * Highlighting of entity def/ref positions wrt. cursor.
   660 
   661 * Action "isabelle.select-entity" (shortcut CS+ENTER) selects all
   662 occurrences of the formal entity at the caret position. This facilitates
   663 systematic renaming.
   664 
   665 * PIDE document markup works across multiple Isar commands, e.g. the
   666 results established at the end of a proof are properly identified in the
   667 theorem statement.
   668 
   669 * Cartouche abbreviations work both for " and ` to accomodate typical
   670 situations where old ASCII notation may be updated.
   671 
   672 * Dockable window "Symbols" also provides access to 'abbrevs' from the
   673 outer syntax of the current theory buffer. This provides clickable
   674 syntax templates, including entries with empty abbrevs name (which are
   675 inaccessible via keyboard completion).
   676 
   677 * IDE support for the Isabelle/Pure bootstrap process, with the
   678 following independent stages:
   679 
   680   src/Pure/ROOT0.ML
   681   src/Pure/ROOT.ML
   682   src/Pure/Pure.thy
   683   src/Pure/ML_Bootstrap.thy
   684 
   685 The ML ROOT files act like quasi-theories in the context of theory
   686 ML_Bootstrap: this allows continuous checking of all loaded ML files.
   687 The theory files are presented with a modified header to import Pure
   688 from the running Isabelle instance. Results from changed versions of
   689 each stage are *not* propagated to the next stage, and isolated from the
   690 actual Isabelle/Pure that runs the IDE itself. The sequential
   691 dependencies of the above files are only observed for batch build.
   692 
   693 * Isabelle/ML and Standard ML files are presented in Sidekick with the
   694 tree structure of section headings: this special comment format is
   695 described in "implementation" chapter 0, e.g. (*** section ***).
   696 
   697 * Additional abbreviations for syntactic completion may be specified
   698 within the theory header as 'abbrevs'. The theory syntax for 'keywords'
   699 has been simplified accordingly: optional abbrevs need to go into the
   700 new 'abbrevs' section.
   701 
   702 * Global abbreviations via $ISABELLE_HOME/etc/abbrevs and
   703 $ISABELLE_HOME_USER/etc/abbrevs are no longer supported. Minor
   704 INCOMPATIBILITY, use 'abbrevs' within theory header instead.
   705 
   706 * Action "isabelle.keymap-merge" asks the user to resolve pending
   707 Isabelle keymap changes that are in conflict with the current jEdit
   708 keymap; non-conflicting changes are always applied implicitly. This
   709 action is automatically invoked on Isabelle/jEdit startup and thus
   710 increases chances that users see new keyboard shortcuts when re-using
   711 old keymaps.
   712 
   713 * ML and document antiquotations for file-systems paths are more uniform
   714 and diverse:
   715 
   716   @{path NAME}   -- no file-system check
   717   @{file NAME}   -- check for plain file
   718   @{dir NAME}    -- check for directory
   719 
   720 Minor INCOMPATIBILITY, former uses of @{file} and @{file_unchecked} may
   721 have to be changed.
   722 
   723 
   724 *** Document preparation ***
   725 
   726 * New symbol \<circle>, e.g. for temporal operator.
   727 
   728 * New document and ML antiquotation @{locale} for locales, similar to
   729 existing antiquotation @{class}.
   730 
   731 * Mixfix annotations support delimiters like \<^control>\<open>cartouche\<close> --
   732 this allows special forms of document output.
   733 
   734 * Raw LaTeX output now works via \<^latex>\<open>...\<close> instead of raw control
   735 symbol \<^raw:...>. INCOMPATIBILITY, notably for LaTeXsugar.thy and its
   736 derivatives.
   737 
   738 * \<^raw:...> symbols are no longer supported.
   739 
   740 * Old 'header' command is no longer supported (legacy since
   741 Isabelle2015).
   742 
   743 
   744 *** Isar ***
   745 
   746 * Many specification elements support structured statements with 'if' /
   747 'for' eigen-context, e.g. 'axiomatization', 'abbreviation',
   748 'definition', 'inductive', 'function'.
   749 
   750 * Toplevel theorem statements support eigen-context notation with 'if' /
   751 'for' (in postfix), which corresponds to 'assumes' / 'fixes' in the
   752 traditional long statement form (in prefix). Local premises are called
   753 "that" or "assms", respectively. Empty premises are *not* bound in the
   754 context: INCOMPATIBILITY.
   755 
   756 * Command 'define' introduces a local (non-polymorphic) definition, with
   757 optional abstraction over local parameters. The syntax resembles
   758 'definition' and 'obtain'. It fits better into the Isar language than
   759 old 'def', which is now a legacy feature.
   760 
   761 * Command 'obtain' supports structured statements with 'if' / 'for'
   762 context.
   763 
   764 * Command '\<proof>' is an alias for 'sorry', with different
   765 typesetting. E.g. to produce proof holes in examples and documentation.
   766 
   767 * The defining position of a literal fact \<open>prop\<close> is maintained more
   768 carefully, and made accessible as hyperlink in the Prover IDE.
   769 
   770 * Commands 'finally' and 'ultimately' used to expose the result as
   771 literal fact: this accidental behaviour has been discontinued. Rare
   772 INCOMPATIBILITY, use more explicit means to refer to facts in Isar.
   773 
   774 * Command 'axiomatization' has become more restrictive to correspond
   775 better to internal axioms as singleton facts with mandatory name. Minor
   776 INCOMPATIBILITY.
   777 
   778 * Proof methods may refer to the main facts via the dynamic fact
   779 "method_facts". This is particularly useful for Eisbach method
   780 definitions.
   781 
   782 * Proof method "use" allows to modify the main facts of a given method
   783 expression, e.g.
   784 
   785   (use facts in simp)
   786   (use facts in \<open>simp add: ...\<close>)
   787 
   788 * The old proof method "default" has been removed (legacy since
   789 Isabelle2016). INCOMPATIBILITY, use "standard" instead.
   790 
   791 
   792 *** Pure ***
   793 
   794 * Pure provides basic versions of proof methods "simp" and "simp_all"
   795 that only know about meta-equality (==). Potential INCOMPATIBILITY in
   796 theory imports that merge Pure with e.g. Main of Isabelle/HOL: the order
   797 is relevant to avoid confusion of Pure.simp vs. HOL.simp.
   798 
   799 * The command 'unfolding' and proof method "unfold" include a second
   800 stage where given equations are passed through the attribute "abs_def"
   801 before rewriting. This ensures that definitions are fully expanded,
   802 regardless of the actual parameters that are provided. Rare
   803 INCOMPATIBILITY in some corner cases: use proof method (simp only:)
   804 instead, or declare [[unfold_abs_def = false]] in the proof context.
   805 
   806 * Type-inference improves sorts of newly introduced type variables for
   807 the object-logic, using its base sort (i.e. HOL.type for Isabelle/HOL).
   808 Thus terms like "f x" or "\<And>x. P x" without any further syntactic context
   809 produce x::'a::type in HOL instead of x::'a::{} in Pure. Rare
   810 INCOMPATIBILITY, need to provide explicit type constraints for Pure
   811 types where this is really intended.
   812 
   813 
   814 *** HOL ***
   815 
   816 * New proof method "argo" using the built-in Argo solver based on SMT
   817 technology. The method can be used to prove goals of quantifier-free
   818 propositional logic, goals based on a combination of quantifier-free
   819 propositional logic with equality, and goals based on a combination of
   820 quantifier-free propositional logic with linear real arithmetic
   821 including min/max/abs. See HOL/ex/Argo_Examples.thy for examples.
   822 
   823 * The new "nunchaku" command integrates the Nunchaku model finder. The
   824 tool is experimental. See ~~/src/HOL/Nunchaku/Nunchaku.thy for details.
   825 
   826 * Metis: The problem encoding has changed very slightly. This might
   827 break existing proofs. INCOMPATIBILITY.
   828 
   829 * Sledgehammer:
   830   - The MaSh relevance filter is now faster than before.
   831   - Produce syntactically correct Vampire 4.0 problem files.
   832 
   833 * (Co)datatype package:
   834   - New commands for defining corecursive functions and reasoning about
   835     them in "~~/src/HOL/Library/BNF_Corec.thy": 'corec', 'corecursive',
   836     'friend_of_corec', and 'corecursion_upto'; and 'corec_unique' proof
   837     method. See 'isabelle doc corec'.
   838   - The predicator :: ('a \<Rightarrow> bool) \<Rightarrow> 'a F \<Rightarrow> bool is now a first-class
   839     citizen in bounded natural functors.
   840   - 'primrec' now allows nested calls through the predicator in addition
   841     to the map function.
   842   - 'bnf' automatically discharges reflexive proof obligations.
   843   - 'bnf' outputs a slightly modified proof obligation expressing rel in
   844        terms of map and set
   845        (not giving a specification for rel makes this one reflexive).
   846   - 'bnf' outputs a new proof obligation expressing pred in terms of set
   847        (not giving a specification for pred makes this one reflexive).
   848     INCOMPATIBILITY: manual 'bnf' declarations may need adjustment.
   849   - Renamed lemmas:
   850       rel_prod_apply ~> rel_prod_inject
   851       pred_prod_apply ~> pred_prod_inject
   852     INCOMPATIBILITY.
   853   - The "size" plugin has been made compatible again with locales.
   854   - The theorems about "rel" and "set" may have a slightly different (but
   855     equivalent) form.
   856     INCOMPATIBILITY.
   857 
   858 * The 'coinductive' command produces a proper coinduction rule for
   859 mutual coinductive predicates. This new rule replaces the old rule,
   860 which exposed details of the internal fixpoint construction and was
   861 hard to use. INCOMPATIBILITY.
   862 
   863 * New abbreviations for negated existence (but not bounded existence):
   864 
   865   \<nexists>x. P x \<equiv> \<not> (\<exists>x. P x)
   866   \<nexists>!x. P x \<equiv> \<not> (\<exists>!x. P x)
   867 
   868 * The print mode "HOL" for ASCII syntax of binders "!", "?", "?!", "@"
   869 has been removed for output. It is retained for input only, until it is
   870 eliminated altogether.
   871 
   872 * The unique existence quantifier no longer provides 'binder' syntax,
   873 but uses syntax translations (as for bounded unique existence). Thus
   874 iterated quantification \<exists>!x y. P x y with its slightly confusing
   875 sequential meaning \<exists>!x. \<exists>!y. P x y is no longer possible. Instead,
   876 pattern abstraction admits simultaneous unique existence \<exists>!(x, y). P x y
   877 (analogous to existing notation \<exists>!(x, y)\<in>A. P x y). Potential
   878 INCOMPATIBILITY in rare situations.
   879 
   880 * Conventional syntax "%(). t" for unit abstractions. Slight syntactic
   881 INCOMPATIBILITY.
   882 
   883 * Renamed constants and corresponding theorems:
   884 
   885     setsum ~> sum
   886     setprod ~> prod
   887     listsum ~> sum_list
   888     listprod ~> prod_list
   889 
   890 INCOMPATIBILITY.
   891 
   892 * Sligthly more standardized theorem names:
   893     sgn_times ~> sgn_mult
   894     sgn_mult' ~> Real_Vector_Spaces.sgn_mult
   895     divide_zero_left ~> div_0
   896     zero_mod_left ~> mod_0
   897     divide_zero ~> div_by_0
   898     divide_1 ~> div_by_1
   899     nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left
   900     div_mult_self1_is_id ~> nonzero_mult_div_cancel_left
   901     nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right
   902     div_mult_self2_is_id ~> nonzero_mult_div_cancel_right
   903     is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left
   904     is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right
   905     mod_div_equality ~> div_mult_mod_eq
   906     mod_div_equality2 ~> mult_div_mod_eq
   907     mod_div_equality3 ~> mod_div_mult_eq
   908     mod_div_equality4 ~> mod_mult_div_eq
   909     minus_div_eq_mod ~> minus_div_mult_eq_mod
   910     minus_div_eq_mod2 ~> minus_mult_div_eq_mod
   911     minus_mod_eq_div ~> minus_mod_eq_div_mult
   912     minus_mod_eq_div2 ~> minus_mod_eq_mult_div
   913     div_mod_equality' ~> minus_mod_eq_div_mult [symmetric]
   914     mod_div_equality' ~> minus_div_mult_eq_mod [symmetric]
   915     zmod_zdiv_equality ~> mult_div_mod_eq [symmetric]
   916     zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric]
   917     Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
   918     mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
   919     zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
   920     div_1 ~> div_by_Suc_0
   921     mod_1 ~> mod_by_Suc_0
   922 INCOMPATIBILITY.
   923 
   924 * New type class "idom_abs_sgn" specifies algebraic properties
   925 of sign and absolute value functions.  Type class "sgn_if" has
   926 disappeared.  Slight INCOMPATIBILITY.
   927 
   928 * Dedicated syntax LENGTH('a) for length of types.
   929 
   930 * Characters (type char) are modelled as finite algebraic type
   931 corresponding to {0..255}.
   932 
   933   - Logical representation:
   934     * 0 is instantiated to the ASCII zero character.
   935     * All other characters are represented as "Char n"
   936       with n being a raw numeral expression less than 256.
   937     * Expressions of the form "Char n" with n greater than 255
   938       are non-canonical.
   939   - Printing and parsing:
   940     * Printable characters are printed and parsed as "CHR ''\<dots>''"
   941       (as before).
   942     * The ASCII zero character is printed and parsed as "0".
   943     * All other canonical characters are printed as "CHR 0xXX"
   944       with XX being the hexadecimal character code.  "CHR n"
   945       is parsable for every numeral expression n.
   946     * Non-canonical characters have no special syntax and are
   947       printed as their logical representation.
   948   - Explicit conversions from and to the natural numbers are
   949     provided as char_of_nat, nat_of_char (as before).
   950   - The auxiliary nibble type has been discontinued.
   951 
   952 INCOMPATIBILITY.
   953 
   954 * Type class "div" with operation "mod" renamed to type class "modulo"
   955 with operation "modulo", analogously to type class "divide". This
   956 eliminates the need to qualify any of those names in the presence of
   957 infix "mod" syntax. INCOMPATIBILITY.
   958 
   959 * Statements and proofs of Knaster-Tarski fixpoint combinators lfp/gfp
   960 have been clarified. The fixpoint properties are lfp_fixpoint, its
   961 symmetric lfp_unfold (as before), and the duals for gfp. Auxiliary items
   962 for the proof (lfp_lemma2 etc.) are no longer exported, but can be
   963 easily recovered by composition with eq_refl. Minor INCOMPATIBILITY.
   964 
   965 * Constant "surj" is a mere input abbreviation, to avoid hiding an
   966 equation in term output. Minor INCOMPATIBILITY.
   967 
   968 * Command 'code_reflect' accepts empty constructor lists for datatypes,
   969 which renders those abstract effectively.
   970 
   971 * Command 'export_code' checks given constants for abstraction
   972 violations: a small guarantee that given constants specify a safe
   973 interface for the generated code.
   974 
   975 * Code generation for Scala: ambiguous implicts in class diagrams are
   976 spelt out explicitly.
   977 
   978 * Static evaluators (Code_Evaluation.static_* in Isabelle/ML) rely on
   979 explicitly provided auxiliary definitions for required type class
   980 dictionaries rather than half-working magic. INCOMPATIBILITY, see the
   981 tutorial on code generation for details.
   982 
   983 * Theory Set_Interval: substantial new theorems on indexed sums and
   984 products.
   985 
   986 * Locale bijection establishes convenient default simp rules such as
   987 "inv f (f a) = a" for total bijections.
   988 
   989 * Abstract locales semigroup, abel_semigroup, semilattice,
   990 semilattice_neutr, ordering, ordering_top, semilattice_order,
   991 semilattice_neutr_order, comm_monoid_set, semilattice_set,
   992 semilattice_neutr_set, semilattice_order_set,
   993 semilattice_order_neutr_set monoid_list, comm_monoid_list,
   994 comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified
   995 syntax uniformly that does not clash with corresponding global syntax.
   996 INCOMPATIBILITY.
   997 
   998 * Former locale lifting_syntax is now a bundle, which is easier to
   999 include in a local context or theorem statement, e.g. "context includes
  1000 lifting_syntax begin ... end". Minor INCOMPATIBILITY.
  1001 
  1002 * Some old / obsolete theorems have been renamed / removed, potential
  1003 INCOMPATIBILITY.
  1004 
  1005   nat_less_cases  --  removed, use linorder_cases instead
  1006   inv_image_comp  --  removed, use image_inv_f_f instead
  1007   image_surj_f_inv_f  ~>  image_f_inv_f
  1008 
  1009 * Some theorems about groups and orders have been generalised from
  1010   groups to semi-groups that are also monoids:
  1011     le_add_same_cancel1
  1012     le_add_same_cancel2
  1013     less_add_same_cancel1
  1014     less_add_same_cancel2
  1015     add_le_same_cancel1
  1016     add_le_same_cancel2
  1017     add_less_same_cancel1
  1018     add_less_same_cancel2
  1019 
  1020 * Some simplifications theorems about rings have been removed, since
  1021   superseeded by a more general version:
  1022     less_add_cancel_left_greater_zero ~> less_add_same_cancel1
  1023     less_add_cancel_right_greater_zero ~> less_add_same_cancel2
  1024     less_eq_add_cancel_left_greater_eq_zero ~> le_add_same_cancel1
  1025     less_eq_add_cancel_right_greater_eq_zero ~> le_add_same_cancel2
  1026     less_eq_add_cancel_left_less_eq_zero ~> add_le_same_cancel1
  1027     less_eq_add_cancel_right_less_eq_zero ~> add_le_same_cancel2
  1028     less_add_cancel_left_less_zero ~> add_less_same_cancel1
  1029     less_add_cancel_right_less_zero ~> add_less_same_cancel2
  1030 INCOMPATIBILITY.
  1031 
  1032 * Renamed split_if -> if_split and split_if_asm -> if_split_asm to
  1033 resemble the f.split naming convention, INCOMPATIBILITY.
  1034 
  1035 * Added class topological_monoid.
  1036 
  1037 * The following theorems have been renamed:
  1038 
  1039   setsum_left_distrib ~> sum_distrib_right
  1040   setsum_right_distrib ~> sum_distrib_left
  1041 
  1042 INCOMPATIBILITY.
  1043 
  1044 * Compound constants INFIMUM and SUPREMUM are mere abbreviations now.
  1045 INCOMPATIBILITY.
  1046 
  1047 * "Gcd (f ` A)" and "Lcm (f ` A)" are printed with optional
  1048 comprehension-like syntax analogously to "Inf (f ` A)" and "Sup (f `
  1049 A)".
  1050 
  1051 * Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY.
  1052 
  1053 * The type class ordered_comm_monoid_add is now called
  1054 ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add
  1055 is introduced as the combination of ordered_ab_semigroup_add +
  1056 comm_monoid_add. INCOMPATIBILITY.
  1057 
  1058 * Introduced the type classes canonically_ordered_comm_monoid_add and
  1059 dioid.
  1060 
  1061 * Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When
  1062 instantiating linordered_semiring_strict and ordered_ab_group_add, an
  1063 explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might
  1064 be required. INCOMPATIBILITY.
  1065 
  1066 * Dropped various legacy fact bindings, whose replacements are often
  1067 of a more general type also:
  1068   lcm_left_commute_nat ~> lcm.left_commute
  1069   lcm_left_commute_int ~> lcm.left_commute
  1070   gcd_left_commute_nat ~> gcd.left_commute
  1071   gcd_left_commute_int ~> gcd.left_commute
  1072   gcd_greatest_iff_nat ~> gcd_greatest_iff
  1073   gcd_greatest_iff_int ~> gcd_greatest_iff
  1074   coprime_dvd_mult_nat ~> coprime_dvd_mult
  1075   coprime_dvd_mult_int ~> coprime_dvd_mult
  1076   zpower_numeral_even ~> power_numeral_even
  1077   gcd_mult_cancel_nat ~> gcd_mult_cancel
  1078   gcd_mult_cancel_int ~> gcd_mult_cancel
  1079   div_gcd_coprime_nat ~> div_gcd_coprime
  1080   div_gcd_coprime_int ~> div_gcd_coprime
  1081   zpower_numeral_odd ~> power_numeral_odd
  1082   zero_less_int_conv ~> of_nat_0_less_iff
  1083   gcd_greatest_nat ~> gcd_greatest
  1084   gcd_greatest_int ~> gcd_greatest
  1085   coprime_mult_nat ~> coprime_mult
  1086   coprime_mult_int ~> coprime_mult
  1087   lcm_commute_nat ~> lcm.commute
  1088   lcm_commute_int ~> lcm.commute
  1089   int_less_0_conv ~> of_nat_less_0_iff
  1090   gcd_commute_nat ~> gcd.commute
  1091   gcd_commute_int ~> gcd.commute
  1092   Gcd_insert_nat ~> Gcd_insert
  1093   Gcd_insert_int ~> Gcd_insert
  1094   of_int_int_eq ~> of_int_of_nat_eq
  1095   lcm_least_nat ~> lcm_least
  1096   lcm_least_int ~> lcm_least
  1097   lcm_assoc_nat ~> lcm.assoc
  1098   lcm_assoc_int ~> lcm.assoc
  1099   int_le_0_conv ~> of_nat_le_0_iff
  1100   int_eq_0_conv ~> of_nat_eq_0_iff
  1101   Gcd_empty_nat ~> Gcd_empty
  1102   Gcd_empty_int ~> Gcd_empty
  1103   gcd_assoc_nat ~> gcd.assoc
  1104   gcd_assoc_int ~> gcd.assoc
  1105   zero_zle_int ~> of_nat_0_le_iff
  1106   lcm_dvd2_nat ~> dvd_lcm2
  1107   lcm_dvd2_int ~> dvd_lcm2
  1108   lcm_dvd1_nat ~> dvd_lcm1
  1109   lcm_dvd1_int ~> dvd_lcm1
  1110   gcd_zero_nat ~> gcd_eq_0_iff
  1111   gcd_zero_int ~> gcd_eq_0_iff
  1112   gcd_dvd2_nat ~> gcd_dvd2
  1113   gcd_dvd2_int ~> gcd_dvd2
  1114   gcd_dvd1_nat ~> gcd_dvd1
  1115   gcd_dvd1_int ~> gcd_dvd1
  1116   int_numeral ~> of_nat_numeral
  1117   lcm_ac_nat ~> ac_simps
  1118   lcm_ac_int ~> ac_simps
  1119   gcd_ac_nat ~> ac_simps
  1120   gcd_ac_int ~> ac_simps
  1121   abs_int_eq ~> abs_of_nat
  1122   zless_int ~> of_nat_less_iff
  1123   zdiff_int ~> of_nat_diff
  1124   zadd_int ~> of_nat_add
  1125   int_mult ~> of_nat_mult
  1126   int_Suc ~> of_nat_Suc
  1127   inj_int ~> inj_of_nat
  1128   int_1 ~> of_nat_1
  1129   int_0 ~> of_nat_0
  1130   Lcm_empty_nat ~> Lcm_empty
  1131   Lcm_empty_int ~> Lcm_empty
  1132   Lcm_insert_nat ~> Lcm_insert
  1133   Lcm_insert_int ~> Lcm_insert
  1134   comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd
  1135   comp_fun_idem_gcd_int ~> comp_fun_idem_gcd
  1136   comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm
  1137   comp_fun_idem_lcm_int ~> comp_fun_idem_lcm
  1138   Lcm_eq_0 ~> Lcm_eq_0_I
  1139   Lcm0_iff ~> Lcm_0_iff
  1140   Lcm_dvd_int ~> Lcm_least
  1141   divides_mult_nat ~> divides_mult
  1142   divides_mult_int ~> divides_mult
  1143   lcm_0_nat ~> lcm_0_right
  1144   lcm_0_int ~> lcm_0_right
  1145   lcm_0_left_nat ~> lcm_0_left
  1146   lcm_0_left_int ~> lcm_0_left
  1147   dvd_gcd_D1_nat ~> dvd_gcdD1
  1148   dvd_gcd_D1_int ~> dvd_gcdD1
  1149   dvd_gcd_D2_nat ~> dvd_gcdD2
  1150   dvd_gcd_D2_int ~> dvd_gcdD2
  1151   coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff
  1152   coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff
  1153   realpow_minus_mult ~> power_minus_mult
  1154   realpow_Suc_le_self ~> power_Suc_le_self
  1155   dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest
  1156 INCOMPATIBILITY.
  1157 
  1158 * Renamed HOL/Quotient_Examples/FSet.thy to
  1159 HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY.
  1160 
  1161 * Session HOL-Library: theory FinFun bundles "finfun_syntax" and
  1162 "no_finfun_syntax" allow to control optional syntax in local contexts;
  1163 this supersedes former theory FinFun_Syntax. INCOMPATIBILITY, e.g. use
  1164 "unbundle finfun_syntax" to imitate import of
  1165 "~~/src/HOL/Library/FinFun_Syntax".
  1166 
  1167 * Session HOL-Library: theory Multiset_Permutations (executably) defines
  1168 the set of permutations of a given set or multiset, i.e. the set of all
  1169 lists that contain every element of the carrier (multi-)set exactly
  1170 once.
  1171 
  1172 * Session HOL-Library: multiset membership is now expressed using
  1173 set_mset rather than count.
  1174 
  1175   - Expressions "count M a > 0" and similar simplify to membership
  1176     by default.
  1177 
  1178   - Converting between "count M a = 0" and non-membership happens using
  1179     equations count_eq_zero_iff and not_in_iff.
  1180 
  1181   - Rules count_inI and in_countE obtain facts of the form
  1182     "count M a = n" from membership.
  1183 
  1184   - Rules count_in_diffI and in_diff_countE obtain facts of the form
  1185     "count M a = n + count N a" from membership on difference sets.
  1186 
  1187 INCOMPATIBILITY.
  1188 
  1189 * Session HOL-Library: theory LaTeXsugar uses new-style "dummy_pats" for
  1190 displaying equations in functional programming style --- variables
  1191 present on the left-hand but not on the righ-hand side are replaced by
  1192 underscores.
  1193 
  1194 * Session HOL-Library: theory Combinator_PER provides combinator to
  1195 build partial equivalence relations from a predicate and an equivalence
  1196 relation.
  1197 
  1198 * Session HOL-Library: theory Perm provides basic facts about almost
  1199 everywhere fix bijections.
  1200 
  1201 * Session HOL-Library: theory Normalized_Fraction allows viewing an
  1202 element of a field of fractions as a normalized fraction (i.e. a pair of
  1203 numerator and denominator such that the two are coprime and the
  1204 denominator is normalized wrt. unit factors).
  1205 
  1206 * Session HOL-NSA has been renamed to HOL-Nonstandard_Analysis.
  1207 
  1208 * Session HOL-Multivariate_Analysis has been renamed to HOL-Analysis.
  1209 
  1210 * Session HOL-Analysis: measure theory has been moved here from
  1211 HOL-Probability. When importing HOL-Analysis some theorems need
  1212 additional name spaces prefixes due to name clashes. INCOMPATIBILITY.
  1213 
  1214 * Session HOL-Analysis: more complex analysis including Cauchy's
  1215 inequality, Liouville theorem, open mapping theorem, maximum modulus
  1216 principle, Residue theorem, Schwarz Lemma.
  1217 
  1218 * Session HOL-Analysis: Theory of polyhedra: faces, extreme points,
  1219 polytopes, and the Krein–Milman Minkowski theorem.
  1220 
  1221 * Session HOL-Analysis: Numerous results ported from the HOL Light
  1222 libraries: homeomorphisms, continuous function extensions, invariance of
  1223 domain.
  1224 
  1225 * Session HOL-Probability: the type of emeasure and nn_integral was
  1226 changed from ereal to ennreal, INCOMPATIBILITY.
  1227 
  1228   emeasure :: 'a measure \<Rightarrow> 'a set \<Rightarrow> ennreal
  1229   nn_integral :: 'a measure \<Rightarrow> ('a \<Rightarrow> ennreal) \<Rightarrow> ennreal
  1230 
  1231 * Session HOL-Probability: Code generation and QuickCheck for
  1232 Probability Mass Functions.
  1233 
  1234 * Session HOL-Probability: theory Random_Permutations contains some
  1235 theory about choosing a permutation of a set uniformly at random and
  1236 folding over a list in random order.
  1237 
  1238 * Session HOL-Probability: theory SPMF formalises discrete
  1239 subprobability distributions.
  1240 
  1241 * Session HOL-Library: the names of multiset theorems have been
  1242 normalised to distinguish which ordering the theorems are about
  1243 
  1244     mset_less_eqI ~> mset_subset_eqI
  1245     mset_less_insertD ~> mset_subset_insertD
  1246     mset_less_eq_count ~> mset_subset_eq_count
  1247     mset_less_diff_self ~> mset_subset_diff_self
  1248     mset_le_exists_conv ~> mset_subset_eq_exists_conv
  1249     mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel
  1250     mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel
  1251     mset_le_mono_add ~> mset_subset_eq_mono_add
  1252     mset_le_add_left ~> mset_subset_eq_add_left
  1253     mset_le_add_right ~> mset_subset_eq_add_right
  1254     mset_le_single ~> mset_subset_eq_single
  1255     mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute
  1256     diff_le_self ~> diff_subset_eq_self
  1257     mset_leD ~> mset_subset_eqD
  1258     mset_lessD ~> mset_subsetD
  1259     mset_le_insertD ~> mset_subset_eq_insertD
  1260     mset_less_of_empty ~> mset_subset_of_empty
  1261     mset_less_size ~> mset_subset_size
  1262     wf_less_mset_rel ~> wf_subset_mset_rel
  1263     count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq
  1264     mset_remdups_le ~> mset_remdups_subset_eq
  1265     ms_lesseq_impl ~> subset_eq_mset_impl
  1266 
  1267 Some functions have been renamed:
  1268     ms_lesseq_impl -> subset_eq_mset_impl
  1269 
  1270 * HOL-Library: multisets are now ordered with the multiset ordering
  1271     #\<subseteq># ~> \<le>
  1272     #\<subset># ~> <
  1273     le_multiset ~> less_eq_multiset
  1274     less_multiset ~> le_multiset
  1275 INCOMPATIBILITY.
  1276 
  1277 * Session HOL-Library: the prefix multiset_order has been discontinued:
  1278 the theorems can be directly accessed. As a consequence, the lemmas
  1279 "order_multiset" and "linorder_multiset" have been discontinued, and the
  1280 interpretations "multiset_linorder" and "multiset_wellorder" have been
  1281 replaced by instantiations. INCOMPATIBILITY.
  1282 
  1283 * Session HOL-Library: some theorems about the multiset ordering have
  1284 been renamed:
  1285 
  1286     le_multiset_def ~> less_eq_multiset_def
  1287     less_multiset_def ~> le_multiset_def
  1288     less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset
  1289     mult_less_not_refl ~> mset_le_not_refl
  1290     mult_less_trans ~> mset_le_trans
  1291     mult_less_not_sym ~> mset_le_not_sym
  1292     mult_less_asym ~> mset_le_asym
  1293     mult_less_irrefl ~> mset_le_irrefl
  1294     union_less_mono2{,1,2} ~> union_le_mono2{,1,2}
  1295 
  1296     le_multiset\<^sub>H\<^sub>O ~> less_eq_multiset\<^sub>H\<^sub>O
  1297     le_multiset_total ~> less_eq_multiset_total
  1298     less_multiset_right_total ~> subset_eq_imp_le_multiset
  1299     le_multiset_empty_left ~> less_eq_multiset_empty_left
  1300     le_multiset_empty_right ~> less_eq_multiset_empty_right
  1301     less_multiset_empty_right ~> le_multiset_empty_left
  1302     less_multiset_empty_left ~> le_multiset_empty_right
  1303     union_less_diff_plus ~> union_le_diff_plus
  1304     ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset
  1305     less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty
  1306     le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty
  1307 INCOMPATIBILITY.
  1308 
  1309 * Session HOL-Library: the lemma mset_map has now the attribute [simp].
  1310 INCOMPATIBILITY.
  1311 
  1312 * Session HOL-Library: some theorems about multisets have been removed.
  1313 INCOMPATIBILITY, use the following replacements:
  1314 
  1315     le_multiset_plus_plus_left_iff ~> add_less_cancel_right
  1316     less_multiset_plus_plus_left_iff ~> add_less_cancel_right
  1317     le_multiset_plus_plus_right_iff ~> add_less_cancel_left
  1318     less_multiset_plus_plus_right_iff ~> add_less_cancel_left
  1319     add_eq_self_empty_iff ~> add_cancel_left_right
  1320     mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right
  1321     mset_less_add_bothsides ~> subset_mset.add_less_cancel_right
  1322     mset_le_add_bothsides ~> subset_mset.add_less_cancel_right
  1323     empty_inter ~> subset_mset.inf_bot_left
  1324     inter_empty ~> subset_mset.inf_bot_right
  1325     empty_sup ~> subset_mset.sup_bot_left
  1326     sup_empty ~> subset_mset.sup_bot_right
  1327     bdd_below_multiset ~> subset_mset.bdd_above_bot
  1328     subset_eq_empty ~> subset_mset.le_zero_eq
  1329     le_empty ~> subset_mset.le_zero_eq
  1330     mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero
  1331     mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero
  1332 
  1333 * Session HOL-Library: some typeclass constraints about multisets have
  1334 been reduced from ordered or linordered to preorder. Multisets have the
  1335 additional typeclasses order_bot, no_top,
  1336 ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add,
  1337 linordered_cancel_ab_semigroup_add, and
  1338 ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY.
  1339 
  1340 * Session HOL-Library: there are some new simplification rules about
  1341 multisets, the multiset ordering, and the subset ordering on multisets.
  1342 INCOMPATIBILITY.
  1343 
  1344 * Session HOL-Library: the subset ordering on multisets has now the
  1345 interpretations ordered_ab_semigroup_monoid_add_imp_le and
  1346 bounded_lattice_bot. INCOMPATIBILITY.
  1347 
  1348 * Session HOL-Library, theory Multiset: single has been removed in favor
  1349 of add_mset that roughly corresponds to Set.insert. Some theorems have
  1350 removed or changed:
  1351 
  1352   single_not_empty ~> add_mset_not_empty or empty_not_add_mset
  1353   fold_mset_insert ~> fold_mset_add_mset
  1354   image_mset_insert ~> image_mset_add_mset
  1355   union_single_eq_diff
  1356   multi_self_add_other_not_self
  1357   diff_single_eq_union
  1358 INCOMPATIBILITY.
  1359 
  1360 * Session HOL-Library, theory Multiset: some theorems have been changed
  1361 to use add_mset instead of single:
  1362 
  1363   mset_add
  1364   multi_self_add_other_not_self
  1365   diff_single_eq_union
  1366   union_single_eq_diff
  1367   union_single_eq_member
  1368   add_eq_conv_diff
  1369   insert_noteq_member
  1370   add_eq_conv_ex
  1371   multi_member_split
  1372   multiset_add_sub_el_shuffle
  1373   mset_subset_eq_insertD
  1374   mset_subset_insertD
  1375   insert_subset_eq_iff
  1376   insert_union_subset_iff
  1377   multi_psub_of_add_self
  1378   inter_add_left1
  1379   inter_add_left2
  1380   inter_add_right1
  1381   inter_add_right2
  1382   sup_union_left1
  1383   sup_union_left2
  1384   sup_union_right1
  1385   sup_union_right2
  1386   size_eq_Suc_imp_eq_union
  1387   multi_nonempty_split
  1388   mset_insort
  1389   mset_update
  1390   mult1I
  1391   less_add
  1392   mset_zip_take_Cons_drop_twice
  1393   rel_mset_Zero
  1394   msed_map_invL
  1395   msed_map_invR
  1396   msed_rel_invL
  1397   msed_rel_invR
  1398   le_multiset_right_total
  1399   multiset_induct
  1400   multiset_induct2_size
  1401   multiset_induct2
  1402 INCOMPATIBILITY.
  1403 
  1404 * Session HOL-Library, theory Multiset: the definitions of some
  1405 constants have changed to use add_mset instead of adding a single
  1406 element:
  1407 
  1408   image_mset
  1409   mset
  1410   replicate_mset
  1411   mult1
  1412   pred_mset
  1413   rel_mset'
  1414   mset_insort
  1415 
  1416 INCOMPATIBILITY.
  1417 
  1418 * Session HOL-Library, theory Multiset: due to the above changes, the
  1419 attributes of some multiset theorems have been changed:
  1420 
  1421   insert_DiffM  [] ~> [simp]
  1422   insert_DiffM2 [simp] ~> []
  1423   diff_add_mset_swap [simp]
  1424   fold_mset_add_mset [simp]
  1425   diff_diff_add [simp] (for multisets only)
  1426   diff_cancel [simp] ~> []
  1427   count_single [simp] ~> []
  1428   set_mset_single [simp] ~> []
  1429   size_multiset_single [simp] ~> []
  1430   size_single [simp] ~> []
  1431   image_mset_single [simp] ~> []
  1432   mset_subset_eq_mono_add_right_cancel [simp] ~> []
  1433   mset_subset_eq_mono_add_left_cancel [simp] ~> []
  1434   fold_mset_single [simp] ~> []
  1435   subset_eq_empty [simp] ~> []
  1436   empty_sup [simp] ~> []
  1437   sup_empty [simp] ~> []
  1438   inter_empty [simp] ~> []
  1439   empty_inter [simp] ~> []
  1440 INCOMPATIBILITY.
  1441 
  1442 * Session HOL-Library, theory Multiset: the order of the variables in
  1443 the second cases of multiset_induct, multiset_induct2_size,
  1444 multiset_induct2 has been changed (e.g. Add A a ~> Add a A).
  1445 INCOMPATIBILITY.
  1446 
  1447 * Session HOL-Library, theory Multiset: there is now a simplification
  1448 procedure on multisets. It mimics the behavior of the procedure on
  1449 natural numbers. INCOMPATIBILITY.
  1450 
  1451 * Session HOL-Library, theory Multiset: renamed sums and products of
  1452 multisets:
  1453 
  1454   msetsum ~> sum_mset
  1455   msetprod ~> prod_mset
  1456 
  1457 * Session HOL-Library, theory Multiset: the notation for intersection
  1458 and union of multisets have been changed:
  1459 
  1460   #\<inter> ~> \<inter>#
  1461   #\<union> ~> \<union>#
  1462 
  1463 INCOMPATIBILITY.
  1464 
  1465 * Session HOL-Library, theory Multiset: the lemma
  1466 one_step_implies_mult_aux on multisets has been removed, use
  1467 one_step_implies_mult instead. INCOMPATIBILITY.
  1468 
  1469 * Session HOL-Library: theory Complete_Partial_Order2 provides reasoning
  1470 support for monotonicity and continuity in chain-complete partial orders
  1471 and about admissibility conditions for fixpoint inductions.
  1472 
  1473 * Session HOL-Library: theory Library/Polynomial contains also
  1474 derivation of polynomials (formerly in Library/Poly_Deriv) but not
  1475 gcd/lcm on polynomials over fields. This has been moved to a separate
  1476 theory Library/Polynomial_GCD_euclidean.thy, to pave way for a possible
  1477 future different type class instantiation for polynomials over factorial
  1478 rings. INCOMPATIBILITY.
  1479 
  1480 * Session HOL-Library: theory Sublist provides function "prefixes" with
  1481 the following renaming
  1482 
  1483   prefixeq -> prefix
  1484   prefix -> strict_prefix
  1485   suffixeq -> suffix
  1486   suffix -> strict_suffix
  1487 
  1488 Added theory of longest common prefixes.
  1489 
  1490 * Session HOL-Number_Theory: algebraic foundation for primes:
  1491 Generalisation of predicate "prime" and introduction of predicates
  1492 "prime_elem", "irreducible", a "prime_factorization" function, and the
  1493 "factorial_ring" typeclass with instance proofs for nat, int, poly. Some
  1494 theorems now have different names, most notably "prime_def" is now
  1495 "prime_nat_iff". INCOMPATIBILITY.
  1496 
  1497 * Session Old_Number_Theory has been removed, after porting remaining
  1498 theories.
  1499 
  1500 * Session HOL-Types_To_Sets provides an experimental extension of
  1501 Higher-Order Logic to allow translation of types to sets.
  1502 
  1503 
  1504 *** ML ***
  1505 
  1506 * Integer.gcd and Integer.lcm use efficient operations from the Poly/ML
  1507 library (notably for big integers). Subtle change of semantics:
  1508 Integer.gcd and Integer.lcm both normalize the sign, results are never
  1509 negative. This coincides with the definitions in HOL/GCD.thy.
  1510 INCOMPATIBILITY.
  1511 
  1512 * Structure Rat for rational numbers is now an integral part of
  1513 Isabelle/ML, with special notation @int/nat or @int for numerals (an
  1514 abbreviation for antiquotation @{Pure.rat argument}) and ML pretty
  1515 printing. Standard operations on type Rat.rat are provided via ad-hoc
  1516 overloading of + - * / < <= > >= ~ abs. INCOMPATIBILITY, need to
  1517 use + instead of +/ etc. Moreover, exception Rat.DIVZERO has been
  1518 superseded by General.Div.
  1519 
  1520 * ML antiquotation @{path} is superseded by @{file}, which ensures that
  1521 the argument is a plain file. Minor INCOMPATIBILITY.
  1522 
  1523 * Antiquotation @{make_string} is available during Pure bootstrap --
  1524 with approximative output quality.
  1525 
  1526 * Low-level ML system structures (like PolyML and RunCall) are no longer
  1527 exposed to Isabelle/ML user-space. Potential INCOMPATIBILITY.
  1528 
  1529 * The ML function "ML" provides easy access to run-time compilation.
  1530 This is particularly useful for conditional compilation, without
  1531 requiring separate files.
  1532 
  1533 * Option ML_exception_debugger controls detailed exception trace via the
  1534 Poly/ML debugger. Relevant ML modules need to be compiled beforehand
  1535 with ML_file_debug, or with ML_file and option ML_debugger enabled. Note
  1536 debugger information requires consirable time and space: main
  1537 Isabelle/HOL with full debugger support may need ML_system_64.
  1538 
  1539 * Local_Theory.restore has been renamed to Local_Theory.reset to
  1540 emphasize its disruptive impact on the cumulative context, notably the
  1541 scope of 'private' or 'qualified' names. Note that Local_Theory.reset is
  1542 only appropriate when targets are managed, e.g. starting from a global
  1543 theory and returning to it. Regular definitional packages should use
  1544 balanced blocks of Local_Theory.open_target versus
  1545 Local_Theory.close_target instead. Rare INCOMPATIBILITY.
  1546 
  1547 * Structure TimeLimit (originally from the SML/NJ library) has been
  1548 replaced by structure Timeout, with slightly different signature.
  1549 INCOMPATIBILITY.
  1550 
  1551 * Discontinued cd and pwd operations, which are not well-defined in a
  1552 multi-threaded environment. Note that files are usually located
  1553 relatively to the master directory of a theory (see also
  1554 File.full_path). Potential INCOMPATIBILITY.
  1555 
  1556 * Binding.empty_atts supersedes Thm.empty_binding and
  1557 Attrib.empty_binding. Minor INCOMPATIBILITY.
  1558 
  1559 
  1560 *** System ***
  1561 
  1562 * SML/NJ and old versions of Poly/ML are no longer supported.
  1563 
  1564 * Poly/ML heaps now follow the hierarchy of sessions, and thus require
  1565 much less disk space.
  1566 
  1567 * The Isabelle ML process is now managed directly by Isabelle/Scala, and
  1568 shell scripts merely provide optional command-line access. In
  1569 particular:
  1570 
  1571   . Scala module ML_Process to connect to the raw ML process,
  1572     with interaction via stdin/stdout/stderr or in batch mode;
  1573   . command-line tool "isabelle console" as interactive wrapper;
  1574   . command-line tool "isabelle process" as batch mode wrapper.
  1575 
  1576 * The executable "isabelle_process" has been discontinued. Tools and
  1577 prover front-ends should use ML_Process or Isabelle_Process in
  1578 Isabelle/Scala. INCOMPATIBILITY.
  1579 
  1580 * New command-line tool "isabelle process" supports ML evaluation of
  1581 literal expressions (option -e) or files (option -f) in the context of a
  1582 given heap image. Errors lead to premature exit of the ML process with
  1583 return code 1.
  1584 
  1585 * The command-line tool "isabelle build" supports option -N for cyclic
  1586 shuffling of NUMA CPU nodes. This may help performance tuning on Linux
  1587 servers with separate CPU/memory modules.
  1588 
  1589 * System option "threads" (for the size of the Isabelle/ML thread farm)
  1590 is also passed to the underlying ML runtime system as --gcthreads,
  1591 unless there is already a default provided via ML_OPTIONS settings.
  1592 
  1593 * System option "checkpoint" helps to fine-tune the global heap space
  1594 management of isabelle build. This is relevant for big sessions that may
  1595 exhaust the small 32-bit address space of the ML process (which is used
  1596 by default).
  1597 
  1598 * System option "profiling" specifies the mode for global ML profiling
  1599 in "isabelle build". Possible values are "time", "allocations". The
  1600 command-line tool "isabelle profiling_report" helps to digest the
  1601 resulting log files.
  1602 
  1603 * System option "ML_process_policy" specifies an optional command prefix
  1604 for the underlying ML process, e.g. to control CPU affinity on
  1605 multiprocessor systems. The "isabelle jedit" tool allows to override the
  1606 implicit default via option -p.
  1607 
  1608 * Command-line tool "isabelle console" provides option -r to help to
  1609 bootstrapping Isabelle/Pure interactively.
  1610 
  1611 * Command-line tool "isabelle yxml" has been discontinued.
  1612 INCOMPATIBILITY, use operations from the modules "XML" and "YXML" in
  1613 Isabelle/ML or Isabelle/Scala.
  1614 
  1615 * Many Isabelle tools that require a Java runtime system refer to the
  1616 settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64,
  1617 depending on the underlying platform. The settings for "isabelle build"
  1618 ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been
  1619 discontinued. Potential INCOMPATIBILITY.
  1620 
  1621 * The Isabelle system environment always ensures that the main
  1622 executables are found within the shell search $PATH: "isabelle" and
  1623 "isabelle_scala_script".
  1624 
  1625 * Isabelle tools may consist of .scala files: the Scala compiler is
  1626 invoked on the spot. The source needs to define some object that extends
  1627 Isabelle_Tool.Body.
  1628 
  1629 * File.bash_string, File.bash_path etc. represent Isabelle/ML and
  1630 Isabelle/Scala strings authentically within GNU bash. This is useful to
  1631 produce robust shell scripts under program control, without worrying
  1632 about spaces or special characters. Note that user output works via
  1633 Path.print (ML) or Path.toString (Scala). INCOMPATIBILITY, the old (and
  1634 less versatile) operations File.shell_quote, File.shell_path etc. have
  1635 been discontinued.
  1636 
  1637 * The isabelle_java executable allows to run a Java process within the
  1638 name space of Java and Scala components that are bundled with Isabelle,
  1639 but without the Isabelle settings environment.
  1640 
  1641 * Isabelle/Scala: the SSH module supports ssh and sftp connections, for
  1642 remote command-execution and file-system access. This resembles
  1643 operations from module File and Isabelle_System to some extent. Note
  1644 that Path specifications need to be resolved remotely via
  1645 ssh.remote_path instead of File.standard_path: the implicit process
  1646 environment is different, Isabelle settings are not available remotely.
  1647 
  1648 * Isabelle/Scala: the Mercurial module supports repositories via the
  1649 regular hg command-line interface. The repositroy clone and working
  1650 directory may reside on a local or remote file-system (via ssh
  1651 connection).
  1652 
  1653 
  1654 
  1655 New in Isabelle2016 (February 2016)
  1656 -----------------------------------
  1657 
  1658 *** General ***
  1659 
  1660 * Eisbach is now based on Pure instead of HOL. Objects-logics may import
  1661 either the theory ~~/src/HOL/Eisbach/Eisbach (for HOL etc.) or
  1662 ~~/src/HOL/Eisbach/Eisbach_Old_Appl_Syntax (for FOL, ZF etc.). Note that
  1663 the HOL-Eisbach session located in ~~/src/HOL/Eisbach/ contains further
  1664 examples that do require HOL.
  1665 
  1666 * Better resource usage on all platforms (Linux, Windows, Mac OS X) for
  1667 both Isabelle/ML and Isabelle/Scala.  Slightly reduced heap space usage.
  1668 
  1669 * Former "xsymbols" syntax with Isabelle symbols is used by default,
  1670 without any special print mode. Important ASCII replacement syntax
  1671 remains available under print mode "ASCII", but less important syntax
  1672 has been removed (see below).
  1673 
  1674 * Support for more arrow symbols, with rendering in LaTeX and Isabelle
  1675 fonts: \<Lleftarrow> \<Rrightarrow> \<longlongleftarrow> \<longlongrightarrow> \<longlonglongleftarrow> \<longlonglongrightarrow>.
  1676 
  1677 * Special notation \<struct> for the first implicit 'structure' in the
  1678 context has been discontinued. Rare INCOMPATIBILITY, use explicit
  1679 structure name instead, notably in indexed notation with block-subscript
  1680 (e.g. \<odot>\<^bsub>A\<^esub>).
  1681 
  1682 * The glyph for \<diamond> in the IsabelleText font now corresponds better to its
  1683 counterpart \<box> as quantifier-like symbol. A small diamond is available as
  1684 \<diamondop>; the old symbol \<struct> loses this rendering and any special
  1685 meaning.
  1686 
  1687 * Syntax for formal comments "-- text" now also supports the symbolic
  1688 form "\<comment> text". Command-line tool "isabelle update_cartouches -c" helps
  1689 to update old sources.
  1690 
  1691 * Toplevel theorem statements have been simplified as follows:
  1692 
  1693   theorems             ~>  lemmas
  1694   schematic_lemma      ~>  schematic_goal
  1695   schematic_theorem    ~>  schematic_goal
  1696   schematic_corollary  ~>  schematic_goal
  1697 
  1698 Command-line tool "isabelle update_theorems" updates theory sources
  1699 accordingly.
  1700 
  1701 * Toplevel theorem statement 'proposition' is another alias for
  1702 'theorem'.
  1703 
  1704 * The old 'defs' command has been removed (legacy since Isabelle2014).
  1705 INCOMPATIBILITY, use regular 'definition' instead. Overloaded and/or
  1706 deferred definitions require a surrounding 'overloading' block.
  1707 
  1708 
  1709 *** Prover IDE -- Isabelle/Scala/jEdit ***
  1710 
  1711 * IDE support for the source-level debugger of Poly/ML, to work with
  1712 Isabelle/ML and official Standard ML. Option "ML_debugger" and commands
  1713 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',
  1714 'SML_file_no_debug' control compilation of sources with or without
  1715 debugging information. The Debugger panel allows to set breakpoints (via
  1716 context menu), step through stopped threads, evaluate local ML
  1717 expressions etc. At least one Debugger view needs to be active to have
  1718 any effect on the running ML program.
  1719 
  1720 * The State panel manages explicit proof state output, with dynamic
  1721 auto-update according to cursor movement. Alternatively, the jEdit
  1722 action "isabelle.update-state" (shortcut S+ENTER) triggers manual
  1723 update.
  1724 
  1725 * The Output panel no longer shows proof state output by default, to
  1726 avoid GUI overcrowding. INCOMPATIBILITY, use the State panel instead or
  1727 enable option "editor_output_state".
  1728 
  1729 * The text overview column (status of errors, warnings etc.) is updated
  1730 asynchronously, leading to much better editor reactivity. Moreover, the
  1731 full document node content is taken into account. The width of the
  1732 column is scaled according to the main text area font, for improved
  1733 visibility.
  1734 
  1735 * The main text area no longer changes its color hue in outdated
  1736 situations. The text overview column takes over the role to indicate
  1737 unfinished edits in the PIDE pipeline. This avoids flashing text display
  1738 due to ad-hoc updates by auxiliary GUI components, such as the State
  1739 panel.
  1740 
  1741 * Slightly improved scheduling for urgent print tasks (e.g. command
  1742 state output, interactive queries) wrt. long-running background tasks.
  1743 
  1744 * Completion of symbols via prefix of \<name> or \<^name> or \name is
  1745 always possible, independently of the language context. It is never
  1746 implicit: a popup will show up unconditionally.
  1747 
  1748 * Additional abbreviations for syntactic completion may be specified in
  1749 $ISABELLE_HOME/etc/abbrevs and $ISABELLE_HOME_USER/etc/abbrevs, with
  1750 support for simple templates using ASCII 007 (bell) as placeholder.
  1751 
  1752 * Symbols \<oplus>, \<Oplus>, \<otimes>, \<Otimes>, \<odot>, \<Odot>, \<ominus>, \<oslash> no longer provide abbreviations for
  1753 completion like "+o", "*o", ".o" etc. -- due to conflicts with other
  1754 ASCII syntax. INCOMPATIBILITY, use plain backslash-completion or define
  1755 suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.
  1756 
  1757 * Action "isabelle-emph" (with keyboard shortcut C+e LEFT) controls
  1758 emphasized text style; the effect is visible in document output, not in
  1759 the editor.
  1760 
  1761 * Action "isabelle-reset" now uses keyboard shortcut C+e BACK_SPACE,
  1762 instead of former C+e LEFT.
  1763 
  1764 * The command-line tool "isabelle jedit" and the isabelle.Main
  1765 application wrapper treat the default $USER_HOME/Scratch.thy more
  1766 uniformly, and allow the dummy file argument ":" to open an empty buffer
  1767 instead.
  1768 
  1769 * New command-line tool "isabelle jedit_client" allows to connect to an
  1770 already running Isabelle/jEdit process. This achieves the effect of
  1771 single-instance applications seen on common GUI desktops.
  1772 
  1773 * The default look-and-feel for Linux is the traditional "Metal", which
  1774 works better with GUI scaling for very high-resolution displays (e.g.
  1775 4K). Moreover, it is generally more robust than "Nimbus".
  1776 
  1777 * Update to jedit-5.3.0, with improved GUI scaling and support of
  1778 high-resolution displays (e.g. 4K).
  1779 
  1780 * The main Isabelle executable is managed as single-instance Desktop
  1781 application uniformly on all platforms: Linux, Windows, Mac OS X.
  1782 
  1783 
  1784 *** Document preparation ***
  1785 
  1786 * Commands 'paragraph' and 'subparagraph' provide additional section
  1787 headings. Thus there are 6 levels of standard headings, as in HTML.
  1788 
  1789 * Command 'text_raw' has been clarified: input text is processed as in
  1790 'text' (with antiquotations and control symbols). The key difference is
  1791 the lack of the surrounding isabelle markup environment in output.
  1792 
  1793 * Text is structured in paragraphs and nested lists, using notation that
  1794 is similar to Markdown. The control symbols for list items are as
  1795 follows:
  1796 
  1797   \<^item>  itemize
  1798   \<^enum>  enumerate
  1799   \<^descr>  description
  1800 
  1801 * There is a new short form for antiquotations with a single argument
  1802 that is a cartouche: \<^name>\<open>...\<close> is equivalent to @{name \<open>...\<close>} and
  1803 \<open>...\<close> without control symbol is equivalent to @{cartouche \<open>...\<close>}.
  1804 \<^name> without following cartouche is equivalent to @{name}. The
  1805 standard Isabelle fonts provide glyphs to render important control
  1806 symbols, e.g. "\<^verbatim>", "\<^emph>", "\<^bold>".
  1807 
  1808 * Antiquotations @{noindent}, @{smallskip}, @{medskip}, @{bigskip} with
  1809 corresponding control symbols \<^noindent>, \<^smallskip>, \<^medskip>, \<^bigskip> specify spacing formally, using
  1810 standard LaTeX macros of the same names.
  1811 
  1812 * Antiquotation @{cartouche} in Isabelle/Pure is the same as @{text}.
  1813 Consequently, \<open>...\<close> without any decoration prints literal quasi-formal
  1814 text. Command-line tool "isabelle update_cartouches -t" helps to update
  1815 old sources, by approximative patching of the content of string and
  1816 cartouche tokens seen in theory sources.
  1817 
  1818 * The @{text} antiquotation now ignores the antiquotation option
  1819 "source". The given text content is output unconditionally, without any
  1820 surrounding quotes etc. Subtle INCOMPATIBILITY, put quotes into the
  1821 argument where they are really intended, e.g. @{text \<open>"foo"\<close>}. Initial
  1822 or terminal spaces are ignored.
  1823 
  1824 * Antiquotations @{emph} and @{bold} output LaTeX source recursively,
  1825 adding appropriate text style markup. These may be used in the short
  1826 form \<^emph>\<open>...\<close> and \<^bold>\<open>...\<close>.
  1827 
  1828 * Document antiquotation @{footnote} outputs LaTeX source recursively,
  1829 marked as \footnote{}. This may be used in the short form \<^footnote>\<open>...\<close>.
  1830 
  1831 * Antiquotation @{verbatim [display]} supports option "indent".
  1832 
  1833 * Antiquotation @{theory_text} prints uninterpreted theory source text
  1834 (Isar outer syntax with command keywords etc.). This may be used in the
  1835 short form \<^theory_text>\<open>...\<close>. @{theory_text [display]} supports option "indent".
  1836 
  1837 * Antiquotation @{doc ENTRY} provides a reference to the given
  1838 documentation, with a hyperlink in the Prover IDE.
  1839 
  1840 * Antiquotations @{command}, @{method}, @{attribute} print checked
  1841 entities of the Isar language.
  1842 
  1843 * HTML presentation uses the standard IsabelleText font and Unicode
  1844 rendering of Isabelle symbols like Isabelle/Scala/jEdit.  The former
  1845 print mode "HTML" loses its special meaning.
  1846 
  1847 
  1848 *** Isar ***
  1849 
  1850 * Local goals ('have', 'show', 'hence', 'thus') allow structured rule
  1851 statements like fixes/assumes/shows in theorem specifications, but the
  1852 notation is postfix with keywords 'if' (or 'when') and 'for'. For
  1853 example:
  1854 
  1855   have result: "C x y"
  1856     if "A x" and "B y"
  1857     for x :: 'a and y :: 'a
  1858     <proof>
  1859 
  1860 The local assumptions are bound to the name "that". The result is
  1861 exported from context of the statement as usual. The above roughly
  1862 corresponds to a raw proof block like this:
  1863 
  1864   {
  1865     fix x :: 'a and y :: 'a
  1866     assume that: "A x" "B y"
  1867     have "C x y" <proof>
  1868   }
  1869   note result = this
  1870 
  1871 The keyword 'when' may be used instead of 'if', to indicate 'presume'
  1872 instead of 'assume' above.
  1873 
  1874 * Assumptions ('assume', 'presume') allow structured rule statements
  1875 using 'if' and 'for', similar to 'have' etc. above. For example:
  1876 
  1877   assume result: "C x y"
  1878     if "A x" and "B y"
  1879     for x :: 'a and y :: 'a
  1880 
  1881 This assumes "\<And>x y::'a. A x \<Longrightarrow> B y \<Longrightarrow> C x y" and produces a general
  1882 result as usual: "A ?x \<Longrightarrow> B ?y \<Longrightarrow> C ?x ?y".
  1883 
  1884 Vacuous quantification in assumptions is omitted, i.e. a for-context
  1885 only effects propositions according to actual use of variables. For
  1886 example:
  1887 
  1888   assume "A x" and "B y" for x and y
  1889 
  1890 is equivalent to:
  1891 
  1892   assume "\<And>x. A x" and "\<And>y. B y"
  1893 
  1894 * The meaning of 'show' with Pure rule statements has changed: premises
  1895 are treated in the sense of 'assume', instead of 'presume'. This means,
  1896 a goal like "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" can be solved completely as
  1897 follows:
  1898 
  1899   show "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
  1900 
  1901 or:
  1902 
  1903   show "C x" if "A x" "B x" for x
  1904 
  1905 Rare INCOMPATIBILITY, the old behaviour may be recovered as follows:
  1906 
  1907   show "C x" when "A x" "B x" for x
  1908 
  1909 * New command 'consider' states rules for generalized elimination and
  1910 case splitting. This is like a toplevel statement "theorem obtains" used
  1911 within a proof body; or like a multi-branch 'obtain' without activation
  1912 of the local context elements yet.
  1913 
  1914 * Proof method "cases" allows to specify the rule as first entry of
  1915 chained facts.  This is particularly useful with 'consider':
  1916 
  1917   consider (a) A | (b) B | (c) C <proof>
  1918   then have something
  1919   proof cases
  1920     case a
  1921     then show ?thesis <proof>
  1922   next
  1923     case b
  1924     then show ?thesis <proof>
  1925   next
  1926     case c
  1927     then show ?thesis <proof>
  1928   qed
  1929 
  1930 * Command 'case' allows fact name and attribute specification like this:
  1931 
  1932   case a: (c xs)
  1933   case a [attributes]: (c xs)
  1934 
  1935 Facts that are introduced by invoking the case context are uniformly
  1936 qualified by "a"; the same name is used for the cumulative fact. The old
  1937 form "case (c xs) [attributes]" is no longer supported. Rare
  1938 INCOMPATIBILITY, need to adapt uses of case facts in exotic situations,
  1939 and always put attributes in front.
  1940 
  1941 * The standard proof method of commands 'proof' and '..' is now called
  1942 "standard" to make semantically clear what it is; the old name "default"
  1943 is still available as legacy for some time. Documentation now explains
  1944 '..' more accurately as "by standard" instead of "by rule".
  1945 
  1946 * Nesting of Isar goal structure has been clarified: the context after
  1947 the initial backwards refinement is retained for the whole proof, within
  1948 all its context sections (as indicated via 'next'). This is e.g.
  1949 relevant for 'using', 'including', 'supply':
  1950 
  1951   have "A \<and> A" if a: A for A
  1952     supply [simp] = a
  1953   proof
  1954     show A by simp
  1955   next
  1956     show A by simp
  1957   qed
  1958 
  1959 * Command 'obtain' binds term abbreviations (via 'is' patterns) in the
  1960 proof body as well, abstracted over relevant parameters.
  1961 
  1962 * Improved type-inference for theorem statement 'obtains': separate
  1963 parameter scope for of each clause.
  1964 
  1965 * Term abbreviations via 'is' patterns also work for schematic
  1966 statements: result is abstracted over unknowns.
  1967 
  1968 * Command 'subgoal' allows to impose some structure on backward
  1969 refinements, to avoid proof scripts degenerating into long of 'apply'
  1970 sequences. Further explanations and examples are given in the isar-ref
  1971 manual.
  1972 
  1973 * Command 'supply' supports fact definitions during goal refinement
  1974 ('apply' scripts).
  1975 
  1976 * Proof method "goal_cases" turns the current subgoals into cases within
  1977 the context; the conclusion is bound to variable ?case in each case. For
  1978 example:
  1979 
  1980 lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
  1981   and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
  1982 proof goal_cases
  1983   case (1 x)
  1984   then show ?case using \<open>A x\<close> \<open>B x\<close> sorry
  1985 next
  1986   case (2 y z)
  1987   then show ?case using \<open>U y\<close> \<open>V z\<close> sorry
  1988 qed
  1989 
  1990 lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
  1991   and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
  1992 proof goal_cases
  1993   case prems: 1
  1994   then show ?case using prems sorry
  1995 next
  1996   case prems: 2
  1997   then show ?case using prems sorry
  1998 qed
  1999 
  2000 * The undocumented feature of implicit cases goal1, goal2, goal3, etc.
  2001 is marked as legacy, and will be removed eventually. The proof method
  2002 "goals" achieves a similar effect within regular Isar; often it can be
  2003 done more adequately by other means (e.g. 'consider').
  2004 
  2005 * The vacuous fact "TERM x" may be established "by fact" or as `TERM x`
  2006 as well, not just "by this" or "." as before.
  2007 
  2008 * Method "sleep" succeeds after a real-time delay (in seconds). This is
  2009 occasionally useful for demonstration and testing purposes.
  2010 
  2011 
  2012 *** Pure ***
  2013 
  2014 * Qualifiers in locale expressions default to mandatory ('!') regardless
  2015 of the command. Previously, for 'locale' and 'sublocale' the default was
  2016 optional ('?'). The old synatx '!' has been discontinued.
  2017 INCOMPATIBILITY, remove '!' and add '?' as required.
  2018 
  2019 * Keyword 'rewrites' identifies rewrite morphisms in interpretation
  2020 commands. Previously, the keyword was 'where'. INCOMPATIBILITY.
  2021 
  2022 * More gentle suppression of syntax along locale morphisms while
  2023 printing terms. Previously 'abbreviation' and 'notation' declarations
  2024 would be suppressed for morphisms except term identity. Now
  2025 'abbreviation' is also kept for morphims that only change the involved
  2026 parameters, and only 'notation' is suppressed. This can be of great help
  2027 when working with complex locale hierarchies, because proof states are
  2028 displayed much more succinctly. It also means that only notation needs
  2029 to be redeclared if desired, as illustrated by this example:
  2030 
  2031   locale struct = fixes composition :: "'a => 'a => 'a" (infixl "\<cdot>" 65)
  2032   begin
  2033     definition derived (infixl "\<odot>" 65) where ...
  2034   end
  2035 
  2036   locale morphism =
  2037     left: struct composition + right: struct composition'
  2038     for composition (infix "\<cdot>" 65) and composition' (infix "\<cdot>''" 65)
  2039   begin
  2040     notation right.derived ("\<odot>''")
  2041   end
  2042 
  2043 * Command 'global_interpretation' issues interpretations into global
  2044 theories, with optional rewrite definitions following keyword 'defines'.
  2045 
  2046 * Command 'sublocale' accepts optional rewrite definitions after keyword
  2047 'defines'.
  2048 
  2049 * Command 'permanent_interpretation' has been discontinued. Use
  2050 'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.
  2051 
  2052 * Command 'print_definitions' prints dependencies of definitional
  2053 specifications. This functionality used to be part of 'print_theory'.
  2054 
  2055 * Configuration option rule_insts_schematic has been discontinued
  2056 (intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.
  2057 
  2058 * Abbreviations in type classes now carry proper sort constraint. Rare
  2059 INCOMPATIBILITY in situations where the previous misbehaviour has been
  2060 exploited.
  2061 
  2062 * Refinement of user-space type system in type classes: pseudo-local
  2063 operations behave more similar to abbreviations. Potential
  2064 INCOMPATIBILITY in exotic situations.
  2065 
  2066 
  2067 *** HOL ***
  2068 
  2069 * The 'typedef' command has been upgraded from a partially checked
  2070 "axiomatization", to a full definitional specification that takes the
  2071 global collection of overloaded constant / type definitions into
  2072 account. Type definitions with open dependencies on overloaded
  2073 definitions need to be specified as "typedef (overloaded)". This
  2074 provides extra robustness in theory construction. Rare INCOMPATIBILITY.
  2075 
  2076 * Qualification of various formal entities in the libraries is done more
  2077 uniformly via "context begin qualified definition ... end" instead of
  2078 old-style "hide_const (open) ...". Consequently, both the defined
  2079 constant and its defining fact become qualified, e.g. Option.is_none and
  2080 Option.is_none_def. Occasional INCOMPATIBILITY in applications.
  2081 
  2082 * Some old and rarely used ASCII replacement syntax has been removed.
  2083 INCOMPATIBILITY, standard syntax with symbols should be used instead.
  2084 The subsequent commands help to reproduce the old forms, e.g. to
  2085 simplify porting old theories:
  2086 
  2087   notation iff  (infixr "<->" 25)
  2088 
  2089   notation Times  (infixr "<*>" 80)
  2090 
  2091   type_notation Map.map  (infixr "~=>" 0)
  2092   notation Map.map_comp  (infixl "o'_m" 55)
  2093 
  2094   type_notation FinFun.finfun ("(_ =>f /_)" [22, 21] 21)
  2095 
  2096   notation FuncSet.funcset  (infixr "->" 60)
  2097   notation FuncSet.extensional_funcset  (infixr "->\<^sub>E" 60)
  2098 
  2099   notation Omega_Words_Fun.conc (infixr "conc" 65)
  2100 
  2101   notation Preorder.equiv ("op ~~")
  2102     and Preorder.equiv ("(_/ ~~ _)" [51, 51] 50)
  2103 
  2104   notation (in topological_space) tendsto (infixr "--->" 55)
  2105   notation (in topological_space) LIMSEQ ("((_)/ ----> (_))" [60, 60] 60)
  2106   notation LIM ("((_)/ -- (_)/ --> (_))" [60, 0, 60] 60)
  2107 
  2108   notation NSA.approx (infixl "@=" 50)
  2109   notation NSLIMSEQ ("((_)/ ----NS> (_))" [60, 60] 60)
  2110   notation NSLIM ("((_)/ -- (_)/ --NS> (_))" [60, 0, 60] 60)
  2111 
  2112 * The alternative notation "\<Colon>" for type and sort constraints has been
  2113 removed: in LaTeX document output it looks the same as "::".
  2114 INCOMPATIBILITY, use plain "::" instead.
  2115 
  2116 * Commands 'inductive' and 'inductive_set' work better when names for
  2117 intro rules are omitted: the "cases" and "induct" rules no longer
  2118 declare empty case_names, but no case_names at all. This allows to use
  2119 numbered cases in proofs, without requiring method "goal_cases".
  2120 
  2121 * Inductive definitions ('inductive', 'coinductive', etc.) expose
  2122 low-level facts of the internal construction only if the option
  2123 "inductive_internals" is enabled. This refers to the internal predicate
  2124 definition and its monotonicity result. Rare INCOMPATIBILITY.
  2125 
  2126 * Recursive function definitions ('fun', 'function', 'partial_function')
  2127 expose low-level facts of the internal construction only if the option
  2128 "function_internals" is enabled. Its internal inductive definition is
  2129 also subject to "inductive_internals". Rare INCOMPATIBILITY.
  2130 
  2131 * BNF datatypes ('datatype', 'codatatype', etc.) expose low-level facts
  2132 of the internal construction only if the option "bnf_internals" is
  2133 enabled. This supersedes the former option "bnf_note_all". Rare
  2134 INCOMPATIBILITY.
  2135 
  2136 * Combinator to represent case distinction on products is named
  2137 "case_prod", uniformly, discontinuing any input aliasses. Very popular
  2138 theorem aliasses have been retained.
  2139 
  2140 Consolidated facts:
  2141   PairE ~> prod.exhaust
  2142   Pair_eq ~> prod.inject
  2143   pair_collapse ~> prod.collapse
  2144   Pair_fst_snd_eq ~> prod_eq_iff
  2145   split_twice ~> prod.case_distrib
  2146   split_weak_cong ~> prod.case_cong_weak
  2147   split_split ~> prod.split
  2148   split_split_asm ~> prod.split_asm
  2149   splitI ~> case_prodI
  2150   splitD ~> case_prodD
  2151   splitI2 ~> case_prodI2
  2152   splitI2' ~> case_prodI2'
  2153   splitE ~> case_prodE
  2154   splitE' ~> case_prodE'
  2155   split_pair ~> case_prod_Pair
  2156   split_eta ~> case_prod_eta
  2157   split_comp ~> case_prod_comp
  2158   mem_splitI ~> mem_case_prodI
  2159   mem_splitI2 ~> mem_case_prodI2
  2160   mem_splitE ~> mem_case_prodE
  2161   The_split ~> The_case_prod
  2162   cond_split_eta ~> cond_case_prod_eta
  2163   Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE
  2164   Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI
  2165   in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq
  2166   Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD
  2167   Collect_split_Grp_inD ~> Collect_case_prod_Grp_in
  2168   Domain_Collect_split ~> Domain_Collect_case_prod
  2169   Image_Collect_split ~> Image_Collect_case_prod
  2170   Range_Collect_split ~> Range_Collect_case_prod
  2171   Eps_split ~> Eps_case_prod
  2172   Eps_split_eq ~> Eps_case_prod_eq
  2173   split_rsp ~> case_prod_rsp
  2174   curry_split ~> curry_case_prod
  2175   split_curry ~> case_prod_curry
  2176 
  2177 Changes in structure HOLogic:
  2178   split_const ~> case_prod_const
  2179   mk_split ~> mk_case_prod
  2180   mk_psplits ~> mk_ptupleabs
  2181   strip_psplits ~> strip_ptupleabs
  2182 
  2183 INCOMPATIBILITY.
  2184 
  2185 * The coercions to type 'real' have been reorganised. The function
  2186 'real' is no longer overloaded, but has type 'nat => real' and
  2187 abbreviates of_nat for that type. Also 'real_of_int :: int => real'
  2188 abbreviates of_int for that type. Other overloaded instances of 'real'
  2189 have been replaced by 'real_of_ereal' and 'real_of_float'.
  2190 
  2191 Consolidated facts (among others):
  2192   real_of_nat_le_iff -> of_nat_le_iff
  2193   real_of_nat_numeral of_nat_numeral
  2194   real_of_int_zero of_int_0
  2195   real_of_nat_zero of_nat_0
  2196   real_of_one of_int_1
  2197   real_of_int_add of_int_add
  2198   real_of_nat_add of_nat_add
  2199   real_of_int_diff of_int_diff
  2200   real_of_nat_diff of_nat_diff
  2201   floor_subtract floor_diff_of_int
  2202   real_of_int_inject of_int_eq_iff
  2203   real_of_int_gt_zero_cancel_iff of_int_0_less_iff
  2204   real_of_int_ge_zero_cancel_iff of_int_0_le_iff
  2205   real_of_nat_ge_zero of_nat_0_le_iff
  2206   real_of_int_ceiling_ge le_of_int_ceiling
  2207   ceiling_less_eq ceiling_less_iff
  2208   ceiling_le_eq ceiling_le_iff
  2209   less_floor_eq less_floor_iff
  2210   floor_less_eq floor_less_iff
  2211   floor_divide_eq_div floor_divide_of_int_eq
  2212   real_of_int_zero_cancel of_nat_eq_0_iff
  2213   ceiling_real_of_int ceiling_of_int
  2214 
  2215 INCOMPATIBILITY.
  2216 
  2217 * Theory Map: lemma map_of_is_SomeD was a clone of map_of_SomeD and has
  2218 been removed. INCOMPATIBILITY.
  2219 
  2220 * Quickcheck setup for finite sets.
  2221 
  2222 * Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.
  2223 
  2224 * Sledgehammer:
  2225   - The MaSh relevance filter has been sped up.
  2226   - Proof reconstruction has been improved, to minimize the incidence of
  2227     cases where Sledgehammer gives a proof that does not work.
  2228   - Auto Sledgehammer now minimizes and preplays the results.
  2229   - Handle Vampire 4.0 proof output without raising exception.
  2230   - Eliminated "MASH" environment variable. Use the "MaSh" option in
  2231     Isabelle/jEdit instead. INCOMPATIBILITY.
  2232   - Eliminated obsolete "blocking" option and related subcommands.
  2233 
  2234 * Nitpick:
  2235   - Fixed soundness bug in translation of "finite" predicate.
  2236   - Fixed soundness bug in "destroy_constrs" optimization.
  2237   - Fixed soundness bug in translation of "rat" type.
  2238   - Removed "check_potential" and "check_genuine" options.
  2239   - Eliminated obsolete "blocking" option.
  2240 
  2241 * (Co)datatype package:
  2242   - New commands "lift_bnf" and "copy_bnf" for lifting (copying) a BNF
  2243     structure on the raw type to an abstract type defined using typedef.
  2244   - Always generate "case_transfer" theorem.
  2245   - For mutual types, generate slightly stronger "rel_induct",
  2246     "rel_coinduct", and "coinduct" theorems. INCOMPATIBILITY.
  2247   - Allow discriminators and selectors with the same name as the type
  2248     being defined.
  2249   - Avoid various internal name clashes (e.g., 'datatype f = f').
  2250 
  2251 * Transfer: new methods for interactive debugging of 'transfer' and
  2252 'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',
  2253 'transfer_prover_start' and 'transfer_prover_end'.
  2254 
  2255 * New diagnostic command print_record for displaying record definitions.
  2256 
  2257 * Division on integers is bootstrapped directly from division on
  2258 naturals and uses generic numeral algorithm for computations. Slight
  2259 INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former
  2260 simprocs binary_int_div and binary_int_mod
  2261 
  2262 * Tightened specification of class semiring_no_zero_divisors. Minor
  2263 INCOMPATIBILITY.
  2264 
  2265 * Class algebraic_semidom introduces common algebraic notions of
  2266 integral (semi)domains, particularly units. Although logically subsumed
  2267 by fields, is is not a super class of these in order not to burden
  2268 fields with notions that are trivial there.
  2269 
  2270 * Class normalization_semidom specifies canonical representants for
  2271 equivalence classes of associated elements in an integral (semi)domain.
  2272 This formalizes associated elements as well.
  2273 
  2274 * Abstract specification of gcd/lcm operations in classes semiring_gcd,
  2275 semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute
  2276 and gcd_int.commute are subsumed by gcd.commute, as well as
  2277 gcd_nat.assoc and gcd_int.assoc by gcd.assoc.
  2278 
  2279 * Former constants Fields.divide (_ / _) and Divides.div (_ div _) are
  2280 logically unified to Rings.divide in syntactic type class Rings.divide,
  2281 with infix syntax (_ div _). Infix syntax (_ / _) for field division is
  2282 added later as abbreviation in class Fields.inverse. INCOMPATIBILITY,
  2283 instantiations must refer to Rings.divide rather than the former
  2284 separate constants, hence infix syntax (_ / _) is usually not available
  2285 during instantiation.
  2286 
  2287 * New cancellation simprocs for boolean algebras to cancel complementary
  2288 terms for sup and inf. For example, "sup x (sup y (- x))" simplifies to
  2289 "top". INCOMPATIBILITY.
  2290 
  2291 * Class uniform_space introduces uniform spaces btw topological spaces
  2292 and metric spaces. Minor INCOMPATIBILITY: open_<type>_def needs to be
  2293 introduced in the form of an uniformity. Some constants are more general
  2294 now, it may be necessary to add type class constraints.
  2295 
  2296   open_real_def \<leadsto> open_dist
  2297   open_complex_def \<leadsto> open_dist
  2298 
  2299 * Library/Monad_Syntax: notation uses symbols \<bind> and \<then>. INCOMPATIBILITY.
  2300 
  2301 * Library/Multiset:
  2302   - Renamed multiset inclusion operators:
  2303       < ~> <#
  2304       > ~> >#
  2305       <= ~> <=#
  2306       >= ~> >=#
  2307       \<le> ~> \<le>#
  2308       \<ge> ~> \<ge>#
  2309     INCOMPATIBILITY.
  2310   - Added multiset inclusion operator syntax:
  2311       \<subset>#
  2312       \<subseteq>#
  2313       \<supset>#
  2314       \<supseteq>#
  2315   - "'a multiset" is no longer an instance of the "order",
  2316     "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",
  2317     "semilattice_inf", and "semilattice_sup" type classes. The theorems
  2318     previously provided by these type classes (directly or indirectly)
  2319     are now available through the "subset_mset" interpretation
  2320     (e.g. add_mono ~> subset_mset.add_mono).
  2321     INCOMPATIBILITY.
  2322   - Renamed conversions:
  2323       multiset_of ~> mset
  2324       multiset_of_set ~> mset_set
  2325       set_of ~> set_mset
  2326     INCOMPATIBILITY
  2327   - Renamed lemmas:
  2328       mset_le_def ~> subseteq_mset_def
  2329       mset_less_def ~> subset_mset_def
  2330       less_eq_multiset.rep_eq ~> subseteq_mset_def
  2331     INCOMPATIBILITY
  2332   - Removed lemmas generated by lift_definition:
  2333     less_eq_multiset.abs_eq, less_eq_multiset.rsp,
  2334     less_eq_multiset.transfer, less_eq_multiset_def
  2335     INCOMPATIBILITY
  2336 
  2337 * Library/Omega_Words_Fun: Infinite words modeled as functions nat \<Rightarrow> 'a.
  2338 
  2339 * Library/Bourbaki_Witt_Fixpoint: Added formalisation of the
  2340 Bourbaki-Witt fixpoint theorem for increasing functions in
  2341 chain-complete partial orders.
  2342 
  2343 * Library/Old_Recdef: discontinued obsolete 'defer_recdef' command.
  2344 Minor INCOMPATIBILITY, use 'function' instead.
  2345 
  2346 * Library/Periodic_Fun: a locale that provides convenient lemmas for
  2347 periodic functions.
  2348 
  2349 * Library/Formal_Power_Series: proper definition of division (with
  2350 remainder) for formal power series; instances for Euclidean Ring and
  2351 GCD.
  2352 
  2353 * HOL-Imperative_HOL: obsolete theory Legacy_Mrec has been removed.
  2354 
  2355 * HOL-Statespace: command 'statespace' uses mandatory qualifier for
  2356 import of parent, as for general 'locale' expressions. INCOMPATIBILITY,
  2357 remove '!' and add '?' as required.
  2358 
  2359 * HOL-Decision_Procs: The "approximation" method works with "powr"
  2360 (exponentiation on real numbers) again.
  2361 
  2362 * HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour
  2363 integrals (= complex path integrals), Cauchy's integral theorem, winding
  2364 numbers and Cauchy's integral formula, Liouville theorem, Fundamental
  2365 Theorem of Algebra. Ported from HOL Light.
  2366 
  2367 * HOL-Multivariate_Analysis: topological concepts such as connected
  2368 components, homotopic paths and the inside or outside of a set.
  2369 
  2370 * HOL-Multivariate_Analysis: radius of convergence of power series and
  2371 various summability tests; Harmonic numbers and the Euler–Mascheroni
  2372 constant; the Generalised Binomial Theorem; the complex and real
  2373 Gamma/log-Gamma/Digamma/ Polygamma functions and their most important
  2374 properties.
  2375 
  2376 * HOL-Probability: The central limit theorem based on Levy's uniqueness
  2377 and continuity theorems, weak convergence, and characterisitc functions.
  2378 
  2379 * HOL-Data_Structures: new and growing session of standard data
  2380 structures.
  2381 
  2382 
  2383 *** ML ***
  2384 
  2385 * The following combinators for low-level profiling of the ML runtime
  2386 system are available:
  2387 
  2388   profile_time          (*CPU time*)
  2389   profile_time_thread   (*CPU time on this thread*)
  2390   profile_allocations   (*overall heap allocations*)
  2391 
  2392 * Antiquotation @{undefined} or \<^undefined> inlines (raise Match).
  2393 
  2394 * Antiquotation @{method NAME} inlines the (checked) name of the given
  2395 Isar proof method.
  2396 
  2397 * Pretty printing of Poly/ML compiler output in Isabelle has been
  2398 improved: proper treatment of break offsets and blocks with consistent
  2399 breaks.
  2400 
  2401 * The auxiliary module Pure/display.ML has been eliminated. Its
  2402 elementary thm print operations are now in Pure/more_thm.ML and thus
  2403 called Thm.pretty_thm, Thm.string_of_thm etc. INCOMPATIBILITY.
  2404 
  2405 * Simproc programming interfaces have been simplified:
  2406 Simplifier.make_simproc and Simplifier.define_simproc supersede various
  2407 forms of Simplifier.mk_simproc, Simplifier.simproc_global etc. Note that
  2408 term patterns for the left-hand sides are specified with implicitly
  2409 fixed variables, like top-level theorem statements. INCOMPATIBILITY.
  2410 
  2411 * Instantiation rules have been re-organized as follows:
  2412 
  2413   Thm.instantiate  (*low-level instantiation with named arguments*)
  2414   Thm.instantiate' (*version with positional arguments*)
  2415 
  2416   Drule.infer_instantiate  (*instantiation with type inference*)
  2417   Drule.infer_instantiate'  (*version with positional arguments*)
  2418 
  2419 The LHS only requires variable specifications, instead of full terms.
  2420 Old cterm_instantiate is superseded by infer_instantiate.
  2421 INCOMPATIBILITY, need to re-adjust some ML names and types accordingly.
  2422 
  2423 * Old tactic shorthands atac, rtac, etac, dtac, ftac have been
  2424 discontinued. INCOMPATIBILITY, use regular assume_tac, resolve_tac etc.
  2425 instead (with proper context).
  2426 
  2427 * Thm.instantiate (and derivatives) no longer require the LHS of the
  2428 instantiation to be certified: plain variables are given directly.
  2429 
  2430 * Subgoal.SUBPROOF and Subgoal.FOCUS combinators use anonymous
  2431 quasi-bound variables (like the Simplifier), instead of accidentally
  2432 named local fixes. This has the potential to improve stability of proof
  2433 tools, but can also cause INCOMPATIBILITY for tools that don't observe
  2434 the proof context discipline.
  2435 
  2436 * Isar proof methods are based on a slightly more general type
  2437 context_tactic, which allows to change the proof context dynamically
  2438 (e.g. to update cases) and indicate explicit Seq.Error results. Former
  2439 METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are
  2440 provided in src/Pure/Isar/method.ML for convenience. INCOMPATIBILITY.
  2441 
  2442 
  2443 *** System ***
  2444 
  2445 * Command-line tool "isabelle console" enables print mode "ASCII".
  2446 
  2447 * Command-line tool "isabelle update_then" expands old Isar command
  2448 conflations:
  2449 
  2450     hence  ~>  then have
  2451     thus   ~>  then show
  2452 
  2453 This syntax is more orthogonal and improves readability and
  2454 maintainability of proofs.
  2455 
  2456 * Global session timeout is multiplied by timeout_scale factor. This
  2457 allows to adjust large-scale tests (e.g. AFP) to overall hardware
  2458 performance.
  2459 
  2460 * Property values in etc/symbols may contain spaces, if written with the
  2461 replacement character "␣" (Unicode point 0x2324). For example:
  2462 
  2463     \<star>  code: 0x0022c6  group: operator  font: Deja␣Vu␣Sans␣Mono
  2464 
  2465 * Java runtime environment for x86_64-windows allows to use larger heap
  2466 space.
  2467 
  2468 * Java runtime options are determined separately for 32bit vs. 64bit
  2469 platforms as follows.
  2470 
  2471   - Isabelle desktop application: platform-specific files that are
  2472     associated with the main app bundle
  2473 
  2474   - isabelle jedit: settings
  2475     JEDIT_JAVA_SYSTEM_OPTIONS
  2476     JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64
  2477 
  2478   - isabelle build: settings
  2479     ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64
  2480 
  2481 * Bash shell function "jvmpath" has been renamed to "platform_path": it
  2482 is relevant both for Poly/ML and JVM processes.
  2483 
  2484 * Poly/ML default platform architecture may be changed from 32bit to
  2485 64bit via system option ML_system_64. A system restart (and rebuild) is
  2486 required after change.
  2487 
  2488 * Poly/ML 5.6 runs natively on x86-windows and x86_64-windows, which
  2489 both allow larger heap space than former x86-cygwin.
  2490 
  2491 * Heap images are 10-15% smaller due to less wasteful persistent theory
  2492 content (using ML type theory_id instead of theory);
  2493 
  2494 
  2495 
  2496 New in Isabelle2015 (May 2015)
  2497 ------------------------------
  2498 
  2499 *** General ***
  2500 
  2501 * Local theory specification commands may have a 'private' or
  2502 'qualified' modifier to restrict name space accesses to the local scope,
  2503 as provided by some "context begin ... end" block. For example:
  2504 
  2505   context
  2506   begin
  2507 
  2508   private definition ...
  2509   private lemma ...
  2510 
  2511   qualified definition ...
  2512   qualified lemma ...
  2513 
  2514   lemma ...
  2515   theorem ...
  2516 
  2517   end
  2518 
  2519 * Command 'experiment' opens an anonymous locale context with private
  2520 naming policy.
  2521 
  2522 * Command 'notepad' requires proper nesting of begin/end and its proof
  2523 structure in the body: 'oops' is no longer supported here. Minor
  2524 INCOMPATIBILITY, use 'sorry' instead.
  2525 
  2526 * Command 'named_theorems' declares a dynamic fact within the context,
  2527 together with an attribute to maintain the content incrementally. This
  2528 supersedes functor Named_Thms in Isabelle/ML, but with a subtle change
  2529 of semantics due to external visual order vs. internal reverse order.
  2530 
  2531 * 'find_theorems': search patterns which are abstractions are
  2532 schematically expanded before search. Search results match the naive
  2533 expectation more closely, particularly wrt. abbreviations.
  2534 INCOMPATIBILITY.
  2535 
  2536 * Commands 'method_setup' and 'attribute_setup' now work within a local
  2537 theory context.
  2538 
  2539 * Outer syntax commands are managed authentically within the theory
  2540 context, without implicit global state. Potential for accidental
  2541 INCOMPATIBILITY, make sure that required theories are really imported.
  2542 
  2543 * Historical command-line terminator ";" is no longer accepted (and
  2544 already used differently in Isar). Minor INCOMPATIBILITY, use "isabelle
  2545 update_semicolons" to remove obsolete semicolons from old theory
  2546 sources.
  2547 
  2548 * Structural composition of proof methods (meth1; meth2) in Isar
  2549 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.
  2550 
  2551 * The Eisbach proof method language allows to define new proof methods
  2552 by combining existing ones with their usual syntax. The "match" proof
  2553 method provides basic fact/term matching in addition to
  2554 premise/conclusion matching through Subgoal.focus, and binds fact names
  2555 from matches as well as term patterns within matches. The Isabelle
  2556 documentation provides an entry "eisbach" for the Eisbach User Manual.
  2557 Sources and various examples are in ~~/src/HOL/Eisbach/.
  2558 
  2559 
  2560 *** Prover IDE -- Isabelle/Scala/jEdit ***
  2561 
  2562 * Improved folding mode "isabelle" based on Isar syntax. Alternatively,
  2563 the "sidekick" mode may be used for document structure.
  2564 
  2565 * Extended bracket matching based on Isar language structure. System
  2566 option jedit_structure_limit determines maximum number of lines to scan
  2567 in the buffer.
  2568 
  2569 * Support for BibTeX files: context menu, context-sensitive token
  2570 marker, SideKick parser.
  2571 
  2572 * Document antiquotation @{cite} provides formal markup, which is
  2573 interpreted semi-formally based on .bib files that happen to be open in
  2574 the editor (hyperlinks, completion etc.).
  2575 
  2576 * Less waste of vertical space via negative line spacing (see Global
  2577 Options / Text Area).
  2578 
  2579 * Improved graphview panel with optional output of PNG or PDF, for
  2580 display of 'thy_deps', 'class_deps' etc.
  2581 
  2582 * The commands 'thy_deps' and 'class_deps' allow optional bounds to
  2583 restrict the visualized hierarchy.
  2584 
  2585 * Improved scheduling for asynchronous print commands (e.g. provers
  2586 managed by the Sledgehammer panel) wrt. ongoing document processing.
  2587 
  2588 
  2589 *** Document preparation ***
  2590 
  2591 * Document markup commands 'chapter', 'section', 'subsection',
  2592 'subsubsection', 'text', 'txt', 'text_raw' work uniformly in any
  2593 context, even before the initial 'theory' command. Obsolete proof
  2594 commands 'sect', 'subsect', 'subsubsect', 'txt_raw' have been
  2595 discontinued, use 'section', 'subsection', 'subsubsection', 'text_raw'
  2596 instead. The old 'header' command is still retained for some time, but
  2597 should be replaced by 'chapter', 'section' etc. (using "isabelle
  2598 update_header"). Minor INCOMPATIBILITY.
  2599 
  2600 * Official support for "tt" style variants, via \isatt{...} or
  2601 \begin{isabellett}...\end{isabellett}. The somewhat fragile \verb or
  2602 verbatim environment of LaTeX is no longer used. This allows @{ML} etc.
  2603 as argument to other macros (such as footnotes).
  2604 
  2605 * Document antiquotation @{verbatim} prints ASCII text literally in "tt"
  2606 style.
  2607 
  2608 * Discontinued obsolete option "document_graph": session_graph.pdf is
  2609 produced unconditionally for HTML browser_info and PDF-LaTeX document.
  2610 
  2611 * Diagnostic commands and document markup commands within a proof do not
  2612 affect the command tag for output. Thus commands like 'thm' are subject
  2613 to proof document structure, and no longer "stick out" accidentally.
  2614 Commands 'text' and 'txt' merely differ in the LaTeX style, not their
  2615 tags. Potential INCOMPATIBILITY in exotic situations.
  2616 
  2617 * System option "pretty_margin" is superseded by "thy_output_margin",
  2618 which is also accessible via document antiquotation option "margin".
  2619 Only the margin for document output may be changed, but not the global
  2620 pretty printing: that is 76 for plain console output, and adapted
  2621 dynamically in GUI front-ends. Implementations of document
  2622 antiquotations need to observe the margin explicitly according to
  2623 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.
  2624 
  2625 * Specification of 'document_files' in the session ROOT file is
  2626 mandatory for document preparation. The legacy mode with implicit
  2627 copying of the document/ directory is no longer supported. Minor
  2628 INCOMPATIBILITY.
  2629 
  2630 
  2631 *** Pure ***
  2632 
  2633 * Proof methods with explicit instantiation ("rule_tac", "subgoal_tac"
  2634 etc.) allow an optional context of local variables ('for' declaration):
  2635 these variables become schematic in the instantiated theorem; this
  2636 behaviour is analogous to 'for' in attributes "where" and "of".
  2637 Configuration option rule_insts_schematic (default false) controls use
  2638 of schematic variables outside the context. Minor INCOMPATIBILITY,
  2639 declare rule_insts_schematic = true temporarily and update to use local
  2640 variable declarations or dummy patterns instead.
  2641 
  2642 * Explicit instantiation via attributes "where", "of", and proof methods
  2643 "rule_tac" with derivatives like "subgoal_tac" etc. admit dummy patterns
  2644 ("_") that stand for anonymous local variables.
  2645 
  2646 * Generated schematic variables in standard format of exported facts are
  2647 incremented to avoid material in the proof context. Rare
  2648 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to
  2649 different index.
  2650 
  2651 * Lexical separation of signed and unsigned numerals: categories "num"
  2652 and "float" are unsigned. INCOMPATIBILITY: subtle change in precedence
  2653 of numeral signs, particularly in expressions involving infix syntax
  2654 like "(- 1) ^ n".
  2655 
  2656 * Old inner token category "xnum" has been discontinued.  Potential
  2657 INCOMPATIBILITY for exotic syntax: may use mixfix grammar with "num"
  2658 token category instead.
  2659 
  2660 
  2661 *** HOL ***
  2662 
  2663 * New (co)datatype package:
  2664   - The 'datatype_new' command has been renamed 'datatype'. The old
  2665     command of that name is now called 'old_datatype' and is provided
  2666     by "~~/src/HOL/Library/Old_Datatype.thy". See
  2667     'isabelle doc datatypes' for information on porting.
  2668     INCOMPATIBILITY.
  2669   - Renamed theorems:
  2670       disc_corec ~> corec_disc
  2671       disc_corec_iff ~> corec_disc_iff
  2672       disc_exclude ~> distinct_disc
  2673       disc_exhaust ~> exhaust_disc
  2674       disc_map_iff ~> map_disc_iff
  2675       sel_corec ~> corec_sel
  2676       sel_exhaust ~> exhaust_sel
  2677       sel_map ~> map_sel
  2678       sel_set ~> set_sel
  2679       sel_split ~> split_sel
  2680       sel_split_asm ~> split_sel_asm
  2681       strong_coinduct ~> coinduct_strong
  2682       weak_case_cong ~> case_cong_weak
  2683     INCOMPATIBILITY.
  2684   - The "no_code" option to "free_constructors", "datatype_new", and
  2685     "codatatype" has been renamed "plugins del: code".
  2686     INCOMPATIBILITY.
  2687   - The rules "set_empty" have been removed. They are easy
  2688     consequences of other set rules "by auto".
  2689     INCOMPATIBILITY.
  2690   - The rule "set_cases" is now registered with the "[cases set]"
  2691     attribute. This can influence the behavior of the "cases" proof
  2692     method when more than one case rule is applicable (e.g., an
  2693     assumption is of the form "w : set ws" and the method "cases w"
  2694     is invoked). The solution is to specify the case rule explicitly
  2695     (e.g. "cases w rule: widget.exhaust").
  2696     INCOMPATIBILITY.
  2697   - Renamed theories:
  2698       BNF_Comp ~> BNF_Composition
  2699       BNF_FP_Base ~> BNF_Fixpoint_Base
  2700       BNF_GFP ~> BNF_Greatest_Fixpoint
  2701       BNF_LFP ~> BNF_Least_Fixpoint
  2702       BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions
  2703       Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions
  2704     INCOMPATIBILITY.
  2705   - Lifting and Transfer setup for basic HOL types sum and prod (also
  2706     option) is now performed by the BNF package. Theories Lifting_Sum,
  2707     Lifting_Product and Lifting_Option from Main became obsolete and
  2708     were removed. Changed definitions of the relators rel_prod and
  2709     rel_sum (using inductive).
  2710     INCOMPATIBILITY: use rel_prod.simps and rel_sum.simps instead
  2711     of rel_prod_def and rel_sum_def.
  2712     Minor INCOMPATIBILITY: (rarely used by name) transfer theorem names
  2713     changed (e.g. map_prod_transfer ~> prod.map_transfer).
  2714   - Parametricity theorems for map functions, relators, set functions,
  2715     constructors, case combinators, discriminators, selectors and
  2716     (co)recursors are automatically proved and registered as transfer
  2717     rules.
  2718 
  2719 * Old datatype package:
  2720   - The old 'datatype' command has been renamed 'old_datatype', and
  2721     'rep_datatype' has been renamed 'old_rep_datatype'. They are
  2722     provided by "~~/src/HOL/Library/Old_Datatype.thy". See
  2723     'isabelle doc datatypes' for information on porting.
  2724     INCOMPATIBILITY.
  2725   - Renamed theorems:
  2726       weak_case_cong ~> case_cong_weak
  2727     INCOMPATIBILITY.
  2728   - Renamed theory:
  2729       ~~/src/HOL/Datatype.thy ~> ~~/src/HOL/Library/Old_Datatype.thy
  2730     INCOMPATIBILITY.
  2731 
  2732 * Nitpick:
  2733   - Fixed soundness bug related to the strict and non-strict subset
  2734     operations.
  2735 
  2736 * Sledgehammer:
  2737   - CVC4 is now included with Isabelle instead of CVC3 and run by
  2738     default.
  2739   - Z3 is now always enabled by default, now that it is fully open
  2740     source. The "z3_non_commercial" option is discontinued.
  2741   - Minimization is now always enabled by default.
  2742     Removed sub-command:
  2743       min
  2744   - Proof reconstruction, both one-liners and Isar, has been
  2745     dramatically improved.
  2746   - Improved support for CVC4 and veriT.
  2747 
  2748 * Old and new SMT modules:
  2749   - The old 'smt' method has been renamed 'old_smt' and moved to
  2750     'src/HOL/Library/Old_SMT.thy'. It is provided for compatibility,
  2751     until applications have been ported to use the new 'smt' method. For
  2752     the method to work, an older version of Z3 (e.g. Z3 3.2 or 4.0) must
  2753     be installed, and the environment variable "OLD_Z3_SOLVER" must
  2754     point to it.
  2755     INCOMPATIBILITY.
  2756   - The 'smt2' method has been renamed 'smt'.
  2757     INCOMPATIBILITY.
  2758   - New option 'smt_reconstruction_step_timeout' to limit the
  2759     reconstruction time of Z3 proof steps in the new 'smt' method.
  2760   - New option 'smt_statistics' to display statistics of the new 'smt'
  2761     method, especially runtime statistics of Z3 proof reconstruction.
  2762 
  2763 * Lifting: command 'lift_definition' allows to execute lifted constants
  2764 that have as a return type a datatype containing a subtype. This
  2765 overcomes long-time limitations in the area of code generation and
  2766 lifting, and avoids tedious workarounds.
  2767 
  2768 * Command and antiquotation "value" provide different evaluation slots
  2769 (again), where the previous strategy (NBE after ML) serves as default.
  2770 Minor INCOMPATIBILITY.
  2771 
  2772 * Add NO_MATCH-simproc, allows to check for syntactic non-equality.
  2773 
  2774 * field_simps: Use NO_MATCH-simproc for distribution rules, to avoid
  2775 non-termination in case of distributing a division. With this change
  2776 field_simps is in some cases slightly less powerful, if it fails try to
  2777 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.
  2778 
  2779 * Separate class no_zero_divisors has been given up in favour of fully
  2780 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.
  2781 
  2782 * Class linordered_semidom really requires no zero divisors.
  2783 INCOMPATIBILITY.
  2784 
  2785 * Classes division_ring, field and linordered_field always demand
  2786 "inverse 0 = 0". Given up separate classes division_ring_inverse_zero,
  2787 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.
  2788 
  2789 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit
  2790 additive inverse operation. INCOMPATIBILITY.
  2791 
  2792 * Complex powers and square roots. The functions "ln" and "powr" are now
  2793 overloaded for types real and complex, and 0 powr y = 0 by definition.
  2794 INCOMPATIBILITY: type constraints may be necessary.
  2795 
  2796 * The functions "sin" and "cos" are now defined for any type of sort
  2797 "{real_normed_algebra_1,banach}" type, so in particular on "real" and
  2798 "complex" uniformly. Minor INCOMPATIBILITY: type constraints may be
  2799 needed.
  2800 
  2801 * New library of properties of the complex transcendental functions sin,
  2802 cos, tan, exp, Ln, Arctan, Arcsin, Arccos. Ported from HOL Light.
  2803 
  2804 * The factorial function, "fact", now has type "nat => 'a" (of a sort
  2805 that admits numeric types including nat, int, real and complex.
  2806 INCOMPATIBILITY: an expression such as "fact 3 = 6" may require a type
  2807 constraint, and the combination "real (fact k)" is likely to be
  2808 unsatisfactory. If a type conversion is still necessary, then use
  2809 "of_nat (fact k)" or "real_of_nat (fact k)".
  2810 
  2811 * Removed functions "natfloor" and "natceiling", use "nat o floor" and
  2812 "nat o ceiling" instead. A few of the lemmas have been retained and
  2813 adapted: in their names "natfloor"/"natceiling" has been replaced by
  2814 "nat_floor"/"nat_ceiling".
  2815 
  2816 * Qualified some duplicated fact names required for boostrapping the
  2817 type class hierarchy:
  2818   ab_add_uminus_conv_diff ~> diff_conv_add_uminus
  2819   field_inverse_zero ~> inverse_zero
  2820   field_divide_inverse ~> divide_inverse
  2821   field_inverse ~> left_inverse
  2822 Minor INCOMPATIBILITY.
  2823 
  2824 * Eliminated fact duplicates:
  2825   mult_less_imp_less_right ~> mult_right_less_imp_less
  2826   mult_less_imp_less_left ~> mult_left_less_imp_less
  2827 Minor INCOMPATIBILITY.
  2828 
  2829 * Fact consolidation: even_less_0_iff is subsumed by
  2830 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).
  2831 
  2832 * Generalized and consolidated some theorems concerning divsibility:
  2833   dvd_reduce ~> dvd_add_triv_right_iff
  2834   dvd_plus_eq_right ~> dvd_add_right_iff
  2835   dvd_plus_eq_left ~> dvd_add_left_iff
  2836 Minor INCOMPATIBILITY.
  2837 
  2838 * "even" and "odd" are mere abbreviations for "2 dvd _" and "~ 2 dvd _"
  2839 and part of theory Main.
  2840   even_def ~> even_iff_mod_2_eq_zero
  2841 INCOMPATIBILITY.
  2842 
  2843 * Lemma name consolidation: divide_Numeral1 ~> divide_numeral_1. Minor
  2844 INCOMPATIBILITY.
  2845 
  2846 * Bootstrap of listsum as special case of abstract product over lists.
  2847 Fact rename:
  2848     listsum_def ~> listsum.eq_foldr
  2849 INCOMPATIBILITY.
  2850 
  2851 * Product over lists via constant "listprod".
  2852 
  2853 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to
  2854 Cons_nth_drop_Suc.
  2855 
  2856 * New infrastructure for compiling, running, evaluating and testing
  2857 generated code in target languages in HOL/Library/Code_Test. See
  2858 HOL/Codegenerator_Test/Code_Test* for examples.
  2859 
  2860 * Library/Multiset:
  2861   - Introduced "replicate_mset" operation.
  2862   - Introduced alternative characterizations of the multiset ordering in
  2863     "Library/Multiset_Order".
  2864   - Renamed multiset ordering:
  2865       <# ~> #<#
  2866       <=# ~> #<=#
  2867       \<subset># ~> #\<subset>#
  2868       \<subseteq># ~> #\<subseteq>#
  2869     INCOMPATIBILITY.
  2870   - Introduced abbreviations for ill-named multiset operations:
  2871       <#, \<subset># abbreviate < (strict subset)
  2872       <=#, \<le>#, \<subseteq># abbreviate <= (subset or equal)
  2873     INCOMPATIBILITY.
  2874   - Renamed
  2875       in_multiset_of ~> in_multiset_in_set
  2876       Multiset.fold ~> fold_mset
  2877       Multiset.filter ~> filter_mset
  2878     INCOMPATIBILITY.
  2879   - Removed mcard, is equal to size.
  2880   - Added attributes:
  2881       image_mset.id [simp]
  2882       image_mset_id [simp]
  2883       elem_multiset_of_set [simp, intro]
  2884       comp_fun_commute_plus_mset [simp]
  2885       comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]
  2886       in_mset_fold_plus_iff [iff]
  2887       set_of_Union_mset [simp]
  2888       in_Union_mset_iff [iff]
  2889     INCOMPATIBILITY.
  2890 
  2891 * Library/Sum_of_Squares: simplified and improved "sos" method. Always
  2892 use local CSDP executable, which is much faster than the NEOS server.
  2893 The "sos_cert" functionality is invoked as "sos" with additional
  2894 argument. Minor INCOMPATIBILITY.
  2895 
  2896 * HOL-Decision_Procs: New counterexample generator quickcheck
  2897 [approximation] for inequalities of transcendental functions. Uses
  2898 hardware floating point arithmetic to randomly discover potential
  2899 counterexamples. Counterexamples are certified with the "approximation"
  2900 method. See HOL/Decision_Procs/ex/Approximation_Quickcheck_Ex.thy for
  2901 examples.
  2902 
  2903 * HOL-Probability: Reworked measurability prover
  2904   - applies destructor rules repeatedly
  2905   - removed application splitting (replaced by destructor rule)
  2906   - added congruence rules to rewrite measure spaces under the sets
  2907     projection
  2908 
  2909 * New proof method "rewrite" (in theory ~~/src/HOL/Library/Rewrite) for
  2910 single-step rewriting with subterm selection based on patterns.
  2911 
  2912 
  2913 *** ML ***
  2914 
  2915 * Subtle change of name space policy: undeclared entries are now
  2916 considered inaccessible, instead of accessible via the fully-qualified
  2917 internal name. This mainly affects Name_Space.intern (and derivatives),
  2918 which may produce an unexpected Long_Name.hidden prefix. Note that
  2919 contemporary applications use the strict Name_Space.check (and
  2920 derivatives) instead, which is not affected by the change. Potential
  2921 INCOMPATIBILITY in rare applications of Name_Space.intern.
  2922 
  2923 * Subtle change of error semantics of Toplevel.proof_of: regular user
  2924 ERROR instead of internal Toplevel.UNDEF.
  2925 
  2926 * Basic combinators map, fold, fold_map, split_list, apply are available
  2927 as parameterized antiquotations, e.g. @{map 4} for lists of quadruples.
  2928 
  2929 * Renamed "pairself" to "apply2", in accordance to @{apply 2}.
  2930 INCOMPATIBILITY.
  2931 
  2932 * Former combinators NAMED_CRITICAL and CRITICAL for central critical
  2933 sections have been discontinued, in favour of the more elementary
  2934 Multithreading.synchronized and its high-level derivative
  2935 Synchronized.var (which is usually sufficient in applications). Subtle
  2936 INCOMPATIBILITY: synchronized access needs to be atomic and cannot be
  2937 nested.
  2938 
  2939 * Synchronized.value (ML) is actually synchronized (as in Scala): subtle
  2940 change of semantics with minimal potential for INCOMPATIBILITY.
  2941 
  2942 * The main operations to certify logical entities are Thm.ctyp_of and
  2943 Thm.cterm_of with a local context; old-style global theory variants are
  2944 available as Thm.global_ctyp_of and Thm.global_cterm_of.
  2945 INCOMPATIBILITY.
  2946 
  2947 * Elementary operations in module Thm are no longer pervasive.
  2948 INCOMPATIBILITY, need to use qualified Thm.prop_of, Thm.cterm_of,
  2949 Thm.term_of etc.
  2950 
  2951 * Proper context for various elementary tactics: assume_tac,
  2952 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,
  2953 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.
  2954 
  2955 * Tactical PARALLEL_ALLGOALS is the most common way to refer to
  2956 PARALLEL_GOALS.
  2957 
  2958 * Goal.prove_multi is superseded by the fully general Goal.prove_common,
  2959 which also allows to specify a fork priority.
  2960 
  2961 * Antiquotation @{command_spec "COMMAND"} is superseded by
  2962 @{command_keyword COMMAND} (usually without quotes and with PIDE
  2963 markup). Minor INCOMPATIBILITY.
  2964 
  2965 * Cartouches within ML sources are turned into values of type
  2966 Input.source (with formal position information).
  2967 
  2968 
  2969 *** System ***
  2970 
  2971 * The Isabelle tool "update_cartouches" changes theory files to use
  2972 cartouches instead of old-style {* verbatim *} or `alt_string` tokens.
  2973 
  2974 * The Isabelle tool "build" provides new options -X, -k, -x.
  2975 
  2976 * Discontinued old-fashioned "codegen" tool. Code generation can always
  2977 be externally triggered using an appropriate ROOT file plus a
  2978 corresponding theory. Parametrization is possible using environment
  2979 variables, or ML snippets in the most extreme cases. Minor
  2980 INCOMPATIBILITY.
  2981 
  2982 * JVM system property "isabelle.threads" determines size of Scala thread
  2983 pool, like Isabelle system option "threads" for ML.
  2984 
  2985 * JVM system property "isabelle.laf" determines the default Swing
  2986 look-and-feel, via internal class name or symbolic name as in the jEdit
  2987 menu Global Options / Appearance.
  2988 
  2989 * Support for Proof General and Isar TTY loop has been discontinued.
  2990 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.
  2991 
  2992 
  2993 
  2994 New in Isabelle2014 (August 2014)
  2995 ---------------------------------
  2996 
  2997 *** General ***
  2998 
  2999 * Support for official Standard ML within the Isabelle context.
  3000 Command 'SML_file' reads and evaluates the given Standard ML file.
  3001 Toplevel bindings are stored within the theory context; the initial
  3002 environment is restricted to the Standard ML implementation of
  3003 Poly/ML, without the add-ons of Isabelle/ML.  Commands 'SML_import'
  3004 and 'SML_export' allow to exchange toplevel bindings between the two
  3005 separate environments.  See also ~~/src/Tools/SML/Examples.thy for
  3006 some examples.
  3007 
  3008 * Standard tactics and proof methods such as "clarsimp", "auto" and
  3009 "safe" now preserve equality hypotheses "x = expr" where x is a free
  3010 variable.  Locale assumptions and chained facts containing "x"
  3011 continue to be useful.  The new method "hypsubst_thin" and the
  3012 configuration option "hypsubst_thin" (within the attribute name space)
  3013 restore the previous behavior.  INCOMPATIBILITY, especially where
  3014 induction is done after these methods or when the names of free and
  3015 bound variables clash.  As first approximation, old proofs may be
  3016 repaired by "using [[hypsubst_thin = true]]" in the critical spot.
  3017 
  3018 * More static checking of proof methods, which allows the system to
  3019 form a closure over the concrete syntax.  Method arguments should be
  3020 processed in the original proof context as far as possible, before
  3021 operating on the goal state.  In any case, the standard discipline for
  3022 subgoal-addressing needs to be observed: no subgoals or a subgoal
  3023 number that is out of range produces an empty result sequence, not an
  3024 exception.  Potential INCOMPATIBILITY for non-conformant tactical
  3025 proof tools.
  3026 
  3027 * Lexical syntax (inner and outer) supports text cartouches with
  3028 arbitrary nesting, and without escapes of quotes etc.  The Prover IDE
  3029 supports input via ` (backquote).
  3030 
  3031 * The outer syntax categories "text" (for formal comments and document
  3032 markup commands) and "altstring" (for literal fact references) allow
  3033 cartouches as well, in addition to the traditional mix of quotations.
  3034 
  3035 * Syntax of document antiquotation @{rail} now uses \<newline> instead
  3036 of "\\", to avoid the optical illusion of escaped backslash within
  3037 string token.  General renovation of its syntax using text cartouches.
  3038 Minor INCOMPATIBILITY.
  3039 
  3040 * Discontinued legacy_isub_isup, which was a temporary workaround for
  3041 Isabelle/ML in Isabelle2013-1.  The prover process no longer accepts
  3042 old identifier syntax with \<^isub> or \<^isup>.  Potential
  3043 INCOMPATIBILITY.
  3044 
  3045 * Document antiquotation @{url} produces markup for the given URL,
  3046 which results in an active hyperlink within the text.
  3047 
  3048 * Document antiquotation @{file_unchecked} is like @{file}, but does
  3049 not check existence within the file-system.
  3050 
  3051 * Updated and extended manuals: codegen, datatypes, implementation,
  3052 isar-ref, jedit, system.
  3053 
  3054 
  3055 *** Prover IDE -- Isabelle/Scala/jEdit ***
  3056 
  3057 * Improved Document panel: simplified interaction where every single
  3058 mouse click (re)opens document via desktop environment or as jEdit
  3059 buffer.
  3060 
  3061 * Support for Navigator plugin (with toolbar buttons), with connection
  3062 to PIDE hyperlinks.
  3063 
  3064 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
  3065 Open text buffers take precedence over copies within the file-system.
  3066 
  3067 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
  3068 auxiliary ML files.
  3069 
  3070 * Improved syntactic and semantic completion mechanism, with simple
  3071 templates, completion language context, name-space completion,
  3072 file-name completion, spell-checker completion.
  3073 
  3074 * Refined GUI popup for completion: more robust key/mouse event
  3075 handling and propagation to enclosing text area -- avoid loosing
  3076 keystrokes with slow / remote graphics displays.
  3077 
  3078 * Completion popup supports both ENTER and TAB (default) to select an
  3079 item, depending on Isabelle options.
  3080 
  3081 * Refined insertion of completion items wrt. jEdit text: multiple
  3082 selections, rectangular selections, rectangular selection as "tall
  3083 caret".
  3084 
  3085 * Integrated spell-checker for document text, comments etc. with
  3086 completion popup and context-menu.
  3087 
  3088 * More general "Query" panel supersedes "Find" panel, with GUI access
  3089 to commands 'find_theorems' and 'find_consts', as well as print
  3090 operations for the context.  Minor incompatibility in keyboard
  3091 shortcuts etc.: replace action isabelle-find by isabelle-query.
  3092 
  3093 * Search field for all output panels ("Output", "Query", "Info" etc.)
  3094 to highlight text via regular expression.
  3095 
  3096 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
  3097 General") allows to specify additional print modes for the prover
  3098 process, without requiring old-fashioned command-line invocation of
  3099 "isabelle jedit -m MODE".
  3100 
  3101 * More support for remote files (e.g. http) using standard Java
  3102 networking operations instead of jEdit virtual file-systems.
  3103 
  3104 * Empty editors buffers that are no longer required (e.g.\ via theory
  3105 imports) are automatically removed from the document model.
  3106 
  3107 * Improved monitor panel.
  3108 
  3109 * Improved Console/Scala plugin: more uniform scala.Console output,
  3110 more robust treatment of threads and interrupts.
  3111 
  3112 * Improved management of dockable windows: clarified keyboard focus
  3113 and window placement wrt. main editor view; optional menu item to
  3114 "Detach" a copy where this makes sense.
  3115 
  3116 * New Simplifier Trace panel provides an interactive view of the
  3117 simplification process, enabled by the "simp_trace_new" attribute
  3118 within the context.
  3119 
  3120 
  3121 *** Pure ***
  3122 
  3123 * Low-level type-class commands 'classes', 'classrel', 'arities' have
  3124 been discontinued to avoid the danger of non-trivial axiomatization
  3125 that is not immediately visible.  INCOMPATIBILITY, use regular
  3126 'instance' command with proof.  The required OFCLASS(...) theorem
  3127 might be postulated via 'axiomatization' beforehand, or the proof
  3128 finished trivially if the underlying class definition is made vacuous
  3129 (without any assumptions).  See also Isabelle/ML operations
  3130 Axclass.class_axiomatization, Axclass.classrel_axiomatization,
  3131 Axclass.arity_axiomatization.
  3132 
  3133 * Basic constants of Pure use more conventional names and are always
  3134 qualified.  Rare INCOMPATIBILITY, but with potentially serious
  3135 consequences, notably for tools in Isabelle/ML.  The following
  3136 renaming needs to be applied:
  3137 
  3138   ==             ~>  Pure.eq
  3139   ==>            ~>  Pure.imp
  3140   all            ~>  Pure.all
  3141   TYPE           ~>  Pure.type
  3142   dummy_pattern  ~>  Pure.dummy_pattern
  3143 
  3144 Systematic porting works by using the following theory setup on a
  3145 *previous* Isabelle version to introduce the new name accesses for the
  3146 old constants:
  3147 
  3148 setup {*
  3149   fn thy => thy
  3150     |> Sign.root_path
  3151     |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
  3152     |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
  3153     |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
  3154     |> Sign.restore_naming thy
  3155 *}
  3156 
  3157 Thus ML antiquotations like @{const_name Pure.eq} may be used already.
  3158 Later the application is moved to the current Isabelle version, and
  3159 the auxiliary aliases are deleted.
  3160 
  3161 * Attributes "where" and "of" allow an optional context of local
  3162 variables ('for' declaration): these variables become schematic in the
  3163 instantiated theorem.
  3164 
  3165 * Obsolete attribute "standard" has been discontinued (legacy since
  3166 Isabelle2012).  Potential INCOMPATIBILITY, use explicit 'for' context
  3167 where instantiations with schematic variables are intended (for
  3168 declaration commands like 'lemmas' or attributes like "of").  The
  3169 following temporary definition may help to port old applications:
  3170 
  3171   attribute_setup standard =
  3172     "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
  3173 
  3174 * More thorough check of proof context for goal statements and
  3175 attributed fact expressions (concerning background theory, declared
  3176 hyps).  Potential INCOMPATIBILITY, tools need to observe standard
  3177 context discipline.  See also Assumption.add_assumes and the more
  3178 primitive Thm.assume_hyps.
  3179 
  3180 * Inner syntax token language allows regular quoted strings "..."
  3181 (only makes sense in practice, if outer syntax is delimited
  3182 differently, e.g. via cartouches).
  3183 
  3184 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,
  3185 but the latter is retained some time as Proof General legacy.
  3186 
  3187 * Code generator preprocessor: explicit control of simp tracing on a
  3188 per-constant basis.  See attribute "code_preproc".
  3189 
  3190 
  3191 *** HOL ***
  3192 
  3193 * Code generator: enforce case of identifiers only for strict target
  3194 language requirements.  INCOMPATIBILITY.
  3195 
  3196 * Code generator: explicit proof contexts in many ML interfaces.
  3197 INCOMPATIBILITY.
  3198 
  3199 * Code generator: minimize exported identifiers by default.  Minor
  3200 INCOMPATIBILITY.
  3201 
  3202 * Code generation for SML and OCaml: dropped arcane "no_signatures"
  3203 option.  Minor INCOMPATIBILITY.
  3204 
  3205 * "declare [[code abort: ...]]" replaces "code_abort ...".
  3206 INCOMPATIBILITY.
  3207 
  3208 * "declare [[code drop: ...]]" drops all code equations associated
  3209 with the given constants.
  3210 
  3211 * Code generations are provided for make, fields, extend and truncate
  3212 operations on records.
  3213 
  3214 * Command and antiquotation "value" are now hardcoded against nbe and
  3215 ML.  Minor INCOMPATIBILITY.
  3216 
  3217 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.
  3218 
  3219 * The symbol "\<newline>" may be used within char or string literals
  3220 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
  3221 
  3222 * Qualified String.implode and String.explode.  INCOMPATIBILITY.
  3223 
  3224 * Simplifier: Enhanced solver of preconditions of rewrite rules can
  3225 now deal with conjunctions.  For help with converting proofs, the old
  3226 behaviour of the simplifier can be restored like this: declare/using
  3227 [[simp_legacy_precond]].  This configuration option will disappear
  3228 again in the future.  INCOMPATIBILITY.
  3229 
  3230 * Simproc "finite_Collect" is no longer enabled by default, due to
  3231 spurious crashes and other surprises.  Potential INCOMPATIBILITY.
  3232 
  3233 * Moved new (co)datatype package and its dependencies from session
  3234   "HOL-BNF" to "HOL".  The commands 'bnf', 'wrap_free_constructors',
  3235   'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now
  3236   part of theory "Main".
  3237 
  3238   Theory renamings:
  3239     FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
  3240     Library/Wfrec.thy ~> Wfrec.thy
  3241     Library/Zorn.thy ~> Zorn.thy
  3242     Cardinals/Order_Relation.thy ~> Order_Relation.thy
  3243     Library/Order_Union.thy ~> Cardinals/Order_Union.thy
  3244     Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
  3245     Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
  3246     Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
  3247     Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
  3248     Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
  3249     BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
  3250     BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
  3251     BNF/BNF_Comp.thy ~> BNF_Comp.thy
  3252     BNF/BNF_Def.thy ~> BNF_Def.thy
  3253     BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
  3254     BNF/BNF_GFP.thy ~> BNF_GFP.thy
  3255     BNF/BNF_LFP.thy ~> BNF_LFP.thy
  3256     BNF/BNF_Util.thy ~> BNF_Util.thy
  3257     BNF/Coinduction.thy ~> Coinduction.thy
  3258     BNF/More_BNFs.thy ~> Library/More_BNFs.thy
  3259     BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
  3260     BNF/Examples/* ~> BNF_Examples/*
  3261 
  3262   New theories:
  3263     Wellorder_Extension.thy (split from Zorn.thy)
  3264     Library/Cardinal_Notations.thy
  3265     Library/BNF_Axomatization.thy
  3266     BNF_Examples/Misc_Primcorec.thy
  3267     BNF_Examples/Stream_Processor.thy
  3268 
  3269   Discontinued theories:
  3270     BNF/BNF.thy
  3271     BNF/Equiv_Relations_More.thy
  3272 
  3273 INCOMPATIBILITY.
  3274 
  3275 * New (co)datatype package:
  3276   - Command 'primcorec' is fully implemented.
  3277   - Command 'datatype_new' generates size functions ("size_xxx" and
  3278     "size") as required by 'fun'.
  3279   - BNFs are integrated with the Lifting tool and new-style
  3280     (co)datatypes with Transfer.
  3281   - Renamed commands:
  3282       datatype_new_compat ~> datatype_compat
  3283       primrec_new ~> primrec
  3284       wrap_free_constructors ~> free_constructors
  3285     INCOMPATIBILITY.
  3286   - The generated constants "xxx_case" and "xxx_rec" have been renamed
  3287     "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
  3288     INCOMPATIBILITY.
  3289   - The constant "xxx_(un)fold" and related theorems are no longer
  3290     generated.  Use "xxx_(co)rec" or define "xxx_(un)fold" manually
  3291     using "prim(co)rec".
  3292     INCOMPATIBILITY.
  3293   - No discriminators are generated for nullary constructors by
  3294     default, eliminating the need for the odd "=:" syntax.
  3295     INCOMPATIBILITY.
  3296   - No discriminators or selectors are generated by default by
  3297     "datatype_new", unless custom names are specified or the new
  3298     "discs_sels" option is passed.
  3299     INCOMPATIBILITY.
  3300 
  3301 * Old datatype package:
  3302   - The generated theorems "xxx.cases" and "xxx.recs" have been
  3303     renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->
  3304     "sum.case").  INCOMPATIBILITY.
  3305   - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have
  3306     been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,
  3307     "prod_case" ~> "case_prod").  INCOMPATIBILITY.
  3308 
  3309 * The types "'a list" and "'a option", their set and map functions,
  3310   their relators, and their selectors are now produced using the new
  3311   BNF-based datatype package.
  3312 
  3313   Renamed constants:
  3314     Option.set ~> set_option
  3315     Option.map ~> map_option
  3316     option_rel ~> rel_option
  3317 
  3318   Renamed theorems:
  3319     set_def ~> set_rec[abs_def]
  3320     map_def ~> map_rec[abs_def]
  3321     Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
  3322     option.recs ~> option.rec
  3323     list_all2_def ~> list_all2_iff
  3324     set.simps ~> set_simps (or the slightly different "list.set")
  3325     map.simps ~> list.map
  3326     hd.simps ~> list.sel(1)
  3327     tl.simps ~> list.sel(2-3)
  3328     the.simps ~> option.sel
  3329 
  3330 INCOMPATIBILITY.
  3331 
  3332 * The following map functions and relators have been renamed:
  3333     sum_map ~> map_sum
  3334     map_pair ~> map_prod
  3335     prod_rel ~> rel_prod
  3336     sum_rel ~> rel_sum
  3337     fun_rel ~> rel_fun
  3338     set_rel ~> rel_set
  3339     filter_rel ~> rel_filter
  3340     fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")
  3341     cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")
  3342     vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")
  3343 
  3344 INCOMPATIBILITY.
  3345 
  3346 * Lifting and Transfer:
  3347   - a type variable as a raw type is supported
  3348   - stronger reflexivity prover
  3349   - rep_eq is always generated by lift_definition
  3350   - setup for Lifting/Transfer is now automated for BNFs
  3351     + holds for BNFs that do not contain a dead variable
  3352     + relator_eq, relator_mono, relator_distr, relator_domain,
  3353       relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,
  3354       right_unique, right_total, left_unique, left_total are proved
  3355       automatically
  3356     + definition of a predicator is generated automatically
  3357     + simplification rules for a predicator definition are proved
  3358       automatically for datatypes
  3359   - consolidation of the setup of Lifting/Transfer
  3360     + property that a relator preservers reflexivity is not needed any
  3361       more
  3362       Minor INCOMPATIBILITY.
  3363     + left_total and left_unique rules are now transfer rules
  3364       (reflexivity_rule attribute not needed anymore)
  3365       INCOMPATIBILITY.
  3366     + Domainp does not have to be a separate assumption in
  3367       relator_domain theorems (=> more natural statement)
  3368       INCOMPATIBILITY.
  3369   - registration of code equations is more robust
  3370     Potential INCOMPATIBILITY.
  3371   - respectfulness proof obligation is preprocessed to a more readable
  3372     form
  3373     Potential INCOMPATIBILITY.
  3374   - eq_onp is always unfolded in respectfulness proof obligation
  3375     Potential INCOMPATIBILITY.
  3376   - unregister lifting setup for Code_Numeral.integer and
  3377     Code_Numeral.natural
  3378     Potential INCOMPATIBILITY.
  3379   - Lifting.invariant -> eq_onp
  3380     INCOMPATIBILITY.
  3381 
  3382 * New internal SAT solver "cdclite" that produces models and proof
  3383 traces.  This solver replaces the internal SAT solvers "enumerate" and
  3384 "dpll".  Applications that explicitly used one of these two SAT
  3385 solvers should use "cdclite" instead. In addition, "cdclite" is now
  3386 the default SAT solver for the "sat" and "satx" proof methods and
  3387 corresponding tactics; the old default can be restored using "declare
  3388 [[sat_solver = zchaff_with_proofs]]".  Minor INCOMPATIBILITY.
  3389 
  3390 * SMT module: A new version of the SMT module, temporarily called
  3391 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,
  3392 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also
  3393 supported as oracles. Yices is no longer supported, because no version
  3394 of the solver can handle both SMT-LIB 2 and quantifiers.
  3395 
  3396 * Activation of Z3 now works via "z3_non_commercial" system option
  3397 (without requiring restart), instead of former settings variable
  3398 "Z3_NON_COMMERCIAL".  The option can be edited in Isabelle/jEdit menu
  3399 Plugin Options / Isabelle / General.
  3400 
  3401 * Sledgehammer:
  3402   - Z3 can now produce Isar proofs.
  3403   - MaSh overhaul:
  3404     . New SML-based learning algorithms eliminate the dependency on
  3405       Python and increase performance and reliability.
  3406     . MaSh and MeSh are now used by default together with the
  3407       traditional MePo (Meng-Paulson) relevance filter. To disable
  3408       MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin
  3409       Options / Isabelle / General to "none".
  3410   - New option:
  3411       smt_proofs
  3412   - Renamed options:
  3413       isar_compress ~> compress
  3414       isar_try0 ~> try0
  3415 
  3416 INCOMPATIBILITY.
  3417 
  3418 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
  3419 
  3420 * Nitpick:
  3421   - Fixed soundness bug whereby mutually recursive datatypes could
  3422     take infinite values.
  3423   - Fixed soundness bug with low-level number functions such as
  3424     "Abs_Integ" and "Rep_Integ".
  3425   - Removed "std" option.
  3426   - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
  3427     "hide_types".
  3428 
  3429 * Metis: Removed legacy proof method 'metisFT'. Use 'metis
  3430 (full_types)' instead. INCOMPATIBILITY.
  3431 
  3432 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
  3433 
  3434 * Adjustion of INF and SUP operations:
  3435   - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
  3436   - Consolidated theorem names containing INFI and SUPR: have INF and
  3437     SUP instead uniformly.
  3438   - More aggressive normalization of expressions involving INF and Inf
  3439     or SUP and Sup.
  3440   - INF_image and SUP_image do not unfold composition.
  3441   - Dropped facts INF_comp, SUP_comp.
  3442   - Default congruence rules strong_INF_cong and strong_SUP_cong, with
  3443     simplifier implication in premises.  Generalize and replace former
  3444     INT_cong, SUP_cong
  3445 
  3446 INCOMPATIBILITY.
  3447 
  3448 * SUP and INF generalized to conditionally_complete_lattice.
  3449 
  3450 * Swapped orientation of facts image_comp and vimage_comp:
  3451 
  3452   image_compose ~> image_comp [symmetric]
  3453   image_comp ~> image_comp [symmetric]
  3454   vimage_compose ~> vimage_comp [symmetric]
  3455   vimage_comp ~> vimage_comp [symmetric]
  3456 
  3457 INCOMPATIBILITY.
  3458 
  3459 * Theory reorganization: split of Big_Operators.thy into
  3460 Groups_Big.thy and Lattices_Big.thy.
  3461 
  3462 * Consolidated some facts about big group operators:
  3463 
  3464     setsum_0' ~> setsum.neutral
  3465     setsum_0 ~> setsum.neutral_const
  3466     setsum_addf ~> setsum.distrib
  3467     setsum_cartesian_product ~> setsum.cartesian_product
  3468     setsum_cases ~> setsum.If_cases
  3469     setsum_commute ~> setsum.commute
  3470     setsum_cong ~> setsum.cong
  3471     setsum_delta ~> setsum.delta
  3472     setsum_delta' ~> setsum.delta'
  3473     setsum_diff1' ~> setsum.remove
  3474     setsum_empty ~> setsum.empty
  3475     setsum_infinite ~> setsum.infinite
  3476     setsum_insert ~> setsum.insert
  3477     setsum_inter_restrict'' ~> setsum.inter_filter
  3478     setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left
  3479     setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right
  3480     setsum_mono_zero_left ~> setsum.mono_neutral_left
  3481     setsum_mono_zero_right ~> setsum.mono_neutral_right
  3482     setsum_reindex ~> setsum.reindex
  3483     setsum_reindex_cong ~> setsum.reindex_cong
  3484     setsum_reindex_nonzero ~> setsum.reindex_nontrivial
  3485     setsum_restrict_set ~> setsum.inter_restrict
  3486     setsum_Plus ~> setsum.Plus
  3487     setsum_setsum_restrict ~> setsum.commute_restrict
  3488     setsum_Sigma ~> setsum.Sigma
  3489     setsum_subset_diff ~> setsum.subset_diff
  3490     setsum_Un_disjoint ~> setsum.union_disjoint
  3491     setsum_UN_disjoint ~> setsum.UNION_disjoint
  3492     setsum_Un_Int ~> setsum.union_inter
  3493     setsum_Union_disjoint ~> setsum.Union_disjoint
  3494     setsum_UNION_zero ~> setsum.Union_comp
  3495     setsum_Un_zero ~> setsum.union_inter_neutral
  3496     strong_setprod_cong ~> setprod.strong_cong
  3497     strong_setsum_cong ~> setsum.strong_cong
  3498     setprod_1' ~> setprod.neutral
  3499     setprod_1 ~> setprod.neutral_const
  3500     setprod_cartesian_product ~> setprod.cartesian_product
  3501     setprod_cong ~> setprod.cong
  3502     setprod_delta ~> setprod.delta
  3503     setprod_delta' ~> setprod.delta'
  3504     setprod_empty ~> setprod.empty
  3505     setprod_infinite ~> setprod.infinite
  3506     setprod_insert ~> setprod.insert
  3507     setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left
  3508     setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right
  3509     setprod_mono_one_left ~> setprod.mono_neutral_left
  3510     setprod_mono_one_right ~> setprod.mono_neutral_right
  3511     setprod_reindex ~> setprod.reindex
  3512     setprod_reindex_cong ~> setprod.reindex_cong
  3513     setprod_reindex_nonzero ~> setprod.reindex_nontrivial
  3514     setprod_Sigma ~> setprod.Sigma
  3515     setprod_subset_diff ~> setprod.subset_diff
  3516     setprod_timesf ~> setprod.distrib
  3517     setprod_Un2 ~> setprod.union_diff2
  3518     setprod_Un_disjoint ~> setprod.union_disjoint
  3519     setprod_UN_disjoint ~> setprod.UNION_disjoint
  3520     setprod_Un_Int ~> setprod.union_inter
  3521     setprod_Union_disjoint ~> setprod.Union_disjoint
  3522     setprod_Un_one ~> setprod.union_inter_neutral
  3523 
  3524   Dropped setsum_cong2 (simple variant of setsum.cong).
  3525   Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)
  3526   Dropped setsum_reindex_id, setprod_reindex_id
  3527     (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).
  3528 
  3529 INCOMPATIBILITY.
  3530 
  3531 * Abolished slightly odd global lattice interpretation for min/max.
  3532 
  3533   Fact consolidations:
  3534     min_max.inf_assoc ~> min.assoc
  3535     min_max.inf_commute ~> min.commute
  3536     min_max.inf_left_commute ~> min.left_commute
  3537     min_max.inf_idem ~> min.idem
  3538     min_max.inf_left_idem ~> min.left_idem
  3539     min_max.inf_right_idem ~> min.right_idem
  3540     min_max.sup_assoc ~> max.assoc
  3541     min_max.sup_commute ~> max.commute
  3542     min_max.sup_left_commute ~> max.left_commute
  3543     min_max.sup_idem ~> max.idem
  3544     min_max.sup_left_idem ~> max.left_idem
  3545     min_max.sup_inf_distrib1 ~> max_min_distrib2
  3546     min_max.sup_inf_distrib2 ~> max_min_distrib1
  3547     min_max.inf_sup_distrib1 ~> min_max_distrib2
  3548     min_max.inf_sup_distrib2 ~> min_max_distrib1
  3549     min_max.distrib ~> min_max_distribs
  3550     min_max.inf_absorb1 ~> min.absorb1
  3551     min_max.inf_absorb2 ~> min.absorb2
  3552     min_max.sup_absorb1 ~> max.absorb1
  3553     min_max.sup_absorb2 ~> max.absorb2
  3554     min_max.le_iff_inf ~> min.absorb_iff1
  3555     min_max.le_iff_sup ~> max.absorb_iff2
  3556     min_max.inf_le1 ~> min.cobounded1
  3557     min_max.inf_le2 ~> min.cobounded2
  3558     le_maxI1, min_max.sup_ge1 ~> max.cobounded1
  3559     le_maxI2, min_max.sup_ge2 ~> max.cobounded2
  3560     min_max.le_infI1 ~> min.coboundedI1
  3561     min_max.le_infI2 ~> min.coboundedI2
  3562     min_max.le_supI1 ~> max.coboundedI1
  3563     min_max.le_supI2 ~> max.coboundedI2
  3564     min_max.less_infI1 ~> min.strict_coboundedI1
  3565     min_max.less_infI2 ~> min.strict_coboundedI2
  3566     min_max.less_supI1 ~> max.strict_coboundedI1
  3567     min_max.less_supI2 ~> max.strict_coboundedI2
  3568     min_max.inf_mono ~> min.mono
  3569     min_max.sup_mono ~> max.mono
  3570     min_max.le_infI, min_max.inf_greatest ~> min.boundedI
  3571     min_max.le_supI, min_max.sup_least ~> max.boundedI
  3572     min_max.le_inf_iff ~> min.bounded_iff
  3573     min_max.le_sup_iff ~> max.bounded_iff
  3574 
  3575 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
  3576 min.left_commute, min.left_idem, max.commute, max.assoc,
  3577 max.left_commute, max.left_idem directly.
  3578 
  3579 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,
  3580 min.cobounded2, max.cobounded1m max.cobounded2 directly.
  3581 
  3582 For min_ac or max_ac, prefer more general collection ac_simps.
  3583 
  3584 INCOMPATIBILITY.
  3585 
  3586 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>
  3587 Inf_fin_le_Sup_fin.  INCOMPATIBILITY.
  3588 
  3589 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
  3590 INCOMPATIBILITY.
  3591 
  3592 * Fact generalization and consolidation:
  3593     neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
  3594 
  3595 INCOMPATIBILITY.
  3596 
  3597 * Purely algebraic definition of even.  Fact generalization and
  3598   consolidation:
  3599     nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
  3600     even_zero_(nat|int) ~> even_zero
  3601 
  3602 INCOMPATIBILITY.
  3603 
  3604 * Abolished neg_numeral.
  3605   - Canonical representation for minus one is "- 1".
  3606   - Canonical representation for other negative numbers is "- (numeral _)".
  3607   - When devising rule sets for number calculation, consider the
  3608     following canonical cases: 0, 1, numeral _, - 1, - numeral _.
  3609   - HOLogic.dest_number also recognizes numerals in non-canonical forms
  3610     like "numeral One", "- numeral One", "- 0" and even "- ... - _".
  3611   - Syntax for negative numerals is mere input syntax.
  3612 
  3613 INCOMPATIBILITY.
  3614 
  3615 * Reduced name variants for rules on associativity and commutativity:
  3616 
  3617     add_assoc ~> add.assoc
  3618     add_commute ~> add.commute
  3619     add_left_commute ~> add.left_commute
  3620     mult_assoc ~> mult.assoc
  3621     mult_commute ~> mult.commute
  3622     mult_left_commute ~> mult.left_commute
  3623     nat_add_assoc ~> add.assoc
  3624     nat_add_commute ~> add.commute
  3625     nat_add_left_commute ~> add.left_commute
  3626     nat_mult_assoc ~> mult.assoc
  3627     nat_mult_commute ~> mult.commute
  3628     eq_assoc ~> iff_assoc
  3629     eq_left_commute ~> iff_left_commute
  3630 
  3631 INCOMPATIBILITY.
  3632 
  3633 * Fact collections add_ac and mult_ac are considered old-fashioned.
  3634 Prefer ac_simps instead, or specify rules
  3635 (add|mult).(assoc|commute|left_commute) individually.
  3636 
  3637 * Elimination of fact duplicates:
  3638     equals_zero_I ~> minus_unique
  3639     diff_eq_0_iff_eq ~> right_minus_eq
  3640     nat_infinite ~> infinite_UNIV_nat
  3641     int_infinite ~> infinite_UNIV_int
  3642 
  3643 INCOMPATIBILITY.
  3644 
  3645 * Fact name consolidation:
  3646     diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
  3647     minus_le_self_iff ~> neg_less_eq_nonneg
  3648     le_minus_self_iff ~> less_eq_neg_nonpos
  3649     neg_less_nonneg ~> neg_less_pos
  3650     less_minus_self_iff ~> less_neg_neg [simp]
  3651 
  3652 INCOMPATIBILITY.
  3653 
  3654 * More simplification rules on unary and binary minus:
  3655 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
  3656 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
  3657 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
  3658 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
  3659 minus_add_cancel, uminus_add_conv_diff.  These correspondingly have
  3660 been taken away from fact collections algebra_simps and field_simps.
  3661 INCOMPATIBILITY.
  3662 
  3663 To restore proofs, the following patterns are helpful:
  3664 
  3665 a) Arbitrary failing proof not involving "diff_def":
  3666 Consider simplification with algebra_simps or field_simps.
  3667 
  3668 b) Lifting rules from addition to subtraction:
  3669 Try with "using <rule for addition> of [... "- _" ...]" by simp".
  3670 
  3671 c) Simplification with "diff_def": just drop "diff_def".
  3672 Consider simplification with algebra_simps or field_simps;
  3673 or the brute way with
  3674 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
  3675 
  3676 * Introduce bdd_above and bdd_below in theory
  3677 Conditionally_Complete_Lattices, use them instead of explicitly
  3678 stating boundedness of sets.
  3679 
  3680 * ccpo.admissible quantifies only over non-empty chains to allow more
  3681 syntax-directed proof rules; the case of the empty chain shows up as
  3682 additional case in fixpoint induction proofs.  INCOMPATIBILITY.
  3683 
  3684 * Removed and renamed theorems in Series:
  3685   summable_le         ~>  suminf_le
  3686   suminf_le           ~>  suminf_le_const
  3687   series_pos_le       ~>  setsum_le_suminf
  3688   series_pos_less     ~>  setsum_less_suminf
  3689   suminf_ge_zero      ~>  suminf_nonneg
  3690   suminf_gt_zero      ~>  suminf_pos
  3691   suminf_gt_zero_iff  ~>  suminf_pos_iff
  3692   summable_sumr_LIMSEQ_suminf  ~>  summable_LIMSEQ
  3693   suminf_0_le         ~>  suminf_nonneg [rotate]
  3694   pos_summable        ~>  summableI_nonneg_bounded
  3695   ratio_test          ~>  summable_ratio_test
  3696 
  3697   removed series_zero, replaced by sums_finite
  3698 
  3699   removed auxiliary lemmas:
  3700 
  3701     sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
  3702     half, le_Suc_ex_iff, lemma_realpow_diff_sumr,
  3703     real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,
  3704     sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,
  3705     summable_convergent_sumr_iff, sumr_diff_mult_const
  3706 
  3707 INCOMPATIBILITY.
  3708 
  3709 * Replace (F)DERIV syntax by has_derivative:
  3710   - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
  3711 
  3712   - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
  3713 
  3714   - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
  3715 
  3716   - removed constant isDiff
  3717 
  3718   - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as
  3719     input syntax.
  3720 
  3721   - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.
  3722 
  3723   - Renamed FDERIV_... lemmas to has_derivative_...
  3724 
  3725   - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
  3726 
  3727   - removed DERIV_intros, has_derivative_eq_intros
  3728 
  3729   - introduced derivative_intros and deriative_eq_intros which
  3730     includes now rules for DERIV, has_derivative and
  3731     has_vector_derivative.
  3732 
  3733   - Other renamings:
  3734     differentiable_def        ~>  real_differentiable_def
  3735     differentiableE           ~>  real_differentiableE
  3736     fderiv_def                ~>  has_derivative_at
  3737     field_fderiv_def          ~>  field_has_derivative_at
  3738     isDiff_der                ~>  differentiable_def
  3739     deriv_fderiv              ~>  has_field_derivative_def
  3740     deriv_def                 ~>  DERIV_def
  3741 
  3742 INCOMPATIBILITY.
  3743 
  3744 * Include more theorems in continuous_intros. Remove the
  3745 continuous_on_intros, isCont_intros collections, these facts are now
  3746 in continuous_intros.
  3747 
  3748 * Theorems about complex numbers are now stated only using Re and Im,
  3749 the Complex constructor is not used anymore. It is possible to use
  3750 primcorec to defined the behaviour of a complex-valued function.
  3751 
  3752 Removed theorems about the Complex constructor from the simpset, they
  3753 are available as the lemma collection legacy_Complex_simps. This
  3754 especially removes
  3755 
  3756     i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
  3757 
  3758 Instead the reverse direction is supported with
  3759     Complex_eq: "Complex a b = a + \<i> * b"
  3760 
  3761 Moved csqrt from Fundamental_Algebra_Theorem to Complex.
  3762 
  3763   Renamings:
  3764     Re/Im                  ~>  complex.sel
  3765     complex_Re/Im_zero     ~>  zero_complex.sel
  3766     complex_Re/Im_add      ~>  plus_complex.sel
  3767     complex_Re/Im_minus    ~>  uminus_complex.sel
  3768     complex_Re/Im_diff     ~>  minus_complex.sel
  3769     complex_Re/Im_one      ~>  one_complex.sel
  3770     complex_Re/Im_mult     ~>  times_complex.sel
  3771     complex_Re/Im_inverse  ~>  inverse_complex.sel
  3772     complex_Re/Im_scaleR   ~>  scaleR_complex.sel
  3773     complex_Re/Im_i        ~>  ii.sel
  3774     complex_Re/Im_cnj      ~>  cnj.sel
  3775     Re/Im_cis              ~>  cis.sel
  3776 
  3777     complex_divide_def   ~>  divide_complex_def
  3778     complex_norm_def     ~>  norm_complex_def
  3779     cmod_def             ~>  norm_complex_de
  3780 
  3781   Removed theorems:
  3782     complex_zero_def
  3783     complex_add_def
  3784     complex_minus_def
  3785     complex_diff_def
  3786     complex_one_def
  3787     complex_mult_def
  3788     complex_inverse_def
  3789     complex_scaleR_def
  3790 
  3791 INCOMPATIBILITY.
  3792 
  3793 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
  3794 Conditionally_Complete_Lattices.  INCOMPATIBILITY.
  3795 
  3796 * HOL-Library: new theory src/HOL/Library/Tree.thy.
  3797 
  3798 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it
  3799 is subsumed by session Kleene_Algebra in AFP.
  3800 
  3801 * HOL-Library / theory RBT: various constants and facts are hidden;
  3802 lifting setup is unregistered.  INCOMPATIBILITY.
  3803 
  3804 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.
  3805 
  3806 * HOL-Word: bit representations prefer type bool over type bit.
  3807 INCOMPATIBILITY.
  3808 
  3809 * HOL-Word:
  3810   - Abandoned fact collection "word_arith_alts", which is a duplicate
  3811     of "word_arith_wis".
  3812   - Dropped first (duplicated) element in fact collections
  3813     "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
  3814     "uint_word_arith_bintrs".
  3815 
  3816 * HOL-Number_Theory:
  3817   - consolidated the proofs of the binomial theorem
  3818   - the function fib is again of type nat => nat and not overloaded
  3819   - no more references to Old_Number_Theory in the HOL libraries
  3820     (except the AFP)
  3821 
  3822 INCOMPATIBILITY.
  3823 
  3824 * HOL-Multivariate_Analysis:
  3825   - Type class ordered_real_vector for ordered vector spaces.
  3826   - New theory Complex_Basic_Analysis defining complex derivatives,
  3827     holomorphic functions, etc., ported from HOL Light's canal.ml.
  3828   - Changed order of ordered_euclidean_space to be compatible with
  3829     pointwise ordering on products. Therefore instance of
  3830     conditionally_complete_lattice and ordered_real_vector.
  3831     INCOMPATIBILITY: use box instead of greaterThanLessThan or
  3832     explicit set-comprehensions with eucl_less for other (half-)open
  3833     intervals.
  3834   - removed dependencies on type class ordered_euclidean_space with
  3835     introduction of "cbox" on euclidean_space
  3836     - renamed theorems:
  3837         interval ~> box
  3838         mem_interval ~> mem_box
  3839         interval_eq_empty ~> box_eq_empty
  3840         interval_ne_empty ~> box_ne_empty
  3841         interval_sing(1) ~> cbox_sing
  3842         interval_sing(2) ~> box_sing
  3843         subset_interval_imp ~> subset_box_imp
  3844         subset_interval ~> subset_box
  3845         open_interval ~> open_box
  3846         closed_interval ~> closed_cbox
  3847         interior_closed_interval ~> interior_cbox
  3848         bounded_closed_interval ~> bounded_cbox
  3849         compact_interval ~> compact_cbox
  3850         bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric
  3851         bounded_subset_closed_interval ~> bounded_subset_cbox
  3852         mem_interval_componentwiseI ~> mem_box_componentwiseI
  3853         convex_box ~> convex_prod
  3854         rel_interior_real_interval ~> rel_interior_real_box
  3855         convex_interval ~> convex_box
  3856         convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox
  3857         frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox
  3858         content_closed_interval' ~> content_cbox'
  3859         elementary_subset_interval ~> elementary_subset_box
  3860         diameter_closed_interval ~> diameter_cbox
  3861         frontier_closed_interval ~> frontier_cbox
  3862         frontier_open_interval ~> frontier_box
  3863         bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric
  3864         closure_open_interval ~> closure_box
  3865         open_closed_interval_convex ~> open_cbox_convex
  3866         open_interval_midpoint ~> box_midpoint
  3867         content_image_affinity_interval ~> content_image_affinity_cbox
  3868         is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval
  3869         bounded_interval ~> bounded_closed_interval + bounded_boxes
  3870 
  3871     - respective theorems for intervals over the reals:
  3872         content_closed_interval + content_cbox
  3873         has_integral + has_integral_real
  3874         fine_division_exists + fine_division_exists_real
  3875         has_integral_null + has_integral_null_real
  3876         tagged_division_union_interval + tagged_division_union_interval_real
  3877         has_integral_const + has_integral_const_real
  3878         integral_const + integral_const_real
  3879         has_integral_bound + has_integral_bound_real
  3880         integrable_continuous + integrable_continuous_real
  3881         integrable_subinterval + integrable_subinterval_real
  3882         has_integral_reflect_lemma + has_integral_reflect_lemma_real
  3883         integrable_reflect + integrable_reflect_real
  3884         integral_reflect + integral_reflect_real
  3885         image_affinity_interval + image_affinity_cbox
  3886         image_smult_interval + image_smult_cbox
  3887         integrable_const + integrable_const_ivl
  3888         integrable_on_subinterval + integrable_on_subcbox
  3889 
  3890   - renamed theorems:
  3891     derivative_linear         ~>  has_derivative_bounded_linear
  3892     derivative_is_linear      ~>  has_derivative_linear
  3893     bounded_linear_imp_linear ~>  bounded_linear.linear
  3894 
  3895 * HOL-Probability:
  3896   - Renamed positive_integral to nn_integral:
  3897 
  3898     . Renamed all lemmas "*positive_integral*" to *nn_integral*"
  3899       positive_integral_positive ~> nn_integral_nonneg
  3900 
  3901     . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.
  3902 
  3903   - replaced the Lebesgue integral on real numbers by the more general
  3904     Bochner integral for functions into a real-normed vector space.
  3905 
  3906     integral_zero               ~>  integral_zero / integrable_zero
  3907     integral_minus              ~>  integral_minus / integrable_minus
  3908     integral_add                ~>  integral_add / integrable_add
  3909     integral_diff               ~>  integral_diff / integrable_diff
  3910     integral_setsum             ~>  integral_setsum / integrable_setsum
  3911     integral_multc              ~>  integral_mult_left / integrable_mult_left
  3912     integral_cmult              ~>  integral_mult_right / integrable_mult_right
  3913     integral_triangle_inequality~>  integral_norm_bound
  3914     integrable_nonneg           ~>  integrableI_nonneg
  3915     integral_positive           ~>  integral_nonneg_AE
  3916     integrable_abs_iff          ~>  integrable_abs_cancel
  3917     positive_integral_lim_INF   ~>  nn_integral_liminf
  3918     lebesgue_real_affine        ~>  lborel_real_affine
  3919     borel_integral_has_integral ~>  has_integral_lebesgue_integral
  3920     integral_indicator          ~>
  3921          integral_real_indicator / integrable_real_indicator
  3922     positive_integral_fst       ~>  nn_integral_fst'
  3923     positive_integral_fst_measurable ~> nn_integral_fst
  3924     positive_integral_snd_measurable ~> nn_integral_snd
  3925 
  3926     integrable_fst_measurable   ~>
  3927          integral_fst / integrable_fst / AE_integrable_fst
  3928 
  3929     integrable_snd_measurable   ~>
  3930          integral_snd / integrable_snd / AE_integrable_snd
  3931 
  3932     integral_monotone_convergence  ~>
  3933          integral_monotone_convergence / integrable_monotone_convergence
  3934 
  3935     integral_monotone_convergence_at_top  ~>
  3936          integral_monotone_convergence_at_top /
  3937          integrable_monotone_convergence_at_top
  3938 
  3939     has_integral_iff_positive_integral_lebesgue  ~>
  3940          has_integral_iff_has_bochner_integral_lebesgue_nonneg
  3941 
  3942     lebesgue_integral_has_integral  ~>
  3943          has_integral_integrable_lebesgue_nonneg
  3944 
  3945     positive_integral_lebesgue_has_integral  ~>
  3946          integral_has_integral_lebesgue_nonneg /
  3947          integrable_has_integral_lebesgue_nonneg
  3948 
  3949     lebesgue_integral_real_affine  ~>
  3950          nn_integral_real_affine
  3951 
  3952     has_integral_iff_positive_integral_lborel  ~>
  3953          integral_has_integral_nonneg / integrable_has_integral_nonneg
  3954 
  3955     The following theorems where removed:
  3956 
  3957     lebesgue_integral_nonneg
  3958     lebesgue_integral_uminus
  3959     lebesgue_integral_cmult
  3960     lebesgue_integral_multc
  3961     lebesgue_integral_cmult_nonneg
  3962     integral_cmul_indicator
  3963     integral_real
  3964 
  3965   - Formalized properties about exponentially, Erlang, and normal
  3966     distributed random variables.
  3967 
  3968 * HOL-Decision_Procs: Separate command 'approximate' for approximative
  3969 computation in src/HOL/Decision_Procs/Approximation.  Minor
  3970 INCOMPATIBILITY.
  3971 
  3972 
  3973 *** Scala ***
  3974 
  3975 * The signature and semantics of Document.Snapshot.cumulate_markup /
  3976 select_markup have been clarified.  Markup is now traversed in the
  3977 order of reports given by the prover: later markup is usually more
  3978 specific and may override results accumulated so far.  The elements
  3979 guard is mandatory and checked precisely.  Subtle INCOMPATIBILITY.
  3980 
  3981 * Substantial reworking of internal PIDE protocol communication
  3982 channels.  INCOMPATIBILITY.
  3983 
  3984 
  3985 *** ML ***
  3986 
  3987 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
  3988 compared (according to Thm.thm_ord), but assumed to be covered by the
  3989 current background theory.  Thus equivalent data produced in different
  3990 branches of the theory graph usually coincides (e.g. relevant for
  3991 theory merge).  Note that the softer Thm.eq_thm_prop is often more
  3992 appropriate than Thm.eq_thm.
  3993 
  3994 * Proper context for basic Simplifier operations: rewrite_rule,
  3995 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
  3996 pass runtime Proof.context (and ensure that the simplified entity
  3997 actually belongs to it).
  3998 
  3999 * Proper context discipline for read_instantiate and instantiate_tac:
  4000 variables that are meant to become schematic need to be given as
  4001 fixed, and are generalized by the explicit context of local variables.
  4002 This corresponds to Isar attributes "where" and "of" with 'for'
  4003 declaration.  INCOMPATIBILITY, also due to potential change of indices
  4004 of schematic variables.
  4005 
  4006 * Moved ML_Compiler.exn_trace and other operations on exceptions to
  4007 structure Runtime.  Minor INCOMPATIBILITY.
  4008 
  4009 * Discontinued old Toplevel.debug in favour of system option
  4010 "ML_exception_trace", which may be also declared within the context
  4011 via "declare [[ML_exception_trace = true]]".  Minor INCOMPATIBILITY.
  4012 
  4013 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
  4014 INCOMPATIBILITY.
  4015 
  4016 * Configuration option "ML_print_depth" controls the pretty-printing
  4017 depth of the ML compiler within the context.  The old print_depth in
  4018 ML is still available as default_print_depth, but rarely used.  Minor
  4019 INCOMPATIBILITY.
  4020 
  4021 * Toplevel function "use" refers to raw ML bootstrap environment,
  4022 without Isar context nor antiquotations.  Potential INCOMPATIBILITY.
  4023 Note that 'ML_file' is the canonical command to load ML files into the
  4024 formal context.
  4025 
  4026 * Simplified programming interface to define ML antiquotations, see
  4027 structure ML_Antiquotation.  Minor INCOMPATIBILITY.
  4028 
  4029 * ML antiquotation @{here} refers to its source position, which is
  4030 occasionally useful for experimentation and diagnostic purposes.
  4031 
  4032 * ML antiquotation @{path} produces a Path.T value, similarly to
  4033 Path.explode, but with compile-time check against the file-system and
  4034 some PIDE markup.  Note that unlike theory source, ML does not have a
  4035 well-defined master directory, so an absolute symbolic path
  4036 specification is usually required, e.g. "~~/src/HOL".
  4037 
  4038 * ML antiquotation @{print} inlines a function to print an arbitrary
  4039 ML value, which is occasionally useful for diagnostic or demonstration
  4040 purposes.
  4041 
  4042 
  4043 *** System ***
  4044 
  4045 * Proof General with its traditional helper scripts is now an optional
  4046 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle
  4047 component repository http://isabelle.in.tum.de/components/.  Note that
  4048 the "system" manual provides general explanations about add-on
  4049 components, especially those that are not bundled with the release.
  4050 
  4051 * The raw Isabelle process executable has been renamed from
  4052 "isabelle-process" to "isabelle_process", which conforms to common
  4053 shell naming conventions, and allows to define a shell function within
  4054 the Isabelle environment to avoid dynamic path lookup.  Rare
  4055 incompatibility for old tools that do not use the ISABELLE_PROCESS
  4056 settings variable.
  4057 
  4058 * Former "isabelle tty" has been superseded by "isabelle console",
  4059 with implicit build like "isabelle jedit", and without the mostly
  4060 obsolete Isar TTY loop.
  4061 
  4062 * Simplified "isabelle display" tool.  Settings variables DVI_VIEWER
  4063 and PDF_VIEWER now refer to the actual programs, not shell
  4064 command-lines.  Discontinued option -c: invocation may be asynchronous
  4065 via desktop environment, without any special precautions.  Potential
  4066 INCOMPATIBILITY with ambitious private settings.
  4067 
  4068 * Removed obsolete "isabelle unsymbolize".  Note that the usual format
  4069 for email communication is the Unicode rendering of Isabelle symbols,
  4070 as produced by Isabelle/jEdit, for example.
  4071 
  4072 * Removed obsolete tool "wwwfind". Similar functionality may be
  4073 integrated into Isabelle/jEdit eventually.
  4074 
  4075 * Improved 'display_drafts' concerning desktop integration and
  4076 repeated invocation in PIDE front-end: re-use single file
  4077 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
  4078 
  4079 * Session ROOT specifications require explicit 'document_files' for
  4080 robust dependencies on LaTeX sources.  Only these explicitly given
  4081 files are copied to the document output directory, before document
  4082 processing is started.
  4083 
  4084 * Windows: support for regular TeX installation (e.g. MiKTeX) instead
  4085 of TeX Live from Cygwin.
  4086 
  4087 
  4088 
  4089 New in Isabelle2013-2 (December 2013)
  4090 -------------------------------------
  4091 
  4092 *** Prover IDE -- Isabelle/Scala/jEdit ***
  4093 
  4094 * More robust editing of running commands with internal forks,
  4095 e.g. non-terminating 'by' steps.
  4096 
  4097 * More relaxed Sledgehammer panel: avoid repeated application of query
  4098 after edits surrounding the command location.
  4099 
  4100 * More status information about commands that are interrupted
  4101 accidentally (via physical event or Poly/ML runtime system signal,
  4102 e.g. out-of-memory).
  4103 
  4104 
  4105 *** System ***
  4106 
  4107 * More robust termination of external processes managed by
  4108 Isabelle/ML: support cancellation of tasks within the range of
  4109 milliseconds, as required for PIDE document editing with automatically
  4110 tried tools (e.g. Sledgehammer).
  4111 
  4112 * Reactivated Isabelle/Scala kill command for external processes on
  4113 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
  4114 workaround for some Debian/Ubuntu Linux versions from 2013.
  4115 
  4116 
  4117 
  4118 New in Isabelle2013-1 (November 2013)
  4119 -------------------------------------
  4120 
  4121 *** General ***
  4122 
  4123 * Discontinued obsolete 'uses' within theory header.  Note that
  4124 commands like 'ML_file' work without separate declaration of file
  4125 dependencies.  Minor INCOMPATIBILITY.
  4126 
  4127 * Discontinued redundant 'use' command, which was superseded by
  4128 'ML_file' in Isabelle2013.  Minor INCOMPATIBILITY.
  4129 
  4130 * Simplified subscripts within identifiers, using plain \<^sub>
  4131 instead of the second copy \<^isub> and \<^isup>.  Superscripts are
  4132 only for literal tokens within notation; explicit mixfix annotations
  4133 for consts or fixed variables may be used as fall-back for unusual
  4134 names.  Obsolete \<twosuperior> has been expanded to \<^sup>2 in
  4135 Isabelle/HOL.  INCOMPATIBILITY, use "isabelle update_sub_sup" to
  4136 standardize symbols as a starting point for further manual cleanup.
  4137 The ML reference variable "legacy_isub_isup" may be set as temporary
  4138 workaround, to make the prover accept a subset of the old identifier
  4139 syntax.
  4140 
  4141 * Document antiquotations: term style "isub" has been renamed to
  4142 "sub".  Minor INCOMPATIBILITY.
  4143 
  4144 * Uniform management of "quick_and_dirty" as system option (see also
  4145 "isabelle options"), configuration option within the context (see also
  4146 Config.get in Isabelle/ML), and attribute in Isabelle/Isar.  Minor
  4147 INCOMPATIBILITY, need to use more official Isabelle means to access
  4148 quick_and_dirty, instead of historical poking into mutable reference.
  4149 
  4150 * Renamed command 'print_configs' to 'print_options'.  Minor
  4151 INCOMPATIBILITY.
  4152 
  4153 * Proper diagnostic command 'print_state'.  Old 'pr' (with its
  4154 implicit change of some global references) is retained for now as
  4155 control command, e.g. for ProofGeneral 3.7.x.
  4156 
  4157 * Discontinued 'print_drafts' command with its old-fashioned PS output
  4158 and Unix command-line print spooling.  Minor INCOMPATIBILITY: use
  4159 'display_drafts' instead and print via the regular document viewer.
  4160 
  4161 * Updated and extended "isar-ref" and "implementation" manual,
  4162 eliminated old "ref" manual.
  4163 
  4164 
  4165 *** Prover IDE -- Isabelle/Scala/jEdit ***
  4166 
  4167 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
  4168 Documentation panel.
  4169 
  4170 * Dockable window "Documentation" provides access to Isabelle
  4171 documentation.
  4172 
  4173 * Dockable window "Find" provides query operations for formal entities
  4174 (GUI front-end to 'find_theorems' command).
  4175 
  4176 * Dockable window "Sledgehammer" manages asynchronous / parallel
  4177 sledgehammer runs over existing document sources, independently of
  4178 normal editing and checking process.
  4179 
  4180 * Dockable window "Timing" provides an overview of relevant command
  4181 timing information, depending on option jedit_timing_threshold.  The
  4182 same timing information is shown in the extended tooltip of the
  4183 command keyword, when hovering the mouse over it while the CONTROL or
  4184 COMMAND modifier is pressed.
  4185 
  4186 * Improved dockable window "Theories": Continuous checking of proof
  4187 document (visible and required parts) may be controlled explicitly,
  4188 using check box or shortcut "C+e ENTER".  Individual theory nodes may
  4189 be marked explicitly as required and checked in full, using check box
  4190 or shortcut "C+e SPACE".
  4191 
  4192 * Improved completion mechanism, which is now managed by the
  4193 Isabelle/jEdit plugin instead of SideKick.  Refined table of Isabelle
  4194 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
  4195 
  4196 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
  4197 isabelle.complete for explicit completion in Isabelle sources.
  4198 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
  4199 to resolve conflict.
  4200 
  4201 * Improved support of various "minor modes" for Isabelle NEWS,
  4202 options, session ROOT etc., with completion and SideKick tree view.
  4203 
  4204 * Strictly monotonic document update, without premature cancellation of
  4205 running transactions that are still needed: avoid reset/restart of
  4206 such command executions while editing.
  4207 
  4208 * Support for asynchronous print functions, as overlay to existing
  4209 document content.
  4210 
  4211 * Support for automatic tools in HOL, which try to prove or disprove
  4212 toplevel theorem statements.
  4213 
  4214 * Action isabelle.reset-font-size resets main text area font size
  4215 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
  4216 also "Plugin Options / Isabelle / General").  It can be bound to some
  4217 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
  4218 
  4219 * File specifications in jEdit (e.g. file browser) may refer to
  4220 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms.  Discontinued
  4221 obsolete $ISABELLE_HOME_WINDOWS variable.
  4222 
  4223 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
  4224 / Global Options / Appearance".
  4225 
  4226 * Improved support of native Mac OS X functionality via "MacOSX"
  4227 plugin, which is now enabled by default.
  4228 
  4229 
  4230 *** Pure ***
  4231 
  4232 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
  4233 In particular, 'interpretation' allows for non-persistent
  4234 interpretation within "context ... begin ... end" blocks offering a
  4235 light-weight alternative to 'sublocale'.  See "isar-ref" manual for
  4236 details.
  4237 
  4238 * Improved locales diagnostic command 'print_dependencies'.
  4239 
  4240 * Discontinued obsolete 'axioms' command, which has been marked as
  4241 legacy since Isabelle2009-2.  INCOMPATIBILITY, use 'axiomatization'
  4242 instead, while observing its uniform scope for polymorphism.
  4243 
  4244 * Discontinued empty name bindings in 'axiomatization'.
  4245 INCOMPATIBILITY.
  4246 
  4247 * System option "proofs" has been discontinued.  Instead the global
  4248 state of Proofterm.proofs is persistently compiled into logic images
  4249 as required, notably HOL-Proofs.  Users no longer need to change
  4250 Proofterm.proofs dynamically.  Minor INCOMPATIBILITY.
  4251 
  4252 * Syntax translation functions (print_translation etc.) always depend
  4253 on Proof.context.  Discontinued former "(advanced)" option -- this is
  4254 now the default.  Minor INCOMPATIBILITY.
  4255 
  4256 * Former global reference trace_unify_fail is now available as
  4257 configuration option "unify_trace_failure" (global context only).
  4258 
  4259 * SELECT_GOAL now retains the syntactic context of the overall goal
  4260 state (schematic variables etc.).  Potential INCOMPATIBILITY in rare
  4261 situations.
  4262 
  4263 
  4264 *** HOL ***
  4265 
  4266 * Stronger precedence of syntax for big intersection and union on
  4267 sets, in accordance with corresponding lattice operations.
  4268 INCOMPATIBILITY.
  4269 
  4270 * Notation "{p:A. P}" now allows tuple patterns as well.
  4271 
  4272 * Nested case expressions are now translated in a separate check phase
  4273 rather than during parsing. The data for case combinators is separated
  4274 from the datatype package. The declaration attribute
  4275 "case_translation" can be used to register new case combinators:
  4276 
  4277   declare [[case_translation case_combinator constructor1 ... constructorN]]
  4278 
  4279 * Code generator:
  4280   - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
  4281     'code_instance'.
  4282   - 'code_identifier' declares name hints for arbitrary identifiers in
  4283     generated code, subsuming 'code_modulename'.
  4284 
  4285 See the isar-ref manual for syntax diagrams, and the HOL theories for
  4286 examples.
  4287 
  4288 * Attibute 'code': 'code' now declares concrete and abstract code
  4289 equations uniformly.  Use explicit 'code equation' and 'code abstract'
  4290 to distinguish both when desired.
  4291 
  4292 * Discontinued theories Code_Integer and Efficient_Nat by a more
  4293 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
  4294 Code_Target_Nat and Code_Target_Numeral.  See the tutorial on code
  4295 generation for details.  INCOMPATIBILITY.
  4296 
  4297 * Numeric types are mapped by default to target language numerals:
  4298 natural (replaces former code_numeral) and integer (replaces former
  4299 code_int).  Conversions are available as integer_of_natural /
  4300 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
  4301 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
  4302 ML).  INCOMPATIBILITY.
  4303 
  4304 * Function package: For mutually recursive functions f and g, separate
  4305 cases rules f.cases and g.cases are generated instead of unusable
  4306 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
  4307 in the case that the unusable rule was used nevertheless.
  4308 
  4309 * Function package: For each function f, new rules f.elims are
  4310 generated, which eliminate equalities of the form "f x = t".
  4311 
  4312 * New command 'fun_cases' derives ad-hoc elimination rules for
  4313 function equations as simplified instances of f.elims, analogous to
  4314 inductive_cases.  See ~~/src/HOL/ex/Fundefs.thy for some examples.
  4315 
  4316 * Lifting:
  4317   - parametrized correspondence relations are now supported:
  4318     + parametricity theorems for the raw term can be specified in
  4319       the command lift_definition, which allow us to generate stronger
  4320       transfer rules
  4321     + setup_lifting generates stronger transfer rules if parametric
  4322       correspondence relation can be generated
  4323     + various new properties of the relator must be specified to support
  4324       parametricity
  4325     + parametricity theorem for the Quotient relation can be specified
  4326   - setup_lifting generates domain rules for the Transfer package
  4327   - stronger reflexivity prover of respectfulness theorems for type
  4328     copies
  4329   - ===> and --> are now local. The symbols can be introduced
  4330     by interpreting the locale lifting_syntax (typically in an
  4331     anonymous context)
  4332   - Lifting/Transfer relevant parts of Library/Quotient_* are now in
  4333     Main. Potential INCOMPATIBILITY
  4334   - new commands for restoring and deleting Lifting/Transfer context:
  4335     lifting_forget, lifting_update
  4336   - the command print_quotmaps was renamed to print_quot_maps.
  4337     INCOMPATIBILITY
  4338 
  4339 * Transfer:
  4340   - better support for domains in Transfer: replace Domainp T
  4341     by the actual invariant in a transferred goal
  4342   - transfer rules can have as assumptions other transfer rules
  4343   - Experimental support for transferring from the raw level to the
  4344     abstract level: Transfer.transferred attribute
  4345   - Attribute version of the transfer method: untransferred attribute
  4346 
  4347 * Reification and reflection:
  4348   - Reification is now directly available in HOL-Main in structure
  4349     "Reification".
  4350   - Reflection now handles multiple lists with variables also.
  4351   - The whole reflection stack has been decomposed into conversions.
  4352 INCOMPATIBILITY.
  4353 
  4354 * Revised devices for recursive definitions over finite sets:
  4355   - Only one fundamental fold combinator on finite set remains:
  4356     Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
  4357     This is now identity on infinite sets.
  4358   - Locales ("mini packages") for fundamental definitions with
  4359     Finite_Set.fold: folding, folding_idem.
  4360   - Locales comm_monoid_set, semilattice_order_set and
  4361     semilattice_neutr_order_set for big operators on sets.
  4362     See theory Big_Operators for canonical examples.
  4363     Note that foundational constants comm_monoid_set.F and
  4364     semilattice_set.F correspond to former combinators fold_image
  4365     and fold1 respectively.  These are now gone.  You may use
  4366     those foundational constants as substitutes, but it is
  4367     preferable to interpret the above locales accordingly.
  4368   - Dropped class ab_semigroup_idem_mult (special case of lattice,
  4369     no longer needed in connection with Finite_Set.fold etc.)
  4370   - Fact renames:
  4371       card.union_inter ~> card_Un_Int [symmetric]
  4372       card.union_disjoint ~> card_Un_disjoint
  4373 INCOMPATIBILITY.
  4374 
  4375 * Locale hierarchy for abstract orderings and (semi)lattices.
  4376 
  4377 * Complete_Partial_Order.admissible is defined outside the type class
  4378 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
  4379 class predicate assumption or sort constraint when possible.
  4380 INCOMPATIBILITY.
  4381 
  4382 * Introduce type class "conditionally_complete_lattice": Like a
  4383 complete lattice but does not assume the existence of the top and
  4384 bottom elements.  Allows to generalize some lemmas about reals and
  4385 extended reals.  Removed SupInf and replaced it by the instantiation
  4386 of conditionally_complete_lattice for real. Renamed lemmas about
  4387 conditionally-complete lattice from Sup_... to cSup_... and from
  4388 Inf_...  to cInf_... to avoid hidding of similar complete lattice
  4389 lemmas.
  4390 
  4391 * Introduce type class linear_continuum as combination of
  4392 conditionally-complete lattices and inner dense linorders which have
  4393 more than one element.  INCOMPATIBILITY.
  4394 
  4395 * Introduced type classes order_top and order_bot. The old classes top
  4396 and bot only contain the syntax without assumptions.  INCOMPATIBILITY:
  4397 Rename bot -> order_bot, top -> order_top
  4398 
  4399 * Introduce type classes "no_top" and "no_bot" for orderings without
  4400 top and bottom elements.
  4401 
  4402 * Split dense_linorder into inner_dense_order and no_top, no_bot.
  4403 
  4404 * Complex_Main: Unify and move various concepts from
  4405 HOL-Multivariate_Analysis to HOL-Complex_Main.
  4406 
  4407  - Introduce type class (lin)order_topology and
  4408    linear_continuum_topology.  Allows to generalize theorems about
  4409    limits and order.  Instances are reals and extended reals.
  4410 
  4411  - continuous and continuos_on from Multivariate_Analysis:
  4412    "continuous" is the continuity of a function at a filter.  "isCont"
  4413    is now an abbrevitation: "isCont x f == continuous (at _) f".
  4414 
  4415    Generalized continuity lemmas from isCont to continuous on an
  4416    arbitrary filter.
  4417 
  4418  - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
  4419    compactness of closed intervals on reals. Continuous functions
  4420    attain infimum and supremum on compact sets. The inverse of a
  4421    continuous function is continuous, when the function is continuous
  4422    on a compact set.
  4423 
  4424  - connected from Multivariate_Analysis. Use it to prove the
  4425    intermediate value theorem. Show connectedness of intervals on
  4426    linear_continuum_topology).
  4427 
  4428  - first_countable_topology from Multivariate_Analysis. Is used to
  4429    show equivalence of properties on the neighbourhood filter of x and
  4430    on all sequences converging to x.
  4431 
  4432  - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
  4433    theorems from Library/FDERIV.thy to Deriv.thy and base the
  4434    definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
  4435    which are restricted to sets, i.e. to represent derivatives from
  4436    left or right.
  4437 
  4438  - Removed the within-filter. It is replaced by the principal filter:
  4439 
  4440      F within X = inf F (principal X)
  4441 
  4442  - Introduce "at x within U" as a single constant, "at x" is now an
  4443    abbreviation for "at x within UNIV"
  4444 
  4445  - Introduce named theorem collections tendsto_intros,
  4446    continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
  4447    in tendsto_intros (or FDERIV_intros) are also available as
  4448    tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
  4449    is replaced by a congruence rule. This allows to apply them as
  4450    intro rules and then proving equivalence by the simplifier.
  4451 
  4452  - Restructured theories in HOL-Complex_Main:
  4453 
  4454    + Moved RealDef and RComplete into Real
  4455 
  4456    + Introduced Topological_Spaces and moved theorems about
  4457      topological spaces, filters, limits and continuity to it
  4458 
  4459    + Renamed RealVector to Real_Vector_Spaces
  4460 
  4461    + Split Lim, SEQ, Series into Topological_Spaces,
  4462      Real_Vector_Spaces, and Limits
  4463 
  4464    + Moved Ln and Log to Transcendental
  4465 
  4466    + Moved theorems about continuity from Deriv to Topological_Spaces
  4467 
  4468  - Remove various auxiliary lemmas.
  4469 
  4470 INCOMPATIBILITY.
  4471 
  4472 * Nitpick:
  4473   - Added option "spy".
  4474   - Reduce incidence of "too high arity" errors.
  4475 
  4476 * Sledgehammer:
  4477   - Renamed option:
  4478       isar_shrink ~> isar_compress
  4479     INCOMPATIBILITY.
  4480   - Added options "isar_try0", "spy".
  4481   - Better support for "isar_proofs".
  4482   - MaSh has been fined-tuned and now runs as a local server.
  4483 
  4484 * Improved support for ad hoc overloading of constants (see also
  4485 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
  4486 
  4487 * Library/Polynomial.thy:
  4488   - Use lifting for primitive definitions.
  4489   - Explicit conversions from and to lists of coefficients, used for
  4490     generated code.
  4491   - Replaced recursion operator poly_rec by fold_coeffs.
  4492   - Prefer pre-existing gcd operation for gcd.
  4493   - Fact renames:
  4494     poly_eq_iff ~> poly_eq_poly_eq_iff
  4495     poly_ext ~> poly_eqI
  4496     expand_poly_eq ~> poly_eq_iff
  4497 IMCOMPATIBILITY.
  4498 
  4499 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
  4500 case_of_simps to convert function definitions between a list of
  4501 equations with patterns on the lhs and a single equation with case
  4502 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
  4503 
  4504 * New Library/FSet.thy: type of finite sets defined as a subtype of
  4505 sets defined by Lifting/Transfer.
  4506 
  4507 * Discontinued theory src/HOL/Library/Eval_Witness.  INCOMPATIBILITY.
  4508 
  4509 * Consolidation of library theories on product orders:
  4510 
  4511     Product_Lattice ~> Product_Order -- pointwise order on products
  4512     Product_ord ~> Product_Lexorder -- lexicographic order on products
  4513 
  4514 INCOMPATIBILITY.
  4515 
  4516 * Imperative-HOL: The MREC combinator is considered legacy and no
  4517 longer included by default. INCOMPATIBILITY, use partial_function
  4518 instead, or import theory Legacy_Mrec as a fallback.
  4519 
  4520 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
  4521 ~~/src/HOL/Algebra/poly.  Existing theories should be based on
  4522 ~~/src/HOL/Library/Polynomial instead.  The latter provides
  4523 integration with HOL's type classes for rings.  INCOMPATIBILITY.
  4524 
  4525 * HOL-BNF:
  4526   - Various improvements to BNF-based (co)datatype package, including
  4527     new commands "primrec_new", "primcorec", and
  4528     "datatype_new_compat", as well as documentation. See
  4529     "datatypes.pdf" for details.
  4530   - New "coinduction" method to avoid some boilerplate (compared to
  4531     coinduct).
  4532   - Renamed keywords:
  4533     data ~> datatype_new
  4534     codata ~> codatatype
  4535     bnf_def ~> bnf
  4536   - Renamed many generated theorems, including
  4537     discs ~> disc
  4538     map_comp' ~> map_comp
  4539     map_id' ~> map_id
  4540     sels ~> sel
  4541     set_map' ~> set_map
  4542     sets ~> set
  4543 IMCOMPATIBILITY.
  4544 
  4545 
  4546 *** ML ***
  4547 
  4548 * Spec_Check is a Quickcheck tool for Isabelle/ML.  The ML function
  4549 "check_property" allows to check specifications of the form "ALL x y
  4550 z. prop x y z".  See also ~~/src/Tools/Spec_Check/ with its
  4551 Examples.thy in particular.
  4552 
  4553 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
  4554 tracing output in the command transaction context instead of physical
  4555 stdout.  See also Toplevel.debug, Toplevel.debugging and
  4556 ML_Compiler.exn_trace.
  4557 
  4558 * ML type "theory" is now immutable, without any special treatment of
  4559 drafts or linear updates (which could lead to "stale theory" errors in
  4560 the past).  Discontinued obsolete operations like Theory.copy,
  4561 Theory.checkpoint, and the auxiliary type theory_ref.  Minor
  4562 INCOMPATIBILITY.
  4563 
  4564 * More uniform naming of goal functions for skipped proofs:
  4565 
  4566     Skip_Proof.prove  ~>  Goal.prove_sorry
  4567     Skip_Proof.prove_global  ~>  Goal.prove_sorry_global
  4568 
  4569 Minor INCOMPATIBILITY.
  4570 
  4571 * Simplifier tactics and tools use proper Proof.context instead of
  4572 historic type simpset.  Old-style declarations like addsimps,
  4573 addsimprocs etc. operate directly on Proof.context.  Raw type simpset
  4574 retains its use as snapshot of the main Simplifier context, using
  4575 simpset_of and put_simpset on Proof.context.  INCOMPATIBILITY -- port
  4576 old tools by making them depend on (ctxt : Proof.context) instead of
  4577 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
  4578 
  4579 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
  4580 operate on Proof.context instead of claset, for uniformity with addIs,
  4581 addEs, addDs etc. Note that claset_of and put_claset allow to manage
  4582 clasets separately from the context.
  4583 
  4584 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
  4585 INCOMPATIBILITY, use @{context} instead.
  4586 
  4587 * Antiquotation @{theory_context A} is similar to @{theory A}, but
  4588 presents the result as initial Proof.context.
  4589 
  4590 
  4591 *** System ***
  4592 
  4593 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
  4594 "isabelle build" in Isabelle2013.  INCOMPATIBILITY.
  4595 
  4596 * Discontinued obsolete isabelle-process options -f and -u (former
  4597 administrative aliases of option -e).  Minor INCOMPATIBILITY.
  4598 
  4599 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
  4600 settings variable.
  4601 
  4602 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
  4603 document formats: dvi.gz, ps, ps.gz -- the default document format is
  4604 always pdf.
  4605 
  4606 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
  4607 specify global resources of the JVM process run by isabelle build.
  4608 
  4609 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
  4610 to run Isabelle/Scala source files as standalone programs.
  4611 
  4612 * Improved "isabelle keywords" tool (for old-style ProofGeneral
  4613 keyword tables): use Isabelle/Scala operations, which inspect outer
  4614 syntax without requiring to build sessions first.
  4615 
  4616 * Sessions may be organized via 'chapter' specifications in the ROOT
  4617 file, which determines a two-level hierarchy of browser info.  The old
  4618 tree-like organization via implicit sub-session relation (with its
  4619 tendency towards erratic fluctuation of URLs) has been discontinued.
  4620 The default chapter is called "Unsorted".  Potential INCOMPATIBILITY
  4621 for HTML presentation of theories.
  4622 
  4623 
  4624 
  4625 New in Isabelle2013 (February 2013)
  4626 -----------------------------------
  4627 
  4628 *** General ***
  4629 
  4630 * Theorem status about oracles and unfinished/failed future proofs is
  4631 no longer printed by default, since it is incompatible with
  4632 incremental / parallel checking of the persistent document model.  ML
  4633 function Thm.peek_status may be used to inspect a snapshot of the
  4634 ongoing evaluation process.  Note that in batch mode --- notably
  4635 isabelle build --- the system ensures that future proofs of all
  4636 accessible theorems in the theory context are finished (as before).
  4637 
  4638 * Configuration option show_markup controls direct inlining of markup
  4639 into the printed representation of formal entities --- notably type
  4640 and sort constraints.  This enables Prover IDE users to retrieve that
  4641 information via tooltips in the output window, for example.
  4642 
  4643 * Command 'ML_file' evaluates ML text from a file directly within the
  4644 theory, without any predeclaration via 'uses' in the theory header.
  4645 
  4646 * Old command 'use' command and corresponding keyword 'uses' in the
  4647 theory header are legacy features and will be discontinued soon.
  4648 Tools that load their additional source files may imitate the
  4649 'ML_file' implementation, such that the system can take care of
  4650 dependencies properly.
  4651 
  4652 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
  4653 is called fastforce / fast_force_tac already since Isabelle2011-1.
  4654 
  4655 * Updated and extended "isar-ref" and "implementation" manual, reduced
  4656 remaining material in old "ref" manual.
  4657 
  4658 * Improved support for auxiliary contexts that indicate block structure
  4659 for specifications.  Nesting of "context fixes ... context assumes ..."
  4660 and "class ... context ...".
  4661 
  4662 * Attribute "consumes" allows a negative value as well, which is
  4663 interpreted relatively to the total number of premises of the rule in
  4664 the target context.  This form of declaration is stable when exported
  4665 from a nested 'context' with additional assumptions.  It is the
  4666 preferred form for definitional packages, notably cases/rules produced
  4667 in HOL/inductive and HOL/function.
  4668 
  4669 * More informative error messages for Isar proof commands involving
  4670 lazy enumerations (method applications etc.).
  4671 
  4672 * Refined 'help' command to retrieve outer syntax commands according
  4673 to name patterns (with clickable results).
  4674 
  4675 
  4676 *** Prover IDE -- Isabelle/Scala/jEdit ***
  4677 
  4678 * Parallel terminal proofs ('by') are enabled by default, likewise
  4679 proofs that are built into packages like 'datatype', 'function'.  This
  4680 allows to "run ahead" checking the theory specifications on the
  4681 surface, while the prover is still crunching on internal
  4682 justifications.  Unfinished / cancelled proofs are restarted as
  4683 required to complete full proof checking eventually.
  4684 
  4685 * Improved output panel with tooltips, hyperlinks etc. based on the
  4686 same Rich_Text_Area as regular Isabelle/jEdit buffers.  Activation of
  4687 tooltips leads to some window that supports the same recursively,
  4688 which can lead to stacks of tooltips as the semantic document content
  4689 is explored.  ESCAPE closes the whole stack, individual windows may be
  4690 closed separately, or detached to become independent jEdit dockables.
  4691 
  4692 * Improved support for commands that produce graph output: the text
  4693 message contains a clickable area to open a new instance of the graph
  4694 browser on demand.
  4695 
  4696 * More robust incremental parsing of outer syntax (partial comments,
  4697 malformed symbols).  Changing the balance of open/close quotes and
  4698 comment delimiters works more conveniently with unfinished situations
  4699 that frequently occur in user interaction.
  4700 
  4701 * More efficient painting and improved reactivity when editing large
  4702 files.  More scalable management of formal document content.
  4703 
  4704 * Smarter handling of tracing messages: prover process pauses after
  4705 certain number of messages per command transaction, with some user
  4706 dialog to stop or continue.  This avoids swamping the front-end with
  4707 potentially infinite message streams.
  4708 
  4709 * More plugin options and preferences, based on Isabelle/Scala.  The
  4710 jEdit plugin option panel provides access to some Isabelle/Scala
  4711 options, including tuning parameters for editor reactivity and color
  4712 schemes.
  4713 
  4714 * Dockable window "Symbols" provides some editing support for Isabelle
  4715 symbols.
  4716 
  4717 * Dockable window "Monitor" shows ML runtime statistics.  Note that
  4718 continuous display of the chart slows down the system.
  4719 
  4720 * Improved editing support for control styles: subscript, superscript,
  4721 bold, reset of style -- operating on single symbols or text
  4722 selections.  Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
  4723 
  4724 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
  4725 adjust the main text area font size, and its derivatives for output,
  4726 tooltips etc.  Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
  4727 need to be adapted to local keyboard layouts.
  4728 
  4729 * More reactive completion popup by default: use \t (TAB) instead of
  4730 \n (NEWLINE) to minimize intrusion into regular flow of editing.  See
  4731 also "Plugin Options / SideKick / General / Code Completion Options".
  4732 
  4733 * Implicit check and build dialog of the specified logic session
  4734 image.  For example, HOL, HOLCF, HOL-Nominal can be produced on
  4735 demand, without bundling big platform-dependent heap images in the
  4736 Isabelle distribution.
  4737 
  4738 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
  4739 from Oracle provide better multi-platform experience.  This version is
  4740 now bundled exclusively with Isabelle.
  4741 
  4742 
  4743 *** Pure ***
  4744 
  4745 * Code generation for Haskell: restrict unqualified imports from
  4746 Haskell Prelude to a small set of fundamental operations.
  4747 
  4748 * Command 'export_code': relative file names are interpreted
  4749 relatively to master directory of current theory rather than the
  4750 rather arbitrary current working directory.  INCOMPATIBILITY.
  4751 
  4752 * Discontinued obsolete attribute "COMP".  Potential INCOMPATIBILITY,
  4753 use regular rule composition via "OF" / "THEN", or explicit proof
  4754 structure instead.  Note that Isabelle/ML provides a variety of
  4755 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
  4756 with some care where this is really required.
  4757 
  4758 * Command 'typ' supports an additional variant with explicit sort
  4759 constraint, to infer and check the most general type conforming to a
  4760 given sort.  Example (in HOL):
  4761 
  4762   typ "_ * _ * bool * unit" :: finite
  4763 
  4764 * Command 'locale_deps' visualizes all locales and their relations as
  4765 a Hasse diagram.
  4766 
  4767 
  4768 *** HOL ***
  4769 
  4770 * Sledgehammer:
  4771 
  4772   - Added MaSh relevance filter based on machine-learning; see the
  4773     Sledgehammer manual for details.
  4774   - Polished Isar proofs generated with "isar_proofs" option.
  4775   - Rationalized type encodings ("type_enc" option).
  4776   - Renamed "kill_provers" subcommand to "kill_all".
  4777   - Renamed options:
  4778       isar_proof ~> isar_proofs
  4779       isar_shrink_factor ~> isar_shrink
  4780       max_relevant ~> max_facts
  4781       relevance_thresholds ~> fact_thresholds
  4782 
  4783 * Quickcheck: added an optimisation for equality premises.  It is
  4784 switched on by default, and can be switched off by setting the
  4785 configuration quickcheck_optimise_equality to false.
  4786 
  4787 * Quotient: only one quotient can be defined by quotient_type
  4788 INCOMPATIBILITY.
  4789 
  4790 * Lifting:
  4791   - generation of an abstraction function equation in lift_definition
  4792   - quot_del attribute
  4793   - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
  4794 
  4795 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
  4796 expressions.
  4797 
  4798 * Preprocessing of the code generator rewrites set comprehensions into
  4799 pointfree expressions.
  4800 
  4801 * The SMT solver Z3 has now by default a restricted set of directly
  4802 supported features. For the full set of features (div/mod, nonlinear
  4803 arithmetic, datatypes/records) with potential proof reconstruction
  4804 failures, enable the configuration option "z3_with_extensions".  Minor
  4805 INCOMPATIBILITY.
  4806 
  4807 * Simplified 'typedef' specifications: historical options for implicit
  4808 set definition and alternative name have been discontinued.  The
  4809 former behavior of "typedef (open) t = A" is now the default, but
  4810 written just "typedef t = A".  INCOMPATIBILITY, need to adapt theories
  4811 accordingly.
  4812 
  4813 * Removed constant "chars"; prefer "Enum.enum" on type "char"
  4814 directly.  INCOMPATIBILITY.
  4815 
  4816 * Moved operation product, sublists and n_lists from theory Enum to
  4817 List.  INCOMPATIBILITY.
  4818 
  4819 * Theorem UN_o generalized to SUP_comp.  INCOMPATIBILITY.
  4820 
  4821 * Class "comm_monoid_diff" formalises properties of bounded
  4822 subtraction, with natural numbers and multisets as typical instances.
  4823 
  4824 * Added combinator "Option.these" with type "'a option set => 'a set".
  4825 
  4826 * Theory "Transitive_Closure": renamed lemmas
  4827 
  4828   reflcl_tranclp -> reflclp_tranclp
  4829   rtranclp_reflcl -> rtranclp_reflclp
  4830 
  4831 INCOMPATIBILITY.
  4832 
  4833 * Theory "Rings": renamed lemmas (in class semiring)
  4834 
  4835   left_distrib ~> distrib_right
  4836   right_distrib ~> distrib_left
  4837 
  4838 INCOMPATIBILITY.
  4839 
  4840 * Generalized the definition of limits:
  4841 
  4842   - Introduced the predicate filterlim (LIM x F. f x :> G) which
  4843     expresses that when the input values x converge to F then the
  4844     output f x converges to G.
  4845 
  4846   - Added filters for convergence to positive (at_top) and negative
  4847     infinity (at_bot).
  4848 
  4849   - Moved infinity in the norm (at_infinity) from
  4850     Multivariate_Analysis to Complex_Main.
  4851 
  4852   - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
  4853     at_top".
  4854 
  4855 INCOMPATIBILITY.
  4856 
  4857 * Theory "Library/Option_ord" provides instantiation of option type to
  4858 lattice type classes.
  4859 
  4860 * Theory "Library/Multiset": renamed
  4861 
  4862     constant fold_mset ~> Multiset.fold
  4863     fact fold_mset_commute ~> fold_mset_comm
  4864 
  4865 INCOMPATIBILITY.
  4866 
  4867 * Renamed theory Library/List_Prefix to Library/Sublist, with related
  4868 changes as follows.
  4869 
  4870   - Renamed constants (and related lemmas)
  4871 
  4872       prefix ~> prefixeq
  4873       strict_prefix ~> prefix
  4874 
  4875   - Replaced constant "postfix" by "suffixeq" with swapped argument
  4876     order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
  4877     old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
  4878     Renamed lemmas accordingly.
  4879 
  4880   - Added constant "list_hembeq" for homeomorphic embedding on
  4881     lists. Added abbreviation "sublisteq" for special case
  4882     "list_hembeq (op =)".
  4883 
  4884   - Theory Library/Sublist no longer provides "order" and "bot" type
  4885     class instances for the prefix order (merely corresponding locale
  4886     interpretations). The type class instances are now in theory
  4887     Library/Prefix_Order.
  4888 
  4889   - The sublist relation of theory Library/Sublist_Order is now based
  4890     on "Sublist.sublisteq".  Renamed lemmas accordingly:
  4891 
  4892       le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
  4893       le_list_append_mono ~> Sublist.list_hembeq_append_mono
  4894       le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
  4895       le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
  4896       le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
  4897       le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
  4898       le_list_drop_Cons ~> Sublist.sublisteq_Cons'
  4899       le_list_drop_many ~> Sublist.sublisteq_drop_many
  4900       le_list_filter_left ~> Sublist.sublisteq_filter_left
  4901       le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
  4902       le_list_rev_take_iff ~> Sublist.sublisteq_append
  4903       le_list_same_length ~> Sublist.sublisteq_same_length
  4904       le_list_take_many_iff ~> Sublist.sublisteq_append'
  4905       less_eq_list.drop ~> less_eq_list_drop
  4906       less_eq_list.induct ~> less_eq_list_induct
  4907       not_le_list_length ~> Sublist.not_sublisteq_length
  4908 
  4909 INCOMPATIBILITY.
  4910 
  4911 * New theory Library/Countable_Set.
  4912 
  4913 * Theory Library/Debug and Library/Parallel provide debugging and
  4914 parallel execution for code generated towards Isabelle/ML.
  4915 
  4916 * Theory Library/FuncSet: Extended support for Pi and extensional and
  4917 introduce the extensional dependent function space "PiE". Replaced
  4918 extensional_funcset by an abbreviation, and renamed lemmas from
  4919 extensional_funcset to PiE as follows:
  4920 
  4921   extensional_empty  ~>  PiE_empty
  4922   extensional_funcset_empty_domain  ~>  PiE_empty_domain
  4923   extensional_funcset_empty_range  ~>  PiE_empty_range
  4924   extensional_funcset_arb  ~>  PiE_arb
  4925   extensional_funcset_mem  ~>  PiE_mem
  4926   extensional_funcset_extend_domainI  ~>  PiE_fun_upd
  4927   extensional_funcset_restrict_domain  ~>  fun_upd_in_PiE
  4928   extensional_funcset_extend_domain_eq  ~>  PiE_insert_eq
  4929   card_extensional_funcset  ~>  card_PiE
  4930   finite_extensional_funcset  ~>  finite_PiE
  4931 
  4932 INCOMPATIBILITY.
  4933 
  4934 * Theory Library/FinFun: theory of almost everywhere constant
  4935 functions (supersedes the AFP entry "Code Generation for Functions as
  4936 Data").
  4937 
  4938 * Theory Library/Phantom: generic phantom type to make a type
  4939 parameter appear in a constant's type.  This alternative to adding
  4940 TYPE('a) as another parameter avoids unnecessary closures in generated
  4941 code.
  4942 
  4943 * Theory Library/RBT_Impl: efficient construction of red-black trees
  4944 from sorted associative lists. Merging two trees with rbt_union may
  4945 return a structurally different tree than before.  Potential
  4946 INCOMPATIBILITY.
  4947 
  4948 * Theory Library/IArray: immutable arrays with code generation.
  4949 
  4950 * Theory Library/Finite_Lattice: theory of finite lattices.
  4951 
  4952 * HOL/Multivariate_Analysis: replaced
  4953 
  4954   "basis :: 'a::euclidean_space => nat => real"
  4955   "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
  4956 
  4957 on euclidean spaces by using the inner product "_ \<bullet> _" with
  4958 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
  4959 "SUM i : Basis. f i * r i".
  4960 
  4961   With this change the following constants are also changed or removed:
  4962 
  4963     DIM('a) :: nat  ~>  card (Basis :: 'a set)   (is an abbreviation)
  4964     a $$ i  ~>  inner a i  (where i : Basis)
  4965     cart_base i  removed
  4966     \<pi>, \<pi>'  removed
  4967 
  4968   Theorems about these constants where removed.
  4969 
  4970   Renamed lemmas:
  4971 
  4972     component_le_norm  ~>  Basis_le_norm
  4973     euclidean_eq  ~>  euclidean_eq_iff
  4974     differential_zero_maxmin_component  ~>  differential_zero_maxmin_cart
  4975     euclidean_simps  ~>  inner_simps
  4976     independent_basis  ~>  independent_Basis
  4977     span_basis  ~>  span_Basis
  4978     in_span_basis  ~>  in_span_Basis
  4979     norm_bound_component_le  ~>  norm_boound_Basis_le
  4980     norm_bound_component_lt  ~>  norm_boound_Basis_lt
  4981     component_le_infnorm  ~>  Basis_le_infnorm
  4982 
  4983 INCOMPATIBILITY.
  4984 
  4985 * HOL/Probability:
  4986 
  4987   - Added simproc "measurable" to automatically prove measurability.
  4988 
  4989   - Added induction rules for sigma sets with disjoint union
  4990     (sigma_sets_induct_disjoint) and for Borel-measurable functions
  4991     (borel_measurable_induct).
  4992 
  4993   - Added the Daniell-Kolmogorov theorem (the existence the limit of a
  4994     projective family).
  4995 
  4996 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
  4997 AFP entry "Ordinals_and_Cardinals").
  4998 
  4999 * HOL/BNF: New (co)datatype package based on bounded natural functors
  5000 with support for mixed, nested recursion and interesting non-free
  5001 datatypes.
  5002 
  5003 * HOL/Finite_Set and Relation: added new set and relation operations
  5004 expressed by Finite_Set.fold.
  5005 
  5006 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
  5007 trees for the code generator.
  5008 
  5009 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
  5010 Lifting/Transfer.
  5011 possible INCOMPATIBILITY.
  5012 
  5013 * HOL/Set: renamed Set.project -> Set.filter
  5014 INCOMPATIBILITY.
  5015 
  5016 
  5017 *** Document preparation ***
  5018 
  5019 * Dropped legacy antiquotations "term_style" and "thm_style", since
  5020 styles may be given as arguments to "term" and "thm" already.
  5021 Discontinued legacy styles "prem1" .. "prem19".
  5022 
  5023 * Default LaTeX rendering for \<euro> is now based on eurosym package,
  5024 instead of slightly exotic babel/greek.
  5025 
  5026 * Document variant NAME may use different LaTeX entry point
  5027 document/root_NAME.tex if that file exists, instead of the common
  5028 document/root.tex.
  5029 
  5030 * Simplified custom document/build script, instead of old-style
  5031 document/IsaMakefile.  Minor INCOMPATIBILITY.
  5032 
  5033 
  5034 *** ML ***
  5035 
  5036 * The default limit for maximum number of worker threads is now 8,
  5037 instead of 4, in correspondence to capabilities of contemporary
  5038 hardware and Poly/ML runtime system.
  5039 
  5040 * Type Seq.results and related operations support embedded error
  5041 messages within lazy enumerations, and thus allow to provide
  5042 informative errors in the absence of any usable results.
  5043 
  5044 * Renamed Position.str_of to Position.here to emphasize that this is a
  5045 formal device to inline positions into message text, but not
  5046 necessarily printing visible text.
  5047 
  5048 
  5049 *** System ***
  5050 
  5051 * Advanced support for Isabelle sessions and build management, see
  5052 "system" manual for the chapter of that name, especially the "isabelle
  5053 build" tool and its examples.  The "isabelle mkroot" tool prepares
  5054 session root directories for use with "isabelle build", similar to
  5055 former "isabelle mkdir" for "isabelle usedir".  Note that this affects
  5056 document preparation as well.  INCOMPATIBILITY, isabelle usedir /
  5057 mkdir / make are rendered obsolete.
  5058 
  5059 * Discontinued obsolete Isabelle/build script, it is superseded by the
  5060 regular isabelle build tool.  For example:
  5061 
  5062   isabelle build -s -b HOL
  5063 
  5064 * Discontinued obsolete "isabelle makeall".
  5065 
  5066 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
  5067 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
  5068 provides some traditional targets that invoke "isabelle build".  Note
  5069 that this is inefficient!  Applications of Isabelle/HOL involving
  5070 "isabelle make" should be upgraded to use "isabelle build" directly.
  5071 
  5072 * The "isabelle options" tool prints Isabelle system options, as
  5073 required for "isabelle build", for example.
  5074 
  5075 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
  5076 Minor INCOMPATIBILITY in command-line options.
  5077 
  5078 * The "isabelle install" tool has now a simpler command-line.  Minor
  5079 INCOMPATIBILITY.
  5080 
  5081 * The "isabelle components" tool helps to resolve add-on components
  5082 that are not bundled, or referenced from a bare-bones repository
  5083 version of Isabelle.
  5084 
  5085 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
  5086 platform family: "linux", "macos", "windows".
  5087 
  5088 * The ML system is configured as regular component, and no longer
  5089 picked up from some surrounding directory.  Potential INCOMPATIBILITY
  5090 for home-made settings.
  5091 
  5092 * Improved ML runtime statistics (heap, threads, future tasks etc.).
  5093 
  5094 * Discontinued support for Poly/ML 5.2.1, which was the last version
  5095 without exception positions and advanced ML compiler/toplevel
  5096 configuration.
  5097 
  5098 * Discontinued special treatment of Proof General -- no longer guess
  5099 PROOFGENERAL_HOME based on accidental file-system layout.  Minor
  5100 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
  5101 settings manually, or use a Proof General version that has been
  5102 bundled as Isabelle component.
  5103 
  5104 
  5105 
  5106 New in Isabelle2012 (May 2012)
  5107 ------------------------------
  5108 
  5109 *** General ***
  5110 
  5111 * Prover IDE (PIDE) improvements:
  5112 
  5113   - more robust Sledgehammer integration (as before the sledgehammer
  5114     command-line needs to be typed into the source buffer)
  5115   - markup for bound variables
  5116   - markup for types of term variables (displayed as tooltips)
  5117   - support for user-defined Isar commands within the running session
  5118   - improved support for Unicode outside original 16bit range
  5119     e.g. glyph for \<A> (thanks to jEdit 4.5.1)
  5120 
  5121 * Forward declaration of outer syntax keywords within the theory
  5122 header -- minor INCOMPATIBILITY for user-defined commands.  Allow new
  5123 commands to be used in the same theory where defined.
  5124 
  5125 * Auxiliary contexts indicate block structure for specifications with
  5126 additional parameters and assumptions.  Such unnamed contexts may be
  5127 nested within other targets, like 'theory', 'locale', 'class',
  5128 'instantiation' etc.  Results from the local context are generalized
  5129 accordingly and applied to the enclosing target context.  Example:
  5130 
  5131   context
  5132     fixes x y z :: 'a
  5133     assumes xy: "x = y" and yz: "y = z"
  5134   begin
  5135 
  5136   lemma my_trans: "x = z" using xy yz by simp
  5137 
  5138   end
  5139 
  5140   thm my_trans
  5141 
  5142 The most basic application is to factor-out context elements of
  5143 several fixes/assumes/shows theorem statements, e.g. see
  5144 ~~/src/HOL/Isar_Examples/Group_Context.thy
  5145 
  5146 Any other local theory specification element works within the "context
  5147 ... begin ... end" block as well.
  5148 
  5149 * Bundled declarations associate attributed fact expressions with a
  5150 given name in the context.  These may be later included in other
  5151 contexts.  This allows to manage context extensions casually, without
  5152 the logical dependencies of locales and locale interpretation.  See
  5153 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
  5154 
  5155 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
  5156 declaration, and results are standardized before being stored.  Thus
  5157 old-style "standard" after instantiation or composition of facts
  5158 becomes obsolete.  Minor INCOMPATIBILITY, due to potential change of
  5159 indices of schematic variables.
  5160 
  5161 * Rule attributes in local theory declarations (e.g. locale or class)
  5162 are now statically evaluated: the resulting theorem is stored instead
  5163 of the original expression.  INCOMPATIBILITY in rare situations, where
  5164 the historic accident of dynamic re-evaluation in interpretations
  5165 etc. was exploited.
  5166 
  5167 * New tutorial "Programming and Proving in Isabelle/HOL"
  5168 ("prog-prove").  It completely supersedes "A Tutorial Introduction to
  5169 Structured Isar Proofs" ("isar-overview"), which has been removed.  It
  5170 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
  5171 Logic" as the recommended beginners tutorial, but does not cover all
  5172 of the material of that old tutorial.
  5173 
  5174 * Updated and extended reference manuals: "isar-ref",
  5175 "implementation", "system"; reduced remaining material in old "ref"
  5176 manual.
  5177 
  5178 
  5179 *** Pure ***
  5180 
  5181 * Command 'definition' no longer exports the foundational "raw_def"
  5182 into the user context.  Minor INCOMPATIBILITY, may use the regular
  5183 "def" result with attribute "abs_def" to imitate the old version.
  5184 
  5185 * Attribute "abs_def" turns an equation of the form "f x y == t" into
  5186 "f == %x y. t", which ensures that "simp" or "unfold" steps always
  5187 expand it.  This also works for object-logic equality.  (Formerly
  5188 undocumented feature.)
  5189 
  5190 * Sort constraints are now propagated in simultaneous statements, just
  5191 like type constraints.  INCOMPATIBILITY in rare situations, where
  5192 distinct sorts used to be assigned accidentally.  For example:
  5193 
  5194   lemma "P (x::'a::foo)" and "Q (y::'a::bar)"  -- "now illegal"
  5195 
  5196   lemma "P (x::'a)" and "Q (y::'a::bar)"
  5197     -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
  5198 
  5199 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
  5200 tolerant against multiple unifiers, as long as the final result is
  5201 unique.  (As before, rules are composed in canonical right-to-left
  5202 order to accommodate newly introduced premises.)
  5203 
  5204 * Renamed some inner syntax categories:
  5205 
  5206     num ~> num_token
  5207     xnum ~> xnum_token
  5208     xstr ~> str_token
  5209 
  5210 Minor INCOMPATIBILITY.  Note that in practice "num_const" or
  5211 "num_position" etc. are mainly used instead (which also include
  5212 position information via constraints).
  5213 
  5214 * Simplified configuration options for syntax ambiguity: see
  5215 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
  5216 manual.  Minor INCOMPATIBILITY.
  5217 
  5218 * Discontinued configuration option "syntax_positions": atomic terms
  5219 in parse trees are always annotated by position constraints.
  5220 
  5221 * Old code generator for SML and its commands 'code_module',
  5222 'code_library', 'consts_code', 'types_code' have been discontinued.
  5223 Use commands of the generic code generator instead.  INCOMPATIBILITY.
  5224 
  5225 * Redundant attribute "code_inline" has been discontinued. Use
  5226 "code_unfold" instead.  INCOMPATIBILITY.
  5227 
  5228 * Dropped attribute "code_unfold_post" in favor of the its dual
  5229 "code_abbrev", which yields a common pattern in definitions like
  5230 
  5231   definition [code_abbrev]: "f = t"
  5232 
  5233 INCOMPATIBILITY.
  5234 
  5235 * Obsolete 'types' command has been discontinued.  Use 'type_synonym'
  5236 instead.  INCOMPATIBILITY.
  5237 
  5238 * Discontinued old "prems" fact, which used to refer to the accidental
  5239 collection of foundational premises in the context (already marked as
  5240 legacy since Isabelle2011).
  5241 
  5242 
  5243 *** HOL ***
  5244 
  5245 * Type 'a set is now a proper type constructor (just as before
  5246 Isabelle2008).  Definitions mem_def and Collect_def have disappeared.
  5247 Non-trivial INCOMPATIBILITY.  For developments keeping predicates and
  5248 sets separate, it is often sufficient to rephrase some set S that has
  5249 been accidentally used as predicates by "%x. x : S", and some
  5250 predicate P that has been accidentally used as set by "{x. P x}".
  5251 Corresponding proofs in a first step should be pruned from any
  5252 tinkering with former theorems mem_def and Collect_def as far as
  5253 possible.
  5254 
  5255 For developments which deliberately mix predicates and sets, a
  5256 planning step is necessary to determine what should become a predicate
  5257 and what a set.  It can be helpful to carry out that step in
  5258 Isabelle2011-1 before jumping right into the current release.
  5259 
  5260 * Code generation by default implements sets as container type rather
  5261 than predicates.  INCOMPATIBILITY.
  5262 
  5263 * New type synonym 'a rel = ('a * 'a) set
  5264 
  5265 * The representation of numerals has changed.  Datatype "num"
  5266 represents strictly positive binary numerals, along with functions
  5267 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
  5268 positive and negated numeric literals, respectively.  See also
  5269 definitions in ~~/src/HOL/Num.thy.  Potential INCOMPATIBILITY, some
  5270 user theories may require adaptations as follows:
  5271 
  5272   - Theorems with number_ring or number_semiring constraints: These
  5273     classes are gone; use comm_ring_1 or comm_semiring_1 instead.
  5274 
  5275   - Theories defining numeric types: Remove number, number_semiring,
  5276     and number_ring instances. Defer all theorems about numerals until
  5277     after classes one and semigroup_add have been instantiated.
  5278 
  5279   - Numeral-only simp rules: Replace each rule having a "number_of v"
  5280     pattern with two copies, one for numeral and one for neg_numeral.
  5281 
  5282   - Theorems about subclasses of semiring_1 or ring_1: These classes
  5283     automatically support numerals now, so more simp rules and
  5284     simprocs may now apply within the proof.
  5285 
  5286   - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
  5287     Redefine using other integer operations.
  5288 
  5289 * Transfer: New package intended to generalize the existing
  5290 "descending" method and related theorem attributes from the Quotient
  5291 package.  (Not all functionality is implemented yet, but future
  5292 development will focus on Transfer as an eventual replacement for the
  5293 corresponding parts of the Quotient package.)
  5294 
  5295   - transfer_rule attribute: Maintains a collection of transfer rules,
  5296     which relate constants at two different types. Transfer rules may
  5297     relate different type instances of the same polymorphic constant,
  5298     or they may relate an operation on a raw type to a corresponding
  5299     operation on an abstract type (quotient or subtype). For example:
  5300 
  5301     ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
  5302     (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
  5303 
  5304   - transfer method: Replaces a subgoal on abstract types with an
  5305     equivalent subgoal on the corresponding raw types. Constants are
  5306     replaced with corresponding ones according to the transfer rules.
  5307     Goals are generalized over all free variables by default; this is
  5308     necessary for variables whose types change, but can be overridden
  5309     for specific variables with e.g. "transfer fixing: x y z".  The
  5310     variant transfer' method allows replacing a subgoal with one that
  5311     is logically stronger (rather than equivalent).
  5312 
  5313   - relator_eq attribute: Collects identity laws for relators of
  5314     various type constructors, e.g. "list_all2 (op =) = (op =)".  The
  5315     transfer method uses these lemmas to infer transfer rules for
  5316     non-polymorphic constants on the fly.
  5317 
  5318   - transfer_prover method: Assists with proving a transfer rule for a
  5319     new constant, provided the constant is defined in terms of other
  5320     constants that already have transfer rules. It should be applied
  5321     after unfolding the constant definitions.
  5322 
  5323   - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
  5324     from type nat to type int.
  5325 
  5326 * Lifting: New package intended to generalize the quotient_definition
  5327 facility of the Quotient package; designed to work with Transfer.
  5328 
  5329   - lift_definition command: Defines operations on an abstract type in
  5330     terms of a corresponding operation on a representation
  5331     type.  Example syntax:
  5332 
  5333     lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
  5334       is List.insert
  5335 
  5336     Users must discharge a respectfulness proof obligation when each
  5337     constant is defined. (For a type copy, i.e. a typedef with UNIV,
  5338     the proof is discharged automatically.) The obligation is
  5339     presented in a user-friendly, readable form; a respectfulness
  5340     theorem in the standard format and a transfer rule are generated
  5341     by the package.
  5342 
  5343   - Integration with code_abstype: For typedefs (e.g. subtypes
  5344     corresponding to a datatype invariant, such as dlist),
  5345     lift_definition generates a code certificate theorem and sets up
  5346     code generation for each constant.
  5347 
  5348   - setup_lifting command: Sets up the Lifting package to work with a
  5349     user-defined type. The user must provide either a quotient theorem
  5350     or a type_definition theorem.  The package configures transfer
  5351     rules for equality and quantifiers on the type, and sets up the
  5352     lift_definition command to work with the type.
  5353 
  5354   - Usage examples: See Quotient_Examples/Lift_DList.thy,
  5355     Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
  5356     Word/Word.thy and Library/Float.thy.
  5357 
  5358 * Quotient package:
  5359 
  5360   - The 'quotient_type' command now supports a 'morphisms' option with
  5361     rep and abs functions, similar to typedef.
  5362 
  5363   - 'quotient_type' sets up new types to work with the Lifting and
  5364     Transfer packages, as with 'setup_lifting'.
  5365 
  5366   - The 'quotient_definition' command now requires the user to prove a
  5367     respectfulness property at the point where the constant is
  5368     defined, similar to lift_definition; INCOMPATIBILITY.
  5369 
  5370   - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
  5371     accordingly, INCOMPATIBILITY.
  5372 
  5373 * New diagnostic command 'find_unused_assms' to find potentially
  5374 superfluous assumptions in theorems using Quickcheck.
  5375 
  5376 * Quickcheck:
  5377 
  5378   - Quickcheck returns variable assignments as counterexamples, which
  5379     allows to reveal the underspecification of functions under test.
  5380     For example, refuting "hd xs = x", it presents the variable
  5381     assignment xs = [] and x = a1 as a counterexample, assuming that
  5382     any property is false whenever "hd []" occurs in it.
  5383 
  5384     These counterexample are marked as potentially spurious, as
  5385     Quickcheck also returns "xs = []" as a counterexample to the
  5386     obvious theorem "hd xs = hd xs".
  5387 
  5388     After finding a potentially spurious counterexample, Quickcheck
  5389     continues searching for genuine ones.
  5390 
  5391     By default, Quickcheck shows potentially spurious and genuine
  5392     counterexamples. The option "genuine_only" sets quickcheck to only
  5393     show genuine counterexamples.
  5394 
  5395   - The command 'quickcheck_generator' creates random and exhaustive
  5396     value generators for a given type and operations.
  5397 
  5398     It generates values by using the operations as if they were
  5399     constructors of that type.
  5400 
  5401   - Support for multisets.
  5402 
  5403   - Added "use_subtype" options.
  5404 
  5405   - Added "quickcheck_locale" configuration to specify how to process
  5406     conjectures in a locale context.
  5407 
  5408 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
  5409 and affecting 'rat' and 'real'.
  5410 
  5411 * Sledgehammer:
  5412   - Integrated more tightly with SPASS, as described in the ITP 2012
  5413     paper "More SPASS with Isabelle".
  5414   - Made it try "smt" as a fallback if "metis" fails or times out.
  5415   - Added support for the following provers: Alt-Ergo (via Why3 and
  5416     TFF1), iProver, iProver-Eq.
  5417   - Sped up the minimizer.
  5418   - Added "lam_trans", "uncurry_aliases", and "minimize" options.
  5419   - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
  5420   - Renamed "sound" option to "strict".
  5421 
  5422 * Metis: Added possibility to specify lambda translations scheme as a
  5423 parenthesized argument (e.g., "by (metis (lifting) ...)").
  5424 
  5425 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
  5426 
  5427 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
  5428 
  5429 * New "case_product" attribute to generate a case rule doing multiple
  5430 case distinctions at the same time.  E.g.
  5431 
  5432   list.exhaust [case_product nat.exhaust]
  5433 
  5434 produces a rule which can be used to perform case distinction on both
  5435 a list and a nat.
  5436 
  5437 * New "eventually_elim" method as a generalized variant of the
  5438 eventually_elim* rules.  Supports structured proofs.
  5439 
  5440 * Typedef with implicit set definition is considered legacy.  Use
  5441 "typedef (open)" form instead, which will eventually become the
  5442 default.
  5443 
  5444 * Record: code generation can be switched off manually with
  5445 
  5446   declare [[record_coden = false]]  -- "default true"
  5447 
  5448 * Datatype: type parameters allow explicit sort constraints.
  5449 
  5450 * Concrete syntax for case expressions includes constraints for source
  5451 positions, and thus produces Prover IDE markup for its bindings.
  5452 INCOMPATIBILITY for old-style syntax translations that augment the
  5453 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
  5454 one_case.
  5455 
  5456 * Clarified attribute "mono_set": pure declaration without modifying
  5457 the result of the fact expression.
  5458 
  5459 * More default pred/set conversions on a couple of relation operations
  5460 and predicates.  Added powers of predicate relations.  Consolidation
  5461 of some relation theorems:
  5462 
  5463   converse_def ~> converse_unfold
  5464   rel_comp_def ~> relcomp_unfold
  5465   symp_def ~> (modified, use symp_def and sym_def instead)
  5466   transp_def ~> transp_trans
  5467   Domain_def ~> Domain_unfold
  5468   Range_def ~> Domain_converse [symmetric]
  5469 
  5470 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
  5471 
  5472 See theory "Relation" for examples for making use of pred/set
  5473 conversions by means of attributes "to_set" and "to_pred".
  5474 
  5475 INCOMPATIBILITY.
  5476 
  5477 * Renamed facts about the power operation on relations, i.e., relpow
  5478 to match the constant's name:
  5479 
  5480   rel_pow_1 ~> relpow_1
  5481   rel_pow_0_I ~> relpow_0_I
  5482   rel_pow_Suc_I ~> relpow_Suc_I
  5483   rel_pow_Suc_I2 ~> relpow_Suc_I2
  5484   rel_pow_0_E ~> relpow_0_E
  5485   rel_pow_Suc_E ~> relpow_Suc_E
  5486   rel_pow_E ~> relpow_E
  5487   rel_pow_Suc_D2 ~> relpow_Suc_D2
  5488   rel_pow_Suc_E2 ~> relpow_Suc_E2
  5489   rel_pow_Suc_D2' ~> relpow_Suc_D2'
  5490   rel_pow_E2 ~> relpow_E2
  5491   rel_pow_add ~> relpow_add
  5492   rel_pow_commute ~> relpow
  5493   rel_pow_empty ~> relpow_empty:
  5494   rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
  5495   rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
  5496   rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
  5497   rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
  5498   rel_pow_fun_conv ~> relpow_fun_conv
  5499   rel_pow_finite_bounded1 ~> relpow_finite_bounded1
  5500   rel_pow_finite_bounded ~> relpow_finite_bounded
  5501   rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
  5502   trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
  5503   single_valued_rel_pow ~> single_valued_relpow
  5504 
  5505 INCOMPATIBILITY.
  5506 
  5507 * Theory Relation: Consolidated constant name for relation composition
  5508 and corresponding theorem names:
  5509 
  5510   - Renamed constant rel_comp to relcomp.
  5511 
  5512   - Dropped abbreviation pred_comp. Use relcompp instead.
  5513 
  5514   - Renamed theorems:
  5515 
  5516     rel_compI ~> relcompI
  5517     rel_compEpair ~> relcompEpair
  5518     rel_compE ~> relcompE
  5519     pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
  5520     rel_comp_empty1 ~> relcomp_empty1
  5521     rel_comp_mono ~> relcomp_mono
  5522     rel_comp_subset_Sigma ~> relcomp_subset_Sigma
  5523     rel_comp_distrib ~> relcomp_distrib
  5524     rel_comp_distrib2 ~> relcomp_distrib2
  5525     rel_comp_UNION_distrib ~> relcomp_UNION_distrib
  5526     rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
  5527     single_valued_rel_comp ~> single_valued_relcomp
  5528     rel_comp_def ~> relcomp_unfold
  5529     converse_rel_comp ~> converse_relcomp
  5530     pred_compI ~> relcomppI
  5531     pred_compE ~> relcomppE
  5532     pred_comp_bot1 ~> relcompp_bot1
  5533     pred_comp_bot2 ~> relcompp_bot2
  5534     transp_pred_comp_less_eq ~> transp_relcompp_less_eq
  5535     pred_comp_mono ~> relcompp_mono
  5536     pred_comp_distrib ~> relcompp_distrib
  5537     pred_comp_distrib2 ~> relcompp_distrib2
  5538     converse_pred_comp ~> converse_relcompp
  5539 
  5540     finite_rel_comp ~> finite_relcomp
  5541 
  5542     set_rel_comp ~> set_relcomp
  5543 
  5544 INCOMPATIBILITY.
  5545 
  5546 * Theory Divides: Discontinued redundant theorems about div and mod.
  5547 INCOMPATIBILITY, use the corresponding generic theorems instead.
  5548 
  5549   DIVISION_BY_ZERO ~> div_by_0, mod_by_0
  5550   zdiv_self ~> div_self
  5551   zmod_self ~> mod_self
  5552   zdiv_zero ~> div_0
  5553   zmod_zero ~> mod_0
  5554   zdiv_zmod_equality ~> div_mod_equality2
  5555   zdiv_zmod_equality2 ~> div_mod_equality
  5556   zmod_zdiv_trivial ~> mod_div_trivial
  5557   zdiv_zminus_zminus ~> div_minus_minus
  5558   zmod_zminus_zminus ~> mod_minus_minus
  5559   zdiv_zminus2 ~> div_minus_right
  5560   zmod_zminus2 ~> mod_minus_right
  5561   zdiv_minus1_right ~> div_minus1_right
  5562   zmod_minus1_right ~> mod_minus1_right
  5563   zdvd_mult_div_cancel ~> dvd_mult_div_cancel
  5564   zmod_zmult1_eq ~> mod_mult_right_eq
  5565   zpower_zmod ~> power_mod
  5566   zdvd_zmod ~> dvd_mod
  5567   zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
  5568   mod_mult_distrib ~> mult_mod_left
  5569   mod_mult_distrib2 ~> mult_mod_right
  5570 
  5571 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
  5572 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
  5573 
  5574 * Finite_Set.fold now qualified.  INCOMPATIBILITY.
  5575 
  5576 * Consolidated theorem names concerning fold combinators:
  5577 
  5578   inf_INFI_fold_inf ~> inf_INF_fold_inf
  5579   sup_SUPR_fold_sup ~> sup_SUP_fold_sup
  5580   INFI_fold_inf ~> INF_fold_inf
  5581   SUPR_fold_sup ~> SUP_fold_sup
  5582   union_set ~> union_set_fold
  5583   minus_set ~> minus_set_fold
  5584   INFI_set_fold ~> INF_set_fold
  5585   SUPR_set_fold ~> SUP_set_fold
  5586   INF_code ~> INF_set_foldr
  5587   SUP_code ~> SUP_set_foldr
  5588   foldr.simps ~> foldr.simps (in point-free formulation)
  5589   foldr_fold_rev ~> foldr_conv_fold
  5590   foldl_fold ~> foldl_conv_fold
  5591   foldr_foldr ~> foldr_conv_foldl
  5592   foldl_foldr ~> foldl_conv_foldr
  5593   fold_set_remdups ~> fold_set_fold_remdups
  5594   fold_set ~> fold_set_fold
  5595   fold1_set ~> fold1_set_fold
  5596 
  5597 INCOMPATIBILITY.
  5598 
  5599 * Dropped rarely useful theorems concerning fold combinators:
  5600 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
  5601 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
  5602 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
  5603 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
  5604 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
  5605 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
  5606 INCOMPATIBILITY.  For the common phrases "%xs. List.foldr plus xs 0"
  5607 and "List.foldl plus 0", prefer "List.listsum".  Otherwise it can be
  5608 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
  5609 unfolding "foldr_conv_fold" and "foldl_conv_fold".
  5610 
  5611 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
  5612 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
  5613 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
  5614 INF_set_foldr, SUP_set_foldr.  INCOMPATIBILITY.  Prefer corresponding
  5615 lemmas over fold rather than foldr, or make use of lemmas
  5616 fold_conv_foldr and fold_rev.
  5617 
  5618 * Congruence rules Option.map_cong and Option.bind_cong for recursion
  5619 through option types.
  5620 
  5621 * "Transitive_Closure.ntrancl": bounded transitive closure on
  5622 relations.
  5623 
  5624 * Constant "Set.not_member" now qualified.  INCOMPATIBILITY.
  5625 
  5626 * Theory Int: Discontinued many legacy theorems specific to type int.
  5627 INCOMPATIBILITY, use the corresponding generic theorems instead.
  5628 
  5629   zminus_zminus ~> minus_minus
  5630   zminus_0 ~> minus_zero
  5631   zminus_zadd_distrib ~> minus_add_distrib
  5632   zadd_commute ~> add_commute
  5633   zadd_assoc ~> add_assoc
  5634   zadd_left_commute ~> add_left_commute
  5635   zadd_ac ~> add_ac
  5636   zmult_ac ~> mult_ac
  5637   zadd_0 ~> add_0_left
  5638   zadd_0_right ~> add_0_right
  5639   zadd_zminus_inverse2 ~> left_minus
  5640   zmult_zminus ~> mult_minus_left
  5641   zmult_commute ~> mult_commute
  5642   zmult_assoc ~> mult_assoc
  5643   zadd_zmult_distrib ~> left_distrib
  5644   zadd_zmult_distrib2 ~> right_distrib
  5645   zdiff_zmult_distrib ~> left_diff_distrib
  5646   zdiff_zmult_distrib2 ~> right_diff_distrib
  5647   zmult_1 ~> mult_1_left
  5648   zmult_1_right ~> mult_1_right
  5649   zle_refl ~> order_refl
  5650   zle_trans ~> order_trans
  5651   zle_antisym ~> order_antisym
  5652   zle_linear ~> linorder_linear
  5653   zless_linear ~> linorder_less_linear
  5654   zadd_left_mono ~> add_left_mono
  5655   zadd_strict_right_mono ~> add_strict_right_mono
  5656   zadd_zless_mono ~> add_less_le_mono
  5657   int_0_less_1 ~> zero_less_one
  5658   int_0_neq_1 ~> zero_neq_one
  5659   zless_le ~> less_le
  5660   zpower_zadd_distrib ~> power_add
  5661   zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
  5662   zero_le_zpower_abs ~> zero_le_power_abs
  5663 
  5664 * Theory Deriv: Renamed
  5665 
  5666   DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
  5667 
  5668 * Theory Library/Multiset: Improved code generation of multisets.
  5669 
  5670 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
  5671 are expressed via type classes again. The special syntax
  5672 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
  5673 setsum_set, which is now subsumed by Big_Operators.setsum.
  5674 INCOMPATIBILITY.
  5675 
  5676 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
  5677 use theory HOL/Library/Nat_Bijection instead.
  5678 
  5679 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
  5680 trees is now inside a type class context.  Names of affected
  5681 operations and lemmas have been prefixed by rbt_.  INCOMPATIBILITY for
  5682 theories working directly with raw red-black trees, adapt the names as
  5683 follows:
  5684 
  5685   Operations:
  5686   bulkload -> rbt_bulkload
  5687   del_from_left -> rbt_del_from_left
  5688   del_from_right -> rbt_del_from_right
  5689   del -> rbt_del
  5690   delete -> rbt_delete
  5691   ins -> rbt_ins
  5692   insert -> rbt_insert
  5693   insertw -> rbt_insert_with
  5694   insert_with_key -> rbt_insert_with_key
  5695   map_entry -> rbt_map_entry
  5696   lookup -> rbt_lookup
  5697   sorted -> rbt_sorted
  5698   tree_greater -> rbt_greater
  5699   tree_less -> rbt_less
  5700   tree_less_symbol -> rbt_less_symbol
  5701   union -> rbt_union
  5702   union_with -> rbt_union_with
  5703   union_with_key -> rbt_union_with_key
  5704 
  5705   Lemmas:
  5706   balance_left_sorted -> balance_left_rbt_sorted
  5707   balance_left_tree_greater -> balance_left_rbt_greater
  5708   balance_left_tree_less -> balance_left_rbt_less
  5709   balance_right_sorted -> balance_right_rbt_sorted
  5710   balance_right_tree_greater -> balance_right_rbt_greater
  5711   balance_right_tree_less -> balance_right_rbt_less
  5712   balance_sorted -> balance_rbt_sorted
  5713   balance_tree_greater -> balance_rbt_greater
  5714   balance_tree_less -> balance_rbt_less
  5715   bulkload_is_rbt -> rbt_bulkload_is_rbt
  5716   combine_sorted -> combine_rbt_sorted
  5717   combine_tree_greater -> combine_rbt_greater
  5718   combine_tree_less -> combine_rbt_less
  5719   delete_in_tree -> rbt_delete_in_tree
  5720   delete_is_rbt -> rbt_delete_is_rbt
  5721   del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
  5722   del_from_left_tree_less -> rbt_del_from_left_rbt_less
  5723   del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
  5724   del_from_right_tree_less -> rbt_del_from_right_rbt_less
  5725   del_in_tree -> rbt_del_in_tree
  5726   del_inv1_inv2 -> rbt_del_inv1_inv2
  5727   del_sorted -> rbt_del_rbt_sorted
  5728   del_tree_greater -> rbt_del_rbt_greater
  5729   del_tree_less -> rbt_del_rbt_less
  5730   dom_lookup_Branch -> dom_rbt_lookup_Branch
  5731   entries_lookup -> entries_rbt_lookup
  5732   finite_dom_lookup -> finite_dom_rbt_lookup
  5733   insert_sorted -> rbt_insert_rbt_sorted
  5734   insertw_is_rbt -> rbt_insertw_is_rbt
  5735   insertwk_is_rbt -> rbt_insertwk_is_rbt
  5736   insertwk_sorted -> rbt_insertwk_rbt_sorted
  5737   insertw_sorted -> rbt_insertw_rbt_sorted
  5738   ins_sorted -> ins_rbt_sorted
  5739   ins_tree_greater -> ins_rbt_greater
  5740   ins_tree_less -> ins_rbt_less
  5741   is_rbt_sorted -> is_rbt_rbt_sorted
  5742   lookup_balance -> rbt_lookup_balance
  5743   lookup_bulkload -> rbt_lookup_rbt_bulkload
  5744   lookup_delete -> rbt_lookup_rbt_delete
  5745   lookup_Empty -> rbt_lookup_Empty
  5746   lookup_from_in_tree -> rbt_lookup_from_in_tree
  5747   lookup_in_tree -> rbt_lookup_in_tree
  5748   lookup_ins -> rbt_lookup_ins
  5749   lookup_insert -> rbt_lookup_rbt_insert
  5750   lookup_insertw -> rbt_lookup_rbt_insertw
  5751   lookup_insertwk -> rbt_lookup_rbt_insertwk
  5752   lookup_keys -> rbt_lookup_keys
  5753   lookup_map -> rbt_lookup_map
  5754   lookup_map_entry -> rbt_lookup_rbt_map_entry
  5755   lookup_tree_greater -> rbt_lookup_rbt_greater
  5756   lookup_tree_less -> rbt_lookup_rbt_less
  5757   lookup_union -> rbt_lookup_rbt_union
  5758   map_entry_color_of -> rbt_map_entry_color_of
  5759   map_entry_inv1 -> rbt_map_entry_inv1
  5760   map_entry_inv2 -> rbt_map_entry_inv2
  5761   map_entry_is_rbt -> rbt_map_entry_is_rbt
  5762   map_entry_sorted -> rbt_map_entry_rbt_sorted
  5763   map_entry_tree_greater -> rbt_map_entry_rbt_greater
  5764   map_entry_tree_less -> rbt_map_entry_rbt_less
  5765   map_tree_greater -> map_rbt_greater
  5766   map_tree_less -> map_rbt_less
  5767   map_sorted -> map_rbt_sorted
  5768   paint_sorted -> paint_rbt_sorted
  5769   paint_lookup -> paint_rbt_lookup
  5770   paint_tree_greater -> paint_rbt_greater
  5771   paint_tree_less -> paint_rbt_less
  5772   sorted_entries -> rbt_sorted_entries
  5773   tree_greater_eq_trans -> rbt_greater_eq_trans
  5774   tree_greater_nit -> rbt_greater_nit
  5775   tree_greater_prop -> rbt_greater_prop
  5776   tree_greater_simps -> rbt_greater_simps
  5777   tree_greater_trans -> rbt_greater_trans
  5778   tree_less_eq_trans -> rbt_less_eq_trans
  5779   tree_less_nit -> rbt_less_nit
  5780   tree_less_prop -> rbt_less_prop
  5781   tree_less_simps -> rbt_less_simps
  5782   tree_less_trans -> rbt_less_trans
  5783   tree_ord_props -> rbt_ord_props
  5784   union_Branch -> rbt_union_Branch
  5785   union_is_rbt -> rbt_union_is_rbt
  5786   unionw_is_rbt -> rbt_unionw_is_rbt
  5787   unionwk_is_rbt -> rbt_unionwk_is_rbt
  5788   unionwk_sorted -> rbt_unionwk_rbt_sorted
  5789 
  5790 * Theory HOL/Library/Float: Floating point numbers are now defined as
  5791 a subset of the real numbers.  All operations are defined using the
  5792 lifing-framework and proofs use the transfer method.  INCOMPATIBILITY.
  5793 
  5794   Changed Operations:
  5795   float_abs -> abs
  5796   float_nprt -> nprt
  5797   float_pprt -> pprt
  5798   pow2 -> use powr
  5799   round_down -> float_round_down
  5800   round_up -> float_round_up
  5801   scale -> exponent
  5802 
  5803   Removed Operations:
  5804   ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
  5805 
  5806   Renamed Lemmas:
  5807   abs_float_def -> Float.compute_float_abs
  5808   bitlen_ge0 -> bitlen_nonneg
  5809   bitlen.simps -> Float.compute_bitlen
  5810   float_components -> Float_mantissa_exponent
  5811   float_divl.simps -> Float.compute_float_divl
  5812   float_divr.simps -> Float.compute_float_divr
  5813   float_eq_odd -> mult_powr_eq_mult_powr_iff
  5814   float_power -> real_of_float_power
  5815   lapprox_posrat_def -> Float.compute_lapprox_posrat
  5816   lapprox_rat.simps -> Float.compute_lapprox_rat
  5817   le_float_def' -> Float.compute_float_le
  5818   le_float_def -> less_eq_float.rep_eq
  5819   less_float_def' -> Float.compute_float_less
  5820   less_float_def -> less_float.rep_eq
  5821   normfloat_def -> Float.compute_normfloat
  5822   normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
  5823   normfloat -> normfloat_def
  5824   normfloat_unique -> use normfloat_def
  5825   number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
  5826   one_float_def -> Float.compute_float_one
  5827   plus_float_def -> Float.compute_float_plus
  5828   rapprox_posrat_def -> Float.compute_rapprox_posrat
  5829   rapprox_rat.simps -> Float.compute_rapprox_rat
  5830   real_of_float_0 -> zero_float.rep_eq
  5831   real_of_float_1 -> one_float.rep_eq
  5832   real_of_float_abs -> abs_float.rep_eq
  5833   real_of_float_add -> plus_float.rep_eq
  5834   real_of_float_minus -> uminus_float.rep_eq
  5835   real_of_float_mult -> times_float.rep_eq
  5836   real_of_float_simp -> Float.rep_eq
  5837   real_of_float_sub -> minus_float.rep_eq
  5838   round_down.simps -> Float.compute_float_round_down
  5839   round_up.simps -> Float.compute_float_round_up
  5840   times_float_def -> Float.compute_float_times
  5841   uminus_float_def -> Float.compute_float_uminus
  5842   zero_float_def -> Float.compute_float_zero
  5843 
  5844   Lemmas not necessary anymore, use the transfer method:
  5845   bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
  5846   float_divr, float_le_simp, float_less1_mantissa_bound,
  5847   float_less_simp, float_less_zero, float_le_zero,
  5848   float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
  5849   floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
  5850   lapprox_rat_bottom, normalized_float, rapprox_posrat,
  5851   rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
  5852   real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
  5853   round_up, zero_le_float, zero_less_float
  5854 
  5855 * New theory HOL/Library/DAList provides an abstract type for
  5856 association lists with distinct keys.
  5857 
  5858 * Session HOL/IMP: Added new theory of abstract interpretation of
  5859 annotated commands.
  5860 
  5861 * Session HOL-Import: Re-implementation from scratch is faster,
  5862 simpler, and more scalable.  Requires a proof bundle, which is
  5863 available as an external component.  Discontinued old (and mostly
  5864 dead) Importer for HOL4 and HOL Light.  INCOMPATIBILITY.
  5865 
  5866 * Session HOL-Word: Discontinued many redundant theorems specific to
  5867 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
  5868 instead.
  5869 
  5870   word_sub_alt ~> word_sub_wi
  5871   word_add_alt ~> word_add_def
  5872   word_mult_alt ~> word_mult_def
  5873   word_minus_alt ~> word_minus_def
  5874   word_0_alt ~> word_0_wi
  5875   word_1_alt ~> word_1_wi
  5876   word_add_0 ~> add_0_left
  5877   word_add_0_right ~> add_0_right
  5878   word_mult_1 ~> mult_1_left
  5879   word_mult_1_right ~> mult_1_right
  5880   word_add_commute ~> add_commute
  5881   word_add_assoc ~> add_assoc
  5882   word_add_left_commute ~> add_left_commute
  5883   word_mult_commute ~> mult_commute
  5884   word_mult_assoc ~> mult_assoc
  5885   word_mult_left_commute ~> mult_left_commute
  5886   word_left_distrib ~> left_distrib
  5887   word_right_distrib ~> right_distrib
  5888   word_left_minus ~> left_minus
  5889   word_diff_0_right ~> diff_0_right
  5890   word_diff_self ~> diff_self
  5891   word_sub_def ~> diff_minus
  5892   word_diff_minus ~> diff_minus
  5893   word_add_ac ~> add_ac
  5894   word_mult_ac ~> mult_ac
  5895   word_plus_ac0 ~> add_0_left add_0_right add_ac
  5896   word_times_ac1 ~> mult_1_left mult_1_right mult_ac
  5897   word_order_trans ~> order_trans
  5898   word_order_refl ~> order_refl
  5899   word_order_antisym ~> order_antisym
  5900   word_order_linear ~> linorder_linear
  5901   lenw1_zero_neq_one ~> zero_neq_one
  5902   word_number_of_eq ~> number_of_eq
  5903   word_of_int_add_hom ~> wi_hom_add
  5904   word_of_int_sub_hom ~> wi_hom_sub
  5905   word_of_int_mult_hom ~> wi_hom_mult
  5906   word_of_int_minus_hom ~> wi_hom_neg
  5907   word_of_int_succ_hom ~> wi_hom_succ
  5908   word_of_int_pred_hom ~> wi_hom_pred
  5909   word_of_int_0_hom ~> word_0_wi
  5910   word_of_int_1_hom ~> word_1_wi
  5911 
  5912 * Session HOL-Word: New proof method "word_bitwise" for splitting
  5913 machine word equalities and inequalities into logical circuits,
  5914 defined in HOL/Word/WordBitwise.thy.  Supports addition, subtraction,
  5915 multiplication, shifting by constants, bitwise operators and numeric
  5916 constants.  Requires fixed-length word types, not 'a word.  Solves
  5917 many standard word identities outright and converts more into first
  5918 order problems amenable to blast or similar.  See also examples in
  5919 HOL/Word/Examples/WordExamples.thy.
  5920 
  5921 * Session HOL-Probability: Introduced the type "'a measure" to
  5922 represent measures, this replaces the records 'a algebra and 'a
  5923 measure_space.  The locales based on subset_class now have two
  5924 locale-parameters the space \<Omega> and the set of measurable sets M.
  5925 The product of probability spaces uses now the same constant as the
  5926 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
  5927 measure".  Most constants are defined now outside of locales and gain
  5928 an additional parameter, like null_sets, almost_eventually or \<mu>'.
  5929 Measure space constructions for distributions and densities now got
  5930 their own constants distr and density.  Instead of using locales to
  5931 describe measure spaces with a finite space, the measure count_space
  5932 and point_measure is introduced.  INCOMPATIBILITY.
  5933 
  5934   Renamed constants:
  5935   measure -> emeasure
  5936   finite_measure.\<mu>' -> measure
  5937   product_algebra_generator -> prod_algebra
  5938   product_prob_space.emb -> prod_emb
  5939   product_prob_space.infprod_algebra -> PiM
  5940 
  5941   Removed locales:
  5942   completeable_measure_space
  5943   finite_measure_space
  5944   finite_prob_space
  5945   finite_product_finite_prob_space
  5946   finite_product_sigma_algebra
  5947   finite_sigma_algebra
  5948   measure_space
  5949   pair_finite_prob_space
  5950   pair_finite_sigma_algebra
  5951   pair_finite_space
  5952   pair_sigma_algebra
  5953   product_sigma_algebra
  5954 
  5955   Removed constants:
  5956   conditional_space
  5957   distribution -> use distr measure, or distributed predicate
  5958   image_space
  5959   joint_distribution -> use distr measure, or distributed predicate
  5960   pair_measure_generator
  5961   product_prob_space.infprod_algebra -> use PiM
  5962   subvimage
  5963 
  5964   Replacement theorems:
  5965   finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
  5966   finite_measure.empty_measure -> measure_empty
  5967   finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
  5968   finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
  5969   finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
  5970   finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
  5971   finite_measure.finite_measure -> finite_measure.emeasure_finite
  5972   finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
  5973   finite_measure.positive_measure' -> measure_nonneg
  5974   finite_measure.real_measure -> finite_measure.emeasure_real
  5975   finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
  5976   finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
  5977   finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
  5978   information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
  5979   information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
  5980   information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
  5981   information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
  5982   information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
  5983   information_space.entropy_commute -> information_space.entropy_commute_simple
  5984   information_space.entropy_eq -> information_space.entropy_simple_distributed
  5985   information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
  5986   information_space.entropy_positive -> information_space.entropy_nonneg_simple
  5987   information_space.entropy_uniform_max -> information_space.entropy_uniform
  5988   information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
  5989   information_space.KL_eq_0 -> information_space.KL_same_eq_0
  5990   information_space.KL_ge_0 -> information_space.KL_nonneg
  5991   information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
  5992   information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
  5993   Int_stable_cuboids -> Int_stable_atLeastAtMost
  5994   Int_stable_product_algebra_generator -> positive_integral
  5995   measure_preserving -> equality "distr M N f = N" "f : measurable M N"
  5996   measure_space.additive -> emeasure_additive
  5997   measure_space.AE_iff_null_set -> AE_iff_null
  5998   measure_space.almost_everywhere_def -> eventually_ae_filter
  5999   measure_space.almost_everywhere_vimage -> AE_distrD
  6000   measure_space.continuity_from_above -> INF_emeasure_decseq
  6001   measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
  6002   measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
  6003   measure_space.continuity_from_below -> SUP_emeasure_incseq
  6004   measure_space_density -> emeasure_density
  6005   measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
  6006   measure_space.integrable_vimage -> integrable_distr
  6007   measure_space.integral_translated_density -> integral_density
  6008   measure_space.integral_vimage -> integral_distr
  6009   measure_space.measure_additive -> plus_emeasure
  6010   measure_space.measure_compl -> emeasure_compl
  6011   measure_space.measure_countable_increasing -> emeasure_countable_increasing
  6012   measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
  6013   measure_space.measure_decseq -> decseq_emeasure
  6014   measure_space.measure_Diff -> emeasure_Diff
  6015   measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
  6016   measure_space.measure_eq_0 -> emeasure_eq_0
  6017   measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
  6018   measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
  6019   measure_space.measure_incseq -> incseq_emeasure
  6020   measure_space.measure_insert -> emeasure_insert
  6021   measure_space.measure_mono -> emeasure_mono
  6022   measure_space.measure_not_negative -> emeasure_not_MInf
  6023   measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
  6024   measure_space.measure_setsum -> setsum_emeasure
  6025   measure_space.measure_setsum_split -> setsum_emeasure_cover
  6026   measure_space.measure_space_vimage -> emeasure_distr
  6027   measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
  6028   measure_space.measure_subadditive -> subadditive
  6029   measure_space.measure_top -> emeasure_space
  6030   measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
  6031   measure_space.measure_Un_null_set -> emeasure_Un_null_set
  6032   measure_space.positive_integral_translated_density -> positive_integral_density
  6033   measure_space.positive_integral_vimage -> positive_integral_distr
  6034   measure_space.real_continuity_from_above -> Lim_measure_decseq
  6035   measure_space.real_continuity_from_below -> Lim_measure_incseq
  6036   measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
  6037   measure_space.real_measure_Diff -> measure_Diff
  6038   measure_space.real_measure_finite_Union -> measure_finite_Union
  6039   measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
  6040   measure_space.real_measure_subadditive -> measure_subadditive
  6041   measure_space.real_measure_Union -> measure_Union
  6042   measure_space.real_measure_UNION -> measure_UNION
  6043   measure_space.simple_function_vimage -> simple_function_comp
  6044   measure_space.simple_integral_vimage -> simple_integral_distr
  6045   measure_space.simple_integral_vimage -> simple_integral_distr
  6046   measure_unique_Int_stable -> measure_eqI_generator_eq
  6047   measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
  6048   pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
  6049   pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
  6050   pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
  6051   pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
  6052   pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
  6053   pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
  6054   pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
  6055   pair_sigma_algebra.sets_swap -> sets_pair_swap
  6056   pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
  6057   pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
  6058   pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
  6059   pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
  6060   pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
  6061   pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
  6062   prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
  6063   prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
  6064   prob_space.measure_space_1 -> prob_space.emeasure_space_1
  6065   prob_space.prob_space_vimage -> prob_space_distr
  6066   prob_space.random_variable_restrict -> measurable_restrict
  6067   prob_space_unique_Int_stable -> measure_eqI_prob_space
  6068   product_algebraE -> prod_algebraE_all
  6069   product_algebra_generator_der -> prod_algebra_eq_finite
  6070   product_algebra_generator_into_space -> prod_algebra_sets_into_space
  6071   product_algebraI -> sets_PiM_I_finite
  6072   product_measure_exists -> product_sigma_finite.sigma_finite
  6073   product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
  6074   product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
  6075   product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
  6076   product_prob_space.measurable_component -> measurable_component_singleton
  6077   product_prob_space.measurable_emb -> measurable_prod_emb
  6078   product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
  6079   product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
  6080   product_prob_space.measure_emb -> emeasure_prod_emb
  6081   product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
  6082   product_sigma_algebra.product_algebra_into_space -> space_closed
  6083   product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
  6084   product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
  6085   product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
  6086   sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
  6087   sets_product_algebra -> sets_PiM
  6088   sigma_algebra.measurable_sigma -> measurable_measure_of
  6089   sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
  6090   sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
  6091   sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
  6092   space_product_algebra -> space_PiM
  6093 
  6094 * Session HOL-TPTP: support to parse and import TPTP problems (all
  6095 languages) into Isabelle/HOL.
  6096 
  6097 
  6098 *** FOL ***
  6099 
  6100 * New "case_product" attribute (see HOL).
  6101 
  6102 
  6103 *** ZF ***
  6104 
  6105 * Greater support for structured proofs involving induction or case
  6106 analysis.
  6107 
  6108 * Much greater use of mathematical symbols.
  6109 
  6110 * Removal of many ML theorem bindings.  INCOMPATIBILITY.
  6111 
  6112 
  6113 *** ML ***
  6114 
  6115 * Antiquotation @{keyword "name"} produces a parser for outer syntax
  6116 from a minor keyword introduced via theory header declaration.
  6117 
  6118 * Antiquotation @{command_spec "name"} produces the
  6119 Outer_Syntax.command_spec from a major keyword introduced via theory
  6120 header declaration; it can be passed to Outer_Syntax.command etc.
  6121 
  6122 * Local_Theory.define no longer hard-wires default theorem name
  6123 "foo_def", but retains the binding as given.  If that is Binding.empty
  6124 / Attrib.empty_binding, the result is not registered as user-level
  6125 fact.  The Local_Theory.define_internal variant allows to specify a
  6126 non-empty name (used for the foundation in the background theory),
  6127 while omitting the fact binding in the user-context.  Potential
  6128 INCOMPATIBILITY for derived definitional packages: need to specify
  6129 naming policy for primitive definitions more explicitly.
  6130 
  6131 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
  6132 conformance with similar operations in structure Term and Logic.
  6133 
  6134 * Antiquotation @{attributes [...]} embeds attribute source
  6135 representation into the ML text, which is particularly useful with
  6136 declarations like Local_Theory.note.
  6137 
  6138 * Structure Proof_Context follows standard naming scheme.  Old
  6139 ProofContext has been discontinued.  INCOMPATIBILITY.
  6140 
  6141 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
  6142 change of semantics: update is applied to auxiliary local theory
  6143 context as well.
  6144 
  6145 * Modernized some old-style infix operations:
  6146 
  6147   addeqcongs    ~> Simplifier.add_eqcong
  6148   deleqcongs    ~> Simplifier.del_eqcong
  6149   addcongs      ~> Simplifier.add_cong
  6150   delcongs      ~> Simplifier.del_cong
  6151   setmksimps    ~> Simplifier.set_mksimps
  6152   setmkcong     ~> Simplifier.set_mkcong
  6153   setmksym      ~> Simplifier.set_mksym
  6154   setmkeqTrue   ~> Simplifier.set_mkeqTrue
  6155   settermless   ~> Simplifier.set_termless
  6156   setsubgoaler  ~> Simplifier.set_subgoaler
  6157   addsplits     ~> Splitter.add_split
  6158   delsplits     ~> Splitter.del_split
  6159 
  6160 
  6161 *** System ***
  6162 
  6163 * USER_HOME settings variable points to cross-platform user home
  6164 directory, which coincides with HOME on POSIX systems only.  Likewise,
  6165 the Isabelle path specification "~" now expands to $USER_HOME, instead
  6166 of former $HOME.  A different default for USER_HOME may be set
  6167 explicitly in shell environment, before Isabelle settings are
  6168 evaluated.  Minor INCOMPATIBILITY: need to adapt Isabelle path where
  6169 the generic user home was intended.
  6170 
  6171 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
  6172 notation, which is useful for the jEdit file browser, for example.
  6173 
  6174 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
  6175 (not just JRE).
  6176 
  6177 
  6178 
  6179 New in Isabelle2011-1 (October 2011)
  6180 ------------------------------------
  6181 
  6182 *** General ***
  6183 
  6184 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
  6185 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
  6186 
  6187   - Management of multiple theory files directly from the editor
  6188     buffer store -- bypassing the file-system (no requirement to save
  6189     files for checking).
  6190 
  6191   - Markup of formal entities within the text buffer, with semantic
  6192     highlighting, tooltips and hyperlinks to jump to defining source
  6193     positions.
  6194 
  6195   - Improved text rendering, with sub/superscripts in the source
  6196     buffer (including support for copy/paste wrt. output panel, HTML
  6197     theory output and other non-Isabelle text boxes).
  6198 
  6199   - Refined scheduling of proof checking and printing of results,
  6200     based on interactive editor view.  (Note: jEdit folding and
  6201     narrowing allows to restrict buffer perspectives explicitly.)
  6202 
  6203   - Reduced CPU performance requirements, usable on machines with few
  6204     cores.
  6205 
  6206   - Reduced memory requirements due to pruning of unused document
  6207     versions (garbage collection).
  6208 
  6209 See also ~~/src/Tools/jEdit/README.html for further information,
  6210 including some remaining limitations.
  6211 
  6212 * Theory loader: source files are exclusively located via the master
  6213 directory of each theory node (where the .thy file itself resides).
  6214 The global load path (such as src/HOL/Library) has been discontinued.
  6215 Note that the path element ~~ may be used to reference theories in the
  6216 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
  6217 INCOMPATIBILITY.
  6218 
  6219 * Theory loader: source files are identified by content via SHA1
  6220 digests.  Discontinued former path/modtime identification and optional
  6221 ISABELLE_FILE_IDENT plugin scripts.
  6222 
  6223 * Parallelization of nested Isar proofs is subject to
  6224 Goal.parallel_proofs_threshold (default 100).  See also isabelle
  6225 usedir option -Q.
  6226 
  6227 * Name space: former unsynchronized references are now proper
  6228 configuration options, with more conventional names:
  6229 
  6230   long_names   ~> names_long
  6231   short_names  ~> names_short
  6232   unique_names ~> names_unique
  6233 
  6234 Minor INCOMPATIBILITY, need to declare options in context like this:
  6235 
  6236   declare [[names_unique = false]]
  6237 
  6238 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`.  Note
  6239 that the result needs to be unique, which means fact specifications
  6240 may have to be refined after enriching a proof context.
  6241 
  6242 * Attribute "case_names" has been refined: the assumptions in each case
  6243 can be named now by following the case name with [name1 name2 ...].
  6244 
  6245 * Isabelle/Isar reference manual has been updated and extended:
  6246   - "Synopsis" provides a catalog of main Isar language concepts.
  6247   - Formal references in syntax diagrams, via @{rail} antiquotation.
  6248   - Updated material from classic "ref" manual, notably about
  6249     "Classical Reasoner".
  6250 
  6251 
  6252 *** HOL ***
  6253 
  6254 * Class bot and top require underlying partial order rather than
  6255 preorder: uniqueness of bot and top is guaranteed.  INCOMPATIBILITY.
  6256 
  6257 * Class complete_lattice: generalized a couple of lemmas from sets;
  6258 generalized theorems INF_cong and SUP_cong.  New type classes for
<