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