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