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