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