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