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