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