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