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