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