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