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