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