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