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