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