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