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