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