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