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