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