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