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