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