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