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