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