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