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