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