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