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