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