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