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