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