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