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