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