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