NEWS
author Andreas Lochbihler
Fri Feb 16 10:59:14 2018 +0100 (16 months ago)
changeset 67616 1d005f514417
parent 67591 6fd9902057f5
child 67702 2d9918f5b33c
permissions -rw-r--r--
strengthen filter relator to canonical categorical definition with better properties
wenzelm@57491
     1
Isabelle NEWS -- history of user-relevant changes
wenzelm@57491
     2
=================================================
wenzelm@2553
     3
wenzelm@62114
     4
(Note: Isabelle/jEdit shows a tree-view of the NEWS file in Sidekick.)
wenzelm@60006
     5
wenzelm@64603
     6
wenzelm@66651
     7
New in this Isabelle version
wenzelm@66651
     8
----------------------------
wenzelm@66651
     9
wenzelm@66712
    10
*** General ***
wenzelm@66712
    11
wenzelm@67446
    12
* Marginal comments need to be written exclusively in the new-style form
wenzelm@67446
    13
"\<comment> \<open>text\<close>", old ASCII variants like "-- {* ... *}" are no longer
wenzelm@67446
    14
supported. INCOMPATIBILITY, use the command-line tool "isabelle
wenzelm@67446
    15
update_comments" to update existing theory files.
wenzelm@67446
    16
wenzelm@67507
    17
* Old-style inner comments (* ... *) within the term language are legacy
wenzelm@67507
    18
and will be discontinued soon: use formal comments "\<comment> \<open>...\<close>" or "\<^cancel>\<open>...\<close>"
wenzelm@67507
    19
instead.
wenzelm@67507
    20
nipkow@67402
    21
* The "op <infix-op>" syntax for infix operators has been replaced by
nipkow@67400
    22
"(<infix-op>)". If <infix-op> begins or ends with a "*", there needs to
nipkow@67400
    23
be a space between the "*" and the corresponding parenthesis.
nipkow@67400
    24
INCOMPATIBILITY.
nipkow@67398
    25
There is an Isabelle tool "update_op" that converts theory and ML files
nipkow@67398
    26
to the new syntax. Because it is based on regular expression matching,
nipkow@67398
    27
the result may need a bit of manual postprocessing. Invoking "isabelle
nipkow@67398
    28
update_op" converts all files in the current directory (recursively).
nipkow@67398
    29
In case you want to exclude conversion of ML files (because the tool
nipkow@67398
    30
frequently also converts ML's "op" syntax), use option "-m".
nipkow@67398
    31
wenzelm@67119
    32
* The old 'def' command has been discontinued (legacy since
wenzelm@67119
    33
Isbelle2016-1). INCOMPATIBILITY, use 'define' instead -- usually with
wenzelm@67119
    34
object-logic equality or equivalence.
wenzelm@67119
    35
wenzelm@66712
    36
* Session-qualified theory names are mandatory: it is no longer possible
wenzelm@66712
    37
to refer to unqualified theories from the parent session.
wenzelm@66712
    38
INCOMPATIBILITY for old developments that have not been updated to
wenzelm@66712
    39
Isabelle2017 yet (using the "isabelle imports" tool).
wenzelm@66712
    40
wenzelm@67013
    41
* Theory header 'abbrevs' specifications need to be separated by 'and'.
wenzelm@67013
    42
INCOMPATIBILITY.
wenzelm@67013
    43
wenzelm@66993
    44
* Only the most fundamental theory names are global, usually the entry
wenzelm@66993
    45
points to major logic sessions: Pure, Main, Complex_Main, HOLCF, IFOL,
wenzelm@66993
    46
FOL, ZF, ZFC etc. INCOMPATIBILITY, need to use qualified names for
wenzelm@66993
    47
formerly global "HOL-Probability.Probability" and "HOL-SPARK.SPARK".
wenzelm@66993
    48
wenzelm@66757
    49
* Command 'external_file' declares the formal dependency on the given
wenzelm@66757
    50
file name, such that the Isabelle build process knows about it, but
wenzelm@66757
    51
without specific Prover IDE management.
wenzelm@66757
    52
wenzelm@66759
    53
* Session ROOT entries no longer allow specification of 'files'. Rare
wenzelm@66759
    54
INCOMPATIBILITY, use command 'external_file' within a proper theory
wenzelm@66759
    55
context.
wenzelm@66759
    56
wenzelm@66764
    57
* Session root directories may be specified multiple times: each
wenzelm@66764
    58
accessible ROOT file is processed only once. This facilitates
wenzelm@66764
    59
specification of $ISABELLE_HOME_USER/ROOTS or command-line options like
wenzelm@66764
    60
-d or -D for "isabelle build" and "isabelle jedit". Example:
wenzelm@66764
    61
wenzelm@66764
    62
  isabelle build -D '~~/src/ZF'
wenzelm@66764
    63
wenzelm@67263
    64
* The command 'display_drafts' has been discontinued. INCOMPATIBILITY,
wenzelm@67263
    65
use action "isabelle.draft" (or "print") in Isabelle/jEdit instead.
wenzelm@67263
    66
wenzelm@67305
    67
* Isabelle symbol "\<hyphen>" is rendered as explicit Unicode hyphen U+2010, to
wenzelm@67305
    68
avoid unclear meaning of the old "soft hyphen" U+00AD. Rare
wenzelm@67305
    69
INCOMPATIBILITY, e.g. copy-paste of historic Isabelle HTML output.
wenzelm@67305
    70
wenzelm@66712
    71
wenzelm@67261
    72
*** Isabelle/jEdit Prover IDE ***
wenzelm@66768
    73
wenzelm@67395
    74
* System options "spell_checker_include" and "spell_checker_exclude"
wenzelm@67395
    75
supersede former "spell_checker_elements" to determine regions of text
wenzelm@67395
    76
that are subject to spell-checking. Minor INCOMPATIBILITY.
wenzelm@67395
    77
wenzelm@67221
    78
* PIDE markup for session ROOT files: allows to complete session names,
wenzelm@67221
    79
follow links to theories and document files etc.
wenzelm@67215
    80
wenzelm@66993
    81
* Completion supports theory header imports, using theory base name.
wenzelm@66994
    82
E.g. "Prob" may be completed to "HOL-Probability.Probability".
wenzelm@66768
    83
wenzelm@66988
    84
* The command-line tool "isabelle jedit" provides more flexible options
wenzelm@66988
    85
for session selection:
wenzelm@66988
    86
  - options -P opens the parent session image of -l
wenzelm@66988
    87
  - options -A and -B modify the meaning of -l to produce a base
wenzelm@66988
    88
    image on the spot, based on the specified ancestor (or parent)
wenzelm@66987
    89
  - option -F focuses on the specified logic session
wenzelm@66987
    90
  - option -R has changed: it only opens the session ROOT entry
wenzelm@66987
    91
  - option -S sets up the development environment to edit the
wenzelm@66987
    92
    specified session: it abbreviates -B -F -R -l
wenzelm@66973
    93
wenzelm@66990
    94
  Examples:
wenzelm@66990
    95
    isabelle jedit -d '$AFP' -S Formal_SSA -A HOL
wenzelm@66990
    96
    isabelle jedit -d '$AFP' -S Formal_SSA -A HOL-Analysis
wenzelm@66988
    97
wenzelm@67133
    98
* Named control symbols (without special Unicode rendering) are shown as
wenzelm@67133
    99
bold-italic keyword. This is particularly useful for the short form of
wenzelm@67133
   100
antiquotations with control symbol: \<^name>\<open>argument\<close>. The action
wenzelm@67133
   101
"isabelle.antiquoted_cartouche" turns an antiquotation with 0 or 1
wenzelm@67133
   102
arguments into this format.
wenzelm@67133
   103
wenzelm@67311
   104
* Completion provides templates for named symbols with arguments,
wenzelm@67311
   105
e.g. "\<comment> \<open>ARGUMENT\<close>" or "\<^emph>\<open>ARGUMENT\<close>".
wenzelm@67311
   106
wenzelm@67295
   107
* Bibtex database files (.bib) are semantically checked.
wenzelm@67295
   108
wenzelm@67248
   109
* Action "isabelle.preview" is able to present more file formats,
wenzelm@67266
   110
notably bibtex database files and ML files.
wenzelm@67246
   111
wenzelm@67262
   112
* Action "isabelle.draft" is similar to "isabelle.preview", but shows a
wenzelm@67262
   113
plain-text document draft.
wenzelm@67262
   114
wenzelm@67304
   115
* When loading text files, the Isabelle symbols encoding UTF-8-Isabelle
wenzelm@67304
   116
is only used if there is no conflict with existing Unicode sequences in
wenzelm@67304
   117
the file. Otherwise, the fallback encoding is plain UTF-8 and Isabelle
wenzelm@67304
   118
symbols remain in literal \<symbol> form. This avoids accidental loss of
wenzelm@67304
   119
Unicode content when saving the file.
wenzelm@67304
   120
wenzelm@67246
   121
wenzelm@67261
   122
*** Isabelle/VSCode Prover IDE ***
wenzelm@67261
   123
wenzelm@67261
   124
* HTML preview of theories and other file-formats similar to
wenzelm@67261
   125
Isabelle/jEdit.
wenzelm@67261
   126
wenzelm@66768
   127
wenzelm@67140
   128
*** Document preparation ***
wenzelm@67140
   129
wenzelm@67448
   130
* Formal comments work uniformly in outer syntax, inner syntax (term
wenzelm@67448
   131
language), Isabelle/ML and some other embedded languages of Isabelle.
wenzelm@67448
   132
See also "Document comments" in the isar-ref manual. The following forms
wenzelm@67448
   133
are supported:
wenzelm@67448
   134
wenzelm@67448
   135
  - marginal text comment: \<comment> \<open>\<dots>\<close>
wenzelm@67448
   136
  - canceled source: \<^cancel>\<open>\<dots>\<close>
wenzelm@67448
   137
  - raw LaTeX: \<^latex>\<open>\<dots>\<close>
wenzelm@67413
   138
wenzelm@67381
   139
* Outside of the inner theory body, the default presentation context is
wenzelm@67381
   140
theory Pure. Thus elementary antiquotations may be used in markup
wenzelm@67381
   141
commands (e.g. 'chapter', 'section', 'text') and formal comments.
wenzelm@67381
   142
wenzelm@67140
   143
* System option "document_tags" specifies a default for otherwise
wenzelm@67140
   144
untagged commands. This is occasionally useful to control the global
wenzelm@67140
   145
visibility of commands via session options (e.g. in ROOT).
wenzelm@67140
   146
wenzelm@67140
   147
* Document markup commands ('section', 'text' etc.) are implicitly
wenzelm@67140
   148
tagged as "document" and visible by default. This avoids the application
wenzelm@67140
   149
of option "document_tags" to these commands.
wenzelm@67140
   150
wenzelm@67145
   151
* Isabelle names are mangled into LaTeX macro names to allow the full
wenzelm@67145
   152
identifier syntax with underscore, prime, digits. This is relevant for
wenzelm@67145
   153
antiquotations in control symbol notation, e.g. \<^const_name> becomes
wenzelm@67145
   154
\isactrlconstUNDERSCOREname.
wenzelm@67145
   155
wenzelm@67297
   156
* Document antiquotation @{cite} now checks the given Bibtex entries
wenzelm@67297
   157
against the Bibtex database files -- only in batch-mode session builds.
wenzelm@67297
   158
wenzelm@67219
   159
* Document antiquotation @{session name} checks and prints the given
wenzelm@67219
   160
session name verbatim.
wenzelm@67219
   161
wenzelm@67157
   162
* Document preparation with skip_proofs option now preserves the content
wenzelm@67157
   163
more accurately: only terminal proof steps ('by' etc.) are skipped.
wenzelm@67157
   164
wenzelm@67176
   165
* Command-line tool "isabelle document" has been re-implemented in
wenzelm@67194
   166
Isabelle/Scala, with simplified arguments and explicit errors from the
wenzelm@67203
   167
latex and bibtex process. Minor INCOMPATIBILITY.
wenzelm@67173
   168
wenzelm@67140
   169
blanchet@66661
   170
*** HOL ***
blanchet@66661
   171
haftmann@67525
   172
* Clarifed theorem names:
haftmann@67525
   173
haftmann@67525
   174
  Min.antimono ~> Min.subset_imp
haftmann@67525
   175
  Max.antimono ~> Max.subset_imp
haftmann@67525
   176
haftmann@67525
   177
Minor INCOMPATIBILITY.
haftmann@67525
   178
traytel@67224
   179
* A new command parametric_constant for proving parametricity of
wenzelm@67303
   180
non-recursive definitions. For constants that are not fully parametric
wenzelm@67303
   181
the command will infer conditions on relations (e.g., bi_unique,
wenzelm@67303
   182
bi_total, or type class conditions such as "respects 0") sufficient for
wenzelm@67303
   183
parametricity. See ~~/src/HOL/ex/Conditional_Parametricity_Examples for
wenzelm@67303
   184
some examples.
traytel@67224
   185
blanchet@66661
   186
* SMT module:
blanchet@66661
   187
  - The 'smt_oracle' option is now necessary when using the 'smt' method
blanchet@66662
   188
    with a solver other than Z3. INCOMPATIBILITY.
wenzelm@66844
   189
  - The encoding to first-order logic is now more complete in the
wenzelm@66844
   190
    presence of higher-order quantifiers. An 'smt_explicit_application'
wenzelm@66844
   191
    option has been added to control this. INCOMPATIBILITY.
wenzelm@66844
   192
blanchet@67335
   193
* Datatypes:
blanchet@67335
   194
  - The legacy command 'old_datatype', provided by
blanchet@67335
   195
    '~~/src/HOL/Library/Old_Datatype.thy', has been removed. INCOMPATIBILITY.
blanchet@67335
   196
wenzelm@66844
   197
* Theory HOL-Computational_Algebra.Polynomial_Factorial does not provide
wenzelm@66844
   198
instances of rat, real, complex as factorial rings etc. Import
wenzelm@66844
   199
HOL-Computational_Algebra.Field_as_Ring explicitly in case of need.
wenzelm@66844
   200
INCOMPATIBILITY.
wenzelm@66844
   201
wenzelm@66844
   202
* Fact mod_mult_self4 (on nat) renamed to mod_mult_self3', to avoid
wenzelm@66844
   203
clash with fact mod_mult_self4 (on more generic semirings).
wenzelm@66844
   204
INCOMPATIBILITY.
haftmann@66801
   205
haftmann@66804
   206
* Facts sum.commute(_restrict) and prod.commute(_restrict) renamed to
wenzelm@66844
   207
sum.swap(_restrict) and prod.swap(_restrict), to avoid name clashes on
wenzelm@66844
   208
interpretation of abstract locales. INCOMPATIBILITY.
haftmann@66804
   209
haftmann@66803
   210
* Predicate pairwise_coprime abolished, use "pairwise coprime" instead.
haftmann@66803
   211
INCOMPATIBILITY.
haftmann@66803
   212
Andreas@67616
   213
* The relator rel_filter on filters has been strengthened to its 
Andreas@67616
   214
canonical categorical definition with better properties. INCOMPATIBILITY.
Andreas@67616
   215
nipkow@67341
   216
* HOL-Algebra: renamed (^) to [^]
nipkow@67341
   217
wenzelm@66844
   218
* Session HOL-Analysis: Moebius functions and the Riemann mapping
wenzelm@66844
   219
theorem.
wenzelm@66844
   220
haftmann@66937
   221
* Class linordered_semiring_1 covers zero_less_one also, ruling out
haftmann@66937
   222
pathologic instances. Minor INCOMPATIBILITY.
haftmann@66937
   223
haftmann@67051
   224
* Removed nat-int transfer machinery. Rare INCOMPATIBILITY.
haftmann@67051
   225
haftmann@67051
   226
* Predicate coprime is now a real definition, not a mere
haftmann@67051
   227
abbreviation. INCOMPATIBILITY.
haftmann@66954
   228
haftmann@67207
   229
* Code generation: Code generation takes an explicit option
haftmann@67207
   230
"case_insensitive" to accomodate case-insensitive file systems.
haftmann@67207
   231
wenzelm@66651
   232
wenzelm@66729
   233
*** System ***
wenzelm@66729
   234
wenzelm@67433
   235
* The command-line tool "isabelle update_comments" normalizes formal
wenzelm@67433
   236
comments in outer syntax as follows: \<comment> \<open>text\<close> (whith a single space to
wenzelm@67433
   237
approximate the appearance in document output). This is more specific
wenzelm@67433
   238
than former "isabelle update_cartouches -c": the latter tool option has
wenzelm@67433
   239
been discontinued.
wenzelm@67433
   240
wenzelm@66949
   241
* Session ROOT entry: empty 'document_files' means there is no document
wenzelm@66949
   242
for this session. There is no need to specify options [document = false]
wenzelm@66949
   243
anymore.
wenzelm@66949
   244
wenzelm@67043
   245
* The command-line tool "isabelle mkroot" now always produces a document
wenzelm@67043
   246
outline: its options have been adapted accordingly. INCOMPATIBILITY.
wenzelm@67043
   247
wenzelm@67069
   248
* The command-line tool "isabelle mkroot -I" initializes a Mercurial
wenzelm@67069
   249
repository for the generated session files.
wenzelm@67069
   250
wenzelm@66909
   251
* Linux and Windows/Cygwin is for x86_64 only. Old 32bit platform
wenzelm@66909
   252
support has been discontinued.
wenzelm@66729
   253
wenzelm@67088
   254
* Mac OS X 10.10 Yosemite is now the baseline version; Mavericks is no
wenzelm@67088
   255
longer supported.
wenzelm@67088
   256
wenzelm@66906
   257
* Java runtime is for x86_64 only. Corresponding Isabelle settings have
wenzelm@66906
   258
been renamed to ISABELLE_TOOL_JAVA_OPTIONS and JEDIT_JAVA_OPTIONS,
wenzelm@66906
   259
instead of former 32/64 variants. INCOMPATIBILITY.
wenzelm@66906
   260
wenzelm@66745
   261
* Command-line tool "isabelle build" supports new options:
wenzelm@66745
   262
  - option -B NAME: include session NAME and all descendants
wenzelm@66745
   263
  - option -S: only observe changes of sources, not heap images
wenzelm@66841
   264
  - option -f: forces a fresh build
wenzelm@66737
   265
wenzelm@66843
   266
* Command-line tool "isabelle build" takes "condition" options with the
wenzelm@66843
   267
corresponding environment values into account, when determining the
wenzelm@66843
   268
up-to-date status of a session.
wenzelm@66843
   269
wenzelm@66851
   270
* Command-line tool "isabelle imports -I" also reports actual session
wenzelm@66851
   271
imports. This helps to minimize the session dependency graph.
wenzelm@66851
   272
wenzelm@67099
   273
* Update to current Poly/ML 5.7.1 with slightly improved performance and
wenzelm@67099
   274
PIDE markup for identifier bindings.
wenzelm@67099
   275
wenzelm@67199
   276
* ISABELLE_LATEX and ISABELLE_PDFLATEX now include platform-specific
wenzelm@67199
   277
options for improved error reporting. Potential INCOMPATIBILITY with
wenzelm@67199
   278
unusual LaTeX installations, may have to adapt these settings.
wenzelm@67199
   279
wenzelm@67591
   280
* The bundled Poly/ML 5.7.1 now uses The GNU Multiple Precision
wenzelm@67591
   281
Arithmetic Library (libgmp) on all platforms, notably Mac OS X with
wenzelm@67591
   282
32/64 bit.
wenzelm@67591
   283
wenzelm@67099
   284
wenzelm@66729
   285
wenzelm@66472
   286
New in Isabelle2017 (October 2017)
wenzelm@66472
   287
----------------------------------
wenzelm@64439
   288
wenzelm@64986
   289
*** General ***
wenzelm@64986
   290
wenzelm@66238
   291
* Experimental support for Visual Studio Code (VSCode) as alternative
wenzelm@66238
   292
Isabelle/PIDE front-end, see also
wenzelm@66599
   293
https://marketplace.visualstudio.com/items?itemName=makarius.Isabelle2017
wenzelm@66238
   294
wenzelm@66238
   295
VSCode is a new type of application that continues the concepts of
wenzelm@66238
   296
"programmer's editor" and "integrated development environment" towards
wenzelm@66238
   297
fully semantic editing and debugging -- in a relatively light-weight
wenzelm@66238
   298
manner. Thus it fits nicely on top of the Isabelle/PIDE infrastructure.
wenzelm@66238
   299
Technically, VSCode is based on the Electron application framework
wenzelm@66238
   300
(Node.js + Chromium browser + V8), which is implemented in JavaScript
wenzelm@66238
   301
and TypeScript, while Isabelle/VSCode mainly consists of Isabelle/Scala
wenzelm@66238
   302
modules around a Language Server implementation.
wenzelm@66238
   303
wenzelm@65504
   304
* Theory names are qualified by the session name that they belong to.
wenzelm@66454
   305
This affects imports, but not the theory name space prefix (which is
wenzelm@66454
   306
just the theory base name as before).
wenzelm@66454
   307
wenzelm@66454
   308
In order to import theories from other sessions, the ROOT file format
wenzelm@66454
   309
provides a new 'sessions' keyword. In contrast, a theory that is
wenzelm@66454
   310
imported in the old-fashioned manner via an explicit file-system path
wenzelm@66472
   311
belongs to the current session, and might cause theory name conflicts
wenzelm@66454
   312
later on. Theories that are imported from other sessions are excluded
wenzelm@66454
   313
from the current session document. The command-line tool "isabelle
wenzelm@66454
   314
imports" helps to update theory imports.
wenzelm@66454
   315
wenzelm@65451
   316
* The main theory entry points for some non-HOL sessions have changed,
wenzelm@65451
   317
to avoid confusion with the global name "Main" of the session HOL. This
wenzelm@65451
   318
leads to the follow renamings:
wenzelm@65451
   319
wenzelm@65451
   320
  CTT/Main.thy    ~>  CTT/CTT.thy
wenzelm@65451
   321
  ZF/Main.thy     ~>  ZF/ZF.thy
wenzelm@65451
   322
  ZF/Main_ZF.thy  ~>  ZF/ZF.thy
wenzelm@65451
   323
  ZF/Main_ZFC.thy ~>  ZF/ZFC.thy
wenzelm@65451
   324
  ZF/ZF.thy       ~>  ZF/ZF_Base.thy
wenzelm@65451
   325
wenzelm@65451
   326
INCOMPATIBILITY.
wenzelm@65451
   327
wenzelm@66472
   328
* Commands 'alias' and 'type_alias' introduce aliases for constants and
wenzelm@66472
   329
type constructors, respectively. This allows adhoc changes to name-space
wenzelm@66472
   330
accesses within global or local theory contexts, e.g. within a 'bundle'.
wenzelm@66472
   331
wenzelm@64986
   332
* Document antiquotations @{prf} and @{full_prf} output proof terms
wenzelm@64986
   333
(again) in the same way as commands 'prf' and 'full_prf'.
wenzelm@64986
   334
wenzelm@65055
   335
* Computations generated by the code generator can be embedded directly
wenzelm@65055
   336
into ML, alongside with @{code} antiquotations, using the following
wenzelm@65055
   337
antiquotations:
wenzelm@65055
   338
wenzelm@65055
   339
  @{computation ... terms: ... datatypes: ...} :
wenzelm@65055
   340
    ((term -> term) -> 'ml option -> 'a) -> Proof.context -> term -> 'a
wenzelm@65055
   341
  @{computation_conv ... terms: ... datatypes: ...} :
wenzelm@65055
   342
    (Proof.context -> 'ml -> conv) -> Proof.context -> conv
wenzelm@65045
   343
  @{computation_check terms: ... datatypes: ...} : Proof.context -> conv
haftmann@65041
   344
wenzelm@65055
   345
See src/HOL/ex/Computations.thy,
wenzelm@65055
   346
src/HOL/Decision_Procs/Commutative_Ring.thy and
wenzelm@65055
   347
src/HOL/Decision_Procs/Reflective_Field.thy for examples and the
wenzelm@65055
   348
tutorial on code generation.
haftmann@65041
   349
wenzelm@64986
   350
wenzelm@64602
   351
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@64602
   352
wenzelm@66472
   353
* Session-qualified theory imports allow the Prover IDE to process
wenzelm@66472
   354
arbitrary theory hierarchies independently of the underlying logic
wenzelm@66472
   355
session image (e.g. option "isabelle jedit -l"), but the directory
wenzelm@66472
   356
structure needs to be known in advance (e.g. option "isabelle jedit -d"
wenzelm@66472
   357
or a line in the file $ISABELLE_HOME_USER/ROOTS).
wenzelm@64602
   358
wenzelm@64842
   359
* The PIDE document model maintains file content independently of the
wenzelm@64842
   360
status of jEdit editor buffers. Reloading jEdit buffers no longer causes
wenzelm@64842
   361
changes of formal document content. Theory dependencies are always
wenzelm@64842
   362
resolved internally, without the need for corresponding editor buffers.
wenzelm@64842
   363
The system option "jedit_auto_load" has been discontinued: it is
wenzelm@64842
   364
effectively always enabled.
wenzelm@64842
   365
wenzelm@64867
   366
* The Theories dockable provides a "Purge" button, in order to restrict
wenzelm@64867
   367
the document model to theories that are required for open editor
wenzelm@64867
   368
buffers.
wenzelm@64867
   369
wenzelm@66424
   370
* The Theories dockable indicates the overall status of checking of each
wenzelm@66424
   371
entry. When all forked tasks of a theory are finished, the border is
wenzelm@66424
   372
painted with thick lines; remaining errors in this situation are
wenzelm@66424
   373
represented by a different border color.
wenzelm@66424
   374
wenzelm@66472
   375
* Automatic indentation is more careful to avoid redundant spaces in
wenzelm@66472
   376
intermediate situations. Keywords are indented after input (via typed
wenzelm@66472
   377
characters or completion); see also option "jedit_indent_input".
wenzelm@66472
   378
wenzelm@66472
   379
* Action "isabelle.preview" opens an HTML preview of the current theory
wenzelm@66472
   380
document in the default web browser.
wenzelm@66472
   381
wenzelm@66574
   382
* Command-line invocation "isabelle jedit -R -l LOGIC" opens the ROOT
wenzelm@66574
   383
entry of the specified logic session in the editor, while its parent is
wenzelm@66574
   384
used for formal checking.
wenzelm@66472
   385
wenzelm@66462
   386
* The main Isabelle/jEdit plugin may be restarted manually (using the
wenzelm@66462
   387
jEdit Plugin Manager), as long as the "Isabelle Base" plugin remains
wenzelm@66462
   388
enabled at all times.
wenzelm@66462
   389
wenzelm@66472
   390
* Update to current jedit-5.4.0.
wenzelm@65329
   391
wenzelm@64602
   392
haftmann@66149
   393
*** Pure ***
haftmann@66149
   394
haftmann@66149
   395
* Deleting the last code equations for a particular function using
haftmann@66149
   396
[code del] results in function with no equations (runtime abort) rather
wenzelm@66472
   397
than an unimplemented function (generation time abort). Use explicit
haftmann@66665
   398
[[code drop:]] to enforce the latter. Minor INCOMPATIBILITY.
haftmann@66149
   399
haftmann@66310
   400
* Proper concept of code declarations in code.ML:
wenzelm@66472
   401
  - Regular code declarations act only on the global theory level, being
wenzelm@66472
   402
    ignored with warnings if syntactically malformed.
wenzelm@66472
   403
  - Explicitly global code declarations yield errors if syntactically
wenzelm@66472
   404
    malformed.
wenzelm@66472
   405
  - Default code declarations are silently ignored if syntactically
wenzelm@66472
   406
    malformed.
haftmann@66310
   407
Minor INCOMPATIBILITY.
haftmann@66310
   408
wenzelm@66472
   409
* Clarified and standardized internal data bookkeeping of code
wenzelm@66472
   410
declarations: history of serials allows to track potentially
wenzelm@66472
   411
non-monotonous declarations appropriately. Minor INCOMPATIBILITY.
haftmann@66310
   412
haftmann@66149
   413
haftmann@64593
   414
*** HOL ***
haftmann@64593
   415
blanchet@66614
   416
* The Nunchaku model finder is now part of "Main".
blanchet@66614
   417
wenzelm@66472
   418
* SMT module:
wenzelm@66472
   419
  - A new option, 'smt_nat_as_int', has been added to translate 'nat' to
wenzelm@66472
   420
    'int' and benefit from the SMT solver's theory reasoning. It is
wenzelm@66472
   421
    disabled by default.
wenzelm@66472
   422
  - The legacy module "src/HOL/Library/Old_SMT.thy" has been removed.
wenzelm@66472
   423
  - Several small issues have been rectified in the 'smt' command.
wenzelm@66472
   424
wenzelm@66472
   425
* (Co)datatype package: The 'size_gen_o_map' lemma is no longer
wenzelm@66472
   426
generated for datatypes with type class annotations. As a result, the
wenzelm@66472
   427
tactic that derives it no longer fails on nested datatypes. Slight
wenzelm@66472
   428
INCOMPATIBILITY.
eberlm@66450
   429
haftmann@66345
   430
* Command and antiquotation "value" with modified default strategy:
haftmann@66345
   431
terms without free variables are always evaluated using plain evaluation
wenzelm@66472
   432
only, with no fallback on normalization by evaluation. Minor
wenzelm@66472
   433
INCOMPATIBILITY.
eberlm@65956
   434
wenzelm@65552
   435
* Theories "GCD" and "Binomial" are already included in "Main" (instead
wenzelm@65575
   436
of "Complex_Main").
wenzelm@65552
   437
haftmann@65170
   438
* Constant "surj" is a full input/output abbreviation (again).
haftmann@65170
   439
Minor INCOMPATIBILITY.
haftmann@65170
   440
haftmann@64632
   441
* Dropped aliasses RangeP, DomainP for Rangep, Domainp respectively.
haftmann@64632
   442
INCOMPATIBILITY.
haftmann@64632
   443
wenzelm@66472
   444
* Renamed ii to imaginary_unit in order to free up ii as a variable
wenzelm@66472
   445
name. The syntax \<i> remains available. INCOMPATIBILITY.
wenzelm@66472
   446
wenzelm@66472
   447
* Dropped abbreviations transP, antisymP, single_valuedP; use constants
wenzelm@66472
   448
transp, antisymp, single_valuedp instead. INCOMPATIBILITY.
wenzelm@66472
   449
wenzelm@66472
   450
* Constant "subseq" in Topological_Spaces has been removed -- it is
wenzelm@66472
   451
subsumed by "strict_mono". Some basic lemmas specific to "subseq" have
wenzelm@66472
   452
been renamed accordingly, e.g. "subseq_o" -> "strict_mono_o" etc.
wenzelm@66472
   453
wenzelm@66472
   454
* Theory List: "sublist" renamed to "nths" in analogy with "nth", and
wenzelm@66472
   455
"sublisteq" renamed to "subseq". Minor INCOMPATIBILITY.
wenzelm@66472
   456
wenzelm@66472
   457
* Theory List: new generic function "sorted_wrt".
wenzelm@66472
   458
wenzelm@66472
   459
* Named theorems mod_simps covers various congruence rules concerning
wenzelm@66472
   460
mod, replacing former zmod_simps. INCOMPATIBILITY.
haftmann@64787
   461
haftmann@64593
   462
* Swapped orientation of congruence rules mod_add_left_eq,
haftmann@64593
   463
mod_add_right_eq, mod_add_eq, mod_mult_left_eq, mod_mult_right_eq,
haftmann@64593
   464
mod_mult_eq, mod_minus_eq, mod_diff_left_eq, mod_diff_right_eq,
wenzelm@66472
   465
mod_diff_eq. INCOMPATIBILITY.
haftmann@64593
   466
haftmann@64593
   467
* Generalized some facts:
blanchet@64876
   468
    measure_induct_rule
blanchet@64876
   469
    measure_induct
haftmann@64593
   470
    zminus_zmod ~> mod_minus_eq
haftmann@64593
   471
    zdiff_zmod_left ~> mod_diff_left_eq
haftmann@64593
   472
    zdiff_zmod_right ~> mod_diff_right_eq
haftmann@64593
   473
    zmod_eq_dvd_iff ~> mod_eq_dvd_iff
haftmann@64593
   474
INCOMPATIBILITY.
haftmann@64593
   475
wenzelm@66472
   476
* Algebraic type class hierarchy of euclidean (semi)rings in HOL:
wenzelm@66472
   477
euclidean_(semi)ring, euclidean_(semi)ring_cancel,
wenzelm@66472
   478
unique_euclidean_(semi)ring; instantiation requires provision of a
wenzelm@66472
   479
euclidean size.
wenzelm@66472
   480
wenzelm@66472
   481
* Theory "HOL-Number_Theory.Euclidean_Algorithm" has been reworked:
wenzelm@66472
   482
  - Euclidean induction is available as rule eucl_induct.
wenzelm@66472
   483
  - Constants Euclidean_Algorithm.gcd, Euclidean_Algorithm.lcm,
wenzelm@66472
   484
    Euclidean_Algorithm.Gcd and Euclidean_Algorithm.Lcm allow
wenzelm@66472
   485
    easy instantiation of euclidean (semi)rings as GCD (semi)rings.
wenzelm@66472
   486
  - Coefficients obtained by extended euclidean algorithm are
wenzelm@66472
   487
    available as "bezout_coefficients".
wenzelm@66472
   488
INCOMPATIBILITY.
wenzelm@66472
   489
wenzelm@66472
   490
* Theory "Number_Theory.Totient" introduces basic notions about Euler's
wenzelm@66472
   491
totient function previously hidden as solitary example in theory
wenzelm@66472
   492
Residues. Definition changed so that "totient 1 = 1" in agreement with
wenzelm@66472
   493
the literature. Minor INCOMPATIBILITY.
wenzelm@66472
   494
wenzelm@66542
   495
* New styles in theory "HOL-Library.LaTeXsugar":
nipkow@66541
   496
  - "dummy_pats" for printing equations with "_" on the lhs;
nipkow@66541
   497
  - "eta_expand" for printing eta-expanded terms.
nipkow@66541
   498
wenzelm@66472
   499
* Theory "HOL-Library.Permutations": theorem bij_swap_ompose_bij has
wenzelm@66472
   500
been renamed to bij_swap_compose_bij. INCOMPATIBILITY.
wenzelm@66472
   501
lp15@66643
   502
* New theory "HOL-Library.Going_To_Filter" providing the "f going_to F"
eberlm@66488
   503
filter for describing points x such that f(x) is in the filter F.
eberlm@66488
   504
eberlm@66480
   505
* Theory "HOL-Library.Formal_Power_Series": constants X/E/L/F have been
eberlm@66480
   506
renamed to fps_X/fps_exp/fps_ln/fps_hypergeo to avoid polluting the name
wenzelm@66472
   507
space. INCOMPATIBILITY.
wenzelm@66472
   508
wenzelm@66472
   509
* Theory "HOL-Library.FinFun" has been moved to AFP (again).
wenzelm@66472
   510
INCOMPATIBILITY.
wenzelm@66472
   511
wenzelm@66472
   512
* Theory "HOL-Library.FuncSet": some old and rarely used ASCII
wenzelm@66472
   513
replacement syntax has been removed. INCOMPATIBILITY, standard syntax
wenzelm@66472
   514
with symbols should be used instead. The subsequent commands help to
wenzelm@66472
   515
reproduce the old forms, e.g. to simplify porting old theories:
wenzelm@66472
   516
wenzelm@66472
   517
syntax (ASCII)
wenzelm@66472
   518
  "_PiE" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set"  ("(3PIE _:_./ _)" 10)
wenzelm@66472
   519
  "_Pi"  :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set"  ("(3PI _:_./ _)" 10)
wenzelm@66472
   520
  "_lam" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> ('a \<Rightarrow> 'b)"  ("(3%_:_./ _)" [0,0,3] 3)
wenzelm@66472
   521
wenzelm@66472
   522
* Theory "HOL-Library.Multiset": the simprocs on subsets operators of
wenzelm@66472
   523
multisets have been renamed:
wenzelm@66472
   524
wenzelm@66472
   525
  msetless_cancel_numerals ~> msetsubset_cancel
wenzelm@66472
   526
  msetle_cancel_numerals ~> msetsubset_eq_cancel
wenzelm@66472
   527
wenzelm@66472
   528
INCOMPATIBILITY.
wenzelm@66472
   529
lars@66481
   530
* Theory "HOL-Library.Pattern_Aliases" provides input and output syntax
lars@66481
   531
for pattern aliases as known from Haskell, Scala and ML.
blanchet@65515
   532
Andreas@66563
   533
* Theory "HOL-Library.Uprod" formalizes the type of unordered pairs.
Andreas@66563
   534
wenzelm@64898
   535
* Session HOL-Analysis: more material involving arcs, paths, covering
wenzelm@66650
   536
spaces, innessential maps, retracts, infinite products, simplicial
wenzelm@66650
   537
complexes. Baire Category theorem. Major results include the Jordan
wenzelm@66650
   538
Curve Theorem and the Great Picard Theorem.
wenzelm@66472
   539
wenzelm@66472
   540
* Session HOL-Algebra has been extended by additional lattice theory:
wenzelm@66472
   541
the Knaster-Tarski fixed point theorem and Galois Connections.
wenzelm@66472
   542
wenzelm@66472
   543
* Sessions HOL-Computational_Algebra and HOL-Number_Theory: new notions
wenzelm@66472
   544
of squarefreeness, n-th powers, and prime powers.
wenzelm@66472
   545
wenzelm@66472
   546
* Session "HOL-Computional_Algebra" covers many previously scattered
wenzelm@66472
   547
theories, notably Euclidean_Algorithm, Factorial_Ring,
wenzelm@66472
   548
Formal_Power_Series, Fraction_Field, Fundamental_Theorem_Algebra,
wenzelm@66472
   549
Normalized_Fraction, Polynomial_FPS, Polynomial, Primes. Minor
wenzelm@66472
   550
INCOMPATIBILITY.
Mathias@65027
   551
wenzelm@60331
   552
wenzelm@64844
   553
*** System ***
wenzelm@64844
   554
wenzelm@66474
   555
* Isabelle/Scala: the SQL module supports access to relational
wenzelm@66474
   556
databases, either as plain file (SQLite) or full-scale server
wenzelm@66474
   557
(PostgreSQL via local port or remote ssh connection).
wenzelm@66474
   558
wenzelm@66474
   559
* Results of "isabelle build" are recorded as SQLite database (i.e.
wenzelm@66474
   560
"Application File Format" in the sense of
wenzelm@66474
   561
https://www.sqlite.org/appfileformat.html). This allows systematic
wenzelm@66474
   562
access via operations from module Sessions.Store in Isabelle/Scala.
wenzelm@66474
   563
wenzelm@66472
   564
* System option "parallel_proofs" is 1 by default (instead of more
wenzelm@66472
   565
aggressive 2). This requires less heap space and avoids burning parallel
wenzelm@66472
   566
CPU cycles, while full subproof parallelization is enabled for repeated
wenzelm@66472
   567
builds (according to parallel_subproofs_threshold).
wenzelm@65072
   568
wenzelm@65448
   569
* System option "record_proofs" allows to change the global
wenzelm@65448
   570
Proofterm.proofs variable for a session. Regular values are are 0, 1, 2;
wenzelm@65448
   571
a negative value means the current state in the ML heap image remains
wenzelm@65448
   572
unchanged.
wenzelm@65448
   573
wenzelm@66472
   574
* Isabelle settings variable ISABELLE_SCALA_BUILD_OPTIONS has been
wenzelm@66472
   575
renamed to ISABELLE_SCALAC_OPTIONS. Rare INCOMPATIBILITY.
wenzelm@66472
   576
wenzelm@66472
   577
* Isabelle settings variables ISABELLE_WINDOWS_PLATFORM,
wenzelm@66472
   578
ISABELLE_WINDOWS_PLATFORM32, ISABELLE_WINDOWS_PLATFORM64 indicate the
wenzelm@66472
   579
native Windows platform (independently of the Cygwin installation). This
wenzelm@66472
   580
is analogous to ISABELLE_PLATFORM, ISABELLE_PLATFORM32,
wenzelm@66472
   581
ISABELLE_PLATFORM64.
wenzelm@65557
   582
wenzelm@66786
   583
* Command-line tool "isabelle build_docker" builds a Docker image from
wenzelm@66786
   584
the Isabelle application bundle for Linux. See also
wenzelm@66786
   585
https://hub.docker.com/r/makarius/isabelle
wenzelm@66786
   586
wenzelm@66473
   587
* Command-line tool "isabelle vscode_server" provides a Language Server
wenzelm@66473
   588
Protocol implementation, e.g. for the Visual Studio Code editor. It
wenzelm@66473
   589
serves as example for alternative PIDE front-ends.
wenzelm@66473
   590
wenzelm@66472
   591
* Command-line tool "isabelle imports" helps to maintain theory imports
wenzelm@66671
   592
wrt. session structure. Examples for the main Isabelle distribution:
wenzelm@66472
   593
wenzelm@66472
   594
  isabelle imports -I -a
wenzelm@66472
   595
  isabelle imports -U -a
wenzelm@66472
   596
  isabelle imports -U -i -a
wenzelm@66472
   597
  isabelle imports -M -a -d '~~/src/Benchmarks'
wenzelm@66472
   598
wenzelm@64844
   599
wenzelm@67099
   600
wenzelm@64072
   601
New in Isabelle2016-1 (December 2016)
wenzelm@64072
   602
-------------------------------------
wenzelm@62216
   603
wenzelm@62440
   604
*** General ***
wenzelm@62440
   605
wenzelm@64390
   606
* Splitter in proof methods "simp", "auto" and friends:
wenzelm@64390
   607
  - The syntax "split add" has been discontinued, use plain "split",
wenzelm@64390
   608
    INCOMPATIBILITY.
wenzelm@64390
   609
  - For situations with many conditional or case expressions, there is
wenzelm@64390
   610
    an alternative splitting strategy that can be much faster. It is
wenzelm@64390
   611
    selected by writing "split!" instead of "split". It applies safe
wenzelm@64390
   612
    introduction and elimination rules after each split rule. As a
wenzelm@64390
   613
    result the subgoal may be split into several subgoals.
wenzelm@64390
   614
wenzelm@63273
   615
* Command 'bundle' provides a local theory target to define a bundle
wenzelm@63273
   616
from the body of specification commands (such as 'declare',
wenzelm@63273
   617
'declaration', 'notation', 'lemmas', 'lemma'). For example:
wenzelm@63273
   618
wenzelm@63273
   619
bundle foo
wenzelm@63273
   620
begin
wenzelm@63273
   621
  declare a [simp]
wenzelm@63273
   622
  declare b [intro]
wenzelm@63273
   623
end
wenzelm@63272
   624
wenzelm@63282
   625
* Command 'unbundle' is like 'include', but works within a local theory
wenzelm@63282
   626
context. Unlike "context includes ... begin", the effect of 'unbundle'
wenzelm@63282
   627
on the target context persists, until different declarations are given.
wenzelm@63282
   628
wenzelm@63977
   629
* Simplified outer syntax: uniform category "name" includes long
wenzelm@63977
   630
identifiers. Former "xname" / "nameref" / "name reference" has been
wenzelm@63977
   631
discontinued.
wenzelm@63977
   632
wenzelm@63977
   633
* Embedded content (e.g. the inner syntax of types, terms, props) may be
wenzelm@63977
   634
delimited uniformly via cartouches. This works better than old-fashioned
wenzelm@63977
   635
quotes when sub-languages are nested.
wenzelm@63977
   636
wenzelm@63977
   637
* Mixfix annotations support general block properties, with syntax
wenzelm@63977
   638
"(\<open>x=a y=b z \<dots>\<close>". Notable property names are "indent", "consistent",
wenzelm@63977
   639
"unbreakable", "markup". The existing notation "(DIGITS" is equivalent
wenzelm@63977
   640
to "(\<open>indent=DIGITS\<close>". The former notation "(00" for unbreakable blocks
wenzelm@63977
   641
is superseded by "(\<open>unbreabable\<close>" --- rare INCOMPATIBILITY.
nipkow@63650
   642
wenzelm@63383
   643
* Proof method "blast" is more robust wrt. corner cases of Pure
wenzelm@63383
   644
statements without object-logic judgment.
wenzelm@63383
   645
wenzelm@63624
   646
* Commands 'prf' and 'full_prf' are somewhat more informative (again):
wenzelm@63977
   647
proof terms are reconstructed and cleaned from administrative thm nodes.
wenzelm@63977
   648
wenzelm@63977
   649
* Code generator: config option "code_timing" triggers measurements of
wenzelm@63977
   650
different phases of code generation. See src/HOL/ex/Code_Timing.thy for
wenzelm@63977
   651
examples.
wenzelm@63977
   652
wenzelm@63977
   653
* Code generator: implicits in Scala (stemming from type class
wenzelm@63977
   654
instances) are generated into companion object of corresponding type
wenzelm@63977
   655
class, to resolve some situations where ambiguities may occur.
wenzelm@63977
   656
wenzelm@64390
   657
* Solve direct: option "solve_direct_strict_warnings" gives explicit
wenzelm@64390
   658
warnings for lemma statements with trivial proofs.
haftmann@64013
   659
wenzelm@64602
   660
wenzelm@62904
   661
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@62904
   662
wenzelm@64527
   663
* More aggressive flushing of machine-generated input, according to
wenzelm@64527
   664
system option editor_generated_input_delay (in addition to existing
wenzelm@64527
   665
editor_input_delay for regular user edits). This may affect overall PIDE
wenzelm@64527
   666
reactivity and CPU usage.
wenzelm@64527
   667
wenzelm@64390
   668
* Syntactic indentation according to Isabelle outer syntax. Action
wenzelm@64390
   669
"indent-lines" (shortcut C+i) indents the current line according to
wenzelm@64390
   670
command keywords and some command substructure. Action
wenzelm@64390
   671
"isabelle.newline" (shortcut ENTER) indents the old and the new line
wenzelm@64390
   672
according to command keywords only; see also option
wenzelm@64390
   673
"jedit_indent_newline".
wenzelm@64390
   674
wenzelm@64390
   675
* Semantic indentation for unstructured proof scripts ('apply' etc.) via
wenzelm@64390
   676
number of subgoals. This requires information of ongoing document
wenzelm@64390
   677
processing and may thus lag behind, when the user is editing too
wenzelm@64390
   678
quickly; see also option "jedit_script_indent" and
wenzelm@64390
   679
"jedit_script_indent_limit".
wenzelm@64390
   680
wenzelm@64390
   681
* Refined folding mode "isabelle" based on Isar syntax: 'next' and 'qed'
wenzelm@64390
   682
are treated as delimiters for fold structure; 'begin' and 'end'
wenzelm@64390
   683
structure of theory specifications is treated as well.
wenzelm@64390
   684
wenzelm@64390
   685
* Command 'proof' provides information about proof outline with cases,
wenzelm@64390
   686
e.g. for proof methods "cases", "induct", "goal_cases".
wenzelm@64390
   687
wenzelm@64390
   688
* Completion templates for commands involving "begin ... end" blocks,
wenzelm@64390
   689
e.g. 'context', 'notepad'.
wenzelm@64390
   690
wenzelm@64390
   691
* Sidekick parser "isabelle-context" shows nesting of context blocks
wenzelm@64390
   692
according to 'begin' and 'end' structure.
wenzelm@64390
   693
wenzelm@63977
   694
* Highlighting of entity def/ref positions wrt. cursor.
wenzelm@63977
   695
wenzelm@63977
   696
* Action "isabelle.select-entity" (shortcut CS+ENTER) selects all
wenzelm@64514
   697
occurrences of the formal entity at the caret position. This facilitates
wenzelm@63977
   698
systematic renaming.
wenzelm@63977
   699
wenzelm@63977
   700
* PIDE document markup works across multiple Isar commands, e.g. the
wenzelm@63977
   701
results established at the end of a proof are properly identified in the
wenzelm@63977
   702
theorem statement.
wenzelm@63977
   703
wenzelm@63977
   704
* Cartouche abbreviations work both for " and ` to accomodate typical
wenzelm@63977
   705
situations where old ASCII notation may be updated.
wenzelm@63977
   706
wenzelm@63875
   707
* Dockable window "Symbols" also provides access to 'abbrevs' from the
wenzelm@63875
   708
outer syntax of the current theory buffer. This provides clickable
wenzelm@63875
   709
syntax templates, including entries with empty abbrevs name (which are
wenzelm@63875
   710
inaccessible via keyboard completion).
wenzelm@63875
   711
wenzelm@63022
   712
* IDE support for the Isabelle/Pure bootstrap process, with the
wenzelm@63022
   713
following independent stages:
wenzelm@63022
   714
wenzelm@63022
   715
  src/Pure/ROOT0.ML
wenzelm@63022
   716
  src/Pure/ROOT.ML
wenzelm@63022
   717
  src/Pure/Pure.thy
wenzelm@63022
   718
  src/Pure/ML_Bootstrap.thy
wenzelm@63022
   719
wenzelm@63022
   720
The ML ROOT files act like quasi-theories in the context of theory
wenzelm@63022
   721
ML_Bootstrap: this allows continuous checking of all loaded ML files.
wenzelm@63022
   722
The theory files are presented with a modified header to import Pure
wenzelm@63022
   723
from the running Isabelle instance. Results from changed versions of
wenzelm@63022
   724
each stage are *not* propagated to the next stage, and isolated from the
wenzelm@63022
   725
actual Isabelle/Pure that runs the IDE itself. The sequential
wenzelm@63307
   726
dependencies of the above files are only observed for batch build.
wenzelm@62904
   727
wenzelm@63977
   728
* Isabelle/ML and Standard ML files are presented in Sidekick with the
wenzelm@63977
   729
tree structure of section headings: this special comment format is
wenzelm@63977
   730
described in "implementation" chapter 0, e.g. (*** section ***).
wenzelm@63461
   731
wenzelm@63581
   732
* Additional abbreviations for syntactic completion may be specified
wenzelm@63871
   733
within the theory header as 'abbrevs'. The theory syntax for 'keywords'
wenzelm@63871
   734
has been simplified accordingly: optional abbrevs need to go into the
wenzelm@63871
   735
new 'abbrevs' section.
wenzelm@63871
   736
wenzelm@63871
   737
* Global abbreviations via $ISABELLE_HOME/etc/abbrevs and
wenzelm@63871
   738
$ISABELLE_HOME_USER/etc/abbrevs are no longer supported. Minor
wenzelm@63871
   739
INCOMPATIBILITY, use 'abbrevs' within theory header instead.
wenzelm@63579
   740
wenzelm@64390
   741
* Action "isabelle.keymap-merge" asks the user to resolve pending
wenzelm@64390
   742
Isabelle keymap changes that are in conflict with the current jEdit
wenzelm@64390
   743
keymap; non-conflicting changes are always applied implicitly. This
wenzelm@64390
   744
action is automatically invoked on Isabelle/jEdit startup and thus
wenzelm@64390
   745
increases chances that users see new keyboard shortcuts when re-using
wenzelm@64390
   746
old keymaps.
wenzelm@64390
   747
wenzelm@63675
   748
* ML and document antiquotations for file-systems paths are more uniform
wenzelm@63675
   749
and diverse:
wenzelm@63675
   750
wenzelm@63675
   751
  @{path NAME}   -- no file-system check
wenzelm@63675
   752
  @{file NAME}   -- check for plain file
wenzelm@63675
   753
  @{dir NAME}    -- check for directory
wenzelm@63675
   754
wenzelm@63675
   755
Minor INCOMPATIBILITY, former uses of @{file} and @{file_unchecked} may
wenzelm@63675
   756
have to be changed.
wenzelm@63669
   757
wenzelm@63669
   758
wenzelm@63977
   759
*** Document preparation ***
wenzelm@63977
   760
wenzelm@63977
   761
* New symbol \<circle>, e.g. for temporal operator.
wenzelm@63977
   762
wenzelm@64073
   763
* New document and ML antiquotation @{locale} for locales, similar to
wenzelm@64073
   764
existing antiquotation @{class}.
wenzelm@64073
   765
wenzelm@63977
   766
* Mixfix annotations support delimiters like \<^control>\<open>cartouche\<close> --
wenzelm@63977
   767
this allows special forms of document output.
wenzelm@63977
   768
wenzelm@63977
   769
* Raw LaTeX output now works via \<^latex>\<open>...\<close> instead of raw control
wenzelm@63977
   770
symbol \<^raw:...>. INCOMPATIBILITY, notably for LaTeXsugar.thy and its
wenzelm@63977
   771
derivatives.
wenzelm@63977
   772
wenzelm@63977
   773
* \<^raw:...> symbols are no longer supported.
wenzelm@63977
   774
wenzelm@63977
   775
* Old 'header' command is no longer supported (legacy since
wenzelm@63977
   776
Isabelle2015).
wenzelm@63977
   777
wenzelm@63977
   778
wenzelm@62312
   779
*** Isar ***
wenzelm@62312
   780
wenzelm@63180
   781
* Many specification elements support structured statements with 'if' /
wenzelm@63180
   782
'for' eigen-context, e.g. 'axiomatization', 'abbreviation',
wenzelm@63180
   783
'definition', 'inductive', 'function'.
wenzelm@63180
   784
wenzelm@63094
   785
* Toplevel theorem statements support eigen-context notation with 'if' /
wenzelm@63284
   786
'for' (in postfix), which corresponds to 'assumes' / 'fixes' in the
wenzelm@63094
   787
traditional long statement form (in prefix). Local premises are called
wenzelm@63094
   788
"that" or "assms", respectively. Empty premises are *not* bound in the
wenzelm@63094
   789
context: INCOMPATIBILITY.
wenzelm@63094
   790
wenzelm@63039
   791
* Command 'define' introduces a local (non-polymorphic) definition, with
wenzelm@63039
   792
optional abstraction over local parameters. The syntax resembles
wenzelm@63043
   793
'definition' and 'obtain'. It fits better into the Isar language than
wenzelm@63043
   794
old 'def', which is now a legacy feature.
wenzelm@63039
   795
wenzelm@63059
   796
* Command 'obtain' supports structured statements with 'if' / 'for'
wenzelm@63059
   797
context.
wenzelm@63059
   798
wenzelm@62312
   799
* Command '\<proof>' is an alias for 'sorry', with different
wenzelm@62312
   800
typesetting. E.g. to produce proof holes in examples and documentation.
wenzelm@62216
   801
wenzelm@63977
   802
* The defining position of a literal fact \<open>prop\<close> is maintained more
wenzelm@63977
   803
carefully, and made accessible as hyperlink in the Prover IDE.
wenzelm@63977
   804
wenzelm@63977
   805
* Commands 'finally' and 'ultimately' used to expose the result as
wenzelm@63977
   806
literal fact: this accidental behaviour has been discontinued. Rare
wenzelm@63977
   807
INCOMPATIBILITY, use more explicit means to refer to facts in Isar.
wenzelm@63977
   808
wenzelm@63977
   809
* Command 'axiomatization' has become more restrictive to correspond
wenzelm@63977
   810
better to internal axioms as singleton facts with mandatory name. Minor
wenzelm@63977
   811
INCOMPATIBILITY.
wenzelm@62939
   812
wenzelm@63259
   813
* Proof methods may refer to the main facts via the dynamic fact
wenzelm@63259
   814
"method_facts". This is particularly useful for Eisbach method
wenzelm@63259
   815
definitions.
wenzelm@63259
   816
wenzelm@63527
   817
* Proof method "use" allows to modify the main facts of a given method
wenzelm@63527
   818
expression, e.g.
wenzelm@63259
   819
wenzelm@63259
   820
  (use facts in simp)
wenzelm@63259
   821
  (use facts in \<open>simp add: ...\<close>)
wenzelm@63259
   822
wenzelm@63977
   823
* The old proof method "default" has been removed (legacy since
wenzelm@63977
   824
Isabelle2016). INCOMPATIBILITY, use "standard" instead.
wenzelm@63977
   825
wenzelm@62216
   826
haftmann@63165
   827
*** Pure ***
haftmann@63165
   828
wenzelm@63977
   829
* Pure provides basic versions of proof methods "simp" and "simp_all"
wenzelm@63977
   830
that only know about meta-equality (==). Potential INCOMPATIBILITY in
wenzelm@63977
   831
theory imports that merge Pure with e.g. Main of Isabelle/HOL: the order
wenzelm@63977
   832
is relevant to avoid confusion of Pure.simp vs. HOL.simp.
wenzelm@63977
   833
wenzelm@63977
   834
* The command 'unfolding' and proof method "unfold" include a second
wenzelm@63977
   835
stage where given equations are passed through the attribute "abs_def"
wenzelm@63977
   836
before rewriting. This ensures that definitions are fully expanded,
wenzelm@63977
   837
regardless of the actual parameters that are provided. Rare
wenzelm@63977
   838
INCOMPATIBILITY in some corner cases: use proof method (simp only:)
wenzelm@63977
   839
instead, or declare [[unfold_abs_def = false]] in the proof context.
wenzelm@63977
   840
wenzelm@63977
   841
* Type-inference improves sorts of newly introduced type variables for
wenzelm@63977
   842
the object-logic, using its base sort (i.e. HOL.type for Isabelle/HOL).
wenzelm@63977
   843
Thus terms like "f x" or "\<And>x. P x" without any further syntactic context
wenzelm@63977
   844
produce x::'a::type in HOL instead of x::'a::{} in Pure. Rare
wenzelm@63977
   845
INCOMPATIBILITY, need to provide explicit type constraints for Pure
wenzelm@63977
   846
types where this is really intended.
haftmann@63350
   847
haftmann@63165
   848
blanchet@62327
   849
*** HOL ***
blanchet@62327
   850
wenzelm@63977
   851
* New proof method "argo" using the built-in Argo solver based on SMT
wenzelm@63977
   852
technology. The method can be used to prove goals of quantifier-free
wenzelm@63977
   853
propositional logic, goals based on a combination of quantifier-free
wenzelm@63977
   854
propositional logic with equality, and goals based on a combination of
wenzelm@63977
   855
quantifier-free propositional logic with linear real arithmetic
wenzelm@63977
   856
including min/max/abs. See HOL/ex/Argo_Examples.thy for examples.
wenzelm@63977
   857
blanchet@66614
   858
* The new "nunchaku" command integrates the Nunchaku model finder. The
wenzelm@64390
   859
tool is experimental. See ~~/src/HOL/Nunchaku/Nunchaku.thy for details.
wenzelm@64390
   860
wenzelm@63977
   861
* Metis: The problem encoding has changed very slightly. This might
blanchet@63785
   862
break existing proofs. INCOMPATIBILITY.
blanchet@63785
   863
blanchet@63116
   864
* Sledgehammer:
lp15@63967
   865
  - The MaSh relevance filter is now faster than before.
blanchet@63116
   866
  - Produce syntactically correct Vampire 4.0 problem files.
blanchet@63116
   867
blanchet@62327
   868
* (Co)datatype package:
blanchet@62693
   869
  - New commands for defining corecursive functions and reasoning about
blanchet@62693
   870
    them in "~~/src/HOL/Library/BNF_Corec.thy": 'corec', 'corecursive',
blanchet@62693
   871
    'friend_of_corec', and 'corecursion_upto'; and 'corec_unique' proof
blanchet@62842
   872
    method. See 'isabelle doc corec'.
wenzelm@63977
   873
  - The predicator :: ('a \<Rightarrow> bool) \<Rightarrow> 'a F \<Rightarrow> bool is now a first-class
blanchet@63855
   874
    citizen in bounded natural functors.
blanchet@62693
   875
  - 'primrec' now allows nested calls through the predicator in addition
blanchet@62327
   876
    to the map function.
blanchet@63855
   877
  - 'bnf' automatically discharges reflexive proof obligations.
blanchet@62693
   878
  - 'bnf' outputs a slightly modified proof obligation expressing rel in
traytel@62332
   879
       terms of map and set
blanchet@63855
   880
       (not giving a specification for rel makes this one reflexive).
blanchet@62693
   881
  - 'bnf' outputs a new proof obligation expressing pred in terms of set
blanchet@63855
   882
       (not giving a specification for pred makes this one reflexive).
blanchet@63855
   883
    INCOMPATIBILITY: manual 'bnf' declarations may need adjustment.
blanchet@62335
   884
  - Renamed lemmas:
blanchet@62335
   885
      rel_prod_apply ~> rel_prod_inject
blanchet@62335
   886
      pred_prod_apply ~> pred_prod_inject
blanchet@62335
   887
    INCOMPATIBILITY.
blanchet@62536
   888
  - The "size" plugin has been made compatible again with locales.
blanchet@63855
   889
  - The theorems about "rel" and "set" may have a slightly different (but
blanchet@63855
   890
    equivalent) form.
blanchet@63855
   891
    INCOMPATIBILITY.
blanchet@62327
   892
wenzelm@63977
   893
* The 'coinductive' command produces a proper coinduction rule for
wenzelm@63977
   894
mutual coinductive predicates. This new rule replaces the old rule,
wenzelm@63977
   895
which exposed details of the internal fixpoint construction and was
wenzelm@63977
   896
hard to use. INCOMPATIBILITY.
wenzelm@63977
   897
wenzelm@63977
   898
* New abbreviations for negated existence (but not bounded existence):
wenzelm@63977
   899
wenzelm@63977
   900
  \<nexists>x. P x \<equiv> \<not> (\<exists>x. P x)
wenzelm@63977
   901
  \<nexists>!x. P x \<equiv> \<not> (\<exists>!x. P x)
wenzelm@63977
   902
wenzelm@63977
   903
* The print mode "HOL" for ASCII syntax of binders "!", "?", "?!", "@"
wenzelm@63977
   904
has been removed for output. It is retained for input only, until it is
wenzelm@63977
   905
eliminated altogether.
wenzelm@63977
   906
wenzelm@63977
   907
* The unique existence quantifier no longer provides 'binder' syntax,
wenzelm@63977
   908
but uses syntax translations (as for bounded unique existence). Thus
wenzelm@63977
   909
iterated quantification \<exists>!x y. P x y with its slightly confusing
wenzelm@63977
   910
sequential meaning \<exists>!x. \<exists>!y. P x y is no longer possible. Instead,
wenzelm@63977
   911
pattern abstraction admits simultaneous unique existence \<exists>!(x, y). P x y
wenzelm@63977
   912
(analogous to existing notation \<exists>!(x, y)\<in>A. P x y). Potential
wenzelm@63977
   913
INCOMPATIBILITY in rare situations.
wenzelm@63977
   914
wenzelm@63977
   915
* Conventional syntax "%(). t" for unit abstractions. Slight syntactic
wenzelm@63977
   916
INCOMPATIBILITY.
wenzelm@63977
   917
wenzelm@64390
   918
* Renamed constants and corresponding theorems:
wenzelm@64390
   919
wenzelm@64390
   920
    setsum ~> sum
wenzelm@64390
   921
    setprod ~> prod
wenzelm@64390
   922
    listsum ~> sum_list
wenzelm@64390
   923
    listprod ~> prod_list
wenzelm@64390
   924
wenzelm@64390
   925
INCOMPATIBILITY.
wenzelm@64390
   926
wenzelm@64390
   927
* Sligthly more standardized theorem names:
wenzelm@64390
   928
    sgn_times ~> sgn_mult
wenzelm@64390
   929
    sgn_mult' ~> Real_Vector_Spaces.sgn_mult
wenzelm@64390
   930
    divide_zero_left ~> div_0
wenzelm@64390
   931
    zero_mod_left ~> mod_0
wenzelm@64390
   932
    divide_zero ~> div_by_0
wenzelm@64390
   933
    divide_1 ~> div_by_1
wenzelm@64390
   934
    nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left
wenzelm@64390
   935
    div_mult_self1_is_id ~> nonzero_mult_div_cancel_left
wenzelm@64390
   936
    nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right
wenzelm@64390
   937
    div_mult_self2_is_id ~> nonzero_mult_div_cancel_right
wenzelm@64390
   938
    is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left
wenzelm@64390
   939
    is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right
wenzelm@64390
   940
    mod_div_equality ~> div_mult_mod_eq
wenzelm@64390
   941
    mod_div_equality2 ~> mult_div_mod_eq
wenzelm@64390
   942
    mod_div_equality3 ~> mod_div_mult_eq
wenzelm@64390
   943
    mod_div_equality4 ~> mod_mult_div_eq
wenzelm@64390
   944
    minus_div_eq_mod ~> minus_div_mult_eq_mod
wenzelm@64390
   945
    minus_div_eq_mod2 ~> minus_mult_div_eq_mod
wenzelm@64390
   946
    minus_mod_eq_div ~> minus_mod_eq_div_mult
wenzelm@64390
   947
    minus_mod_eq_div2 ~> minus_mod_eq_mult_div
wenzelm@64390
   948
    div_mod_equality' ~> minus_mod_eq_div_mult [symmetric]
wenzelm@64390
   949
    mod_div_equality' ~> minus_div_mult_eq_mod [symmetric]
wenzelm@64390
   950
    zmod_zdiv_equality ~> mult_div_mod_eq [symmetric]
wenzelm@64390
   951
    zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric]
wenzelm@64390
   952
    Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
wenzelm@64390
   953
    mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
wenzelm@64390
   954
    zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
wenzelm@64390
   955
    div_1 ~> div_by_Suc_0
wenzelm@64390
   956
    mod_1 ~> mod_by_Suc_0
wenzelm@64390
   957
INCOMPATIBILITY.
wenzelm@64390
   958
wenzelm@64390
   959
* New type class "idom_abs_sgn" specifies algebraic properties
wenzelm@64390
   960
of sign and absolute value functions.  Type class "sgn_if" has
wenzelm@64390
   961
disappeared.  Slight INCOMPATIBILITY.
wenzelm@64390
   962
wenzelm@64390
   963
* Dedicated syntax LENGTH('a) for length of types.
wenzelm@64390
   964
wenzelm@63977
   965
* Characters (type char) are modelled as finite algebraic type
wenzelm@63977
   966
corresponding to {0..255}.
wenzelm@63977
   967
wenzelm@63977
   968
  - Logical representation:
wenzelm@63977
   969
    * 0 is instantiated to the ASCII zero character.
wenzelm@63977
   970
    * All other characters are represented as "Char n"
wenzelm@63977
   971
      with n being a raw numeral expression less than 256.
wenzelm@63977
   972
    * Expressions of the form "Char n" with n greater than 255
wenzelm@63977
   973
      are non-canonical.
wenzelm@63977
   974
  - Printing and parsing:
wenzelm@63977
   975
    * Printable characters are printed and parsed as "CHR ''\<dots>''"
wenzelm@63977
   976
      (as before).
wenzelm@63977
   977
    * The ASCII zero character is printed and parsed as "0".
wenzelm@63977
   978
    * All other canonical characters are printed as "CHR 0xXX"
wenzelm@63977
   979
      with XX being the hexadecimal character code.  "CHR n"
wenzelm@63977
   980
      is parsable for every numeral expression n.
wenzelm@63977
   981
    * Non-canonical characters have no special syntax and are
wenzelm@63977
   982
      printed as their logical representation.
wenzelm@63977
   983
  - Explicit conversions from and to the natural numbers are
wenzelm@63977
   984
    provided as char_of_nat, nat_of_char (as before).
wenzelm@63977
   985
  - The auxiliary nibble type has been discontinued.
wenzelm@63977
   986
wenzelm@63977
   987
INCOMPATIBILITY.
wenzelm@63977
   988
wenzelm@63977
   989
* Type class "div" with operation "mod" renamed to type class "modulo"
wenzelm@63977
   990
with operation "modulo", analogously to type class "divide". This
wenzelm@63977
   991
eliminates the need to qualify any of those names in the presence of
wenzelm@63977
   992
infix "mod" syntax. INCOMPATIBILITY.
wenzelm@63977
   993
wenzelm@63979
   994
* Statements and proofs of Knaster-Tarski fixpoint combinators lfp/gfp
wenzelm@63979
   995
have been clarified. The fixpoint properties are lfp_fixpoint, its
wenzelm@63979
   996
symmetric lfp_unfold (as before), and the duals for gfp. Auxiliary items
wenzelm@63979
   997
for the proof (lfp_lemma2 etc.) are no longer exported, but can be
wenzelm@63979
   998
easily recovered by composition with eq_refl. Minor INCOMPATIBILITY.
wenzelm@63979
   999
wenzelm@63977
  1000
* Constant "surj" is a mere input abbreviation, to avoid hiding an
wenzelm@63977
  1001
equation in term output. Minor INCOMPATIBILITY.
wenzelm@63977
  1002
wenzelm@63977
  1003
* Command 'code_reflect' accepts empty constructor lists for datatypes,
wenzelm@63977
  1004
which renders those abstract effectively.
wenzelm@63977
  1005
wenzelm@63977
  1006
* Command 'export_code' checks given constants for abstraction
wenzelm@63977
  1007
violations: a small guarantee that given constants specify a safe
wenzelm@63977
  1008
interface for the generated code.
wenzelm@63977
  1009
wenzelm@63977
  1010
* Code generation for Scala: ambiguous implicts in class diagrams are
wenzelm@63977
  1011
spelt out explicitly.
wenzelm@63977
  1012
wenzelm@63977
  1013
* Static evaluators (Code_Evaluation.static_* in Isabelle/ML) rely on
wenzelm@63977
  1014
explicitly provided auxiliary definitions for required type class
wenzelm@64390
  1015
dictionaries rather than half-working magic. INCOMPATIBILITY, see the
wenzelm@64390
  1016
tutorial on code generation for details.
wenzelm@64390
  1017
wenzelm@64390
  1018
* Theory Set_Interval: substantial new theorems on indexed sums and
wenzelm@64390
  1019
products.
wenzelm@63977
  1020
wenzelm@63977
  1021
* Locale bijection establishes convenient default simp rules such as
wenzelm@63977
  1022
"inv f (f a) = a" for total bijections.
wenzelm@63977
  1023
wenzelm@63977
  1024
* Abstract locales semigroup, abel_semigroup, semilattice,
wenzelm@63977
  1025
semilattice_neutr, ordering, ordering_top, semilattice_order,
wenzelm@63977
  1026
semilattice_neutr_order, comm_monoid_set, semilattice_set,
wenzelm@63977
  1027
semilattice_neutr_set, semilattice_order_set,
wenzelm@63977
  1028
semilattice_order_neutr_set monoid_list, comm_monoid_list,
wenzelm@63977
  1029
comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified
wenzelm@63977
  1030
syntax uniformly that does not clash with corresponding global syntax.
wenzelm@63977
  1031
INCOMPATIBILITY.
wenzelm@63977
  1032
wenzelm@63977
  1033
* Former locale lifting_syntax is now a bundle, which is easier to
wenzelm@63977
  1034
include in a local context or theorem statement, e.g. "context includes
wenzelm@63977
  1035
lifting_syntax begin ... end". Minor INCOMPATIBILITY.
wenzelm@63977
  1036
wenzelm@63807
  1037
* Some old / obsolete theorems have been renamed / removed, potential
wenzelm@63807
  1038
INCOMPATIBILITY.
wenzelm@63807
  1039
wenzelm@63807
  1040
  nat_less_cases  --  removed, use linorder_cases instead
wenzelm@63807
  1041
  inv_image_comp  --  removed, use image_inv_f_f instead
wenzelm@63807
  1042
  image_surj_f_inv_f  ~>  image_f_inv_f
wenzelm@63113
  1043
Mathias@63456
  1044
* Some theorems about groups and orders have been generalised from
Mathias@63456
  1045
  groups to semi-groups that are also monoids:
Mathias@63456
  1046
    le_add_same_cancel1
Mathias@63456
  1047
    le_add_same_cancel2
Mathias@63456
  1048
    less_add_same_cancel1
Mathias@63456
  1049
    less_add_same_cancel2
Mathias@63456
  1050
    add_le_same_cancel1
Mathias@63456
  1051
    add_le_same_cancel2
Mathias@63456
  1052
    add_less_same_cancel1
Mathias@63456
  1053
    add_less_same_cancel2
Mathias@63456
  1054
Mathias@63456
  1055
* Some simplifications theorems about rings have been removed, since
Mathias@63456
  1056
  superseeded by a more general version:
Mathias@63456
  1057
    less_add_cancel_left_greater_zero ~> less_add_same_cancel1
Mathias@63456
  1058
    less_add_cancel_right_greater_zero ~> less_add_same_cancel2
Mathias@63456
  1059
    less_eq_add_cancel_left_greater_eq_zero ~> le_add_same_cancel1
Mathias@63456
  1060
    less_eq_add_cancel_right_greater_eq_zero ~> le_add_same_cancel2
Mathias@63456
  1061
    less_eq_add_cancel_left_less_eq_zero ~> add_le_same_cancel1
Mathias@63456
  1062
    less_eq_add_cancel_right_less_eq_zero ~> add_le_same_cancel2
Mathias@63456
  1063
    less_add_cancel_left_less_zero ~> add_less_same_cancel1
Mathias@63456
  1064
    less_add_cancel_right_less_zero ~> add_less_same_cancel2
Mathias@63456
  1065
INCOMPATIBILITY.
Mathias@63456
  1066
wenzelm@62407
  1067
* Renamed split_if -> if_split and split_if_asm -> if_split_asm to
wenzelm@62407
  1068
resemble the f.split naming convention, INCOMPATIBILITY.
nipkow@62396
  1069
wenzelm@63977
  1070
* Added class topological_monoid.
wenzelm@63977
  1071
wenzelm@64391
  1072
* The following theorems have been renamed:
wenzelm@64391
  1073
nipkow@64457
  1074
  setsum_left_distrib ~> sum_distrib_right
nipkow@64457
  1075
  setsum_right_distrib ~> sum_distrib_left
wenzelm@64391
  1076
wenzelm@64391
  1077
INCOMPATIBILITY.
wenzelm@64391
  1078
wenzelm@64391
  1079
* Compound constants INFIMUM and SUPREMUM are mere abbreviations now.
wenzelm@64391
  1080
INCOMPATIBILITY.
wenzelm@64391
  1081
wenzelm@64391
  1082
* "Gcd (f ` A)" and "Lcm (f ` A)" are printed with optional
wenzelm@64391
  1083
comprehension-like syntax analogously to "Inf (f ` A)" and "Sup (f `
wenzelm@64391
  1084
A)".
wenzelm@64391
  1085
wenzelm@64391
  1086
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY.
wenzelm@64391
  1087
wenzelm@64391
  1088
* The type class ordered_comm_monoid_add is now called
wenzelm@64391
  1089
ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add
wenzelm@64391
  1090
is introduced as the combination of ordered_ab_semigroup_add +
wenzelm@64391
  1091
comm_monoid_add. INCOMPATIBILITY.
wenzelm@64391
  1092
wenzelm@64391
  1093
* Introduced the type classes canonically_ordered_comm_monoid_add and
wenzelm@64391
  1094
dioid.
wenzelm@64391
  1095
wenzelm@64391
  1096
* Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When
wenzelm@64391
  1097
instantiating linordered_semiring_strict and ordered_ab_group_add, an
wenzelm@64391
  1098
explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might
wenzelm@64391
  1099
be required. INCOMPATIBILITY.
nipkow@63117
  1100
haftmann@62348
  1101
* Dropped various legacy fact bindings, whose replacements are often
haftmann@62348
  1102
of a more general type also:
haftmann@62348
  1103
  lcm_left_commute_nat ~> lcm.left_commute
haftmann@62348
  1104
  lcm_left_commute_int ~> lcm.left_commute
haftmann@62348
  1105
  gcd_left_commute_nat ~> gcd.left_commute
haftmann@62348
  1106
  gcd_left_commute_int ~> gcd.left_commute
haftmann@62348
  1107
  gcd_greatest_iff_nat ~> gcd_greatest_iff
haftmann@62348
  1108
  gcd_greatest_iff_int ~> gcd_greatest_iff
haftmann@62348
  1109
  coprime_dvd_mult_nat ~> coprime_dvd_mult
haftmann@62348
  1110
  coprime_dvd_mult_int ~> coprime_dvd_mult
haftmann@62348
  1111
  zpower_numeral_even ~> power_numeral_even
haftmann@62348
  1112
  gcd_mult_cancel_nat ~> gcd_mult_cancel
haftmann@62348
  1113
  gcd_mult_cancel_int ~> gcd_mult_cancel
haftmann@62348
  1114
  div_gcd_coprime_nat ~> div_gcd_coprime
haftmann@62348
  1115
  div_gcd_coprime_int ~> div_gcd_coprime
haftmann@62348
  1116
  zpower_numeral_odd ~> power_numeral_odd
haftmann@62348
  1117
  zero_less_int_conv ~> of_nat_0_less_iff
haftmann@62348
  1118
  gcd_greatest_nat ~> gcd_greatest
haftmann@62348
  1119
  gcd_greatest_int ~> gcd_greatest
haftmann@62348
  1120
  coprime_mult_nat ~> coprime_mult
haftmann@62348
  1121
  coprime_mult_int ~> coprime_mult
haftmann@62348
  1122
  lcm_commute_nat ~> lcm.commute
haftmann@62348
  1123
  lcm_commute_int ~> lcm.commute
haftmann@62348
  1124
  int_less_0_conv ~> of_nat_less_0_iff
haftmann@62348
  1125
  gcd_commute_nat ~> gcd.commute
haftmann@62348
  1126
  gcd_commute_int ~> gcd.commute
haftmann@62348
  1127
  Gcd_insert_nat ~> Gcd_insert
haftmann@62348
  1128
  Gcd_insert_int ~> Gcd_insert
haftmann@62348
  1129
  of_int_int_eq ~> of_int_of_nat_eq
haftmann@62348
  1130
  lcm_least_nat ~> lcm_least
haftmann@62348
  1131
  lcm_least_int ~> lcm_least
haftmann@62348
  1132
  lcm_assoc_nat ~> lcm.assoc
haftmann@62348
  1133
  lcm_assoc_int ~> lcm.assoc
haftmann@62348
  1134
  int_le_0_conv ~> of_nat_le_0_iff
haftmann@62348
  1135
  int_eq_0_conv ~> of_nat_eq_0_iff
haftmann@62348
  1136
  Gcd_empty_nat ~> Gcd_empty
haftmann@62348
  1137
  Gcd_empty_int ~> Gcd_empty
haftmann@62348
  1138
  gcd_assoc_nat ~> gcd.assoc
haftmann@62348
  1139
  gcd_assoc_int ~> gcd.assoc
haftmann@62348
  1140
  zero_zle_int ~> of_nat_0_le_iff
haftmann@62348
  1141
  lcm_dvd2_nat ~> dvd_lcm2
haftmann@62348
  1142
  lcm_dvd2_int ~> dvd_lcm2
haftmann@62348
  1143
  lcm_dvd1_nat ~> dvd_lcm1
haftmann@62348
  1144
  lcm_dvd1_int ~> dvd_lcm1
haftmann@62348
  1145
  gcd_zero_nat ~> gcd_eq_0_iff
haftmann@62348
  1146
  gcd_zero_int ~> gcd_eq_0_iff
haftmann@62348
  1147
  gcd_dvd2_nat ~> gcd_dvd2
haftmann@62348
  1148
  gcd_dvd2_int ~> gcd_dvd2
haftmann@62348
  1149
  gcd_dvd1_nat ~> gcd_dvd1
haftmann@62348
  1150
  gcd_dvd1_int ~> gcd_dvd1
haftmann@62348
  1151
  int_numeral ~> of_nat_numeral
haftmann@62348
  1152
  lcm_ac_nat ~> ac_simps
haftmann@62348
  1153
  lcm_ac_int ~> ac_simps
haftmann@62348
  1154
  gcd_ac_nat ~> ac_simps
haftmann@62348
  1155
  gcd_ac_int ~> ac_simps
haftmann@62348
  1156
  abs_int_eq ~> abs_of_nat
haftmann@62348
  1157
  zless_int ~> of_nat_less_iff
haftmann@62348
  1158
  zdiff_int ~> of_nat_diff
haftmann@62348
  1159
  zadd_int ~> of_nat_add
haftmann@62348
  1160
  int_mult ~> of_nat_mult
haftmann@62348
  1161
  int_Suc ~> of_nat_Suc
haftmann@62348
  1162
  inj_int ~> inj_of_nat
haftmann@62348
  1163
  int_1 ~> of_nat_1
haftmann@62348
  1164
  int_0 ~> of_nat_0
haftmann@62353
  1165
  Lcm_empty_nat ~> Lcm_empty
haftmann@62353
  1166
  Lcm_empty_int ~> Lcm_empty
haftmann@62353
  1167
  Lcm_insert_nat ~> Lcm_insert
haftmann@62353
  1168
  Lcm_insert_int ~> Lcm_insert
haftmann@62353
  1169
  comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd
haftmann@62353
  1170
  comp_fun_idem_gcd_int ~> comp_fun_idem_gcd
haftmann@62353
  1171
  comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm
haftmann@62353
  1172
  comp_fun_idem_lcm_int ~> comp_fun_idem_lcm
haftmann@62353
  1173
  Lcm_eq_0 ~> Lcm_eq_0_I
haftmann@62353
  1174
  Lcm0_iff ~> Lcm_0_iff
haftmann@62353
  1175
  Lcm_dvd_int ~> Lcm_least
haftmann@62353
  1176
  divides_mult_nat ~> divides_mult
haftmann@62353
  1177
  divides_mult_int ~> divides_mult
haftmann@62353
  1178
  lcm_0_nat ~> lcm_0_right
haftmann@62353
  1179
  lcm_0_int ~> lcm_0_right
haftmann@62353
  1180
  lcm_0_left_nat ~> lcm_0_left
haftmann@62353
  1181
  lcm_0_left_int ~> lcm_0_left
haftmann@62353
  1182
  dvd_gcd_D1_nat ~> dvd_gcdD1
haftmann@62353
  1183
  dvd_gcd_D1_int ~> dvd_gcdD1
haftmann@62353
  1184
  dvd_gcd_D2_nat ~> dvd_gcdD2
haftmann@62353
  1185
  dvd_gcd_D2_int ~> dvd_gcdD2
haftmann@62353
  1186
  coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff
haftmann@62353
  1187
  coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff
haftmann@62348
  1188
  realpow_minus_mult ~> power_minus_mult
haftmann@62348
  1189
  realpow_Suc_le_self ~> power_Suc_le_self
haftmann@62353
  1190
  dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest
haftmann@62347
  1191
INCOMPATIBILITY.
haftmann@62347
  1192
lp15@63967
  1193
* Renamed HOL/Quotient_Examples/FSet.thy to
wenzelm@63977
  1194
HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY.
wenzelm@63977
  1195
wenzelm@64390
  1196
* Session HOL-Library: theory FinFun bundles "finfun_syntax" and
wenzelm@64390
  1197
"no_finfun_syntax" allow to control optional syntax in local contexts;
wenzelm@64390
  1198
this supersedes former theory FinFun_Syntax. INCOMPATIBILITY, e.g. use
wenzelm@64390
  1199
"unbundle finfun_syntax" to imitate import of
wenzelm@64390
  1200
"~~/src/HOL/Library/FinFun_Syntax".
wenzelm@64390
  1201
wenzelm@64390
  1202
* Session HOL-Library: theory Multiset_Permutations (executably) defines
wenzelm@64390
  1203
the set of permutations of a given set or multiset, i.e. the set of all
wenzelm@64390
  1204
lists that contain every element of the carrier (multi-)set exactly
wenzelm@64390
  1205
once.
wenzelm@64390
  1206
wenzelm@64390
  1207
* Session HOL-Library: multiset membership is now expressed using
wenzelm@64390
  1208
set_mset rather than count.
wenzelm@64390
  1209
wenzelm@64390
  1210
  - Expressions "count M a > 0" and similar simplify to membership
wenzelm@64390
  1211
    by default.
wenzelm@64390
  1212
wenzelm@64390
  1213
  - Converting between "count M a = 0" and non-membership happens using
wenzelm@64390
  1214
    equations count_eq_zero_iff and not_in_iff.
wenzelm@64390
  1215
wenzelm@64390
  1216
  - Rules count_inI and in_countE obtain facts of the form
wenzelm@64390
  1217
    "count M a = n" from membership.
wenzelm@64390
  1218
wenzelm@64390
  1219
  - Rules count_in_diffI and in_diff_countE obtain facts of the form
wenzelm@64390
  1220
    "count M a = n + count N a" from membership on difference sets.
wenzelm@64390
  1221
wenzelm@64390
  1222
INCOMPATIBILITY.
wenzelm@64390
  1223
wenzelm@64390
  1224
* Session HOL-Library: theory LaTeXsugar uses new-style "dummy_pats" for
wenzelm@64390
  1225
displaying equations in functional programming style --- variables
wenzelm@64390
  1226
present on the left-hand but not on the righ-hand side are replaced by
wenzelm@64390
  1227
underscores.
wenzelm@64390
  1228
wenzelm@64390
  1229
* Session HOL-Library: theory Combinator_PER provides combinator to
wenzelm@64390
  1230
build partial equivalence relations from a predicate and an equivalence
wenzelm@64390
  1231
relation.
wenzelm@64390
  1232
wenzelm@64390
  1233
* Session HOL-Library: theory Perm provides basic facts about almost
wenzelm@64390
  1234
everywhere fix bijections.
wenzelm@64390
  1235
wenzelm@64390
  1236
* Session HOL-Library: theory Normalized_Fraction allows viewing an
wenzelm@64390
  1237
element of a field of fractions as a normalized fraction (i.e. a pair of
wenzelm@64390
  1238
numerator and denominator such that the two are coprime and the
wenzelm@64390
  1239
denominator is normalized wrt. unit factors).
wenzelm@64390
  1240
wenzelm@64390
  1241
* Session HOL-NSA has been renamed to HOL-Nonstandard_Analysis.
wenzelm@64390
  1242
wenzelm@64390
  1243
* Session HOL-Multivariate_Analysis has been renamed to HOL-Analysis.
wenzelm@64390
  1244
wenzelm@64390
  1245
* Session HOL-Analysis: measure theory has been moved here from
wenzelm@64390
  1246
HOL-Probability. When importing HOL-Analysis some theorems need
wenzelm@64390
  1247
additional name spaces prefixes due to name clashes. INCOMPATIBILITY.
wenzelm@64390
  1248
wenzelm@64390
  1249
* Session HOL-Analysis: more complex analysis including Cauchy's
wenzelm@64390
  1250
inequality, Liouville theorem, open mapping theorem, maximum modulus
wenzelm@64390
  1251
principle, Residue theorem, Schwarz Lemma.
wenzelm@64390
  1252
wenzelm@64390
  1253
* Session HOL-Analysis: Theory of polyhedra: faces, extreme points,
wenzelm@64390
  1254
polytopes, and the Krein–Milman Minkowski theorem.
wenzelm@64390
  1255
wenzelm@64390
  1256
* Session HOL-Analysis: Numerous results ported from the HOL Light
wenzelm@64390
  1257
libraries: homeomorphisms, continuous function extensions, invariance of
wenzelm@64390
  1258
domain.
wenzelm@64390
  1259
wenzelm@64390
  1260
* Session HOL-Probability: the type of emeasure and nn_integral was
wenzelm@64390
  1261
changed from ereal to ennreal, INCOMPATIBILITY.
wenzelm@64390
  1262
wenzelm@64390
  1263
  emeasure :: 'a measure \<Rightarrow> 'a set \<Rightarrow> ennreal
wenzelm@64390
  1264
  nn_integral :: 'a measure \<Rightarrow> ('a \<Rightarrow> ennreal) \<Rightarrow> ennreal
wenzelm@64390
  1265
wenzelm@64390
  1266
* Session HOL-Probability: Code generation and QuickCheck for
wenzelm@64390
  1267
Probability Mass Functions.
wenzelm@64390
  1268
wenzelm@64390
  1269
* Session HOL-Probability: theory Random_Permutations contains some
wenzelm@64390
  1270
theory about choosing a permutation of a set uniformly at random and
wenzelm@64390
  1271
folding over a list in random order.
wenzelm@64390
  1272
wenzelm@64390
  1273
* Session HOL-Probability: theory SPMF formalises discrete
wenzelm@64390
  1274
subprobability distributions.
wenzelm@64390
  1275
wenzelm@64390
  1276
* Session HOL-Library: the names of multiset theorems have been
wenzelm@64390
  1277
normalised to distinguish which ordering the theorems are about
wenzelm@64390
  1278
wenzelm@64390
  1279
    mset_less_eqI ~> mset_subset_eqI
wenzelm@64390
  1280
    mset_less_insertD ~> mset_subset_insertD
wenzelm@64390
  1281
    mset_less_eq_count ~> mset_subset_eq_count
wenzelm@64390
  1282
    mset_less_diff_self ~> mset_subset_diff_self
wenzelm@64390
  1283
    mset_le_exists_conv ~> mset_subset_eq_exists_conv
wenzelm@64390
  1284
    mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel
wenzelm@64390
  1285
    mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel
wenzelm@64390
  1286
    mset_le_mono_add ~> mset_subset_eq_mono_add
wenzelm@64390
  1287
    mset_le_add_left ~> mset_subset_eq_add_left
wenzelm@64390
  1288
    mset_le_add_right ~> mset_subset_eq_add_right
wenzelm@64390
  1289
    mset_le_single ~> mset_subset_eq_single
wenzelm@64390
  1290
    mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute
wenzelm@64390
  1291
    diff_le_self ~> diff_subset_eq_self
wenzelm@64390
  1292
    mset_leD ~> mset_subset_eqD
wenzelm@64390
  1293
    mset_lessD ~> mset_subsetD
wenzelm@64390
  1294
    mset_le_insertD ~> mset_subset_eq_insertD
wenzelm@64390
  1295
    mset_less_of_empty ~> mset_subset_of_empty
wenzelm@64390
  1296
    mset_less_size ~> mset_subset_size
wenzelm@64390
  1297
    wf_less_mset_rel ~> wf_subset_mset_rel
wenzelm@64390
  1298
    count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq
wenzelm@64390
  1299
    mset_remdups_le ~> mset_remdups_subset_eq
wenzelm@64390
  1300
    ms_lesseq_impl ~> subset_eq_mset_impl
wenzelm@64390
  1301
wenzelm@64390
  1302
Some functions have been renamed:
wenzelm@64390
  1303
    ms_lesseq_impl -> subset_eq_mset_impl
wenzelm@64390
  1304
wenzelm@64390
  1305
* HOL-Library: multisets are now ordered with the multiset ordering
wenzelm@64390
  1306
    #\<subseteq># ~> \<le>
wenzelm@64390
  1307
    #\<subset># ~> <
wenzelm@64390
  1308
    le_multiset ~> less_eq_multiset
wenzelm@64390
  1309
    less_multiset ~> le_multiset
wenzelm@64390
  1310
INCOMPATIBILITY.
wenzelm@64390
  1311
wenzelm@64390
  1312
* Session HOL-Library: the prefix multiset_order has been discontinued:
wenzelm@64390
  1313
the theorems can be directly accessed. As a consequence, the lemmas
wenzelm@64390
  1314
"order_multiset" and "linorder_multiset" have been discontinued, and the
wenzelm@64390
  1315
interpretations "multiset_linorder" and "multiset_wellorder" have been
wenzelm@64390
  1316
replaced by instantiations. INCOMPATIBILITY.
wenzelm@64390
  1317
wenzelm@64390
  1318
* Session HOL-Library: some theorems about the multiset ordering have
wenzelm@64390
  1319
been renamed:
wenzelm@64390
  1320
wenzelm@64390
  1321
    le_multiset_def ~> less_eq_multiset_def
wenzelm@64390
  1322
    less_multiset_def ~> le_multiset_def
wenzelm@64390
  1323
    less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset
wenzelm@64390
  1324
    mult_less_not_refl ~> mset_le_not_refl
wenzelm@64390
  1325
    mult_less_trans ~> mset_le_trans
wenzelm@64390
  1326
    mult_less_not_sym ~> mset_le_not_sym
wenzelm@64390
  1327
    mult_less_asym ~> mset_le_asym
wenzelm@64390
  1328
    mult_less_irrefl ~> mset_le_irrefl
wenzelm@64390
  1329
    union_less_mono2{,1,2} ~> union_le_mono2{,1,2}
wenzelm@64390
  1330
wenzelm@64390
  1331
    le_multiset\<^sub>H\<^sub>O ~> less_eq_multiset\<^sub>H\<^sub>O
wenzelm@64390
  1332
    le_multiset_total ~> less_eq_multiset_total
wenzelm@64390
  1333
    less_multiset_right_total ~> subset_eq_imp_le_multiset
wenzelm@64390
  1334
    le_multiset_empty_left ~> less_eq_multiset_empty_left
wenzelm@64390
  1335
    le_multiset_empty_right ~> less_eq_multiset_empty_right
wenzelm@64390
  1336
    less_multiset_empty_right ~> le_multiset_empty_left
wenzelm@64390
  1337
    less_multiset_empty_left ~> le_multiset_empty_right
wenzelm@64390
  1338
    union_less_diff_plus ~> union_le_diff_plus
wenzelm@64390
  1339
    ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset
wenzelm@64390
  1340
    less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty
wenzelm@64390
  1341
    le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty
wenzelm@64390
  1342
INCOMPATIBILITY.
wenzelm@64390
  1343
wenzelm@64390
  1344
* Session HOL-Library: the lemma mset_map has now the attribute [simp].
wenzelm@64390
  1345
INCOMPATIBILITY.
wenzelm@64390
  1346
wenzelm@64390
  1347
* Session HOL-Library: some theorems about multisets have been removed.
wenzelm@64390
  1348
INCOMPATIBILITY, use the following replacements:
wenzelm@64390
  1349
wenzelm@64390
  1350
    le_multiset_plus_plus_left_iff ~> add_less_cancel_right
wenzelm@64390
  1351
    less_multiset_plus_plus_left_iff ~> add_less_cancel_right
wenzelm@64390
  1352
    le_multiset_plus_plus_right_iff ~> add_less_cancel_left
wenzelm@64390
  1353
    less_multiset_plus_plus_right_iff ~> add_less_cancel_left
wenzelm@64390
  1354
    add_eq_self_empty_iff ~> add_cancel_left_right
wenzelm@64390
  1355
    mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right
wenzelm@64390
  1356
    mset_less_add_bothsides ~> subset_mset.add_less_cancel_right
wenzelm@64390
  1357
    mset_le_add_bothsides ~> subset_mset.add_less_cancel_right
wenzelm@64390
  1358
    empty_inter ~> subset_mset.inf_bot_left
wenzelm@64390
  1359
    inter_empty ~> subset_mset.inf_bot_right
wenzelm@64390
  1360
    empty_sup ~> subset_mset.sup_bot_left
wenzelm@64390
  1361
    sup_empty ~> subset_mset.sup_bot_right
wenzelm@64390
  1362
    bdd_below_multiset ~> subset_mset.bdd_above_bot
wenzelm@64390
  1363
    subset_eq_empty ~> subset_mset.le_zero_eq
wenzelm@64390
  1364
    le_empty ~> subset_mset.le_zero_eq
wenzelm@64390
  1365
    mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero
wenzelm@64390
  1366
    mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero
wenzelm@64390
  1367
wenzelm@64390
  1368
* Session HOL-Library: some typeclass constraints about multisets have
wenzelm@64390
  1369
been reduced from ordered or linordered to preorder. Multisets have the
wenzelm@64390
  1370
additional typeclasses order_bot, no_top,
wenzelm@64390
  1371
ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add,
wenzelm@64390
  1372
linordered_cancel_ab_semigroup_add, and
wenzelm@64390
  1373
ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY.
wenzelm@64390
  1374
wenzelm@64390
  1375
* Session HOL-Library: there are some new simplification rules about
wenzelm@64390
  1376
multisets, the multiset ordering, and the subset ordering on multisets.
wenzelm@64390
  1377
INCOMPATIBILITY.
wenzelm@64390
  1378
wenzelm@64390
  1379
* Session HOL-Library: the subset ordering on multisets has now the
wenzelm@64390
  1380
interpretations ordered_ab_semigroup_monoid_add_imp_le and
wenzelm@64390
  1381
bounded_lattice_bot. INCOMPATIBILITY.
wenzelm@64390
  1382
wenzelm@64390
  1383
* Session HOL-Library, theory Multiset: single has been removed in favor
wenzelm@64390
  1384
of add_mset that roughly corresponds to Set.insert. Some theorems have
wenzelm@64390
  1385
removed or changed:
wenzelm@64390
  1386
wenzelm@64390
  1387
  single_not_empty ~> add_mset_not_empty or empty_not_add_mset
wenzelm@64390
  1388
  fold_mset_insert ~> fold_mset_add_mset
wenzelm@64390
  1389
  image_mset_insert ~> image_mset_add_mset
wenzelm@64390
  1390
  union_single_eq_diff
wenzelm@64390
  1391
  multi_self_add_other_not_self
wenzelm@64390
  1392
  diff_single_eq_union
wenzelm@64390
  1393
INCOMPATIBILITY.
wenzelm@64390
  1394
wenzelm@64390
  1395
* Session HOL-Library, theory Multiset: some theorems have been changed
wenzelm@64390
  1396
to use add_mset instead of single:
wenzelm@64390
  1397
wenzelm@64390
  1398
  mset_add
wenzelm@64390
  1399
  multi_self_add_other_not_self
wenzelm@64390
  1400
  diff_single_eq_union
wenzelm@64390
  1401
  union_single_eq_diff
wenzelm@64390
  1402
  union_single_eq_member
wenzelm@64390
  1403
  add_eq_conv_diff
wenzelm@64390
  1404
  insert_noteq_member
wenzelm@64390
  1405
  add_eq_conv_ex
wenzelm@64390
  1406
  multi_member_split
wenzelm@64390
  1407
  multiset_add_sub_el_shuffle
wenzelm@64390
  1408
  mset_subset_eq_insertD
wenzelm@64390
  1409
  mset_subset_insertD
wenzelm@64390
  1410
  insert_subset_eq_iff
wenzelm@64390
  1411
  insert_union_subset_iff
wenzelm@64390
  1412
  multi_psub_of_add_self
wenzelm@64390
  1413
  inter_add_left1
wenzelm@64390
  1414
  inter_add_left2
wenzelm@64390
  1415
  inter_add_right1
wenzelm@64390
  1416
  inter_add_right2
wenzelm@64390
  1417
  sup_union_left1
wenzelm@64390
  1418
  sup_union_left2
wenzelm@64390
  1419
  sup_union_right1
wenzelm@64390
  1420
  sup_union_right2
wenzelm@64390
  1421
  size_eq_Suc_imp_eq_union
wenzelm@64390
  1422
  multi_nonempty_split
wenzelm@64390
  1423
  mset_insort
wenzelm@64390
  1424
  mset_update
wenzelm@64390
  1425
  mult1I
wenzelm@64390
  1426
  less_add
wenzelm@64390
  1427
  mset_zip_take_Cons_drop_twice
wenzelm@64390
  1428
  rel_mset_Zero
wenzelm@64390
  1429
  msed_map_invL
wenzelm@64390
  1430
  msed_map_invR
wenzelm@64390
  1431
  msed_rel_invL
wenzelm@64390
  1432
  msed_rel_invR
wenzelm@64390
  1433
  le_multiset_right_total
wenzelm@64390
  1434
  multiset_induct
wenzelm@64390
  1435
  multiset_induct2_size
wenzelm@64390
  1436
  multiset_induct2
wenzelm@64390
  1437
INCOMPATIBILITY.
wenzelm@64390
  1438
wenzelm@64390
  1439
* Session HOL-Library, theory Multiset: the definitions of some
wenzelm@64390
  1440
constants have changed to use add_mset instead of adding a single
wenzelm@64390
  1441
element:
wenzelm@64390
  1442
wenzelm@64390
  1443
  image_mset
wenzelm@64390
  1444
  mset
wenzelm@64390
  1445
  replicate_mset
wenzelm@64390
  1446
  mult1
wenzelm@64390
  1447
  pred_mset
wenzelm@64390
  1448
  rel_mset'
wenzelm@64390
  1449
  mset_insort
wenzelm@64390
  1450
wenzelm@64390
  1451
INCOMPATIBILITY.
wenzelm@64390
  1452
wenzelm@64390
  1453
* Session HOL-Library, theory Multiset: due to the above changes, the
wenzelm@64390
  1454
attributes of some multiset theorems have been changed:
wenzelm@64390
  1455
wenzelm@64390
  1456
  insert_DiffM  [] ~> [simp]
wenzelm@64390
  1457
  insert_DiffM2 [simp] ~> []
wenzelm@64390
  1458
  diff_add_mset_swap [simp]
wenzelm@64390
  1459
  fold_mset_add_mset [simp]
wenzelm@64390
  1460
  diff_diff_add [simp] (for multisets only)
wenzelm@64390
  1461
  diff_cancel [simp] ~> []
wenzelm@64390
  1462
  count_single [simp] ~> []
wenzelm@64390
  1463
  set_mset_single [simp] ~> []
wenzelm@64390
  1464
  size_multiset_single [simp] ~> []
wenzelm@64390
  1465
  size_single [simp] ~> []
wenzelm@64390
  1466
  image_mset_single [simp] ~> []
wenzelm@64390
  1467
  mset_subset_eq_mono_add_right_cancel [simp] ~> []
wenzelm@64390
  1468
  mset_subset_eq_mono_add_left_cancel [simp] ~> []
wenzelm@64390
  1469
  fold_mset_single [simp] ~> []
wenzelm@64390
  1470
  subset_eq_empty [simp] ~> []
wenzelm@64390
  1471
  empty_sup [simp] ~> []
wenzelm@64390
  1472
  sup_empty [simp] ~> []
wenzelm@64390
  1473
  inter_empty [simp] ~> []
wenzelm@64390
  1474
  empty_inter [simp] ~> []
wenzelm@64390
  1475
INCOMPATIBILITY.
wenzelm@64390
  1476
wenzelm@64391
  1477
* Session HOL-Library, theory Multiset: the order of the variables in
wenzelm@64390
  1478
the second cases of multiset_induct, multiset_induct2_size,
wenzelm@64390
  1479
multiset_induct2 has been changed (e.g. Add A a ~> Add a A).
wenzelm@64390
  1480
INCOMPATIBILITY.
wenzelm@64390
  1481
wenzelm@64390
  1482
* Session HOL-Library, theory Multiset: there is now a simplification
wenzelm@64390
  1483
procedure on multisets. It mimics the behavior of the procedure on
wenzelm@64390
  1484
natural numbers. INCOMPATIBILITY.
wenzelm@64390
  1485
wenzelm@64390
  1486
* Session HOL-Library, theory Multiset: renamed sums and products of
wenzelm@64390
  1487
multisets:
wenzelm@64390
  1488
wenzelm@64390
  1489
  msetsum ~> sum_mset
wenzelm@64390
  1490
  msetprod ~> prod_mset
wenzelm@64390
  1491
wenzelm@64390
  1492
* Session HOL-Library, theory Multiset: the notation for intersection
wenzelm@64390
  1493
and union of multisets have been changed:
wenzelm@64390
  1494
wenzelm@64390
  1495
  #\<inter> ~> \<inter>#
wenzelm@64390
  1496
  #\<union> ~> \<union>#
wenzelm@64390
  1497
wenzelm@64390
  1498
INCOMPATIBILITY.
wenzelm@64390
  1499
wenzelm@64390
  1500
* Session HOL-Library, theory Multiset: the lemma
wenzelm@64390
  1501
one_step_implies_mult_aux on multisets has been removed, use
wenzelm@64390
  1502
one_step_implies_mult instead. INCOMPATIBILITY.
wenzelm@64390
  1503
wenzelm@64390
  1504
* Session HOL-Library: theory Complete_Partial_Order2 provides reasoning
wenzelm@64390
  1505
support for monotonicity and continuity in chain-complete partial orders
wenzelm@64390
  1506
and about admissibility conditions for fixpoint inductions.
wenzelm@64390
  1507
haftmann@64523
  1508
* Session HOL-Library: theory Library/Polynomial contains also
haftmann@64523
  1509
derivation of polynomials (formerly in Library/Poly_Deriv) but not
haftmann@64523
  1510
gcd/lcm on polynomials over fields. This has been moved to a separate
haftmann@64523
  1511
theory Library/Polynomial_GCD_euclidean.thy, to pave way for a possible
haftmann@64523
  1512
future different type class instantiation for polynomials over factorial
haftmann@64523
  1513
rings. INCOMPATIBILITY.
wenzelm@64390
  1514
wenzelm@64390
  1515
* Session HOL-Library: theory Sublist provides function "prefixes" with
wenzelm@64390
  1516
the following renaming
wenzelm@64390
  1517
wenzelm@64390
  1518
  prefixeq -> prefix
wenzelm@64390
  1519
  prefix -> strict_prefix
wenzelm@64390
  1520
  suffixeq -> suffix
wenzelm@64390
  1521
  suffix -> strict_suffix
wenzelm@64390
  1522
wenzelm@64390
  1523
Added theory of longest common prefixes.
blanchet@64389
  1524
wenzelm@64391
  1525
* Session HOL-Number_Theory: algebraic foundation for primes:
wenzelm@64391
  1526
Generalisation of predicate "prime" and introduction of predicates
wenzelm@64391
  1527
"prime_elem", "irreducible", a "prime_factorization" function, and the
wenzelm@64391
  1528
"factorial_ring" typeclass with instance proofs for nat, int, poly. Some
wenzelm@64391
  1529
theorems now have different names, most notably "prime_def" is now
wenzelm@64391
  1530
"prime_nat_iff". INCOMPATIBILITY.
wenzelm@64391
  1531
wenzelm@64391
  1532
* Session Old_Number_Theory has been removed, after porting remaining
wenzelm@64391
  1533
theories.
wenzelm@64391
  1534
wenzelm@64551
  1535
* Session HOL-Types_To_Sets provides an experimental extension of
wenzelm@64551
  1536
Higher-Order Logic to allow translation of types to sets.
wenzelm@64551
  1537
wenzelm@63198
  1538
wenzelm@62498
  1539
*** ML ***
wenzelm@62498
  1540
wenzelm@63227
  1541
* Integer.gcd and Integer.lcm use efficient operations from the Poly/ML
wenzelm@63228
  1542
library (notably for big integers). Subtle change of semantics:
wenzelm@63228
  1543
Integer.gcd and Integer.lcm both normalize the sign, results are never
wenzelm@63228
  1544
negative. This coincides with the definitions in HOL/GCD.thy.
wenzelm@63228
  1545
INCOMPATIBILITY.
wenzelm@63227
  1546
wenzelm@63212
  1547
* Structure Rat for rational numbers is now an integral part of
wenzelm@63215
  1548
Isabelle/ML, with special notation @int/nat or @int for numerals (an
wenzelm@63215
  1549
abbreviation for antiquotation @{Pure.rat argument}) and ML pretty
wenzelm@63212
  1550
printing. Standard operations on type Rat.rat are provided via ad-hoc
wenzelm@63215
  1551
overloading of + - * / < <= > >= ~ abs. INCOMPATIBILITY, need to
wenzelm@63212
  1552
use + instead of +/ etc. Moreover, exception Rat.DIVZERO has been
wenzelm@63212
  1553
superseded by General.Div.
wenzelm@63198
  1554
wenzelm@64390
  1555
* ML antiquotation @{path} is superseded by @{file}, which ensures that
wenzelm@64390
  1556
the argument is a plain file. Minor INCOMPATIBILITY.
wenzelm@64390
  1557
wenzelm@64390
  1558
* Antiquotation @{make_string} is available during Pure bootstrap --
wenzelm@64390
  1559
with approximative output quality.
wenzelm@64390
  1560
wenzelm@64390
  1561
* Low-level ML system structures (like PolyML and RunCall) are no longer
wenzelm@64390
  1562
exposed to Isabelle/ML user-space. Potential INCOMPATIBILITY.
wenzelm@64390
  1563
wenzelm@62861
  1564
* The ML function "ML" provides easy access to run-time compilation.
wenzelm@62861
  1565
This is particularly useful for conditional compilation, without
wenzelm@62861
  1566
requiring separate files.
wenzelm@62861
  1567
wenzelm@62498
  1568
* Option ML_exception_debugger controls detailed exception trace via the
wenzelm@62498
  1569
Poly/ML debugger. Relevant ML modules need to be compiled beforehand
wenzelm@62498
  1570
with ML_file_debug, or with ML_file and option ML_debugger enabled. Note
wenzelm@62498
  1571
debugger information requires consirable time and space: main
wenzelm@62498
  1572
Isabelle/HOL with full debugger support may need ML_system_64.
wenzelm@62498
  1573
wenzelm@62514
  1574
* Local_Theory.restore has been renamed to Local_Theory.reset to
wenzelm@62514
  1575
emphasize its disruptive impact on the cumulative context, notably the
wenzelm@62514
  1576
scope of 'private' or 'qualified' names. Note that Local_Theory.reset is
wenzelm@62514
  1577
only appropriate when targets are managed, e.g. starting from a global
wenzelm@62514
  1578
theory and returning to it. Regular definitional packages should use
wenzelm@62514
  1579
balanced blocks of Local_Theory.open_target versus
wenzelm@62514
  1580
Local_Theory.close_target instead. Rare INCOMPATIBILITY.
wenzelm@62514
  1581
wenzelm@62519
  1582
* Structure TimeLimit (originally from the SML/NJ library) has been
wenzelm@62519
  1583
replaced by structure Timeout, with slightly different signature.
wenzelm@62519
  1584
INCOMPATIBILITY.
wenzelm@62519
  1585
wenzelm@62551
  1586
* Discontinued cd and pwd operations, which are not well-defined in a
wenzelm@62551
  1587
multi-threaded environment. Note that files are usually located
wenzelm@62551
  1588
relatively to the master directory of a theory (see also
wenzelm@62551
  1589
File.full_path). Potential INCOMPATIBILITY.
wenzelm@62551
  1590
wenzelm@63352
  1591
* Binding.empty_atts supersedes Thm.empty_binding and
wenzelm@63352
  1592
Attrib.empty_binding. Minor INCOMPATIBILITY.
wenzelm@63352
  1593
wenzelm@62498
  1594
wenzelm@62354
  1595
*** System ***
wenzelm@62354
  1596
wenzelm@64390
  1597
* SML/NJ and old versions of Poly/ML are no longer supported.
wenzelm@64390
  1598
wenzelm@64390
  1599
* Poly/ML heaps now follow the hierarchy of sessions, and thus require
wenzelm@64390
  1600
much less disk space.
wenzelm@63226
  1601
wenzelm@62591
  1602
* The Isabelle ML process is now managed directly by Isabelle/Scala, and
wenzelm@62591
  1603
shell scripts merely provide optional command-line access. In
wenzelm@62591
  1604
particular:
wenzelm@62591
  1605
wenzelm@62591
  1606
  . Scala module ML_Process to connect to the raw ML process,
wenzelm@62591
  1607
    with interaction via stdin/stdout/stderr or in batch mode;
wenzelm@62591
  1608
  . command-line tool "isabelle console" as interactive wrapper;
wenzelm@62591
  1609
  . command-line tool "isabelle process" as batch mode wrapper.
wenzelm@62588
  1610
wenzelm@62588
  1611
* The executable "isabelle_process" has been discontinued. Tools and
wenzelm@62588
  1612
prover front-ends should use ML_Process or Isabelle_Process in
wenzelm@62591
  1613
Isabelle/Scala. INCOMPATIBILITY.
wenzelm@62588
  1614
wenzelm@62588
  1615
* New command-line tool "isabelle process" supports ML evaluation of
wenzelm@62588
  1616
literal expressions (option -e) or files (option -f) in the context of a
wenzelm@62588
  1617
given heap image. Errors lead to premature exit of the ML process with
wenzelm@62588
  1618
return code 1.
wenzelm@62588
  1619
wenzelm@64390
  1620
* The command-line tool "isabelle build" supports option -N for cyclic
wenzelm@64390
  1621
shuffling of NUMA CPU nodes. This may help performance tuning on Linux
wenzelm@64390
  1622
servers with separate CPU/memory modules.
wenzelm@64390
  1623
wenzelm@64390
  1624
* System option "threads" (for the size of the Isabelle/ML thread farm)
wenzelm@64390
  1625
is also passed to the underlying ML runtime system as --gcthreads,
wenzelm@64274
  1626
unless there is already a default provided via ML_OPTIONS settings.
wenzelm@64274
  1627
wenzelm@63827
  1628
* System option "checkpoint" helps to fine-tune the global heap space
wenzelm@63827
  1629
management of isabelle build. This is relevant for big sessions that may
wenzelm@63827
  1630
exhaust the small 32-bit address space of the ML process (which is used
wenzelm@63827
  1631
by default).
wenzelm@63827
  1632
wenzelm@64308
  1633
* System option "profiling" specifies the mode for global ML profiling
wenzelm@64342
  1634
in "isabelle build". Possible values are "time", "allocations". The
wenzelm@64342
  1635
command-line tool "isabelle profiling_report" helps to digest the
wenzelm@64342
  1636
resulting log files.
wenzelm@64308
  1637
wenzelm@63986
  1638
* System option "ML_process_policy" specifies an optional command prefix
wenzelm@63986
  1639
for the underlying ML process, e.g. to control CPU affinity on
wenzelm@63987
  1640
multiprocessor systems. The "isabelle jedit" tool allows to override the
wenzelm@63987
  1641
implicit default via option -p.
wenzelm@63986
  1642
wenzelm@64390
  1643
* Command-line tool "isabelle console" provides option -r to help to
wenzelm@64390
  1644
bootstrapping Isabelle/Pure interactively.
wenzelm@64390
  1645
wenzelm@64390
  1646
* Command-line tool "isabelle yxml" has been discontinued.
wenzelm@64390
  1647
INCOMPATIBILITY, use operations from the modules "XML" and "YXML" in
wenzelm@64390
  1648
Isabelle/ML or Isabelle/Scala.
wenzelm@64390
  1649
wenzelm@64390
  1650
* Many Isabelle tools that require a Java runtime system refer to the
wenzelm@64390
  1651
settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64,
wenzelm@64390
  1652
depending on the underlying platform. The settings for "isabelle build"
wenzelm@64390
  1653
ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been
wenzelm@64390
  1654
discontinued. Potential INCOMPATIBILITY.
wenzelm@64390
  1655
wenzelm@64390
  1656
* The Isabelle system environment always ensures that the main
wenzelm@64390
  1657
executables are found within the shell search $PATH: "isabelle" and
wenzelm@64390
  1658
"isabelle_scala_script".
wenzelm@64390
  1659
wenzelm@64390
  1660
* Isabelle tools may consist of .scala files: the Scala compiler is
wenzelm@64390
  1661
invoked on the spot. The source needs to define some object that extends
wenzelm@64390
  1662
Isabelle_Tool.Body.
wenzelm@64390
  1663
wenzelm@64390
  1664
* File.bash_string, File.bash_path etc. represent Isabelle/ML and
wenzelm@64390
  1665
Isabelle/Scala strings authentically within GNU bash. This is useful to
wenzelm@64390
  1666
produce robust shell scripts under program control, without worrying
wenzelm@64390
  1667
about spaces or special characters. Note that user output works via
wenzelm@64390
  1668
Path.print (ML) or Path.toString (Scala). INCOMPATIBILITY, the old (and
wenzelm@64390
  1669
less versatile) operations File.shell_quote, File.shell_path etc. have
wenzelm@64390
  1670
been discontinued.
wenzelm@64390
  1671
wenzelm@63995
  1672
* The isabelle_java executable allows to run a Java process within the
wenzelm@63995
  1673
name space of Java and Scala components that are bundled with Isabelle,
wenzelm@63995
  1674
but without the Isabelle settings environment.
wenzelm@63995
  1675
wenzelm@64390
  1676
* Isabelle/Scala: the SSH module supports ssh and sftp connections, for
wenzelm@64390
  1677
remote command-execution and file-system access. This resembles
wenzelm@64390
  1678
operations from module File and Isabelle_System to some extent. Note
wenzelm@64390
  1679
that Path specifications need to be resolved remotely via
wenzelm@64390
  1680
ssh.remote_path instead of File.standard_path: the implicit process
wenzelm@64390
  1681
environment is different, Isabelle settings are not available remotely.
wenzelm@64390
  1682
wenzelm@64390
  1683
* Isabelle/Scala: the Mercurial module supports repositories via the
wenzelm@64390
  1684
regular hg command-line interface. The repositroy clone and working
wenzelm@64390
  1685
directory may reside on a local or remote file-system (via ssh
wenzelm@64390
  1686
connection).
wenzelm@64265
  1687
wenzelm@62354
  1688
wenzelm@62354
  1689
wenzelm@62031
  1690
New in Isabelle2016 (February 2016)
wenzelm@62016
  1691
-----------------------------------
wenzelm@60138
  1692
wenzelm@61337
  1693
*** General ***
wenzelm@61337
  1694
wenzelm@62168
  1695
* Eisbach is now based on Pure instead of HOL. Objects-logics may import
wenzelm@62168
  1696
either the theory ~~/src/HOL/Eisbach/Eisbach (for HOL etc.) or
wenzelm@62168
  1697
~~/src/HOL/Eisbach/Eisbach_Old_Appl_Syntax (for FOL, ZF etc.). Note that
wenzelm@62168
  1698
the HOL-Eisbach session located in ~~/src/HOL/Eisbach/ contains further
wenzelm@62168
  1699
examples that do require HOL.
wenzelm@62168
  1700
wenzelm@62157
  1701
* Better resource usage on all platforms (Linux, Windows, Mac OS X) for
wenzelm@62157
  1702
both Isabelle/ML and Isabelle/Scala.  Slightly reduced heap space usage.
wenzelm@62157
  1703
wenzelm@62017
  1704
* Former "xsymbols" syntax with Isabelle symbols is used by default,
wenzelm@62017
  1705
without any special print mode. Important ASCII replacement syntax
wenzelm@62017
  1706
remains available under print mode "ASCII", but less important syntax
wenzelm@62017
  1707
has been removed (see below).
wenzelm@62017
  1708
wenzelm@62109
  1709
* Support for more arrow symbols, with rendering in LaTeX and Isabelle
wenzelm@62109
  1710
fonts: \<Lleftarrow> \<Rrightarrow> \<longlongleftarrow> \<longlongrightarrow> \<longlonglongleftarrow> \<longlonglongrightarrow>.
wenzelm@62017
  1711
wenzelm@62108
  1712
* Special notation \<struct> for the first implicit 'structure' in the
wenzelm@62108
  1713
context has been discontinued. Rare INCOMPATIBILITY, use explicit
wenzelm@62108
  1714
structure name instead, notably in indexed notation with block-subscript
wenzelm@62108
  1715
(e.g. \<odot>\<^bsub>A\<^esub>).
wenzelm@62108
  1716
wenzelm@62108
  1717
* The glyph for \<diamond> in the IsabelleText font now corresponds better to its
wenzelm@62108
  1718
counterpart \<box> as quantifier-like symbol. A small diamond is available as
wenzelm@62108
  1719
\<diamondop>; the old symbol \<struct> loses this rendering and any special
wenzelm@62108
  1720
meaning.
wenzelm@62108
  1721
wenzelm@62017
  1722
* Syntax for formal comments "-- text" now also supports the symbolic
wenzelm@62017
  1723
form "\<comment> text". Command-line tool "isabelle update_cartouches -c" helps
wenzelm@62017
  1724
to update old sources.
wenzelm@62017
  1725
wenzelm@61337
  1726
* Toplevel theorem statements have been simplified as follows:
wenzelm@61337
  1727
wenzelm@61337
  1728
  theorems             ~>  lemmas
wenzelm@61337
  1729
  schematic_lemma      ~>  schematic_goal
wenzelm@61337
  1730
  schematic_theorem    ~>  schematic_goal
wenzelm@61337
  1731
  schematic_corollary  ~>  schematic_goal
wenzelm@61337
  1732
wenzelm@61337
  1733
Command-line tool "isabelle update_theorems" updates theory sources
wenzelm@61337
  1734
accordingly.
wenzelm@61337
  1735
wenzelm@61338
  1736
* Toplevel theorem statement 'proposition' is another alias for
wenzelm@61338
  1737
'theorem'.
wenzelm@61338
  1738
wenzelm@62169
  1739
* The old 'defs' command has been removed (legacy since Isabelle2014).
wenzelm@62169
  1740
INCOMPATIBILITY, use regular 'definition' instead. Overloaded and/or
wenzelm@62169
  1741
deferred definitions require a surrounding 'overloading' block.
wenzelm@62169
  1742
wenzelm@61337
  1743
wenzelm@60610
  1744
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@60610
  1745
wenzelm@60986
  1746
* IDE support for the source-level debugger of Poly/ML, to work with
wenzelm@62253
  1747
Isabelle/ML and official Standard ML. Option "ML_debugger" and commands
wenzelm@62253
  1748
'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',
wenzelm@62253
  1749
'SML_file_no_debug' control compilation of sources with or without
wenzelm@62253
  1750
debugging information. The Debugger panel allows to set breakpoints (via
wenzelm@62253
  1751
context menu), step through stopped threads, evaluate local ML
wenzelm@62253
  1752
expressions etc. At least one Debugger view needs to be active to have
wenzelm@62253
  1753
any effect on the running ML program.
wenzelm@60984
  1754
wenzelm@61803
  1755
* The State panel manages explicit proof state output, with dynamic
wenzelm@61803
  1756
auto-update according to cursor movement. Alternatively, the jEdit
wenzelm@61803
  1757
action "isabelle.update-state" (shortcut S+ENTER) triggers manual
wenzelm@61803
  1758
update.
wenzelm@61729
  1759
wenzelm@61729
  1760
* The Output panel no longer shows proof state output by default, to
wenzelm@61729
  1761
avoid GUI overcrowding. INCOMPATIBILITY, use the State panel instead or
wenzelm@61729
  1762
enable option "editor_output_state".
wenzelm@61215
  1763
wenzelm@61803
  1764
* The text overview column (status of errors, warnings etc.) is updated
wenzelm@61803
  1765
asynchronously, leading to much better editor reactivity. Moreover, the
wenzelm@61803
  1766
full document node content is taken into account. The width of the
wenzelm@61803
  1767
column is scaled according to the main text area font, for improved
wenzelm@61803
  1768
visibility.
wenzelm@61803
  1769
wenzelm@61803
  1770
* The main text area no longer changes its color hue in outdated
wenzelm@61803
  1771
situations. The text overview column takes over the role to indicate
wenzelm@61803
  1772
unfinished edits in the PIDE pipeline. This avoids flashing text display
wenzelm@61803
  1773
due to ad-hoc updates by auxiliary GUI components, such as the State
wenzelm@61803
  1774
panel.
wenzelm@61803
  1775
wenzelm@62254
  1776
* Slightly improved scheduling for urgent print tasks (e.g. command
wenzelm@62254
  1777
state output, interactive queries) wrt. long-running background tasks.
wenzelm@62017
  1778
wenzelm@62017
  1779
* Completion of symbols via prefix of \<name> or \<^name> or \name is
wenzelm@62017
  1780
always possible, independently of the language context. It is never
wenzelm@62017
  1781
implicit: a popup will show up unconditionally.
wenzelm@62017
  1782
wenzelm@62017
  1783
* Additional abbreviations for syntactic completion may be specified in
wenzelm@62017
  1784
$ISABELLE_HOME/etc/abbrevs and $ISABELLE_HOME_USER/etc/abbrevs, with
wenzelm@62017
  1785
support for simple templates using ASCII 007 (bell) as placeholder.
wenzelm@62017
  1786
wenzelm@62234
  1787
* Symbols \<oplus>, \<Oplus>, \<otimes>, \<Otimes>, \<odot>, \<Odot>, \<ominus>, \<oslash> no longer provide abbreviations for
wenzelm@62234
  1788
completion like "+o", "*o", ".o" etc. -- due to conflicts with other
wenzelm@62234
  1789
ASCII syntax. INCOMPATIBILITY, use plain backslash-completion or define
wenzelm@62234
  1790
suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.
wenzelm@62234
  1791
wenzelm@61483
  1792
* Action "isabelle-emph" (with keyboard shortcut C+e LEFT) controls
wenzelm@61483
  1793
emphasized text style; the effect is visible in document output, not in
wenzelm@61483
  1794
the editor.
wenzelm@61483
  1795
wenzelm@61483
  1796
* Action "isabelle-reset" now uses keyboard shortcut C+e BACK_SPACE,
wenzelm@61483
  1797
instead of former C+e LEFT.
wenzelm@61483
  1798
wenzelm@61512
  1799
* The command-line tool "isabelle jedit" and the isabelle.Main
wenzelm@62027
  1800
application wrapper treat the default $USER_HOME/Scratch.thy more
wenzelm@61512
  1801
uniformly, and allow the dummy file argument ":" to open an empty buffer
wenzelm@61512
  1802
instead.
wenzelm@61512
  1803
wenzelm@62017
  1804
* New command-line tool "isabelle jedit_client" allows to connect to an
wenzelm@62017
  1805
already running Isabelle/jEdit process. This achieves the effect of
wenzelm@62017
  1806
single-instance applications seen on common GUI desktops.
wenzelm@62017
  1807
wenzelm@61529
  1808
* The default look-and-feel for Linux is the traditional "Metal", which
wenzelm@61529
  1809
works better with GUI scaling for very high-resolution displays (e.g.
wenzelm@61529
  1810
4K). Moreover, it is generally more robust than "Nimbus".
wenzelm@61529
  1811
wenzelm@62163
  1812
* Update to jedit-5.3.0, with improved GUI scaling and support of
wenzelm@62163
  1813
high-resolution displays (e.g. 4K).
wenzelm@62163
  1814
wenzelm@62034
  1815
* The main Isabelle executable is managed as single-instance Desktop
wenzelm@62034
  1816
application uniformly on all platforms: Linux, Windows, Mac OS X.
wenzelm@62034
  1817
wenzelm@60610
  1818
wenzelm@61405
  1819
*** Document preparation ***
wenzelm@61405
  1820
wenzelm@62017
  1821
* Commands 'paragraph' and 'subparagraph' provide additional section
wenzelm@62017
  1822
headings. Thus there are 6 levels of standard headings, as in HTML.
wenzelm@62017
  1823
wenzelm@62017
  1824
* Command 'text_raw' has been clarified: input text is processed as in
wenzelm@62017
  1825
'text' (with antiquotations and control symbols). The key difference is
wenzelm@62017
  1826
the lack of the surrounding isabelle markup environment in output.
wenzelm@62017
  1827
wenzelm@62017
  1828
* Text is structured in paragraphs and nested lists, using notation that
wenzelm@62017
  1829
is similar to Markdown. The control symbols for list items are as
wenzelm@62017
  1830
follows:
wenzelm@62017
  1831
wenzelm@62017
  1832
  \<^item>  itemize
wenzelm@62017
  1833
  \<^enum>  enumerate
wenzelm@62017
  1834
  \<^descr>  description
wenzelm@62017
  1835
wenzelm@61491
  1836
* There is a new short form for antiquotations with a single argument
wenzelm@61491
  1837
that is a cartouche: \<^name>\<open>...\<close> is equivalent to @{name \<open>...\<close>} and
wenzelm@61595
  1838
\<open>...\<close> without control symbol is equivalent to @{cartouche \<open>...\<close>}.
wenzelm@61595
  1839
\<^name> without following cartouche is equivalent to @{name}. The
wenzelm@61501
  1840
standard Isabelle fonts provide glyphs to render important control
wenzelm@61501
  1841
symbols, e.g. "\<^verbatim>", "\<^emph>", "\<^bold>".
wenzelm@61491
  1842
wenzelm@61595
  1843
* Antiquotations @{noindent}, @{smallskip}, @{medskip}, @{bigskip} with
wenzelm@61595
  1844
corresponding control symbols \<^noindent>, \<^smallskip>, \<^medskip>, \<^bigskip> specify spacing formally, using
wenzelm@61595
  1845
standard LaTeX macros of the same names.
wenzelm@61595
  1846
wenzelm@61491
  1847
* Antiquotation @{cartouche} in Isabelle/Pure is the same as @{text}.
wenzelm@61491
  1848
Consequently, \<open>...\<close> without any decoration prints literal quasi-formal
wenzelm@61492
  1849
text. Command-line tool "isabelle update_cartouches -t" helps to update
wenzelm@61492
  1850
old sources, by approximative patching of the content of string and
wenzelm@61492
  1851
cartouche tokens seen in theory sources.
wenzelm@61491
  1852
wenzelm@61491
  1853
* The @{text} antiquotation now ignores the antiquotation option
wenzelm@61491
  1854
"source". The given text content is output unconditionally, without any
wenzelm@61491
  1855
surrounding quotes etc. Subtle INCOMPATIBILITY, put quotes into the
wenzelm@61494
  1856
argument where they are really intended, e.g. @{text \<open>"foo"\<close>}. Initial
wenzelm@61494
  1857
or terminal spaces are ignored.
wenzelm@61491
  1858
wenzelm@62017
  1859
* Antiquotations @{emph} and @{bold} output LaTeX source recursively,
wenzelm@62017
  1860
adding appropriate text style markup. These may be used in the short
wenzelm@62017
  1861
form \<^emph>\<open>...\<close> and \<^bold>\<open>...\<close>.
wenzelm@62017
  1862
wenzelm@62017
  1863
* Document antiquotation @{footnote} outputs LaTeX source recursively,
wenzelm@62017
  1864
marked as \footnote{}. This may be used in the short form \<^footnote>\<open>...\<close>.
wenzelm@62017
  1865
wenzelm@62017
  1866
* Antiquotation @{verbatim [display]} supports option "indent".
wenzelm@62017
  1867
wenzelm@62017
  1868
* Antiquotation @{theory_text} prints uninterpreted theory source text
wenzelm@62231
  1869
(Isar outer syntax with command keywords etc.). This may be used in the
wenzelm@62231
  1870
short form \<^theory_text>\<open>...\<close>. @{theory_text [display]} supports option "indent".
wenzelm@62017
  1871
wenzelm@62017
  1872
* Antiquotation @{doc ENTRY} provides a reference to the given
wenzelm@62017
  1873
documentation, with a hyperlink in the Prover IDE.
wenzelm@62017
  1874
wenzelm@62017
  1875
* Antiquotations @{command}, @{method}, @{attribute} print checked
wenzelm@62017
  1876
entities of the Isar language.
wenzelm@62017
  1877
wenzelm@61471
  1878
* HTML presentation uses the standard IsabelleText font and Unicode
wenzelm@61471
  1879
rendering of Isabelle symbols like Isabelle/Scala/jEdit.  The former
wenzelm@61488
  1880
print mode "HTML" loses its special meaning.
wenzelm@61471
  1881
wenzelm@61405
  1882
wenzelm@60406
  1883
*** Isar ***
wenzelm@60406
  1884
wenzelm@62205
  1885
* Local goals ('have', 'show', 'hence', 'thus') allow structured rule
wenzelm@62205
  1886
statements like fixes/assumes/shows in theorem specifications, but the
wenzelm@62205
  1887
notation is postfix with keywords 'if' (or 'when') and 'for'. For
wenzelm@60555
  1888
example:
wenzelm@60414
  1889
wenzelm@60414
  1890
  have result: "C x y"
wenzelm@60414
  1891
    if "A x" and "B y"
wenzelm@60414
  1892
    for x :: 'a and y :: 'a
wenzelm@60414
  1893
    <proof>
wenzelm@60414
  1894
wenzelm@60449
  1895
The local assumptions are bound to the name "that". The result is
wenzelm@60449
  1896
exported from context of the statement as usual. The above roughly
wenzelm@60414
  1897
corresponds to a raw proof block like this:
wenzelm@60414
  1898
wenzelm@60414
  1899
  {
wenzelm@60414
  1900
    fix x :: 'a and y :: 'a
wenzelm@60449
  1901
    assume that: "A x" "B y"
wenzelm@60414
  1902
    have "C x y" <proof>
wenzelm@60414
  1903
  }
wenzelm@60414
  1904
  note result = this
wenzelm@60406
  1905
wenzelm@60555
  1906
The keyword 'when' may be used instead of 'if', to indicate 'presume'
wenzelm@60555
  1907
instead of 'assume' above.
wenzelm@60555
  1908
wenzelm@61733
  1909
* Assumptions ('assume', 'presume') allow structured rule statements
wenzelm@61733
  1910
using 'if' and 'for', similar to 'have' etc. above. For example:
wenzelm@61658
  1911
wenzelm@61658
  1912
  assume result: "C x y"
wenzelm@61658
  1913
    if "A x" and "B y"
wenzelm@61658
  1914
    for x :: 'a and y :: 'a
wenzelm@61658
  1915
wenzelm@61658
  1916
This assumes "\<And>x y::'a. A x \<Longrightarrow> B y \<Longrightarrow> C x y" and produces a general
wenzelm@61658
  1917
result as usual: "A ?x \<Longrightarrow> B ?y \<Longrightarrow> C ?x ?y".
wenzelm@61658
  1918
wenzelm@61658
  1919
Vacuous quantification in assumptions is omitted, i.e. a for-context
wenzelm@61658
  1920
only effects propositions according to actual use of variables. For
wenzelm@61658
  1921
example:
wenzelm@61658
  1922
wenzelm@61658
  1923
  assume "A x" and "B y" for x and y
wenzelm@61658
  1924
wenzelm@61658
  1925
is equivalent to:
wenzelm@61658
  1926
wenzelm@61658
  1927
  assume "\<And>x. A x" and "\<And>y. B y"
wenzelm@61658
  1928
wenzelm@60595
  1929
* The meaning of 'show' with Pure rule statements has changed: premises
wenzelm@60595
  1930
are treated in the sense of 'assume', instead of 'presume'. This means,
wenzelm@62205
  1931
a goal like "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" can be solved completely as
wenzelm@62205
  1932
follows:
wenzelm@60595
  1933
wenzelm@60595
  1934
  show "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60595
  1935
wenzelm@60595
  1936
or:
wenzelm@60595
  1937
wenzelm@60595
  1938
  show "C x" if "A x" "B x" for x
wenzelm@60595
  1939
wenzelm@60595
  1940
Rare INCOMPATIBILITY, the old behaviour may be recovered as follows:
wenzelm@60595
  1941
wenzelm@60595
  1942
  show "C x" when "A x" "B x" for x
wenzelm@60595
  1943
wenzelm@60459
  1944
* New command 'consider' states rules for generalized elimination and
wenzelm@60459
  1945
case splitting. This is like a toplevel statement "theorem obtains" used
wenzelm@60459
  1946
within a proof body; or like a multi-branch 'obtain' without activation
wenzelm@60459
  1947
of the local context elements yet.
wenzelm@60459
  1948
wenzelm@60455
  1949
* Proof method "cases" allows to specify the rule as first entry of
wenzelm@60455
  1950
chained facts.  This is particularly useful with 'consider':
wenzelm@60455
  1951
wenzelm@60455
  1952
  consider (a) A | (b) B | (c) C <proof>
wenzelm@60455
  1953
  then have something
wenzelm@60455
  1954
  proof cases
wenzelm@60455
  1955
    case a
wenzelm@60455
  1956
    then show ?thesis <proof>
wenzelm@60455
  1957
  next
wenzelm@60455
  1958
    case b
wenzelm@60455
  1959
    then show ?thesis <proof>
wenzelm@60455
  1960
  next
wenzelm@60455
  1961
    case c
wenzelm@60455
  1962
    then show ?thesis <proof>
wenzelm@60455
  1963
  qed
wenzelm@60455
  1964
wenzelm@60565
  1965
* Command 'case' allows fact name and attribute specification like this:
wenzelm@60565
  1966
wenzelm@60565
  1967
  case a: (c xs)
wenzelm@60565
  1968
  case a [attributes]: (c xs)
wenzelm@60565
  1969
wenzelm@60565
  1970
Facts that are introduced by invoking the case context are uniformly
wenzelm@60565
  1971
qualified by "a"; the same name is used for the cumulative fact. The old
wenzelm@60565
  1972
form "case (c xs) [attributes]" is no longer supported. Rare
wenzelm@60565
  1973
INCOMPATIBILITY, need to adapt uses of case facts in exotic situations,
wenzelm@60565
  1974
and always put attributes in front.
wenzelm@60565
  1975
wenzelm@60618
  1976
* The standard proof method of commands 'proof' and '..' is now called
wenzelm@60618
  1977
"standard" to make semantically clear what it is; the old name "default"
wenzelm@60618
  1978
is still available as legacy for some time. Documentation now explains
wenzelm@60618
  1979
'..' more accurately as "by standard" instead of "by rule".
wenzelm@60618
  1980
wenzelm@62017
  1981
* Nesting of Isar goal structure has been clarified: the context after
wenzelm@62017
  1982
the initial backwards refinement is retained for the whole proof, within
wenzelm@62017
  1983
all its context sections (as indicated via 'next'). This is e.g.
wenzelm@62017
  1984
relevant for 'using', 'including', 'supply':
wenzelm@62017
  1985
wenzelm@62017
  1986
  have "A \<and> A" if a: A for A
wenzelm@62017
  1987
    supply [simp] = a
wenzelm@62017
  1988
  proof
wenzelm@62017
  1989
    show A by simp
wenzelm@62017
  1990
  next
wenzelm@62017
  1991
    show A by simp
wenzelm@62017
  1992
  qed
wenzelm@62017
  1993
wenzelm@62017
  1994
* Command 'obtain' binds term abbreviations (via 'is' patterns) in the
wenzelm@62017
  1995
proof body as well, abstracted over relevant parameters.
wenzelm@62017
  1996
wenzelm@62017
  1997
* Improved type-inference for theorem statement 'obtains': separate
wenzelm@62017
  1998
parameter scope for of each clause.
wenzelm@62017
  1999
wenzelm@62017
  2000
* Term abbreviations via 'is' patterns also work for schematic
wenzelm@62017
  2001
statements: result is abstracted over unknowns.
wenzelm@62017
  2002
wenzelm@60631
  2003
* Command 'subgoal' allows to impose some structure on backward
wenzelm@60631
  2004
refinements, to avoid proof scripts degenerating into long of 'apply'
wenzelm@60631
  2005
sequences. Further explanations and examples are given in the isar-ref
wenzelm@60631
  2006
manual.
wenzelm@60631
  2007
wenzelm@62017
  2008
* Command 'supply' supports fact definitions during goal refinement
wenzelm@62017
  2009
('apply' scripts).
wenzelm@62017
  2010
wenzelm@61166
  2011
* Proof method "goal_cases" turns the current subgoals into cases within
wenzelm@61166
  2012
the context; the conclusion is bound to variable ?case in each case. For
wenzelm@61166
  2013
example:
wenzelm@60617
  2014
wenzelm@60617
  2015
lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60622
  2016
  and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
wenzelm@61166
  2017
proof goal_cases
wenzelm@60622
  2018
  case (1 x)
wenzelm@60622
  2019
  then show ?case using \<open>A x\<close> \<open>B x\<close> sorry
wenzelm@60622
  2020
next
wenzelm@60622
  2021
  case (2 y z)
wenzelm@60622
  2022
  then show ?case using \<open>U y\<close> \<open>V z\<close> sorry
wenzelm@60622
  2023
qed
wenzelm@60622
  2024
wenzelm@60622
  2025
lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60622
  2026
  and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
wenzelm@61166
  2027
proof goal_cases
wenzelm@60617
  2028
  case prems: 1
wenzelm@60617
  2029
  then show ?case using prems sorry
wenzelm@60617
  2030
next
wenzelm@60617
  2031
  case prems: 2
wenzelm@60617
  2032
  then show ?case using prems sorry
wenzelm@60617
  2033
qed
wenzelm@60578
  2034
wenzelm@60581
  2035
* The undocumented feature of implicit cases goal1, goal2, goal3, etc.
wenzelm@60617
  2036
is marked as legacy, and will be removed eventually. The proof method
wenzelm@60617
  2037
"goals" achieves a similar effect within regular Isar; often it can be
wenzelm@60617
  2038
done more adequately by other means (e.g. 'consider').
wenzelm@60581
  2039
wenzelm@62017
  2040
* The vacuous fact "TERM x" may be established "by fact" or as `TERM x`
wenzelm@62017
  2041
as well, not just "by this" or "." as before.
wenzelm@60551
  2042
wenzelm@60554
  2043
* Method "sleep" succeeds after a real-time delay (in seconds). This is
wenzelm@60554
  2044
occasionally useful for demonstration and testing purposes.
wenzelm@60554
  2045
wenzelm@60406
  2046
wenzelm@60331
  2047
*** Pure ***
wenzelm@60331
  2048
wenzelm@61606
  2049
* Qualifiers in locale expressions default to mandatory ('!') regardless
wenzelm@61606
  2050
of the command. Previously, for 'locale' and 'sublocale' the default was
wenzelm@61606
  2051
optional ('?'). The old synatx '!' has been discontinued.
wenzelm@61606
  2052
INCOMPATIBILITY, remove '!' and add '?' as required.
ballarin@61565
  2053
ballarin@61566
  2054
* Keyword 'rewrites' identifies rewrite morphisms in interpretation
wenzelm@62017
  2055
commands. Previously, the keyword was 'where'. INCOMPATIBILITY.
ballarin@61566
  2056
ballarin@61701
  2057
* More gentle suppression of syntax along locale morphisms while
wenzelm@62017
  2058
printing terms. Previously 'abbreviation' and 'notation' declarations
wenzelm@62017
  2059
would be suppressed for morphisms except term identity. Now
ballarin@61701
  2060
'abbreviation' is also kept for morphims that only change the involved
wenzelm@62017
  2061
parameters, and only 'notation' is suppressed. This can be of great help
wenzelm@62017
  2062
when working with complex locale hierarchies, because proof states are
wenzelm@62017
  2063
displayed much more succinctly. It also means that only notation needs
wenzelm@62017
  2064
to be redeclared if desired, as illustrated by this example:
ballarin@61701
  2065
ballarin@61701
  2066
  locale struct = fixes composition :: "'a => 'a => 'a" (infixl "\<cdot>" 65)
ballarin@61701
  2067
  begin
ballarin@61701
  2068
    definition derived (infixl "\<odot>" 65) where ...
ballarin@61701
  2069
  end
ballarin@61701
  2070
ballarin@61701
  2071
  locale morphism =
ballarin@61701
  2072
    left: struct composition + right: struct composition'
ballarin@61701
  2073
    for composition (infix "\<cdot>" 65) and composition' (infix "\<cdot>''" 65)
ballarin@61701
  2074
  begin
ballarin@61701
  2075
    notation right.derived ("\<odot>''")
ballarin@61701
  2076
  end
ballarin@61701
  2077
wenzelm@61895
  2078
* Command 'global_interpretation' issues interpretations into global
wenzelm@61895
  2079
theories, with optional rewrite definitions following keyword 'defines'.
wenzelm@61895
  2080
wenzelm@61895
  2081
* Command 'sublocale' accepts optional rewrite definitions after keyword
haftmann@61675
  2082
'defines'.
haftmann@61675
  2083
wenzelm@61895
  2084
* Command 'permanent_interpretation' has been discontinued. Use
wenzelm@61895
  2085
'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.
haftmann@61670
  2086
wenzelm@61252
  2087
* Command 'print_definitions' prints dependencies of definitional
wenzelm@61252
  2088
specifications. This functionality used to be part of 'print_theory'.
wenzelm@61252
  2089
wenzelm@60331
  2090
* Configuration option rule_insts_schematic has been discontinued
wenzelm@62017
  2091
(intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.
wenzelm@60331
  2092
wenzelm@62205
  2093
* Abbreviations in type classes now carry proper sort constraint. Rare
wenzelm@62205
  2094
INCOMPATIBILITY in situations where the previous misbehaviour has been
wenzelm@62205
  2095
exploited.
haftmann@60347
  2096
haftmann@60347
  2097
* Refinement of user-space type system in type classes: pseudo-local
wenzelm@62205
  2098
operations behave more similar to abbreviations. Potential
haftmann@60347
  2099
INCOMPATIBILITY in exotic situations.
haftmann@60347
  2100
haftmann@60347
  2101
nipkow@60171
  2102
*** HOL ***
nipkow@60171
  2103
wenzelm@62017
  2104
* The 'typedef' command has been upgraded from a partially checked
wenzelm@62017
  2105
"axiomatization", to a full definitional specification that takes the
wenzelm@62017
  2106
global collection of overloaded constant / type definitions into
wenzelm@62017
  2107
account. Type definitions with open dependencies on overloaded
wenzelm@62017
  2108
definitions need to be specified as "typedef (overloaded)". This
wenzelm@62017
  2109
provides extra robustness in theory construction. Rare INCOMPATIBILITY.
wenzelm@62017
  2110
wenzelm@62017
  2111
* Qualification of various formal entities in the libraries is done more
wenzelm@62017
  2112
uniformly via "context begin qualified definition ... end" instead of
wenzelm@62017
  2113
old-style "hide_const (open) ...". Consequently, both the defined
wenzelm@62017
  2114
constant and its defining fact become qualified, e.g. Option.is_none and
wenzelm@62017
  2115
Option.is_none_def. Occasional INCOMPATIBILITY in applications.
wenzelm@62017
  2116
wenzelm@62017
  2117
* Some old and rarely used ASCII replacement syntax has been removed.
wenzelm@62017
  2118
INCOMPATIBILITY, standard syntax with symbols should be used instead.
wenzelm@62017
  2119
The subsequent commands help to reproduce the old forms, e.g. to
wenzelm@62017
  2120
simplify porting old theories:
wenzelm@62017
  2121
wenzelm@62017
  2122
  notation iff  (infixr "<->" 25)
wenzelm@62017
  2123
wenzelm@62017
  2124
  notation Times  (infixr "<*>" 80)
wenzelm@62017
  2125
wenzelm@62017
  2126
  type_notation Map.map  (infixr "~=>" 0)
wenzelm@62017
  2127
  notation Map.map_comp  (infixl "o'_m" 55)
wenzelm@62017
  2128
wenzelm@62017
  2129
  type_notation FinFun.finfun ("(_ =>f /_)" [22, 21] 21)
wenzelm@62017
  2130
wenzelm@62017
  2131
  notation FuncSet.funcset  (infixr "->" 60)
wenzelm@62017
  2132
  notation FuncSet.extensional_funcset  (infixr "->\<^sub>E" 60)
wenzelm@62017
  2133
wenzelm@62017
  2134
  notation Omega_Words_Fun.conc (infixr "conc" 65)
wenzelm@62017
  2135
wenzelm@62017
  2136
  notation Preorder.equiv ("op ~~")
wenzelm@62017
  2137
    and Preorder.equiv ("(_/ ~~ _)" [51, 51] 50)
wenzelm@62017
  2138
wenzelm@62017
  2139
  notation (in topological_space) tendsto (infixr "--->" 55)
wenzelm@62017
  2140
  notation (in topological_space) LIMSEQ ("((_)/ ----> (_))" [60, 60] 60)
wenzelm@62017
  2141
  notation LIM ("((_)/ -- (_)/ --> (_))" [60, 0, 60] 60)
wenzelm@62017
  2142
wenzelm@62017
  2143
  notation NSA.approx (infixl "@=" 50)
wenzelm@62017
  2144
  notation NSLIMSEQ ("((_)/ ----NS> (_))" [60, 60] 60)
wenzelm@62017
  2145
  notation NSLIM ("((_)/ -- (_)/ --NS> (_))" [60, 0, 60] 60)
wenzelm@62017
  2146
wenzelm@62017
  2147
* The alternative notation "\<Colon>" for type and sort constraints has been
wenzelm@62017
  2148
removed: in LaTeX document output it looks the same as "::".
wenzelm@62017
  2149
INCOMPATIBILITY, use plain "::" instead.
wenzelm@62017
  2150
wenzelm@62017
  2151
* Commands 'inductive' and 'inductive_set' work better when names for
wenzelm@62017
  2152
intro rules are omitted: the "cases" and "induct" rules no longer
wenzelm@62017
  2153
declare empty case_names, but no case_names at all. This allows to use
wenzelm@62017
  2154
numbered cases in proofs, without requiring method "goal_cases".
wenzelm@62017
  2155
wenzelm@62017
  2156
* Inductive definitions ('inductive', 'coinductive', etc.) expose
wenzelm@62017
  2157
low-level facts of the internal construction only if the option
wenzelm@62093
  2158
"inductive_internals" is enabled. This refers to the internal predicate
wenzelm@62017
  2159
definition and its monotonicity result. Rare INCOMPATIBILITY.
wenzelm@62017
  2160
wenzelm@62017
  2161
* Recursive function definitions ('fun', 'function', 'partial_function')
wenzelm@62017
  2162
expose low-level facts of the internal construction only if the option
wenzelm@62205
  2163
"function_internals" is enabled. Its internal inductive definition is
wenzelm@62205
  2164
also subject to "inductive_internals". Rare INCOMPATIBILITY.
wenzelm@62093
  2165
wenzelm@62093
  2166
* BNF datatypes ('datatype', 'codatatype', etc.) expose low-level facts
wenzelm@62093
  2167
of the internal construction only if the option "bnf_internals" is
wenzelm@62093
  2168
enabled. This supersedes the former option "bnf_note_all". Rare
wenzelm@62093
  2169
INCOMPATIBILITY.
wenzelm@62017
  2170
wenzelm@62017
  2171
* Combinator to represent case distinction on products is named
wenzelm@62017
  2172
"case_prod", uniformly, discontinuing any input aliasses. Very popular
wenzelm@62017
  2173
theorem aliasses have been retained.
wenzelm@62017
  2174
haftmann@61424
  2175
Consolidated facts:
haftmann@61424
  2176
  PairE ~> prod.exhaust
haftmann@61424
  2177
  Pair_eq ~> prod.inject
haftmann@61424
  2178
  pair_collapse ~> prod.collapse
haftmann@61424
  2179
  Pair_fst_snd_eq ~> prod_eq_iff
haftmann@61424
  2180
  split_twice ~> prod.case_distrib
haftmann@61424
  2181
  split_weak_cong ~> prod.case_cong_weak
haftmann@61424
  2182
  split_split ~> prod.split
haftmann@61424
  2183
  split_split_asm ~> prod.split_asm
haftmann@61424
  2184
  splitI ~> case_prodI
haftmann@61424
  2185
  splitD ~> case_prodD
haftmann@61424
  2186
  splitI2 ~> case_prodI2
haftmann@61424
  2187
  splitI2' ~> case_prodI2'
haftmann@61424
  2188
  splitE ~> case_prodE
haftmann@61424
  2189
  splitE' ~> case_prodE'
haftmann@61424
  2190
  split_pair ~> case_prod_Pair
haftmann@61424
  2191
  split_eta ~> case_prod_eta
haftmann@61424
  2192
  split_comp ~> case_prod_comp
haftmann@61424
  2193
  mem_splitI ~> mem_case_prodI
haftmann@61424
  2194
  mem_splitI2 ~> mem_case_prodI2
haftmann@61424
  2195
  mem_splitE ~> mem_case_prodE
haftmann@61424
  2196
  The_split ~> The_case_prod
haftmann@61424
  2197
  cond_split_eta ~> cond_case_prod_eta
haftmann@61424
  2198
  Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE
haftmann@61424
  2199
  Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI
haftmann@61424
  2200
  in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq
haftmann@61424
  2201
  Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD
haftmann@61424
  2202
  Collect_split_Grp_inD ~> Collect_case_prod_Grp_in
haftmann@61424
  2203
  Domain_Collect_split ~> Domain_Collect_case_prod
haftmann@61424
  2204
  Image_Collect_split ~> Image_Collect_case_prod
haftmann@61424
  2205
  Range_Collect_split ~> Range_Collect_case_prod
haftmann@61424
  2206
  Eps_split ~> Eps_case_prod
haftmann@61424
  2207
  Eps_split_eq ~> Eps_case_prod_eq
haftmann@61424
  2208
  split_rsp ~> case_prod_rsp
haftmann@61424
  2209
  curry_split ~> curry_case_prod
haftmann@61424
  2210
  split_curry ~> case_prod_curry
wenzelm@62017
  2211
haftmann@61424
  2212
Changes in structure HOLogic:
haftmann@61424
  2213
  split_const ~> case_prod_const
haftmann@61424
  2214
  mk_split ~> mk_case_prod
haftmann@61424
  2215
  mk_psplits ~> mk_ptupleabs
haftmann@61424
  2216
  strip_psplits ~> strip_ptupleabs
wenzelm@62017
  2217
wenzelm@62017
  2218
INCOMPATIBILITY.
wenzelm@62017
  2219
wenzelm@62017
  2220
* The coercions to type 'real' have been reorganised. The function
wenzelm@62017
  2221
'real' is no longer overloaded, but has type 'nat => real' and
wenzelm@62017
  2222
abbreviates of_nat for that type. Also 'real_of_int :: int => real'
wenzelm@62017
  2223
abbreviates of_int for that type. Other overloaded instances of 'real'
wenzelm@62017
  2224
have been replaced by 'real_of_ereal' and 'real_of_float'.
wenzelm@62017
  2225
lp15@61694
  2226
Consolidated facts (among others):
lp15@61694
  2227
  real_of_nat_le_iff -> of_nat_le_iff
lp15@61694
  2228
  real_of_nat_numeral of_nat_numeral
lp15@61694
  2229
  real_of_int_zero of_int_0
lp15@61694
  2230
  real_of_nat_zero of_nat_0
lp15@61694
  2231
  real_of_one of_int_1
lp15@61694
  2232
  real_of_int_add of_int_add
lp15@61694
  2233
  real_of_nat_add of_nat_add
lp15@61694
  2234
  real_of_int_diff of_int_diff
lp15@61694
  2235
  real_of_nat_diff of_nat_diff
lp15@61694
  2236
  floor_subtract floor_diff_of_int
lp15@61694
  2237
  real_of_int_inject of_int_eq_iff
lp15@61694
  2238
  real_of_int_gt_zero_cancel_iff of_int_0_less_iff
lp15@61694
  2239
  real_of_int_ge_zero_cancel_iff of_int_0_le_iff
lp15@61694
  2240
  real_of_nat_ge_zero of_nat_0_le_iff
lp15@61694
  2241
  real_of_int_ceiling_ge le_of_int_ceiling
lp15@61694
  2242
  ceiling_less_eq ceiling_less_iff
lp15@61694
  2243
  ceiling_le_eq ceiling_le_iff
lp15@61694
  2244
  less_floor_eq less_floor_iff
lp15@61694
  2245
  floor_less_eq floor_less_iff
lp15@61694
  2246
  floor_divide_eq_div floor_divide_of_int_eq
lp15@61694
  2247
  real_of_int_zero_cancel of_nat_eq_0_iff
lp15@61694
  2248
  ceiling_real_of_int ceiling_of_int
wenzelm@62017
  2249
wenzelm@62017
  2250
INCOMPATIBILITY.
wenzelm@61143
  2251
wenzelm@60841
  2252
* Theory Map: lemma map_of_is_SomeD was a clone of map_of_SomeD and has
wenzelm@60841
  2253
been removed. INCOMPATIBILITY.
wenzelm@60841
  2254
lars@60712
  2255
* Quickcheck setup for finite sets.
lars@60712
  2256
nipkow@60171
  2257
* Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.
wenzelm@60138
  2258
blanchet@60306
  2259
* Sledgehammer:
blanchet@61318
  2260
  - The MaSh relevance filter has been sped up.
blanchet@60306
  2261
  - Proof reconstruction has been improved, to minimize the incidence of
blanchet@60306
  2262
    cases where Sledgehammer gives a proof that does not work.
blanchet@60306
  2263
  - Auto Sledgehammer now minimizes and preplays the results.
blanchet@61030
  2264
  - Handle Vampire 4.0 proof output without raising exception.
blanchet@61043
  2265
  - Eliminated "MASH" environment variable. Use the "MaSh" option in
blanchet@61043
  2266
    Isabelle/jEdit instead. INCOMPATIBILITY.
blanchet@61317
  2267
  - Eliminated obsolete "blocking" option and related subcommands.
blanchet@60306
  2268
blanchet@60310
  2269
* Nitpick:
blanchet@61325
  2270
  - Fixed soundness bug in translation of "finite" predicate.
blanchet@61324
  2271
  - Fixed soundness bug in "destroy_constrs" optimization.
blanchet@62080
  2272
  - Fixed soundness bug in translation of "rat" type.
blanchet@60310
  2273
  - Removed "check_potential" and "check_genuine" options.
blanchet@61317
  2274
  - Eliminated obsolete "blocking" option.
blanchet@60310
  2275
wenzelm@62027
  2276
* (Co)datatype package:
blanchet@61345
  2277
  - New commands "lift_bnf" and "copy_bnf" for lifting (copying) a BNF
blanchet@61345
  2278
    structure on the raw type to an abstract type defined using typedef.
blanchet@61345
  2279
  - Always generate "case_transfer" theorem.
wenzelm@62235
  2280
  - For mutual types, generate slightly stronger "rel_induct",
haftmann@63946
  2281
    "rel_coinduct", and "coinduct" theorems. INCOMPATIBILITY.
blanchet@61551
  2282
  - Allow discriminators and selectors with the same name as the type
blanchet@61551
  2283
    being defined.
blanchet@61551
  2284
  - Avoid various internal name clashes (e.g., 'datatype f = f').
traytel@60920
  2285
wenzelm@62098
  2286
* Transfer: new methods for interactive debugging of 'transfer' and
wenzelm@62098
  2287
'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',
wenzelm@62098
  2288
'transfer_prover_start' and 'transfer_prover_end'.
kuncar@61370
  2289
kleing@62118
  2290
* New diagnostic command print_record for displaying record definitions.
kleing@62118
  2291
haftmann@60868
  2292
* Division on integers is bootstrapped directly from division on
wenzelm@62017
  2293
naturals and uses generic numeral algorithm for computations. Slight
wenzelm@62017
  2294
INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former
wenzelm@62017
  2295
simprocs binary_int_div and binary_int_mod
wenzelm@62017
  2296
wenzelm@62017
  2297
* Tightened specification of class semiring_no_zero_divisors. Minor
haftmann@60516
  2298
INCOMPATIBILITY.
haftmann@60516
  2299
haftmann@60688
  2300
* Class algebraic_semidom introduces common algebraic notions of
wenzelm@62017
  2301
integral (semi)domains, particularly units. Although logically subsumed
wenzelm@62017
  2302
by fields, is is not a super class of these in order not to burden
wenzelm@62017
  2303
fields with notions that are trivial there.
wenzelm@62017
  2304
wenzelm@62017
  2305
* Class normalization_semidom specifies canonical representants for
wenzelm@62017
  2306
equivalence classes of associated elements in an integral (semi)domain.
wenzelm@62017
  2307
This formalizes associated elements as well.
haftmann@60688
  2308
haftmann@60688
  2309
* Abstract specification of gcd/lcm operations in classes semiring_gcd,
wenzelm@62017
  2310
semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute
wenzelm@62017
  2311
and gcd_int.commute are subsumed by gcd.commute, as well as
wenzelm@62017
  2312
gcd_nat.assoc and gcd_int.assoc by gcd.assoc.
wenzelm@62017
  2313
wenzelm@62017
  2314
* Former constants Fields.divide (_ / _) and Divides.div (_ div _) are
wenzelm@62017
  2315
logically unified to Rings.divide in syntactic type class Rings.divide,
wenzelm@62017
  2316
with infix syntax (_ div _). Infix syntax (_ / _) for field division is
wenzelm@62017
  2317
added later as abbreviation in class Fields.inverse. INCOMPATIBILITY,
wenzelm@62017
  2318
instantiations must refer to Rings.divide rather than the former
wenzelm@62017
  2319
separate constants, hence infix syntax (_ / _) is usually not available
wenzelm@62017
  2320
during instantiation.
wenzelm@62017
  2321
wenzelm@62017
  2322
* New cancellation simprocs for boolean algebras to cancel complementary
wenzelm@62017
  2323
terms for sup and inf. For example, "sup x (sup y (- x))" simplifies to
wenzelm@62017
  2324
"top". INCOMPATIBILITY.
Andreas@61629
  2325
hoelzl@62101
  2326
* Class uniform_space introduces uniform spaces btw topological spaces
hoelzl@62101
  2327
and metric spaces. Minor INCOMPATIBILITY: open_<type>_def needs to be
wenzelm@62205
  2328
introduced in the form of an uniformity. Some constants are more general
wenzelm@62205
  2329
now, it may be necessary to add type class constraints.
hoelzl@62101
  2330
hoelzl@62101
  2331
  open_real_def \<leadsto> open_dist
hoelzl@62101
  2332
  open_complex_def \<leadsto> open_dist
hoelzl@62101
  2333
wenzelm@62026
  2334
* Library/Monad_Syntax: notation uses symbols \<bind> and \<then>. INCOMPATIBILITY.
wenzelm@62026
  2335
Mathias@60397
  2336
* Library/Multiset:
Mathias@60397
  2337
  - Renamed multiset inclusion operators:
Mathias@60397
  2338
      < ~> <#
blanchet@62208
  2339
      > ~> >#
Mathias@60397
  2340
      <= ~> <=#
blanchet@62208
  2341
      >= ~> >=#
Mathias@60397
  2342
      \<le> ~> \<le>#
blanchet@62208
  2343
      \<ge> ~> \<ge>#
Mathias@60397
  2344
    INCOMPATIBILITY.
blanchet@62209
  2345
  - Added multiset inclusion operator syntax:
blanchet@62209
  2346
      \<subset>#
blanchet@62209
  2347
      \<subseteq>#
blanchet@62209
  2348
      \<supset>#
blanchet@62209
  2349
      \<supseteq>#
Mathias@60397
  2350
  - "'a multiset" is no longer an instance of the "order",
Mathias@60397
  2351
    "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",
Mathias@60397
  2352
    "semilattice_inf", and "semilattice_sup" type classes. The theorems
Mathias@60397
  2353
    previously provided by these type classes (directly or indirectly)
Mathias@60397
  2354
    are now available through the "subset_mset" interpretation
Mathias@60397
  2355
    (e.g. add_mono ~> subset_mset.add_mono).
Mathias@60397
  2356
    INCOMPATIBILITY.
nipkow@60497
  2357
  - Renamed conversions:
nipkow@60515
  2358
      multiset_of ~> mset
nipkow@60515
  2359
      multiset_of_set ~> mset_set
nipkow@60497
  2360
      set_of ~> set_mset
nipkow@60497
  2361
    INCOMPATIBILITY
Mathias@60398
  2362
  - Renamed lemmas:
Mathias@60398
  2363
      mset_le_def ~> subseteq_mset_def
Mathias@60398
  2364
      mset_less_def ~> subset_mset_def
Mathias@60400
  2365
      less_eq_multiset.rep_eq ~> subseteq_mset_def
Mathias@60400
  2366
    INCOMPATIBILITY
Mathias@60400
  2367
  - Removed lemmas generated by lift_definition:
wenzelm@62235
  2368
    less_eq_multiset.abs_eq, less_eq_multiset.rsp,
wenzelm@62235
  2369
    less_eq_multiset.transfer, less_eq_multiset_def
Mathias@60400
  2370
    INCOMPATIBILITY
wenzelm@60006
  2371
wenzelm@62017
  2372
* Library/Omega_Words_Fun: Infinite words modeled as functions nat \<Rightarrow> 'a.
wenzelm@62017
  2373
wenzelm@62017
  2374
* Library/Bourbaki_Witt_Fixpoint: Added formalisation of the
wenzelm@62017
  2375
Bourbaki-Witt fixpoint theorem for increasing functions in
wenzelm@62017
  2376
chain-complete partial orders.
wenzelm@62017
  2377
wenzelm@62017
  2378
* Library/Old_Recdef: discontinued obsolete 'defer_recdef' command.
wenzelm@62017
  2379
Minor INCOMPATIBILITY, use 'function' instead.
wenzelm@62017
  2380
wenzelm@62064
  2381
* Library/Periodic_Fun: a locale that provides convenient lemmas for
wenzelm@62064
  2382
periodic functions.
eberlm@62060
  2383
wenzelm@62098
  2384
* Library/Formal_Power_Series: proper definition of division (with
wenzelm@62098
  2385
remainder) for formal power series; instances for Euclidean Ring and
wenzelm@62098
  2386
GCD.
eberlm@62086
  2387
wenzelm@62084
  2388
* HOL-Imperative_HOL: obsolete theory Legacy_Mrec has been removed.
wenzelm@62084
  2389
wenzelm@62084
  2390
* HOL-Statespace: command 'statespace' uses mandatory qualifier for
wenzelm@62084
  2391
import of parent, as for general 'locale' expressions. INCOMPATIBILITY,
wenzelm@62084
  2392
remove '!' and add '?' as required.
wenzelm@62084
  2393
wenzelm@62237
  2394
* HOL-Decision_Procs: The "approximation" method works with "powr"
wenzelm@62237
  2395
(exponentiation on real numbers) again.
wenzelm@62237
  2396
wenzelm@62084
  2397
* HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour
wenzelm@62084
  2398
integrals (= complex path integrals), Cauchy's integral theorem, winding
wenzelm@62084
  2399
numbers and Cauchy's integral formula, Liouville theorem, Fundamental
wenzelm@62084
  2400
Theorem of Algebra. Ported from HOL Light.
wenzelm@62084
  2401
wenzelm@62084
  2402
* HOL-Multivariate_Analysis: topological concepts such as connected
wenzelm@62017
  2403
components, homotopic paths and the inside or outside of a set.
wenzelm@61121
  2404
wenzelm@62084
  2405
* HOL-Multivariate_Analysis: radius of convergence of power series and
wenzelm@62064
  2406
various summability tests; Harmonic numbers and the Euler–Mascheroni
wenzelm@62064
  2407
constant; the Generalised Binomial Theorem; the complex and real
wenzelm@62064
  2408
Gamma/log-Gamma/Digamma/ Polygamma functions and their most important
wenzelm@62064
  2409
properties.
eberlm@62060
  2410
wenzelm@62084
  2411
* HOL-Probability: The central limit theorem based on Levy's uniqueness
wenzelm@62084
  2412
and continuity theorems, weak convergence, and characterisitc functions.
wenzelm@62084
  2413
wenzelm@62084
  2414
* HOL-Data_Structures: new and growing session of standard data
wenzelm@62084
  2415
structures.
lammich@61178
  2416
wenzelm@60479
  2417
wenzelm@60793
  2418
*** ML ***
wenzelm@60793
  2419
wenzelm@62017
  2420
* The following combinators for low-level profiling of the ML runtime
wenzelm@62017
  2421
system are available:
wenzelm@62017
  2422
wenzelm@62017
  2423
  profile_time          (*CPU time*)
wenzelm@62017
  2424
  profile_time_thread   (*CPU time on this thread*)
wenzelm@62017
  2425
  profile_allocations   (*overall heap allocations*)
wenzelm@62017
  2426
wenzelm@62017
  2427
* Antiquotation @{undefined} or \<^undefined> inlines (raise Match).
wenzelm@62017
  2428
wenzelm@62075
  2429
* Antiquotation @{method NAME} inlines the (checked) name of the given
wenzelm@62075
  2430
Isar proof method.
wenzelm@62075
  2431
wenzelm@61922
  2432
* Pretty printing of Poly/ML compiler output in Isabelle has been
wenzelm@61922
  2433
improved: proper treatment of break offsets and blocks with consistent
wenzelm@61922
  2434
breaks.
wenzelm@61922
  2435
wenzelm@61268
  2436
* The auxiliary module Pure/display.ML has been eliminated. Its
wenzelm@61268
  2437
elementary thm print operations are now in Pure/more_thm.ML and thus
wenzelm@61268
  2438
called Thm.pretty_thm, Thm.string_of_thm etc. INCOMPATIBILITY.
wenzelm@61268
  2439
wenzelm@61144
  2440
* Simproc programming interfaces have been simplified:
wenzelm@61144
  2441
Simplifier.make_simproc and Simplifier.define_simproc supersede various
wenzelm@61144
  2442
forms of Simplifier.mk_simproc, Simplifier.simproc_global etc. Note that
wenzelm@61144
  2443
term patterns for the left-hand sides are specified with implicitly
wenzelm@61144
  2444
fixed variables, like top-level theorem statements. INCOMPATIBILITY.
wenzelm@61144
  2445
wenzelm@60802
  2446
* Instantiation rules have been re-organized as follows:
wenzelm@60802
  2447
wenzelm@60802
  2448
  Thm.instantiate  (*low-level instantiation with named arguments*)
wenzelm@60802
  2449
  Thm.instantiate' (*version with positional arguments*)
wenzelm@60802
  2450
wenzelm@60802
  2451
  Drule.infer_instantiate  (*instantiation with type inference*)
wenzelm@60802
  2452
  Drule.infer_instantiate'  (*version with positional arguments*)
wenzelm@60802
  2453
wenzelm@60802
  2454
The LHS only requires variable specifications, instead of full terms.
wenzelm@60802
  2455
Old cterm_instantiate is superseded by infer_instantiate.
wenzelm@60802
  2456
INCOMPATIBILITY, need to re-adjust some ML names and types accordingly.
wenzelm@60802
  2457
wenzelm@60793
  2458
* Old tactic shorthands atac, rtac, etac, dtac, ftac have been
wenzelm@60793
  2459
discontinued. INCOMPATIBILITY, use regular assume_tac, resolve_tac etc.
wenzelm@60793
  2460
instead (with proper context).
wenzelm@60642
  2461
wenzelm@60642
  2462
* Thm.instantiate (and derivatives) no longer require the LHS of the
wenzelm@60642
  2463
instantiation to be certified: plain variables are given directly.
wenzelm@60642
  2464
wenzelm@60707
  2465
* Subgoal.SUBPROOF and Subgoal.FOCUS combinators use anonymous
wenzelm@60707
  2466
quasi-bound variables (like the Simplifier), instead of accidentally
wenzelm@60707
  2467
named local fixes. This has the potential to improve stability of proof
wenzelm@60707
  2468
tools, but can also cause INCOMPATIBILITY for tools that don't observe
wenzelm@60707
  2469
the proof context discipline.
wenzelm@60707
  2470
wenzelm@62017
  2471
* Isar proof methods are based on a slightly more general type
wenzelm@62017
  2472
context_tactic, which allows to change the proof context dynamically
wenzelm@62017
  2473
(e.g. to update cases) and indicate explicit Seq.Error results. Former
wenzelm@62017
  2474
METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are
wenzelm@62017
  2475
provided in src/Pure/Isar/method.ML for convenience. INCOMPATIBILITY.
wenzelm@61885
  2476
wenzelm@60642
  2477
wenzelm@60983
  2478
*** System ***
wenzelm@60983
  2479
wenzelm@62525
  2480
* Command-line tool "isabelle console" enables print mode "ASCII".
wenzelm@61958
  2481
wenzelm@62017
  2482
* Command-line tool "isabelle update_then" expands old Isar command
wenzelm@62017
  2483
conflations:
wenzelm@62017
  2484
wenzelm@62017
  2485
    hence  ~>  then have
wenzelm@62017
  2486
    thus   ~>  then show
wenzelm@62017
  2487
wenzelm@62017
  2488
This syntax is more orthogonal and improves readability and
wenzelm@62017
  2489
maintainability of proofs.
wenzelm@62017
  2490
wenzelm@61602
  2491
* Global session timeout is multiplied by timeout_scale factor. This
wenzelm@61602
  2492
allows to adjust large-scale tests (e.g. AFP) to overall hardware
wenzelm@61602
  2493
performance.
wenzelm@61602
  2494
wenzelm@61174
  2495
* Property values in etc/symbols may contain spaces, if written with the
wenzelm@62671
  2496
replacement character "␣" (Unicode point 0x2324). For example:
wenzelm@62671
  2497
wenzelm@62671
  2498
    \<star>  code: 0x0022c6  group: operator  font: Deja␣Vu␣Sans␣Mono
wenzelm@61174
  2499
wenzelm@60995
  2500
* Java runtime environment for x86_64-windows allows to use larger heap
wenzelm@60995
  2501
space.
wenzelm@60995
  2502
wenzelm@61135
  2503
* Java runtime options are determined separately for 32bit vs. 64bit
wenzelm@61135
  2504
platforms as follows.
wenzelm@61135
  2505
wenzelm@61135
  2506
  - Isabelle desktop application: platform-specific files that are
wenzelm@61135
  2507
    associated with the main app bundle
wenzelm@61135
  2508
wenzelm@61135
  2509
  - isabelle jedit: settings
wenzelm@61135
  2510
    JEDIT_JAVA_SYSTEM_OPTIONS
wenzelm@61135
  2511
    JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64
wenzelm@61135
  2512
wenzelm@61135
  2513
  - isabelle build: settings
wenzelm@61135
  2514
    ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64
wenzelm@61135
  2515
wenzelm@61294
  2516
* Bash shell function "jvmpath" has been renamed to "platform_path": it
wenzelm@61294
  2517
is relevant both for Poly/ML and JVM processes.
wenzelm@61294
  2518
wenzelm@62017
  2519
* Poly/ML default platform architecture may be changed from 32bit to
wenzelm@62205
  2520
64bit via system option ML_system_64. A system restart (and rebuild) is
wenzelm@62205
  2521
required after change.
wenzelm@62017
  2522
wenzelm@62017
  2523
* Poly/ML 5.6 runs natively on x86-windows and x86_64-windows, which
wenzelm@62017
  2524
both allow larger heap space than former x86-cygwin.
wenzelm@62017
  2525
wenzelm@62157
  2526
* Heap images are 10-15% smaller due to less wasteful persistent theory
wenzelm@62157
  2527
content (using ML type theory_id instead of theory);
wenzelm@62157
  2528
wenzelm@60983
  2529
wenzelm@60479
  2530
wenzelm@60009
  2531
New in Isabelle2015 (May 2015)
wenzelm@60009
  2532
------------------------------
wenzelm@57695
  2533
wenzelm@57941
  2534
*** General ***
wenzelm@57941
  2535
wenzelm@59939
  2536
* Local theory specification commands may have a 'private' or
wenzelm@59990
  2537
'qualified' modifier to restrict name space accesses to the local scope,
wenzelm@59939
  2538
as provided by some "context begin ... end" block. For example:
wenzelm@59926
  2539
wenzelm@59926
  2540
  context
wenzelm@59926
  2541
  begin
wenzelm@59926
  2542
wenzelm@59926
  2543
  private definition ...
wenzelm@59926
  2544
  private lemma ...
wenzelm@59926
  2545
wenzelm@59990
  2546
  qualified definition ...
wenzelm@59990
  2547
  qualified lemma ...
wenzelm@59990
  2548
wenzelm@59926
  2549
  lemma ...
wenzelm@59926
  2550
  theorem ...
wenzelm@59926
  2551
wenzelm@59926
  2552
  end
wenzelm@59926
  2553
wenzelm@59901
  2554
* Command 'experiment' opens an anonymous locale context with private
wenzelm@59901
  2555
naming policy.
wenzelm@59901
  2556
wenzelm@59951
  2557
* Command 'notepad' requires proper nesting of begin/end and its proof
wenzelm@59951
  2558
structure in the body: 'oops' is no longer supported here. Minor
wenzelm@59951
  2559
INCOMPATIBILITY, use 'sorry' instead.
wenzelm@59951
  2560
wenzelm@59951
  2561
* Command 'named_theorems' declares a dynamic fact within the context,
wenzelm@59951
  2562
together with an attribute to maintain the content incrementally. This
wenzelm@59951
  2563
supersedes functor Named_Thms in Isabelle/ML, but with a subtle change
wenzelm@59951
  2564
of semantics due to external visual order vs. internal reverse order.
wenzelm@59951
  2565
wenzelm@59951
  2566
* 'find_theorems': search patterns which are abstractions are
wenzelm@59951
  2567
schematically expanded before search. Search results match the naive
wenzelm@59951
  2568
expectation more closely, particularly wrt. abbreviations.
wenzelm@59951
  2569
INCOMPATIBILITY.
wenzelm@59648
  2570
wenzelm@59569
  2571
* Commands 'method_setup' and 'attribute_setup' now work within a local
wenzelm@59569
  2572
theory context.
wenzelm@57941
  2573
wenzelm@58928
  2574
* Outer syntax commands are managed authentically within the theory
wenzelm@59569
  2575
context, without implicit global state. Potential for accidental
wenzelm@58928
  2576
INCOMPATIBILITY, make sure that required theories are really imported.
wenzelm@58928
  2577
wenzelm@60115
  2578
* Historical command-line terminator ";" is no longer accepted (and
wenzelm@60115
  2579
already used differently in Isar). Minor INCOMPATIBILITY, use "isabelle
wenzelm@60115
  2580
update_semicolons" to remove obsolete semicolons from old theory
wenzelm@60115
  2581
sources.
wenzelm@60115
  2582
wenzelm@59951
  2583
* Structural composition of proof methods (meth1; meth2) in Isar
wenzelm@59951
  2584
corresponds to (tac1 THEN_ALL_NEW tac2) in ML.
haftmann@59105
  2585
wenzelm@60119
  2586
* The Eisbach proof method language allows to define new proof methods
wenzelm@60119
  2587
by combining existing ones with their usual syntax. The "match" proof
wenzelm@60119
  2588
method provides basic fact/term matching in addition to
wenzelm@60119
  2589
premise/conclusion matching through Subgoal.focus, and binds fact names
wenzelm@60288
  2590
from matches as well as term patterns within matches. The Isabelle
wenzelm@60288
  2591
documentation provides an entry "eisbach" for the Eisbach User Manual.
wenzelm@60288
  2592
Sources and various examples are in ~~/src/HOL/Eisbach/.
wenzelm@60119
  2593
wenzelm@57941
  2594
wenzelm@58524
  2595
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@58524
  2596
wenzelm@59569
  2597
* Improved folding mode "isabelle" based on Isar syntax. Alternatively,
wenzelm@59569
  2598
the "sidekick" mode may be used for document structure.
wenzelm@59569
  2599
wenzelm@59569
  2600
* Extended bracket matching based on Isar language structure. System
wenzelm@59569
  2601
option jedit_structure_limit determines maximum number of lines to scan
wenzelm@59569
  2602
in the buffer.
wenzelm@58758
  2603
wenzelm@58540
  2604
* Support for BibTeX files: context menu, context-sensitive token
wenzelm@58540
  2605
marker, SideKick parser.
wenzelm@58524
  2606
wenzelm@58551
  2607
* Document antiquotation @{cite} provides formal markup, which is
wenzelm@60265
  2608
interpreted semi-formally based on .bib files that happen to be open in
wenzelm@60265
  2609
the editor (hyperlinks, completion etc.).
wenzelm@58551
  2610
wenzelm@58785
  2611
* Less waste of vertical space via negative line spacing (see Global
wenzelm@58785
  2612
Options / Text Area).
wenzelm@58785
  2613
wenzelm@60089
  2614
* Improved graphview panel with optional output of PNG or PDF, for
wenzelm@60273
  2615
display of 'thy_deps', 'class_deps' etc.
wenzelm@60009
  2616
wenzelm@60115
  2617
* The commands 'thy_deps' and 'class_deps' allow optional bounds to
wenzelm@60115
  2618
restrict the visualized hierarchy.
wenzelm@60093
  2619
wenzelm@60072
  2620
* Improved scheduling for asynchronous print commands (e.g. provers
wenzelm@60072
  2621
managed by the Sledgehammer panel) wrt. ongoing document processing.
wenzelm@60072
  2622
wenzelm@58524
  2623
wenzelm@59951
  2624
*** Document preparation ***
wenzelm@59951
  2625
wenzelm@59951
  2626
* Document markup commands 'chapter', 'section', 'subsection',
wenzelm@59951
  2627
'subsubsection', 'text', 'txt', 'text_raw' work uniformly in any
wenzelm@59951
  2628
context, even before the initial 'theory' command. Obsolete proof
wenzelm@59951
  2629
commands 'sect', 'subsect', 'subsubsect', 'txt_raw' have been
wenzelm@59951
  2630
discontinued, use 'section', 'subsection', 'subsubsection', 'text_raw'
wenzelm@59951
  2631
instead. The old 'header' command is still retained for some time, but
wenzelm@59951
  2632
should be replaced by 'chapter', 'section' etc. (using "isabelle
wenzelm@59951
  2633
update_header"). Minor INCOMPATIBILITY.
wenzelm@59951
  2634
wenzelm@60009
  2635
* Official support for "tt" style variants, via \isatt{...} or
wenzelm@60009
  2636
\begin{isabellett}...\end{isabellett}. The somewhat fragile \verb or
wenzelm@60009
  2637
verbatim environment of LaTeX is no longer used. This allows @{ML} etc.
wenzelm@60009
  2638
as argument to other macros (such as footnotes).
wenzelm@60009
  2639
wenzelm@60009
  2640
* Document antiquotation @{verbatim} prints ASCII text literally in "tt"
wenzelm@60009
  2641
style.
wenzelm@60009
  2642
wenzelm@60009
  2643
* Discontinued obsolete option "document_graph": session_graph.pdf is
wenzelm@60009
  2644
produced unconditionally for HTML browser_info and PDF-LaTeX document.
wenzelm@60009
  2645
wenzelm@59951
  2646
* Diagnostic commands and document markup commands within a proof do not
wenzelm@59951
  2647
affect the command tag for output. Thus commands like 'thm' are subject
wenzelm@59951
  2648
to proof document structure, and no longer "stick out" accidentally.
wenzelm@59951
  2649
Commands 'text' and 'txt' merely differ in the LaTeX style, not their
wenzelm@59951
  2650
tags. Potential INCOMPATIBILITY in exotic situations.
wenzelm@59951
  2651
wenzelm@59951
  2652
* System option "pretty_margin" is superseded by "thy_output_margin",
wenzelm@59951
  2653
which is also accessible via document antiquotation option "margin".
wenzelm@59951
  2654
Only the margin for document output may be changed, but not the global
wenzelm@59951
  2655
pretty printing: that is 76 for plain console output, and adapted
wenzelm@59951
  2656
dynamically in GUI front-ends. Implementations of document
wenzelm@59951
  2657
antiquotations need to observe the margin explicitly according to
wenzelm@59951
  2658
Thy_Output.string_of_margin. Minor INCOMPATIBILITY.
wenzelm@59951
  2659
wenzelm@60299
  2660
* Specification of 'document_files' in the session ROOT file is
wenzelm@60299
  2661
mandatory for document preparation. The legacy mode with implicit
wenzelm@60299
  2662
copying of the document/ directory is no longer supported. Minor
wenzelm@60299
  2663
INCOMPATIBILITY.
wenzelm@60299
  2664
wenzelm@59951
  2665
haftmann@58202
  2666
*** Pure ***
haftmann@58202
  2667
wenzelm@59835
  2668
* Proof methods with explicit instantiation ("rule_tac", "subgoal_tac"
wenzelm@59835
  2669
etc.) allow an optional context of local variables ('for' declaration):
wenzelm@59835
  2670
these variables become schematic in the instantiated theorem; this
wenzelm@59835
  2671
behaviour is analogous to 'for' in attributes "where" and "of".
wenzelm@59835
  2672
Configuration option rule_insts_schematic (default false) controls use
wenzelm@59835
  2673
of schematic variables outside the context. Minor INCOMPATIBILITY,
wenzelm@59835
  2674
declare rule_insts_schematic = true temporarily and update to use local
wenzelm@59835
  2675
variable declarations or dummy patterns instead.
wenzelm@59835
  2676
wenzelm@60009
  2677
* Explicit instantiation via attributes "where", "of", and proof methods
wenzelm@60009
  2678
"rule_tac" with derivatives like "subgoal_tac" etc. admit dummy patterns
wenzelm@60009
  2679
("_") that stand for anonymous local variables.
wenzelm@60009
  2680
wenzelm@59951
  2681
* Generated schematic variables in standard format of exported facts are
wenzelm@59951
  2682
incremented to avoid material in the proof context. Rare
wenzelm@59951
  2683
INCOMPATIBILITY, explicit instantiation sometimes needs to refer to
wenzelm@59951
  2684
different index.
wenzelm@59951
  2685
wenzelm@60010
  2686
* Lexical separation of signed and unsigned numerals: categories "num"
wenzelm@60010
  2687
and "float" are unsigned. INCOMPATIBILITY: subtle change in precedence
wenzelm@60010
  2688
of numeral signs, particularly in expressions involving infix syntax
wenzelm@60010
  2689
like "(- 1) ^ n".
haftmann@58410
  2690
wenzelm@58421
  2691
* Old inner token category "xnum" has been discontinued.  Potential
wenzelm@58421
  2692
INCOMPATIBILITY for exotic syntax: may use mixfix grammar with "num"
wenzelm@58421
  2693
token category instead.
wenzelm@58421
  2694
haftmann@58202
  2695
blanchet@57737
  2696
*** HOL ***
blanchet@57737
  2697
blanchet@57983
  2698
* New (co)datatype package:
blanchet@58373
  2699
  - The 'datatype_new' command has been renamed 'datatype'. The old
blanchet@58373
  2700
    command of that name is now called 'old_datatype' and is provided
blanchet@58373
  2701
    by "~~/src/HOL/Library/Old_Datatype.thy". See
blanchet@58373
  2702
    'isabelle doc datatypes' for information on porting.
blanchet@58373
  2703
    INCOMPATIBILITY.
blanchet@57983
  2704
  - Renamed theorems:
blanchet@57983
  2705
      disc_corec ~> corec_disc
blanchet@57983
  2706
      disc_corec_iff ~> corec_disc_iff
blanchet@57983
  2707
      disc_exclude ~> distinct_disc
blanchet@57983
  2708
      disc_exhaust ~> exhaust_disc
blanchet@57983
  2709
      disc_map_iff ~> map_disc_iff
blanchet@57983
  2710
      sel_corec ~> corec_sel
blanchet@57983
  2711
      sel_exhaust ~> exhaust_sel
blanchet@57983
  2712
      sel_map ~> map_sel
blanchet@57983
  2713
      sel_set ~> set_sel
blanchet@57983
  2714
      sel_split ~> split_sel
blanchet@57983
  2715
      sel_split_asm ~> split_sel_asm
blanchet@57983
  2716
      strong_coinduct ~> coinduct_strong
blanchet@57983
  2717
      weak_case_cong ~> case_cong_weak
blanchet@57983
  2718
    INCOMPATIBILITY.
blanchet@58192
  2719
  - The "no_code" option to "free_constructors", "datatype_new", and
blanchet@58192
  2720
    "codatatype" has been renamed "plugins del: code".
blanchet@58192
  2721
    INCOMPATIBILITY.
blanchet@58044
  2722
  - The rules "set_empty" have been removed. They are easy
blanchet@58044
  2723
    consequences of other set rules "by auto".
blanchet@58044
  2724
    INCOMPATIBILITY.
blanchet@58044
  2725
  - The rule "set_cases" is now registered with the "[cases set]"
blanchet@57990
  2726
    attribute. This can influence the behavior of the "cases" proof
blanchet@57990
  2727
    method when more than one case rule is applicable (e.g., an
blanchet@57990
  2728
    assumption is of the form "w : set ws" and the method "cases w"
blanchet@57990
  2729
    is invoked). The solution is to specify the case rule explicitly
blanchet@57990
  2730
    (e.g. "cases w rule: widget.exhaust").
blanchet@57990
  2731
    INCOMPATIBILITY.
blanchet@59675
  2732
  - Renamed theories:
blanchet@59675
  2733
      BNF_Comp ~> BNF_Composition
blanchet@59675
  2734
      BNF_FP_Base ~> BNF_Fixpoint_Base
blanchet@59675
  2735
      BNF_GFP ~> BNF_Greatest_Fixpoint