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