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