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