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