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