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