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