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