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