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