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