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