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