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