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