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