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