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