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