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