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