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