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