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