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