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