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