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