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