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