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