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