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