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