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