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