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