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