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