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