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