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