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