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