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