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