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