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