NEWS
author haftmann
Fri Aug 27 14:25:07 2010 +0200 (2010-08-27 ago)
changeset 38814 4d575fbfc920
parent 38795 848be46708dc
child 38815 d0196406ee32
permissions -rw-r--r--
official support for Scala
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@37383
     4
New in this Isabelle version
wenzelm@37383
     5
----------------------------
wenzelm@37383
     6
wenzelm@37536
     7
*** General ***
wenzelm@37536
     8
wenzelm@37536
     9
* Explicit treatment of UTF8 sequences as Isabelle symbols, such that
wenzelm@37536
    10
a Unicode character is treated as a single symbol, not a sequence of
wenzelm@37536
    11
non-ASCII bytes as before.  Since Isabelle/ML string literals may
wenzelm@37536
    12
contain symbols without further backslash escapes, Unicode can now be
wenzelm@37536
    13
used here as well.  Recall that Symbol.explode in ML provides a
wenzelm@37536
    14
consistent view on symbols, while raw explode (or String.explode)
wenzelm@37536
    15
merely give a byte-oriented representation.
wenzelm@37536
    16
wenzelm@38135
    17
* Theory loading: only the master source file is looked-up in the
wenzelm@38135
    18
implicit load path, all other files are addressed relatively to its
wenzelm@38135
    19
directory.  Minor INCOMPATIBILITY, subtle change in semantics.
wenzelm@38135
    20
wenzelm@37939
    21
* Special treatment of ML file names has been discontinued.
wenzelm@37939
    22
Historically, optional extensions .ML or .sml were added on demand --
wenzelm@37939
    23
at the cost of clarity of file dependencies.  Recall that Isabelle/ML
wenzelm@37939
    24
files exclusively use the .ML extension.  Minor INCOMPATIBILTY.
wenzelm@37939
    25
wenzelm@37536
    26
ballarin@38110
    27
*** Pure ***
ballarin@38110
    28
ballarin@38110
    29
* Interpretation command 'interpret' accepts a list of equations like
ballarin@38110
    30
'interpretation' does.
ballarin@38110
    31
ballarin@38110
    32
* Diagnostic command 'print_interps' prints interpretations in proofs
ballarin@38110
    33
in addition to interpretations in theories.
ballarin@38110
    34
wenzelm@38708
    35
* Discontinued obsolete 'global' and 'local' commands to manipulate
wenzelm@38708
    36
the theory name space.  Rare INCOMPATIBILITY.  The ML functions
wenzelm@38708
    37
Sign.root_path and Sign.local_path may be applied directly where this
wenzelm@38708
    38
feature is still required for historical reasons.
wenzelm@38708
    39
ballarin@38110
    40
haftmann@37387
    41
*** HOL ***
haftmann@37387
    42
haftmann@38814
    43
* Scala (2.8 or higher) has been added to the target languages of
haftmann@38814
    44
the code generator.
haftmann@38814
    45
haftmann@38642
    46
* Dropped type classes mult_mono and mult_mono1.  INCOMPATIBILITY.
haftmann@38642
    47
haftmann@38622
    48
* Theory SetsAndFunctions has been split into Function_Algebras and Set_Algebras;
haftmann@38622
    49
canonical names for instance definitions for functions; various improvements.
haftmann@38622
    50
INCOMPATIBILITY.
haftmann@38622
    51
haftmann@38545
    52
* Records: logical foundation type for records do not carry a '_type' suffix
haftmann@38545
    53
any longer.  INCOMPATIBILITY.
haftmann@38545
    54
haftmann@38535
    55
* Code generation for records: more idiomatic representation of record types.
haftmann@38535
    56
Warning: records are not covered by ancient SML code generation any longer.
haftmann@38537
    57
INCOMPATIBILITY.  In cases of need, a suitable rep_datatype declaration
haftmann@38537
    58
helps to succeed then:
haftmann@38537
    59
haftmann@38537
    60
  record 'a foo = ...
haftmann@38537
    61
  ...
haftmann@38537
    62
  rep_datatype foo_ext ...
haftmann@38535
    63
haftmann@38461
    64
* Session Imperative_HOL: revamped, corrected dozens of inadequacies.
haftmann@38461
    65
INCOMPATIBILITY.
haftmann@38461
    66
haftmann@38461
    67
* Quickcheck in locales considers interpretations of that locale for
haftmann@38461
    68
counter example search.
haftmann@38461
    69
haftmann@38347
    70
* Theory Library/Monad_Syntax provides do-syntax for monad types.  Syntax
haftmann@38347
    71
in Library/State_Monad has been changed to avoid ambiguities.
haftmann@38347
    72
INCOMPATIBILITY.
haftmann@38347
    73
haftmann@38461
    74
* Code generator: export_code without explicit file declaration prints
haftmann@37820
    75
to standard output.  INCOMPATIBILITY.
haftmann@37820
    76
haftmann@37679
    77
* Abolished symbol type names:  "prod" and "sum" replace "*" and "+"
haftmann@37681
    78
respectively.  INCOMPATIBILITY.
haftmann@37679
    79
haftmann@37591
    80
* Constant "split" has been merged with constant "prod_case";  names
haftmann@37591
    81
of ML functions, facts etc. involving split have been retained so far,
haftmann@37591
    82
though.  INCOMPATIBILITY.
haftmann@37591
    83
haftmann@37595
    84
* Dropped old infix syntax "mem" for List.member;  use "in set"
haftmann@37595
    85
instead.  INCOMPATIBILITY.
haftmann@37595
    86
haftmann@37595
    87
* Refactoring of code-generation specific operations in List.thy
haftmann@37595
    88
haftmann@37595
    89
  constants
haftmann@37595
    90
    null ~> List.null
haftmann@37595
    91
haftmann@37595
    92
  facts
haftmann@37595
    93
    mem_iff ~> member_def
haftmann@37595
    94
    null_empty ~> null_def
haftmann@37595
    95
haftmann@37595
    96
INCOMPATIBILITY.  Note that these were not suppossed to be used
haftmann@37595
    97
regularly unless for striking reasons;  their main purpose was code
haftmann@37595
    98
generation.
haftmann@37595
    99
haftmann@37387
   100
* Some previously unqualified names have been qualified:
haftmann@37387
   101
haftmann@37387
   102
  types
haftmann@38556
   103
    bool ~> HOL.bool
haftmann@37387
   104
    nat ~> Nat.nat
haftmann@37387
   105
haftmann@37387
   106
  constants
haftmann@38556
   107
    Trueprop ~> HOL.Trueprop
haftmann@38556
   108
    True ~> HOL.True
haftmann@38556
   109
    False ~> HOL.False
haftmann@38795
   110
    op & ~> HOL.conj
haftmann@38795
   111
    op | ~> HOL.disj
haftmann@38788
   112
    op --> ~> HOL.implies
haftmann@38556
   113
    Not ~> HOL.Not
haftmann@38556
   114
    The ~> HOL.The
haftmann@38556
   115
    All ~> HOL.All
haftmann@38556
   116
    Ex ~> HOL.Ex
haftmann@38556
   117
    Ex1 ~> HOL.Ex1
haftmann@38524
   118
    Let ~> HOL.Let
haftmann@38524
   119
    If ~> HOL.If
haftmann@37387
   120
    Ball ~> Set.Ball
haftmann@37387
   121
    Bex ~> Set.Bex
haftmann@37387
   122
    Suc ~> Nat.Suc
haftmann@37389
   123
    Pair ~> Product_Type.Pair
haftmann@37389
   124
    fst ~> Product_Type.fst
haftmann@37389
   125
    snd ~> Product_Type.snd
haftmann@37387
   126
    curry ~> Product_Type.curry
haftmann@37679
   127
    op : ~> Set.member
haftmann@37679
   128
    Collect ~> Set.Collect
haftmann@37387
   129
haftmann@37387
   130
INCOMPATIBILITY.
wenzelm@37383
   131
haftmann@37411
   132
* Removed simplifier congruence rule of "prod_case", as has for long
haftmann@38524
   133
been the case with "split".  INCOMPATIBILITY.
haftmann@37411
   134
haftmann@37423
   135
* Datatype package: theorems generated for executable equality
haftmann@37423
   136
(class eq) carry proper names and are treated as default code
haftmann@37423
   137
equations.
haftmann@37423
   138
haftmann@37423
   139
* List.thy: use various operations from the Haskell prelude when
haftmann@37423
   140
generating Haskell code.
haftmann@37423
   141
haftmann@38524
   142
* code_simp.ML and method code_simp: simplification with rules determined
haftmann@38524
   143
by code generator.
haftmann@37442
   144
haftmann@37442
   145
* code generator: do not print function definitions for case
haftmann@37442
   146
combinators any longer.
haftmann@37442
   147
hoelzl@37666
   148
* Multivariate Analysis: Introduced a type class for euclidean space. Most
hoelzl@37666
   149
theorems are now stated in terms of euclidean spaces instead of finite
hoelzl@37666
   150
cartesian products.
hoelzl@37666
   151
hoelzl@37666
   152
  types
hoelzl@37666
   153
    real ^ 'n ~>  'a::real_vector
hoelzl@37666
   154
              ~>  'a::euclidean_space
hoelzl@37666
   155
              ~>  'a::ordered_euclidean_space
hoelzl@37666
   156
        (depends on your needs)
hoelzl@37666
   157
hoelzl@37666
   158
  constants
hoelzl@37666
   159
     _ $ _        ~> _ $$ _
hoelzl@37666
   160
     \<chi> x. _  ~> \<chi>\<chi> x. _
hoelzl@37666
   161
     CARD('n)     ~> DIM('a)
hoelzl@37666
   162
hoelzl@37666
   163
Also note that the indices are now natural numbers and not from some finite
hoelzl@37666
   164
type. Finite cartesian products of euclidean spaces, products of euclidean
hoelzl@37666
   165
spaces the real and complex numbers are instantiated to be euclidean_spaces.
hoelzl@37666
   166
hoelzl@37666
   167
INCOMPATIBILITY.
wenzelm@37383
   168
hoelzl@38656
   169
* Probability: Introduced pinfreal as real numbers with infinity. Use pinfreal
hoelzl@38656
   170
as value for measures. Introduces Lebesgue Measure based on the integral in
hoelzl@38656
   171
Multivariate Analysis. Proved Radon Nikodym for arbitrary sigma finite measure
hoelzl@38656
   172
spaces.
hoelzl@38656
   173
hoelzl@38656
   174
 INCOMPATIBILITY.
hoelzl@38656
   175
bulwahn@37735
   176
* Inductive package: offers new command "inductive_simps" to automatically
haftmann@38461
   177
derive instantiated and simplified equations for inductive predicates,
haftmann@38461
   178
similar to inductive_cases.
bulwahn@37735
   179
wenzelm@37383
   180
haftmann@38522
   181
*** FOL ***
haftmann@38522
   182
haftmann@38522
   183
* All constant names are now qualified.  INCOMPATIBILITY.
haftmann@38522
   184
haftmann@38522
   185
haftmann@38522
   186
*** ZF ***
haftmann@38522
   187
haftmann@38522
   188
* All constant names are now qualified.  INCOMPATIBILITY.
haftmann@38522
   189
haftmann@38522
   190
wenzelm@37868
   191
*** ML ***
wenzelm@37868
   192
wenzelm@37868
   193
* ML antiquotations @{theory} and @{theory_ref} refer to named
wenzelm@37868
   194
theories from the ancestry of the current context, not any accidental
wenzelm@37868
   195
theory loader state as before.  Potential INCOMPATIBILITY, subtle
wenzelm@37868
   196
change in semantics.
wenzelm@37868
   197
wenzelm@37868
   198
wenzelm@38470
   199
*** System ***
wenzelm@38470
   200
wenzelm@38470
   201
* Discontinued support for Poly/ML 5.0 and 5.1 versions.
wenzelm@38470
   202
wenzelm@38470
   203
wenzelm@37868
   204
wenzelm@37144
   205
New in Isabelle2009-2 (June 2010)
wenzelm@37144
   206
---------------------------------
haftmann@33993
   207
wenzelm@35260
   208
*** General ***
wenzelm@35260
   209
wenzelm@35436
   210
* Authentic syntax for *all* logical entities (type classes, type
wenzelm@35436
   211
constructors, term constants): provides simple and robust
wenzelm@35436
   212
correspondence between formal entities and concrete syntax.  Within
wenzelm@35436
   213
the parse tree / AST representations, "constants" are decorated by
wenzelm@35436
   214
their category (class, type, const) and spelled out explicitly with
wenzelm@35436
   215
their full internal name.
wenzelm@35436
   216
wenzelm@35436
   217
Substantial INCOMPATIBILITY concerning low-level syntax declarations
wenzelm@35436
   218
and translations (translation rules and translation functions in ML).
wenzelm@35436
   219
Some hints on upgrading:
wenzelm@35260
   220
wenzelm@35260
   221
  - Many existing uses of 'syntax' and 'translations' can be replaced
wenzelm@35436
   222
    by more modern 'type_notation', 'notation' and 'abbreviation',
wenzelm@35436
   223
    which are independent of this issue.
wenzelm@35260
   224
wenzelm@35260
   225
  - 'translations' require markup within the AST; the term syntax
wenzelm@35260
   226
    provides the following special forms:
wenzelm@35260
   227
wenzelm@35260
   228
      CONST c   -- produces syntax version of constant c from context
wenzelm@35261
   229
      XCONST c  -- literally c, checked as constant from context
wenzelm@35261
   230
      c         -- literally c, if declared by 'syntax'
wenzelm@35261
   231
wenzelm@35261
   232
    Plain identifiers are treated as AST variables -- occasionally the
wenzelm@35261
   233
    system indicates accidental variables via the error "rhs contains
wenzelm@35261
   234
    extra variables".
wenzelm@35260
   235
wenzelm@35436
   236
    Type classes and type constructors are marked according to their
wenzelm@35436
   237
    concrete syntax.  Some old translations rules need to be written
wenzelm@35436
   238
    for the "type" category, using type constructor application
wenzelm@35436
   239
    instead of pseudo-term application of the default category
wenzelm@35436
   240
    "logic".
wenzelm@35436
   241
wenzelm@35260
   242
  - 'parse_translation' etc. in ML may use the following
wenzelm@35260
   243
    antiquotations:
wenzelm@35260
   244
wenzelm@35436
   245
      @{class_syntax c}   -- type class c within parse tree / AST
wenzelm@35436
   246
      @{term_syntax c}    -- type constructor c within parse tree / AST
wenzelm@35260
   247
      @{const_syntax c}   -- ML version of "CONST c" above
wenzelm@35260
   248
      @{syntax_const c}   -- literally c (checked wrt. 'syntax' declarations)
wenzelm@35260
   249
wenzelm@35436
   250
  - Literal types within 'typed_print_translations', i.e. those *not*
wenzelm@35436
   251
    represented as pseudo-terms are represented verbatim.  Use @{class
wenzelm@35436
   252
    c} or @{type_name c} here instead of the above syntax
wenzelm@35436
   253
    antiquotations.
wenzelm@35436
   254
wenzelm@35260
   255
Note that old non-authentic syntax was based on unqualified base
wenzelm@35436
   256
names, so all of the above "constant" names would coincide.  Recall
wenzelm@35436
   257
that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
wenzelm@35436
   258
diagnose syntax problems.
wenzelm@35260
   259
wenzelm@35351
   260
* Type constructors admit general mixfix syntax, not just infix.
wenzelm@35351
   261
wenzelm@36508
   262
* Concrete syntax may be attached to local entities without a proof
wenzelm@36508
   263
body, too.  This works via regular mixfix annotations for 'fix',
wenzelm@36508
   264
'def', 'obtain' etc. or via the explicit 'write' command, which is
wenzelm@36508
   265
similar to the 'notation' command in theory specifications.
wenzelm@36508
   266
wenzelm@37351
   267
* Discontinued unnamed infix syntax (legacy feature for many years) --
wenzelm@37351
   268
need to specify constant name and syntax separately.  Internal ML
wenzelm@37351
   269
datatype constructors have been renamed from InfixName to Infix etc.
wenzelm@37351
   270
Minor INCOMPATIBILITY.
wenzelm@37351
   271
wenzelm@37351
   272
* Schematic theorem statements need to be explicitly markup as such,
wenzelm@37351
   273
via commands 'schematic_lemma', 'schematic_theorem',
wenzelm@37351
   274
'schematic_corollary'.  Thus the relevance of the proof is made
wenzelm@37351
   275
syntactically clear, which impacts performance in a parallel or
wenzelm@37351
   276
asynchronous interactive environment.  Minor INCOMPATIBILITY.
wenzelm@37351
   277
wenzelm@35613
   278
* Use of cumulative prems via "!" in some proof methods has been
wenzelm@37351
   279
discontinued (old legacy feature).
wenzelm@35613
   280
boehmes@35979
   281
* References 'trace_simp' and 'debug_simp' have been replaced by
wenzelm@36857
   282
configuration options stored in the context. Enabling tracing (the
wenzelm@36857
   283
case of debugging is similar) in proofs works via
wenzelm@36857
   284
wenzelm@36857
   285
  using [[trace_simp = true]]
wenzelm@36857
   286
wenzelm@36857
   287
Tracing is then active for all invocations of the simplifier in
wenzelm@36857
   288
subsequent goal refinement steps. Tracing may also still be enabled or
wenzelm@36857
   289
disabled via the ProofGeneral settings menu.
boehmes@35979
   290
wenzelm@36177
   291
* Separate commands 'hide_class', 'hide_type', 'hide_const',
wenzelm@36177
   292
'hide_fact' replace the former 'hide' KIND command.  Minor
wenzelm@36177
   293
INCOMPATIBILITY.
wenzelm@36177
   294
wenzelm@37298
   295
* Improved parallelism of proof term normalization: usedir -p2 -q0 is
wenzelm@37298
   296
more efficient than combinations with -q1 or -q2.
wenzelm@37298
   297
wenzelm@35260
   298
haftmann@34170
   299
*** Pure ***
haftmann@34170
   300
wenzelm@37351
   301
* Proofterms record type-class reasoning explicitly, using the
wenzelm@37351
   302
"unconstrain" operation internally.  This eliminates all sort
wenzelm@37351
   303
constraints from a theorem and proof, introducing explicit
wenzelm@37351
   304
OFCLASS-premises.  On the proof term level, this operation is
wenzelm@37351
   305
automatically applied at theorem boundaries, such that closed proofs
wenzelm@37351
   306
are always free of sort constraints.  INCOMPATIBILITY for tools that
wenzelm@37351
   307
inspect proof terms.
haftmann@36147
   308
wenzelm@35765
   309
* Local theory specifications may depend on extra type variables that
wenzelm@35765
   310
are not present in the result type -- arguments TYPE('a) :: 'a itself
wenzelm@35765
   311
are added internally.  For example:
wenzelm@35765
   312
wenzelm@35765
   313
  definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
wenzelm@35765
   314
wenzelm@37351
   315
* Predicates of locales introduced by classes carry a mandatory
wenzelm@37351
   316
"class" prefix.  INCOMPATIBILITY.
wenzelm@37351
   317
wenzelm@37351
   318
* Vacuous class specifications observe default sort.  INCOMPATIBILITY.
wenzelm@37351
   319
wenzelm@37351
   320
* Old 'axclass' command has been discontinued.  INCOMPATIBILITY, use
wenzelm@37351
   321
'class' instead.
wenzelm@37351
   322
wenzelm@37351
   323
* Command 'code_reflect' allows to incorporate generated ML code into
wenzelm@37351
   324
runtime environment; replaces immature code_datatype antiquotation.
wenzelm@37351
   325
INCOMPATIBILITY.
wenzelm@37351
   326
wenzelm@37351
   327
* Code generator: simple concept for abstract datatypes obeying
wenzelm@37351
   328
invariants.
wenzelm@37351
   329
wenzelm@36857
   330
* Code generator: details of internal data cache have no impact on the
wenzelm@36857
   331
user space functionality any longer.
wenzelm@36857
   332
wenzelm@37351
   333
* Methods "unfold_locales" and "intro_locales" ignore non-locale
wenzelm@37351
   334
subgoals.  This is more appropriate for interpretations with 'where'.
wenzelm@36857
   335
INCOMPATIBILITY.
haftmann@34170
   336
wenzelm@36356
   337
* Command 'example_proof' opens an empty proof body.  This allows to
wenzelm@36356
   338
experiment with Isar, without producing any persistent result.
wenzelm@36356
   339
wenzelm@35413
   340
* Commands 'type_notation' and 'no_type_notation' declare type syntax
wenzelm@35413
   341
within a local theory context, with explicit checking of the
wenzelm@35413
   342
constructors involved (in contrast to the raw 'syntax' versions).
wenzelm@35413
   343
wenzelm@36178
   344
* Commands 'types' and 'typedecl' now work within a local theory
wenzelm@36178
   345
context -- without introducing dependencies on parameters or
wenzelm@36178
   346
assumptions, which is not possible in Isabelle/Pure.
wenzelm@35681
   347
wenzelm@36857
   348
* Command 'defaultsort' has been renamed to 'default_sort', it works
wenzelm@36857
   349
within a local theory context.  Minor INCOMPATIBILITY.
wenzelm@36454
   350
haftmann@34170
   351
haftmann@33993
   352
*** HOL ***
haftmann@33993
   353
wenzelm@37351
   354
* Command 'typedef' now works within a local theory context -- without
wenzelm@37351
   355
introducing dependencies on parameters or assumptions, which is not
wenzelm@37351
   356
possible in Isabelle/Pure/HOL.  Note that the logical environment may
wenzelm@37351
   357
contain multiple interpretations of local typedefs (with different
wenzelm@37351
   358
non-emptiness proofs), even in a global theory context.
wenzelm@37351
   359
wenzelm@37351
   360
* New package for quotient types.  Commands 'quotient_type' and
wenzelm@37351
   361
'quotient_definition' may be used for defining types and constants by
wenzelm@37351
   362
quotient constructions.  An example is the type of integers created by
wenzelm@37351
   363
quotienting pairs of natural numbers:
wenzelm@37380
   364
wenzelm@37351
   365
  fun
wenzelm@37380
   366
    intrel :: "(nat * nat) => (nat * nat) => bool"
wenzelm@37351
   367
  where
wenzelm@37351
   368
    "intrel (x, y) (u, v) = (x + v = u + y)"
wenzelm@37351
   369
wenzelm@37380
   370
  quotient_type int = "nat * nat" / intrel
wenzelm@37351
   371
    by (auto simp add: equivp_def expand_fun_eq)
wenzelm@37380
   372
wenzelm@37351
   373
  quotient_definition
wenzelm@37351
   374
    "0::int" is "(0::nat, 0::nat)"
wenzelm@37351
   375
wenzelm@37351
   376
The method "lifting" can be used to lift of theorems from the
wenzelm@37351
   377
underlying "raw" type to the quotient type.  The example
wenzelm@37351
   378
src/HOL/Quotient_Examples/FSet.thy includes such a quotient
wenzelm@37351
   379
construction and provides a reasoning infrastructure for finite sets.
wenzelm@37351
   380
wenzelm@37351
   381
* Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
wenzelm@37351
   382
clash with new theory Quotient in Main HOL.
wenzelm@37351
   383
wenzelm@37351
   384
* Moved the SMT binding into the main HOL session, eliminating
wenzelm@37351
   385
separate HOL-SMT session.
wenzelm@37351
   386
haftmann@37020
   387
* List membership infix mem operation is only an input abbreviation.
haftmann@37020
   388
INCOMPATIBILITY.
haftmann@37020
   389
wenzelm@37144
   390
* Theory Library/Word.thy has been removed.  Use library Word/Word.thy
wenzelm@37144
   391
for future developements; former Library/Word.thy is still present in
wenzelm@37144
   392
the AFP entry RSAPPS.
haftmann@36963
   393
wenzelm@36857
   394
* Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
wenzelm@36857
   395
longer shadowed.  INCOMPATIBILITY.
haftmann@36808
   396
huffman@36836
   397
* Dropped theorem duplicate comp_arith; use semiring_norm instead.
huffman@36836
   398
INCOMPATIBILITY.
huffman@36836
   399
huffman@36836
   400
* Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
huffman@36836
   401
INCOMPATIBILITY.
haftmann@36714
   402
wenzelm@36857
   403
* Dropped normalizing_semiring etc; use the facts in semiring classes
wenzelm@36857
   404
instead.  INCOMPATIBILITY.
wenzelm@36857
   405
huffman@36979
   406
* Dropped several real-specific versions of lemmas about floor and
wenzelm@37351
   407
ceiling; use the generic lemmas from theory "Archimedean_Field"
wenzelm@37351
   408
instead.  INCOMPATIBILITY.
huffman@36979
   409
huffman@36979
   410
  floor_number_of_eq         ~> floor_number_of
huffman@36979
   411
  le_floor_eq_number_of      ~> number_of_le_floor
huffman@36979
   412
  le_floor_eq_zero           ~> zero_le_floor
huffman@36979
   413
  le_floor_eq_one            ~> one_le_floor
huffman@36979
   414
  floor_less_eq_number_of    ~> floor_less_number_of
huffman@36979
   415
  floor_less_eq_zero         ~> floor_less_zero
huffman@36979
   416
  floor_less_eq_one          ~> floor_less_one
huffman@36979
   417
  less_floor_eq_number_of    ~> number_of_less_floor
huffman@36979
   418
  less_floor_eq_zero         ~> zero_less_floor
huffman@36979
   419
  less_floor_eq_one          ~> one_less_floor
huffman@36979
   420
  floor_le_eq_number_of      ~> floor_le_number_of
huffman@36979
   421
  floor_le_eq_zero           ~> floor_le_zero
huffman@36979
   422
  floor_le_eq_one            ~> floor_le_one
huffman@36979
   423
  floor_subtract_number_of   ~> floor_diff_number_of
huffman@36979
   424
  floor_subtract_one         ~> floor_diff_one
huffman@36979
   425
  ceiling_number_of_eq       ~> ceiling_number_of
huffman@36979
   426
  ceiling_le_eq_number_of    ~> ceiling_le_number_of
huffman@36979
   427
  ceiling_le_zero_eq         ~> ceiling_le_zero
huffman@36979
   428
  ceiling_le_eq_one          ~> ceiling_le_one
huffman@36979
   429
  less_ceiling_eq_number_of  ~> number_of_less_ceiling
huffman@36979
   430
  less_ceiling_eq_zero       ~> zero_less_ceiling
huffman@36979
   431
  less_ceiling_eq_one        ~> one_less_ceiling
huffman@36979
   432
  ceiling_less_eq_number_of  ~> ceiling_less_number_of
huffman@36979
   433
  ceiling_less_eq_zero       ~> ceiling_less_zero
huffman@36979
   434
  ceiling_less_eq_one        ~> ceiling_less_one
huffman@36979
   435
  le_ceiling_eq_number_of    ~> number_of_le_ceiling
huffman@36979
   436
  le_ceiling_eq_zero         ~> zero_le_ceiling
huffman@36979
   437
  le_ceiling_eq_one          ~> one_le_ceiling
huffman@36979
   438
  ceiling_subtract_number_of ~> ceiling_diff_number_of
huffman@36979
   439
  ceiling_subtract_one       ~> ceiling_diff_one
huffman@36979
   440
wenzelm@37144
   441
* Theory "Finite_Set": various folding_XXX locales facilitate the
wenzelm@36857
   442
application of the various fold combinators on finite sets.
wenzelm@36857
   443
wenzelm@36857
   444
* Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
wenzelm@36857
   445
provides abstract red-black tree type which is backed by "RBT_Impl" as
wenzelm@36857
   446
implementation.  INCOMPATIBILTY.
haftmann@36147
   447
huffman@36830
   448
* Theory Library/Coinductive_List has been removed -- superseded by
wenzelm@35763
   449
AFP/thys/Coinductive.
wenzelm@35763
   450
huffman@36829
   451
* Theory PReal, including the type "preal" and related operations, has
huffman@36829
   452
been removed.  INCOMPATIBILITY.
huffman@36829
   453
wenzelm@37380
   454
* Real: new development using Cauchy Sequences.
wenzelm@37380
   455
wenzelm@37351
   456
* Split off theory "Big_Operators" containing setsum, setprod,
wenzelm@37351
   457
Inf_fin, Sup_fin, Min, Max from theory Finite_Set.  INCOMPATIBILITY.
wenzelm@36857
   458
wenzelm@36857
   459
* Theory "Rational" renamed to "Rat", for consistency with "Nat",
wenzelm@36857
   460
"Int" etc.  INCOMPATIBILITY.
wenzelm@36857
   461
wenzelm@37351
   462
* Constant Rat.normalize needs to be qualified.  INCOMPATIBILITY.
wenzelm@37143
   463
wenzelm@36857
   464
* New set of rules "ac_simps" provides combined assoc / commute
wenzelm@36857
   465
rewrites for all interpretations of the appropriate generic locales.
wenzelm@36857
   466
wenzelm@36857
   467
* Renamed theory "OrderedGroup" to "Groups" and split theory
wenzelm@36857
   468
"Ring_and_Field" into theories "Rings" and "Fields"; for more
wenzelm@36857
   469
appropriate and more consistent names suitable for name prefixes
wenzelm@36857
   470
within the HOL theories.  INCOMPATIBILITY.
haftmann@35050
   471
haftmann@35084
   472
* Some generic constants have been put to appropriate theories:
wenzelm@36857
   473
  - less_eq, less: Orderings
wenzelm@36857
   474
  - zero, one, plus, minus, uminus, times, abs, sgn: Groups
wenzelm@36857
   475
  - inverse, divide: Rings
haftmann@35084
   476
INCOMPATIBILITY.
haftmann@35084
   477
wenzelm@36857
   478
* More consistent naming of type classes involving orderings (and
wenzelm@36857
   479
lattices):
haftmann@35027
   480
haftmann@35027
   481
    lower_semilattice                   ~> semilattice_inf
haftmann@35027
   482
    upper_semilattice                   ~> semilattice_sup
haftmann@35027
   483
haftmann@35027
   484
    dense_linear_order                  ~> dense_linorder
haftmann@35027
   485
haftmann@35027
   486
    pordered_ab_group_add               ~> ordered_ab_group_add
haftmann@35027
   487
    pordered_ab_group_add_abs           ~> ordered_ab_group_add_abs
haftmann@35027
   488
    pordered_ab_semigroup_add           ~> ordered_ab_semigroup_add
haftmann@35027
   489
    pordered_ab_semigroup_add_imp_le    ~> ordered_ab_semigroup_add_imp_le
haftmann@35027
   490
    pordered_cancel_ab_semigroup_add    ~> ordered_cancel_ab_semigroup_add
haftmann@35027
   491
    pordered_cancel_comm_semiring       ~> ordered_cancel_comm_semiring
haftmann@35027
   492
    pordered_cancel_semiring            ~> ordered_cancel_semiring
haftmann@35027
   493
    pordered_comm_monoid_add            ~> ordered_comm_monoid_add
haftmann@35027
   494
    pordered_comm_ring                  ~> ordered_comm_ring
haftmann@35027
   495
    pordered_comm_semiring              ~> ordered_comm_semiring
haftmann@35027
   496
    pordered_ring                       ~> ordered_ring
haftmann@35027
   497
    pordered_ring_abs                   ~> ordered_ring_abs
haftmann@35027
   498
    pordered_semiring                   ~> ordered_semiring
haftmann@35027
   499
haftmann@35027
   500
    ordered_ab_group_add                ~> linordered_ab_group_add
haftmann@35027
   501
    ordered_ab_semigroup_add            ~> linordered_ab_semigroup_add
haftmann@35027
   502
    ordered_cancel_ab_semigroup_add     ~> linordered_cancel_ab_semigroup_add
haftmann@35027
   503
    ordered_comm_semiring_strict        ~> linordered_comm_semiring_strict
haftmann@35027
   504
    ordered_field                       ~> linordered_field
haftmann@35027
   505
    ordered_field_no_lb                 ~> linordered_field_no_lb
haftmann@35027
   506
    ordered_field_no_ub                 ~> linordered_field_no_ub
haftmann@35027
   507
    ordered_field_dense_linear_order    ~> dense_linordered_field
haftmann@35027
   508
    ordered_idom                        ~> linordered_idom
haftmann@35027
   509
    ordered_ring                        ~> linordered_ring
haftmann@35027
   510
    ordered_ring_le_cancel_factor       ~> linordered_ring_le_cancel_factor
haftmann@35027
   511
    ordered_ring_less_cancel_factor     ~> linordered_ring_less_cancel_factor
haftmann@35027
   512
    ordered_ring_strict                 ~> linordered_ring_strict
haftmann@35027
   513
    ordered_semidom                     ~> linordered_semidom
haftmann@35027
   514
    ordered_semiring                    ~> linordered_semiring
haftmann@35027
   515
    ordered_semiring_1                  ~> linordered_semiring_1
haftmann@35027
   516
    ordered_semiring_1_strict           ~> linordered_semiring_1_strict
haftmann@35027
   517
    ordered_semiring_strict             ~> linordered_semiring_strict
haftmann@35027
   518
wenzelm@36857
   519
  The following slightly odd type classes have been moved to a
wenzelm@37351
   520
  separate theory Library/Lattice_Algebras:
haftmann@35032
   521
haftmann@35032
   522
    lordered_ab_group_add               ~> lattice_ab_group_add
haftmann@35032
   523
    lordered_ab_group_add_abs           ~> lattice_ab_group_add_abs
haftmann@35032
   524
    lordered_ab_group_add_meet          ~> semilattice_inf_ab_group_add
haftmann@35032
   525
    lordered_ab_group_add_join          ~> semilattice_sup_ab_group_add
haftmann@35032
   526
    lordered_ring                       ~> lattice_ring
haftmann@35032
   527
haftmann@35027
   528
INCOMPATIBILITY.
haftmann@35027
   529
haftmann@36416
   530
* Refined field classes:
wenzelm@36857
   531
  - classes division_ring_inverse_zero, field_inverse_zero,
wenzelm@36857
   532
    linordered_field_inverse_zero include rule inverse 0 = 0 --
wenzelm@36857
   533
    subsumes former division_by_zero class;
wenzelm@36857
   534
  - numerous lemmas have been ported from field to division_ring.
wenzelm@36857
   535
INCOMPATIBILITY.
haftmann@36416
   536
haftmann@36416
   537
* Refined algebra theorem collections:
wenzelm@36857
   538
  - dropped theorem group group_simps, use algebra_simps instead;
wenzelm@36857
   539
  - dropped theorem group ring_simps, use field_simps instead;
wenzelm@36857
   540
  - proper theorem collection field_simps subsumes former theorem
wenzelm@36857
   541
    groups field_eq_simps and field_simps;
wenzelm@36857
   542
  - dropped lemma eq_minus_self_iff which is a duplicate for
wenzelm@36857
   543
    equal_neg_zero.
wenzelm@36857
   544
INCOMPATIBILITY.
wenzelm@35009
   545
wenzelm@35009
   546
* Theory Finite_Set and List: some lemmas have been generalized from
wenzelm@34076
   547
sets to lattices:
wenzelm@34076
   548
haftmann@34007
   549
  fun_left_comm_idem_inter      ~> fun_left_comm_idem_inf
haftmann@34007
   550
  fun_left_comm_idem_union      ~> fun_left_comm_idem_sup
haftmann@34007
   551
  inter_Inter_fold_inter        ~> inf_Inf_fold_inf
haftmann@34007
   552
  union_Union_fold_union        ~> sup_Sup_fold_sup
haftmann@34007
   553
  Inter_fold_inter              ~> Inf_fold_inf
haftmann@34007
   554
  Union_fold_union              ~> Sup_fold_sup
haftmann@34007
   555
  inter_INTER_fold_inter        ~> inf_INFI_fold_inf
haftmann@34007
   556
  union_UNION_fold_union        ~> sup_SUPR_fold_sup
haftmann@34007
   557
  INTER_fold_inter              ~> INFI_fold_inf
haftmann@34007
   558
  UNION_fold_union              ~> SUPR_fold_sup
haftmann@34007
   559
wenzelm@37351
   560
* Theory "Complete_Lattice": lemmas top_def and bot_def have been
haftmann@36416
   561
replaced by the more convenient lemmas Inf_empty and Sup_empty.
haftmann@36416
   562
Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
haftmann@36416
   563
by Inf_insert and Sup_insert.  Lemmas Inf_UNIV and Sup_UNIV replace
haftmann@36416
   564
former Inf_Univ and Sup_Univ.  Lemmas inf_top_right and sup_bot_right
haftmann@36416
   565
subsume inf_top and sup_bot respectively.  INCOMPATIBILITY.
haftmann@36416
   566
wenzelm@36857
   567
* Reorganized theory Multiset: swapped notation of pointwise and
wenzelm@36857
   568
multiset order:
wenzelm@37351
   569
wenzelm@36857
   570
  - pointwise ordering is instance of class order with standard syntax
wenzelm@36857
   571
    <= and <;
wenzelm@36857
   572
  - multiset ordering has syntax <=# and <#; partial order properties
wenzelm@36857
   573
    are provided by means of interpretation with prefix
wenzelm@36857
   574
    multiset_order;
wenzelm@36857
   575
  - less duplication, less historical organization of sections,
wenzelm@36857
   576
    conversion from associations lists to multisets, rudimentary code
wenzelm@36857
   577
    generation;
wenzelm@36857
   578
  - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
wenzelm@36857
   579
    if needed.
wenzelm@37351
   580
nipkow@36903
   581
Renamed:
wenzelm@37351
   582
wenzelm@37351
   583
  multiset_eq_conv_count_eq  ~>  multiset_ext_iff
wenzelm@37351
   584
  multi_count_ext  ~>  multiset_ext
wenzelm@37351
   585
  diff_union_inverse2  ~>  diff_union_cancelR
wenzelm@37351
   586
wenzelm@36857
   587
INCOMPATIBILITY.
haftmann@36416
   588
nipkow@36903
   589
* Theory Permutation: replaced local "remove" by List.remove1.
nipkow@36903
   590
haftmann@36416
   591
* Code generation: ML and OCaml code is decorated with signatures.
haftmann@36416
   592
wenzelm@35009
   593
* Theory List: added transpose.
wenzelm@35009
   594
huffman@35810
   595
* Library/Nat_Bijection.thy is a collection of bijective functions
huffman@35810
   596
between nat and other types, which supersedes the older libraries
huffman@35810
   597
Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy.  INCOMPATIBILITY.
huffman@35810
   598
huffman@35810
   599
  Constants:
huffman@35810
   600
  Nat_Int_Bij.nat2_to_nat         ~> prod_encode
huffman@35810
   601
  Nat_Int_Bij.nat_to_nat2         ~> prod_decode
huffman@35810
   602
  Nat_Int_Bij.int_to_nat_bij      ~> int_encode
huffman@35810
   603
  Nat_Int_Bij.nat_to_int_bij      ~> int_decode
huffman@35810
   604
  Countable.pair_encode           ~> prod_encode
huffman@35810
   605
  NatIso.prod2nat                 ~> prod_encode
huffman@35810
   606
  NatIso.nat2prod                 ~> prod_decode
huffman@35810
   607
  NatIso.sum2nat                  ~> sum_encode
huffman@35810
   608
  NatIso.nat2sum                  ~> sum_decode
huffman@35810
   609
  NatIso.list2nat                 ~> list_encode
huffman@35810
   610
  NatIso.nat2list                 ~> list_decode
huffman@35810
   611
  NatIso.set2nat                  ~> set_encode
huffman@35810
   612
  NatIso.nat2set                  ~> set_decode
huffman@35810
   613
huffman@35810
   614
  Lemmas:
huffman@35810
   615
  Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_decode
huffman@35810
   616
  Nat_Int_Bij.nat2_to_nat_inj     ~> inj_prod_encode
huffman@35810
   617
  Nat_Int_Bij.nat2_to_nat_surj    ~> surj_prod_encode
huffman@35810
   618
  Nat_Int_Bij.nat_to_nat2_inj     ~> inj_prod_decode
huffman@35810
   619
  Nat_Int_Bij.nat_to_nat2_surj    ~> surj_prod_decode
huffman@35810
   620
  Nat_Int_Bij.i2n_n2i_id          ~> int_encode_inverse
huffman@35810
   621
  Nat_Int_Bij.n2i_i2n_id          ~> int_decode_inverse
huffman@35810
   622
  Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
huffman@35810
   623
  Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
huffman@35810
   624
  Nat_Int_Bij.inj_nat_to_int_bij  ~> inj_int_encode
huffman@35810
   625
  Nat_Int_Bij.inj_int_to_nat_bij  ~> inj_int_decode
huffman@35810
   626
  Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_encode
huffman@35810
   627
  Nat_Int_Bij.bij_int_to_nat_bij  ~> bij_int_decode
huffman@35810
   628
blanchet@36929
   629
* Sledgehammer:
blanchet@36929
   630
  - Renamed ATP commands:
blanchet@36929
   631
    atp_info     ~> sledgehammer running_atps
blanchet@36929
   632
    atp_kill     ~> sledgehammer kill_atps
blanchet@36929
   633
    atp_messages ~> sledgehammer messages
blanchet@36929
   634
    atp_minimize ~> sledgehammer minimize
blanchet@36929
   635
    print_atps   ~> sledgehammer available_atps
blanchet@36929
   636
    INCOMPATIBILITY.
blanchet@36929
   637
  - Added user's manual ("isabelle doc sledgehammer").
blanchet@36929
   638
  - Added option syntax and "sledgehammer_params" to customize
blanchet@36929
   639
    Sledgehammer's behavior.  See the manual for details.
blanchet@36929
   640
  - Modified the Isar proof reconstruction code so that it produces
blanchet@36929
   641
    direct proofs rather than proofs by contradiction.  (This feature
blanchet@36929
   642
    is still experimental.)
blanchet@36929
   643
  - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
blanchet@36929
   644
    full-typed mode.
blanchet@36929
   645
  - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
blanchet@36929
   646
blanchet@36928
   647
* Nitpick:
blanchet@36928
   648
  - Added and implemented "binary_ints" and "bits" options.
blanchet@36928
   649
  - Added "std" option and implemented support for nonstandard models.
blanchet@36928
   650
  - Added and implemented "finitize" option to improve the precision
blanchet@36928
   651
    of infinite datatypes based on a monotonicity analysis.
blanchet@36928
   652
  - Added support for quotient types.
blanchet@36928
   653
  - Added support for "specification" and "ax_specification"
blanchet@36928
   654
    constructs.
blanchet@36928
   655
  - Added support for local definitions (for "function" and
blanchet@36928
   656
    "termination" proofs).
blanchet@36928
   657
  - Added support for term postprocessors.
blanchet@36928
   658
  - Optimized "Multiset.multiset" and "FinFun.finfun".
blanchet@36928
   659
  - Improved efficiency of "destroy_constrs" optimization.
blanchet@36928
   660
  - Fixed soundness bugs related to "destroy_constrs" optimization and
blanchet@36928
   661
    record getters.
blanchet@37272
   662
  - Fixed soundness bug related to higher-order constructors.
blanchet@37272
   663
  - Fixed soundness bug when "full_descrs" is enabled.
blanchet@36928
   664
  - Improved precision of set constructs.
blanchet@37260
   665
  - Added "atoms" option.
blanchet@36928
   666
  - Added cache to speed up repeated Kodkod invocations on the same
blanchet@36928
   667
    problems.
blanchet@36928
   668
  - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
blanchet@36928
   669
    "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
blanchet@36928
   670
    "SAT4J_Light".  INCOMPATIBILITY.
blanchet@36928
   671
  - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
blanchet@36928
   672
    "sharing_depth", and "show_skolems" options.  INCOMPATIBILITY.
blanchet@37264
   673
  - Removed "nitpick_intro" attribute.  INCOMPATIBILITY.
blanchet@36928
   674
berghofe@37361
   675
* Method "induct" now takes instantiations of the form t, where t is not
berghofe@37361
   676
  a variable, as a shorthand for "x == t", where x is a fresh variable.
berghofe@37361
   677
  If this is not intended, t has to be enclosed in parentheses.
berghofe@37361
   678
  By default, the equalities generated by definitional instantiations
berghofe@37361
   679
  are pre-simplified, which may cause parameters of inductive cases
berghofe@37361
   680
  to disappear, or may even delete some of the inductive cases.
berghofe@37361
   681
  Use "induct (no_simp)" instead of "induct" to restore the old
berghofe@37361
   682
  behaviour. The (no_simp) option is also understood by the "cases"
berghofe@37361
   683
  and "nominal_induct" methods, which now perform pre-simplification, too.
berghofe@37361
   684
  INCOMPATIBILITY.
berghofe@37361
   685
haftmann@33993
   686
huffman@36828
   687
*** HOLCF ***
huffman@36828
   688
huffman@36828
   689
* Variable names in lemmas generated by the domain package have
huffman@36828
   690
changed; the naming scheme is now consistent with the HOL datatype
huffman@36828
   691
package.  Some proof scripts may be affected, INCOMPATIBILITY.
huffman@36828
   692
huffman@36828
   693
* The domain package no longer defines the function "foo_copy" for
huffman@36828
   694
recursive domain "foo".  The reach lemma is now stated directly in
huffman@36828
   695
terms of "foo_take".  Lemmas and proofs that mention "foo_copy" must
huffman@36828
   696
be reformulated in terms of "foo_take", INCOMPATIBILITY.
huffman@36828
   697
huffman@36828
   698
* Most definedness lemmas generated by the domain package (previously
huffman@36828
   699
of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
huffman@36828
   700
like "foo$x = UU <-> x = UU", which works better as a simp rule.
wenzelm@37351
   701
Proofs that used definedness lemmas as intro rules may break,
huffman@36828
   702
potential INCOMPATIBILITY.
huffman@36828
   703
huffman@36828
   704
* Induction and casedist rules generated by the domain package now
huffman@36828
   705
declare proper case_names (one called "bottom", and one named for each
huffman@36828
   706
constructor).  INCOMPATIBILITY.
huffman@36828
   707
huffman@36828
   708
* For mutually-recursive domains, separate "reach" and "take_lemma"
huffman@36828
   709
rules are generated for each domain, INCOMPATIBILITY.
huffman@36828
   710
huffman@36828
   711
  foo_bar.reach       ~> foo.reach  bar.reach
huffman@36828
   712
  foo_bar.take_lemmas ~> foo.take_lemma  bar.take_lemma
huffman@36828
   713
huffman@36828
   714
* Some lemmas generated by the domain package have been renamed for
huffman@36828
   715
consistency with the datatype package, INCOMPATIBILITY.
huffman@36828
   716
huffman@36828
   717
  foo.ind        ~> foo.induct
huffman@36828
   718
  foo.finite_ind ~> foo.finite_induct
huffman@36828
   719
  foo.coind      ~> foo.coinduct
huffman@36828
   720
  foo.casedist   ~> foo.exhaust
huffman@36828
   721
  foo.exhaust    ~> foo.nchotomy
huffman@36828
   722
huffman@36828
   723
* For consistency with other definition packages, the fixrec package
huffman@36828
   724
now generates qualified theorem names, INCOMPATIBILITY.
huffman@36828
   725
huffman@36828
   726
  foo_simps  ~> foo.simps
huffman@36828
   727
  foo_unfold ~> foo.unfold
huffman@36828
   728
  foo_induct ~> foo.induct
huffman@36828
   729
huffman@37087
   730
* The "fixrec_simp" attribute has been removed.  The "fixrec_simp"
huffman@37087
   731
method and internal fixrec proofs now use the default simpset instead.
huffman@37087
   732
INCOMPATIBILITY.
huffman@37087
   733
huffman@36828
   734
* The "contlub" predicate has been removed.  Proof scripts should use
huffman@36828
   735
lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
huffman@36828
   736
huffman@36828
   737
* The "admw" predicate has been removed, INCOMPATIBILITY.
huffman@36828
   738
huffman@36828
   739
* The constants cpair, cfst, and csnd have been removed in favor of
huffman@36828
   740
Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
huffman@36828
   741
huffman@36828
   742
haftmann@33993
   743
*** ML ***
haftmann@33993
   744
wenzelm@37351
   745
* Antiquotations for basic formal entities:
wenzelm@37351
   746
wenzelm@37351
   747
    @{class NAME}         -- type class
wenzelm@37351
   748
    @{class_syntax NAME}  -- syntax representation of the above
wenzelm@37351
   749
wenzelm@37351
   750
    @{type_name NAME}     -- logical type
wenzelm@37351
   751
    @{type_abbrev NAME}   -- type abbreviation
wenzelm@37351
   752
    @{nonterminal NAME}   -- type of concrete syntactic category
wenzelm@37351
   753
    @{type_syntax NAME}   -- syntax representation of any of the above
wenzelm@37351
   754
wenzelm@37351
   755
    @{const_name NAME}    -- logical constant (INCOMPATIBILITY)
wenzelm@37351
   756
    @{const_abbrev NAME}  -- abbreviated constant
wenzelm@37351
   757
    @{const_syntax NAME}  -- syntax representation of any of the above
wenzelm@37351
   758
wenzelm@37351
   759
* Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
wenzelm@37351
   760
syntax constant (cf. 'syntax' command).
wenzelm@37351
   761
wenzelm@37351
   762
* Antiquotation @{make_string} inlines a function to print arbitrary
wenzelm@37351
   763
values similar to the ML toplevel.  The result is compiler dependent
wenzelm@37351
   764
and may fall back on "?" in certain situations.
wenzelm@37351
   765
wenzelm@37351
   766
* Diagnostic commands 'ML_val' and 'ML_command' may refer to
wenzelm@37351
   767
antiquotations @{Isar.state} and @{Isar.goal}.  This replaces impure
wenzelm@37351
   768
Isar.state() and Isar.goal(), which belong to the old TTY loop and do
wenzelm@37351
   769
not work with the asynchronous Isar document model.
wenzelm@37351
   770
wenzelm@37351
   771
* Configuration options now admit dynamic default values, depending on
wenzelm@37351
   772
the context or even global references.
wenzelm@37351
   773
wenzelm@37351
   774
* SHA1.digest digests strings according to SHA-1 (see RFC 3174).  It
wenzelm@37351
   775
uses an efficient external library if available (for Poly/ML).
wenzelm@37351
   776
wenzelm@37144
   777
* Renamed some important ML structures, while keeping the old names
wenzelm@37144
   778
for some time as aliases within the structure Legacy:
wenzelm@37144
   779
wenzelm@37144
   780
  OuterKeyword  ~>  Keyword
wenzelm@37144
   781
  OuterLex      ~>  Token
wenzelm@37144
   782
  OuterParse    ~>  Parse
wenzelm@37144
   783
  OuterSyntax   ~>  Outer_Syntax
wenzelm@37216
   784
  PrintMode     ~>  Print_Mode
wenzelm@37144
   785
  SpecParse     ~>  Parse_Spec
wenzelm@37216
   786
  ThyInfo       ~>  Thy_Info
wenzelm@37216
   787
  ThyLoad       ~>  Thy_Load
wenzelm@37216
   788
  ThyOutput     ~>  Thy_Output
wenzelm@37145
   789
  TypeInfer     ~>  Type_Infer
wenzelm@37144
   790
wenzelm@37144
   791
Note that "open Legacy" simplifies porting of sources, but forgetting
wenzelm@37144
   792
to remove it again will complicate porting again in the future.
wenzelm@37144
   793
wenzelm@37144
   794
* Most operations that refer to a global context are named
wenzelm@37144
   795
accordingly, e.g. Simplifier.global_context or
wenzelm@37144
   796
ProofContext.init_global.  There are some situations where a global
wenzelm@37144
   797
context actually works, but under normal circumstances one needs to
wenzelm@37144
   798
pass the proper local context through the code!
wenzelm@37144
   799
wenzelm@37144
   800
* Discontinued old TheoryDataFun with its copy/init operation -- data
wenzelm@37144
   801
needs to be pure.  Functor Theory_Data_PP retains the traditional
wenzelm@37144
   802
Pretty.pp argument to merge, which is absent in the standard
wenzelm@37144
   803
Theory_Data version.
wenzelm@36429
   804
wenzelm@37144
   805
* Sorts.certify_sort and derived "cert" operations for types and terms
wenzelm@37144
   806
no longer minimize sorts.  Thus certification at the boundary of the
wenzelm@37144
   807
inference kernel becomes invariant under addition of class relations,
wenzelm@37144
   808
which is an important monotonicity principle.  Sorts are now minimized
wenzelm@37144
   809
in the syntax layer only, at the boundary between the end-user and the
wenzelm@37144
   810
system.  Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
wenzelm@37144
   811
explicitly in rare situations.
wenzelm@37144
   812
wenzelm@35021
   813
* Renamed old-style Drule.standard to Drule.export_without_context, to
wenzelm@35021
   814
emphasize that this is in no way a standard operation.
wenzelm@35021
   815
INCOMPATIBILITY.
wenzelm@35021
   816
wenzelm@34076
   817
* Subgoal.FOCUS (and variants): resulting goal state is normalized as
wenzelm@34076
   818
usual for resolution.  Rare INCOMPATIBILITY.
wenzelm@34076
   819
wenzelm@35845
   820
* Renamed varify/unvarify operations to varify_global/unvarify_global
wenzelm@35845
   821
to emphasize that these only work in a global situation (which is
wenzelm@35845
   822
quite rare).
wenzelm@35845
   823
wenzelm@37144
   824
* Curried take and drop in library.ML; negative length is interpreted
wenzelm@37144
   825
as infinity (as in chop).  Subtle INCOMPATIBILITY.
wenzelm@36961
   826
wenzelm@37351
   827
* Proof terms: type substitutions on proof constants now use canonical
wenzelm@37351
   828
order of type variables.  INCOMPATIBILITY for tools working with proof
wenzelm@37351
   829
terms.
wenzelm@37351
   830
wenzelm@37351
   831
* Raw axioms/defs may no longer carry sort constraints, and raw defs
wenzelm@37351
   832
may no longer carry premises.  User-level specifications are
wenzelm@37351
   833
transformed accordingly by Thm.add_axiom/add_def.
wenzelm@37351
   834
haftmann@33993
   835
wenzelm@34238
   836
*** System ***
wenzelm@34238
   837
wenzelm@34238
   838
* Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
wenzelm@34238
   839
ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions.  Note that
wenzelm@34238
   840
proof terms are enabled unconditionally in the new HOL-Proofs image.
wenzelm@34238
   841
wenzelm@34255
   842
* Discontinued old ISABELLE and ISATOOL environment settings (legacy
wenzelm@34255
   843
feature since Isabelle2009).  Use ISABELLE_PROCESS and ISABELLE_TOOL,
wenzelm@34255
   844
respectively.
wenzelm@34255
   845
wenzelm@36201
   846
* Old lib/scripts/polyml-platform is superseded by the
wenzelm@36201
   847
ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
wenzelm@36201
   848
variant, even on a 64 bit machine.  The following example setting
wenzelm@36201
   849
prefers 64 bit if available:
wenzelm@36201
   850
wenzelm@36201
   851
  ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
wenzelm@36201
   852
wenzelm@37218
   853
* The preliminary Isabelle/jEdit application demonstrates the emerging
wenzelm@37218
   854
Isabelle/Scala layer for advanced prover interaction and integration.
wenzelm@37218
   855
See src/Tools/jEdit or "isabelle jedit" provided by the properly built
wenzelm@37218
   856
component.
wenzelm@37218
   857
wenzelm@37375
   858
* "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
wenzelm@37375
   859
and Bluesky TeX fonts.  It provides the usual Isabelle symbols,
wenzelm@37375
   860
similar to the default assignment of the document preparation system
wenzelm@37375
   861
(cf. isabellesym.sty).  The Isabelle/Scala class Isabelle_System
wenzelm@37375
   862
provides some operations for direct access to the font without asking
wenzelm@37375
   863
the user for manual installation.
wenzelm@37375
   864
wenzelm@34238
   865
haftmann@33993
   866
wenzelm@33842
   867
New in Isabelle2009-1 (December 2009)
wenzelm@33842
   868
-------------------------------------
wenzelm@30904
   869
wenzelm@31547
   870
*** General ***
wenzelm@31547
   871
wenzelm@31547
   872
* Discontinued old form of "escaped symbols" such as \\<forall>.  Only
wenzelm@31547
   873
one backslash should be used, even in ML sources.
wenzelm@31547
   874
wenzelm@31547
   875
haftmann@30951
   876
*** Pure ***
haftmann@30951
   877
ballarin@32846
   878
* Locale interpretation propagates mixins along the locale hierarchy.
ballarin@32846
   879
The currently only available mixins are the equations used to map
ballarin@32846
   880
local definitions to terms of the target domain of an interpretation.
ballarin@32846
   881
wenzelm@33842
   882
* Reactivated diagnostic command 'print_interps'.  Use "print_interps
wenzelm@33842
   883
loc" to print all interpretations of locale "loc" in the theory.
wenzelm@33842
   884
Interpretations in proofs are not shown.
ballarin@32846
   885
ballarin@32983
   886
* Thoroughly revised locales tutorial.  New section on conditional
ballarin@32983
   887
interpretation.
ballarin@32983
   888
wenzelm@33843
   889
* On instantiation of classes, remaining undefined class parameters
wenzelm@33843
   890
are formally declared.  INCOMPATIBILITY.
wenzelm@33843
   891
haftmann@30951
   892
wenzelm@33842
   893
*** Document preparation ***
wenzelm@33842
   894
wenzelm@33842
   895
* New generalized style concept for printing terms: @{foo (style) ...}
wenzelm@33842
   896
instead of @{foo_style style ...}  (old form is still retained for
wenzelm@33842
   897
backward compatibility).  Styles can be also applied for
wenzelm@33842
   898
antiquotations prop, term_type and typeof.
haftmann@32891
   899
haftmann@32891
   900
haftmann@30930
   901
*** HOL ***
haftmann@30930
   902
wenzelm@33842
   903
* New proof method "smt" for a combination of first-order logic with
wenzelm@33842
   904
equality, linear and nonlinear (natural/integer/real) arithmetic, and
wenzelm@33842
   905
fixed-size bitvectors; there is also basic support for higher-order
wenzelm@33842
   906
features (esp. lambda abstractions).  It is an incomplete decision
wenzelm@33842
   907
procedure based on external SMT solvers using the oracle mechanism;
wenzelm@33842
   908
for the SMT solver Z3, this method is proof-producing.  Certificates
wenzelm@33842
   909
are provided to avoid calling the external solvers solely for
wenzelm@33842
   910
re-checking proofs.  Due to a remote SMT service there is no need for
wenzelm@33842
   911
installing SMT solvers locally.  See src/HOL/SMT.
wenzelm@33842
   912
wenzelm@33842
   913
* New commands to load and prove verification conditions generated by
wenzelm@33842
   914
the Boogie program verifier or derived systems (e.g. the Verifying C
wenzelm@33842
   915
Compiler (VCC) or Spec#).  See src/HOL/Boogie.
wenzelm@33842
   916
wenzelm@33842
   917
* New counterexample generator tool 'nitpick' based on the Kodkod
wenzelm@33842
   918
relational model finder.  See src/HOL/Tools/Nitpick and
wenzelm@33842
   919
src/HOL/Nitpick_Examples.
wenzelm@33842
   920
haftmann@33860
   921
* New commands 'code_pred' and 'values' to invoke the predicate
haftmann@33860
   922
compiler and to enumerate values of inductive predicates.
haftmann@33860
   923
haftmann@33860
   924
* A tabled implementation of the reflexive transitive closure.
haftmann@33860
   925
haftmann@33860
   926
* New implementation of quickcheck uses generic code generator;
haftmann@33860
   927
default generators are provided for all suitable HOL types, records
haftmann@33860
   928
and datatypes.  Old quickcheck can be re-activated importing theory
haftmann@33860
   929
Library/SML_Quickcheck.
haftmann@33860
   930
wenzelm@33843
   931
* New testing tool Mirabelle for automated proof tools.  Applies
wenzelm@33843
   932
several tools and tactics like sledgehammer, metis, or quickcheck, to
wenzelm@33843
   933
every proof step in a theory.  To be used in batch mode via the
wenzelm@33843
   934
"mirabelle" utility.
wenzelm@33843
   935
wenzelm@33843
   936
* New proof method "sos" (sum of squares) for nonlinear real
wenzelm@33843
   937
arithmetic (originally due to John Harison). It requires theory
wenzelm@33843
   938
Library/Sum_Of_Squares.  It is not a complete decision procedure but
wenzelm@33843
   939
works well in practice on quantifier-free real arithmetic with +, -,
wenzelm@33843
   940
*, ^, =, <= and <, i.e. boolean combinations of equalities and
wenzelm@33843
   941
inequalities between polynomials.  It makes use of external
wenzelm@33843
   942
semidefinite programming solvers.  Method "sos" generates a
wenzelm@33843
   943
certificate that can be pasted into the proof thus avoiding the need
wenzelm@33843
   944
to call an external tool every time the proof is checked.  See
wenzelm@33843
   945
src/HOL/Library/Sum_Of_Squares.
wenzelm@33843
   946
wenzelm@33843
   947
* New method "linarith" invokes existing linear arithmetic decision
wenzelm@33843
   948
procedure only.
wenzelm@33843
   949
wenzelm@33843
   950
* New command 'atp_minimal' reduces result produced by Sledgehammer.
wenzelm@33843
   951
wenzelm@33843
   952
* New Sledgehammer option "Full Types" in Proof General settings menu.
wenzelm@33843
   953
Causes full type information to be output to the ATPs.  This slows
wenzelm@33843
   954
ATPs down considerably but eliminates a source of unsound "proofs"
wenzelm@33843
   955
that fail later.
wenzelm@33843
   956
wenzelm@33843
   957
* New method "metisFT": A version of metis that uses full type
wenzelm@33843
   958
information in order to avoid failures of proof reconstruction.
wenzelm@33843
   959
wenzelm@33843
   960
* New evaluator "approximate" approximates an real valued term using
wenzelm@33843
   961
the same method as the approximation method.
wenzelm@33843
   962
wenzelm@33843
   963
* Method "approximate" now supports arithmetic expressions as
wenzelm@33843
   964
boundaries of intervals and implements interval splitting and Taylor
wenzelm@33843
   965
series expansion.
wenzelm@33843
   966
wenzelm@33843
   967
* ML antiquotation @{code_datatype} inserts definition of a datatype
wenzelm@33843
   968
generated by the code generator; e.g. see src/HOL/Predicate.thy.
wenzelm@33843
   969
haftmann@33860
   970
* New theory SupInf of the supremum and infimum operators for sets of
haftmann@33860
   971
reals.
haftmann@33860
   972
haftmann@33860
   973
* New theory Probability, which contains a development of measure
haftmann@33860
   974
theory, eventually leading to Lebesgue integration and probability.
haftmann@33860
   975
haftmann@33860
   976
* Extended Multivariate Analysis to include derivation and Brouwer's
haftmann@33860
   977
fixpoint theorem.
wenzelm@33843
   978
wenzelm@33842
   979
* Reorganization of number theory, INCOMPATIBILITY:
wenzelm@33873
   980
  - new number theory development for nat and int, in theories Divides
wenzelm@33873
   981
    and GCD as well as in new session Number_Theory
wenzelm@33873
   982
  - some constants and facts now suffixed with _nat and _int
wenzelm@33873
   983
    accordingly
wenzelm@33873
   984
  - former session NumberTheory now named Old_Number_Theory, including
wenzelm@33873
   985
    theories Legacy_GCD and Primes (prefer Number_Theory if possible)
wenzelm@33842
   986
  - moved theory Pocklington from src/HOL/Library to
wenzelm@33842
   987
    src/HOL/Old_Number_Theory
haftmann@32479
   988
wenzelm@33873
   989
* Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
wenzelm@33873
   990
lcm of finite and infinite sets. It is shown that they form a complete
haftmann@32600
   991
lattice.
haftmann@32600
   992
haftmann@32600
   993
* Class semiring_div requires superclass no_zero_divisors and proof of
haftmann@32600
   994
div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
haftmann@32600
   995
div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
haftmann@32600
   996
generalized to class semiring_div, subsuming former theorems
haftmann@32600
   997
zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
haftmann@32600
   998
zdiv_zmult_zmult2.  div_mult_mult1 is now [simp] by default.
haftmann@32600
   999
INCOMPATIBILITY.
haftmann@32600
  1000
haftmann@32588
  1001
* Refinements to lattice classes and sets:
haftmann@32064
  1002
  - less default intro/elim rules in locale variant, more default
haftmann@32064
  1003
    intro/elim rules in class variant: more uniformity
wenzelm@33842
  1004
  - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
wenzelm@33842
  1005
    le_inf_iff
wenzelm@33842
  1006
  - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
wenzelm@33842
  1007
    sup_aci)
haftmann@32064
  1008
  - renamed ACI to inf_sup_aci
haftmann@32600
  1009
  - new class "boolean_algebra"
wenzelm@33842
  1010
  - class "complete_lattice" moved to separate theory
haftmann@33860
  1011
    "Complete_Lattice"; corresponding constants (and abbreviations)
wenzelm@33842
  1012
    renamed and with authentic syntax:
haftmann@33860
  1013
    Set.Inf ~>    Complete_Lattice.Inf
haftmann@33860
  1014
    Set.Sup ~>    Complete_Lattice.Sup
haftmann@33860
  1015
    Set.INFI ~>   Complete_Lattice.INFI
haftmann@33860
  1016
    Set.SUPR ~>   Complete_Lattice.SUPR
haftmann@33860
  1017
    Set.Inter ~>  Complete_Lattice.Inter
haftmann@33860
  1018
    Set.Union ~>  Complete_Lattice.Union
haftmann@33860
  1019
    Set.INTER ~>  Complete_Lattice.INTER
haftmann@33860
  1020
    Set.UNION ~>  Complete_Lattice.UNION
haftmann@32600
  1021
  - authentic syntax for
haftmann@32600
  1022
    Set.Pow
haftmann@32600
  1023
    Set.image
haftmann@32588
  1024
  - mere abbreviations:
haftmann@32588
  1025
    Set.empty               (for bot)
haftmann@32588
  1026
    Set.UNIV                (for top)
haftmann@33860
  1027
    Set.inter               (for inf, formerly Set.Int)
haftmann@33860
  1028
    Set.union               (for sup, formerly Set.Un)
haftmann@32588
  1029
    Complete_Lattice.Inter  (for Inf)
haftmann@32588
  1030
    Complete_Lattice.Union  (for Sup)
haftmann@32606
  1031
    Complete_Lattice.INTER  (for INFI)
haftmann@32606
  1032
    Complete_Lattice.UNION  (for SUPR)
haftmann@32600
  1033
  - object-logic definitions as far as appropriate
haftmann@32217
  1034
haftmann@32691
  1035
INCOMPATIBILITY.  Care is required when theorems Int_subset_iff or
wenzelm@33842
  1036
Un_subset_iff are explicitly deleted as default simp rules; then also
wenzelm@33842
  1037
their lattice counterparts le_inf_iff and le_sup_iff have to be
haftmann@32691
  1038
deleted to achieve the desired effect.
haftmann@32064
  1039
wenzelm@33842
  1040
* Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
wenzelm@33842
  1041
rules by default any longer; the same applies to min_max.inf_absorb1
wenzelm@33842
  1042
etc.  INCOMPATIBILITY.
wenzelm@33842
  1043
wenzelm@33842
  1044
* Rules sup_Int_eq and sup_Un_eq are no longer declared as
wenzelm@33842
  1045
pred_set_conv by default.  INCOMPATIBILITY.
wenzelm@33842
  1046
wenzelm@33842
  1047
* Power operations on relations and functions are now one dedicated
haftmann@32706
  1048
constant "compow" with infix syntax "^^".  Power operation on
wenzelm@31547
  1049
multiplicative monoids retains syntax "^" and is now defined generic
wenzelm@31547
  1050
in class power.  INCOMPATIBILITY.
wenzelm@31547
  1051
wenzelm@33842
  1052
* Relation composition "R O S" now has a more standard argument order:
wenzelm@33842
  1053
"R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}".  INCOMPATIBILITY,
wenzelm@33842
  1054
rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
wenzelm@33842
  1055
break, since the O_assoc rule was not rewritten like this.  Fix using
wenzelm@33842
  1056
O_assoc[symmetric].  The same applies to the curried version "R OO S".
wenzelm@32427
  1057
nipkow@33057
  1058
* Function "Inv" is renamed to "inv_into" and function "inv" is now an
wenzelm@33842
  1059
abbreviation for "inv_into UNIV".  Lemmas are renamed accordingly.
nipkow@32988
  1060
INCOMPATIBILITY.
nipkow@32988
  1061
haftmann@33860
  1062
* Most rules produced by inductive and datatype package have mandatory
haftmann@33860
  1063
prefixes.  INCOMPATIBILITY.
nipkow@31790
  1064
wenzelm@33842
  1065
* Changed "DERIV_intros" to a dynamic fact, which can be augmented by
wenzelm@33842
  1066
the attribute of the same name.  Each of the theorems in the list
wenzelm@33842
  1067
DERIV_intros assumes composition with an additional function and
wenzelm@33842
  1068
matches a variable to the derivative, which has to be solved by the
wenzelm@33842
  1069
Simplifier.  Hence (auto intro!: DERIV_intros) computes the derivative
wenzelm@33873
  1070
of most elementary terms.  Former Maclauren.DERIV_tac and
wenzelm@33873
  1071
Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
wenzelm@33873
  1072
INCOMPATIBILITY.
haftmann@33860
  1073
haftmann@33860
  1074
* Code generator attributes follow the usual underscore convention:
haftmann@33860
  1075
    code_unfold     replaces    code unfold
haftmann@33860
  1076
    code_post       replaces    code post
haftmann@33860
  1077
    etc.
haftmann@33860
  1078
  INCOMPATIBILITY.
wenzelm@31900
  1079
krauss@33471
  1080
* Renamed methods:
krauss@33471
  1081
    sizechange -> size_change
krauss@33471
  1082
    induct_scheme -> induction_schema
haftmann@33860
  1083
  INCOMPATIBILITY.
nipkow@33673
  1084
wenzelm@33843
  1085
* Discontinued abbreviation "arbitrary" of constant "undefined".
wenzelm@33843
  1086
INCOMPATIBILITY, use "undefined" directly.
wenzelm@33843
  1087
haftmann@33860
  1088
* Renamed theorems:
haftmann@33860
  1089
    Suc_eq_add_numeral_1 -> Suc_eq_plus1
haftmann@33860
  1090
    Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
haftmann@33860
  1091
    Suc_plus1 -> Suc_eq_plus1
haftmann@33860
  1092
    *anti_sym -> *antisym*
haftmann@33860
  1093
    vector_less_eq_def -> vector_le_def
haftmann@33860
  1094
  INCOMPATIBILITY.
haftmann@33860
  1095
haftmann@33860
  1096
* Added theorem List.map_map as [simp].  Removed List.map_compose.
haftmann@33860
  1097
INCOMPATIBILITY.
haftmann@33860
  1098
haftmann@33860
  1099
* Removed predicate "M hassize n" (<--> card M = n & finite M).
haftmann@33860
  1100
INCOMPATIBILITY.
haftmann@33860
  1101
hoelzl@31812
  1102
huffman@33825
  1103
*** HOLCF ***
huffman@33825
  1104
wenzelm@33842
  1105
* Theory Representable defines a class "rep" of domains that are
wenzelm@33842
  1106
representable (via an ep-pair) in the universal domain type "udom".
huffman@33825
  1107
Instances are provided for all type constructors defined in HOLCF.
huffman@33825
  1108
huffman@33825
  1109
* The 'new_domain' command is a purely definitional version of the
huffman@33825
  1110
domain package, for representable domains.  Syntax is identical to the
huffman@33825
  1111
old domain package.  The 'new_domain' package also supports indirect
huffman@33825
  1112
recursion using previously-defined type constructors.  See
wenzelm@33842
  1113
src/HOLCF/ex/New_Domain.thy for examples.
wenzelm@33842
  1114
wenzelm@33842
  1115
* Method "fixrec_simp" unfolds one step of a fixrec-defined constant
huffman@33825
  1116
on the left-hand side of an equation, and then performs
huffman@33825
  1117
simplification.  Rewriting is done using rules declared with the
wenzelm@33842
  1118
"fixrec_simp" attribute.  The "fixrec_simp" method is intended as a
wenzelm@33842
  1119
replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
huffman@33825
  1120
huffman@33825
  1121
* The pattern-match compiler in 'fixrec' can now handle constructors
huffman@33825
  1122
with HOL function types.  Pattern-match combinators for the Pair
huffman@33825
  1123
constructor are pre-configured.
huffman@33825
  1124
huffman@33825
  1125
* The 'fixrec' package now produces better fixed-point induction rules
huffman@33825
  1126
for mutually-recursive definitions:  Induction rules have conclusions
huffman@33825
  1127
of the form "P foo bar" instead of "P <foo, bar>".
huffman@33825
  1128
huffman@33825
  1129
* The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
huffman@33825
  1130
been renamed to "below".  The name "below" now replaces "less" in many
wenzelm@33842
  1131
theorem names.  (Legacy theorem names using "less" are still supported
wenzelm@33842
  1132
as well.)
huffman@33825
  1133
huffman@33825
  1134
* The 'fixrec' package now supports "bottom patterns".  Bottom
huffman@33825
  1135
patterns can be used to generate strictness rules, or to make
huffman@33825
  1136
functions more strict (much like the bang-patterns supported by the
wenzelm@33873
  1137
Glasgow Haskell Compiler).  See src/HOLCF/ex/Fixrec_ex.thy for
wenzelm@33873
  1138
examples.
huffman@33825
  1139
huffman@33825
  1140
wenzelm@31304
  1141
*** ML ***
wenzelm@31304
  1142
wenzelm@33843
  1143
* Support for Poly/ML 5.3.0, with improved reporting of compiler
wenzelm@33843
  1144
errors and run-time exceptions, including detailed source positions.
wenzelm@33843
  1145
wenzelm@33843
  1146
* Structure Name_Space (formerly NameSpace) now manages uniquely
wenzelm@33843
  1147
identified entries, with some additional information such as source
wenzelm@33843
  1148
position, logical grouping etc.
wenzelm@33843
  1149
wenzelm@33524
  1150
* Theory and context data is now introduced by the simplified and
wenzelm@33524
  1151
modernized functors Theory_Data, Proof_Data, Generic_Data.  Data needs
wenzelm@33524
  1152
to be pure, but the old TheoryDataFun for mutable data (with explicit
wenzelm@33524
  1153
copy operation) is still available for some time.
wenzelm@33524
  1154
wenzelm@32742
  1155
* Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
wenzelm@32742
  1156
provides a high-level programming interface to synchronized state
wenzelm@32742
  1157
variables with atomic update.  This works via pure function
wenzelm@32742
  1158
application within a critical section -- its runtime should be as
wenzelm@32742
  1159
short as possible; beware of deadlocks if critical code is nested,
wenzelm@32742
  1160
either directly or indirectly via other synchronized variables!
wenzelm@32742
  1161
wenzelm@32742
  1162
* Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
wenzelm@32742
  1163
wraps raw ML references, explicitly indicating their non-thread-safe
wenzelm@32742
  1164
behaviour.  The Isar toplevel keeps this structure open, to
wenzelm@32742
  1165
accommodate Proof General as well as quick and dirty interactive
wenzelm@32742
  1166
experiments with references.
wenzelm@32742
  1167
wenzelm@32365
  1168
* PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
wenzelm@32365
  1169
parallel tactical reasoning.
wenzelm@32365
  1170
wenzelm@32427
  1171
* Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
wenzelm@32427
  1172
are similar to SUBPROOF, but are slightly more flexible: only the
wenzelm@32427
  1173
specified parts of the subgoal are imported into the context, and the
wenzelm@32427
  1174
body tactic may introduce new subgoals and schematic variables.
wenzelm@32427
  1175
wenzelm@32427
  1176
* Old tactical METAHYPS, which does not observe the proof context, has
wenzelm@32427
  1177
been renamed to Old_Goals.METAHYPS and awaits deletion.  Use SUBPROOF
wenzelm@32427
  1178
or Subgoal.FOCUS etc.
wenzelm@32216
  1179
wenzelm@31971
  1180
* Renamed functor TableFun to Table, and GraphFun to Graph.  (Since
wenzelm@31971
  1181
functors have their own ML name space there is no point to mark them
wenzelm@31971
  1182
separately.)  Minor INCOMPATIBILITY.
wenzelm@31971
  1183
wenzelm@31901
  1184
* Renamed NamedThmsFun to Named_Thms.  INCOMPATIBILITY.
wenzelm@31901
  1185
wenzelm@33842
  1186
* Renamed several structures FooBar to Foo_Bar.  Occasional,
wenzelm@33842
  1187
INCOMPATIBILITY.
wenzelm@33842
  1188
wenzelm@33843
  1189
* Operations of structure Skip_Proof no longer require quick_and_dirty
wenzelm@33843
  1190
mode, which avoids critical setmp.
wenzelm@33843
  1191
wenzelm@31306
  1192
* Eliminated old Attrib.add_attributes, Method.add_methods and related
wenzelm@33842
  1193
combinators for "args".  INCOMPATIBILITY, need to use simplified
wenzelm@31306
  1194
Attrib/Method.setup introduced in Isabelle2009.
wenzelm@31304
  1195
wenzelm@32151
  1196
* Proper context for simpset_of, claset_of, clasimpset_of.  May fall
wenzelm@32151
  1197
back on global_simpset_of, global_claset_of, global_clasimpset_of as
wenzelm@32151
  1198
last resort.  INCOMPATIBILITY.
wenzelm@32151
  1199
wenzelm@32092
  1200
* Display.pretty_thm now requires a proper context (cf. former
wenzelm@32092
  1201
ProofContext.pretty_thm).  May fall back on Display.pretty_thm_global
wenzelm@32092
  1202
or even Display.pretty_thm_without_context as last resort.
wenzelm@32092
  1203
INCOMPATIBILITY.
wenzelm@32092
  1204
wenzelm@32433
  1205
* Discontinued Display.pretty_ctyp/cterm etc.  INCOMPATIBILITY, use
wenzelm@32433
  1206
Syntax.pretty_typ/term directly, preferably with proper context
wenzelm@32433
  1207
instead of global theory.
wenzelm@32433
  1208
wenzelm@31304
  1209
wenzelm@31308
  1210
*** System ***
wenzelm@31308
  1211
wenzelm@33842
  1212
* Further fine tuning of parallel proof checking, scales up to 8 cores
wenzelm@33842
  1213
(max. speedup factor 5.0).  See also Goal.parallel_proofs in ML and
wenzelm@33842
  1214
usedir option -q.
wenzelm@33842
  1215
wenzelm@32326
  1216
* Support for additional "Isabelle components" via etc/components, see
wenzelm@32326
  1217
also the system manual.
wenzelm@32326
  1218
wenzelm@32326
  1219
* The isabelle makeall tool now operates on all components with
wenzelm@32326
  1220
IsaMakefile, not just hardwired "logics".
wenzelm@32326
  1221
wenzelm@33842
  1222
* Removed "compress" option from isabelle-process and isabelle usedir;
wenzelm@33842
  1223
this is always enabled.
kleing@33818
  1224
wenzelm@31308
  1225
* Discontinued support for Poly/ML 4.x versions.
wenzelm@31308
  1226
wenzelm@33842
  1227
* Isabelle tool "wwwfind" provides web interface for 'find_theorems'
wenzelm@33842
  1228
on a given logic image.  This requires the lighttpd webserver and is
wenzelm@33842
  1229
currently supported on Linux only.
wenzelm@32061
  1230
wenzelm@31308
  1231
wenzelm@31304
  1232
wenzelm@30845
  1233
New in Isabelle2009 (April 2009)
wenzelm@30845
  1234
--------------------------------
haftmann@27104
  1235
wenzelm@27599
  1236
*** General ***
wenzelm@27599
  1237
wenzelm@28504
  1238
* Simplified main Isabelle executables, with less surprises on
wenzelm@28504
  1239
case-insensitive file-systems (such as Mac OS).
wenzelm@28504
  1240
wenzelm@28504
  1241
  - The main Isabelle tool wrapper is now called "isabelle" instead of
wenzelm@28504
  1242
    "isatool."
wenzelm@28504
  1243
wenzelm@28504
  1244
  - The former "isabelle" alias for "isabelle-process" has been
wenzelm@28504
  1245
    removed (should rarely occur to regular users).
wenzelm@28504
  1246
wenzelm@28915
  1247
  - The former "isabelle-interface" and its alias "Isabelle" have been
wenzelm@28915
  1248
    removed (interfaces are now regular Isabelle tools).
wenzelm@28504
  1249
wenzelm@28504
  1250
Within scripts and make files, the Isabelle environment variables
wenzelm@28504
  1251
ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
wenzelm@28504
  1252
respectively.  (The latter are still available as legacy feature.)
wenzelm@28504
  1253
wenzelm@28915
  1254
The old isabelle-interface wrapper could react in confusing ways if
wenzelm@28915
  1255
the interface was uninstalled or changed otherwise.  Individual
wenzelm@28915
  1256
interface tool configuration is now more explicit, see also the
wenzelm@28915
  1257
Isabelle system manual.  In particular, Proof General is now available
wenzelm@28915
  1258
via "isabelle emacs".
wenzelm@28504
  1259
wenzelm@28504
  1260
INCOMPATIBILITY, need to adapt derivative scripts.  Users may need to
wenzelm@28504
  1261
purge installed copies of Isabelle executables and re-run "isabelle
wenzelm@28504
  1262
install -p ...", or use symlinks.
wenzelm@28504
  1263
wenzelm@28914
  1264
* The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
wenzelm@30845
  1265
old ~/isabelle, which was slightly non-standard and apt to cause
wenzelm@30845
  1266
surprises on case-insensitive file-systems (such as Mac OS).
wenzelm@28914
  1267
wenzelm@28914
  1268
INCOMPATIBILITY, need to move existing ~/isabelle/etc,
wenzelm@28914
  1269
~/isabelle/heaps, ~/isabelle/browser_info to the new place.  Special
wenzelm@28914
  1270
care is required when using older releases of Isabelle.  Note that
wenzelm@28914
  1271
ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
wenzelm@30845
  1272
Isabelle distribution, in order to use the new ~/.isabelle uniformly.
wenzelm@28914
  1273
wenzelm@29161
  1274
* Proofs of fully specified statements are run in parallel on
wenzelm@30845
  1275
multi-core systems.  A speedup factor of 2.5 to 3.2 can be expected on
wenzelm@30845
  1276
a regular 4-core machine, if the initial heap space is made reasonably
wenzelm@30845
  1277
large (cf. Poly/ML option -H).  (Requires Poly/ML 5.2.1 or later.)
wenzelm@30845
  1278
wenzelm@30845
  1279
* The main reference manuals ("isar-ref", "implementation", and
wenzelm@30845
  1280
"system") have been updated and extended.  Formally checked references
wenzelm@30845
  1281
as hyperlinks are now available uniformly.
wenzelm@30845
  1282
wenzelm@30163
  1283
wenzelm@27599
  1284
*** Pure ***
wenzelm@27599
  1285
wenzelm@30845
  1286
* Complete re-implementation of locales.  INCOMPATIBILITY in several
wenzelm@30845
  1287
respects.  The most important changes are listed below.  See the
wenzelm@30845
  1288
Tutorial on Locales ("locales" manual) for details.
ballarin@29253
  1289
ballarin@29253
  1290
- In locale expressions, instantiation replaces renaming.  Parameters
ballarin@29253
  1291
must be declared in a for clause.  To aid compatibility with previous
ballarin@29253
  1292
parameter inheritance, in locale declarations, parameters that are not
ballarin@29253
  1293
'touched' (instantiation position "_" or omitted) are implicitly added
ballarin@29253
  1294
with their syntax at the beginning of the for clause.
ballarin@29253
  1295
ballarin@29253
  1296
- Syntax from abbreviations and definitions in locales is available in
ballarin@29253
  1297
locale expressions and context elements.  The latter is particularly
ballarin@29253
  1298
useful in locale declarations.
ballarin@29253
  1299
ballarin@29253
  1300
- More flexible mechanisms to qualify names generated by locale
ballarin@29253
  1301
expressions.  Qualifiers (prefixes) may be specified in locale
wenzelm@30728
  1302
expressions, and can be marked as mandatory (syntax: "name!:") or
wenzelm@30728
  1303
optional (syntax "name?:").  The default depends for plain "name:"
wenzelm@30728
  1304
depends on the situation where a locale expression is used: in
wenzelm@30728
  1305
commands 'locale' and 'sublocale' prefixes are optional, in
wenzelm@30845
  1306
'interpretation' and 'interpret' prefixes are mandatory.  The old
wenzelm@30728
  1307
implicit qualifiers derived from the parameter names of a locale are
wenzelm@30728
  1308
no longer generated.
wenzelm@30106
  1309
wenzelm@30845
  1310
- Command "sublocale l < e" replaces "interpretation l < e".  The
wenzelm@30106
  1311
instantiation clause in "interpretation" and "interpret" (square
wenzelm@30106
  1312
brackets) is no longer available.  Use locale expressions.
ballarin@29253
  1313
wenzelm@30845
  1314
- When converting proof scripts, mandatory qualifiers in
wenzelm@30728
  1315
'interpretation' and 'interpret' should be retained by default, even
wenzelm@30845
  1316
if this is an INCOMPATIBILITY compared to former behavior.  In the
wenzelm@30845
  1317
worst case, use the "name?:" form for non-mandatory ones.  Qualifiers
wenzelm@30845
  1318
in locale expressions range over a single locale instance only.
wenzelm@30845
  1319
wenzelm@30845
  1320
- Dropped locale element "includes".  This is a major INCOMPATIBILITY.
wenzelm@30845
  1321
In existing theorem specifications replace the includes element by the
wenzelm@30845
  1322
respective context elements of the included locale, omitting those
wenzelm@30845
  1323
that are already present in the theorem specification.  Multiple
wenzelm@30845
  1324
assume elements of a locale should be replaced by a single one
wenzelm@30845
  1325
involving the locale predicate.  In the proof body, declarations (most
wenzelm@30845
  1326
notably theorems) may be regained by interpreting the respective
wenzelm@30845
  1327
locales in the proof context as required (command "interpret").
wenzelm@30845
  1328
wenzelm@30845
  1329
If using "includes" in replacement of a target solely because the
wenzelm@30845
  1330
parameter types in the theorem are not as general as in the target,
wenzelm@30845
  1331
consider declaring a new locale with additional type constraints on
wenzelm@30845
  1332
the parameters (context element "constrains").
wenzelm@30845
  1333
wenzelm@30845
  1334
- Discontinued "locale (open)".  INCOMPATIBILITY.
wenzelm@30845
  1335
wenzelm@30845
  1336
- Locale interpretation commands no longer attempt to simplify goal.
wenzelm@30845
  1337
INCOMPATIBILITY: in rare situations the generated goal differs.  Use
wenzelm@30845
  1338
methods intro_locales and unfold_locales to clarify.
wenzelm@30845
  1339
wenzelm@30845
  1340
- Locale interpretation commands no longer accept interpretation
wenzelm@30845
  1341
attributes.  INCOMPATIBILITY.
wenzelm@30845
  1342
wenzelm@30845
  1343
* Class declaration: so-called "base sort" must not be given in import
wenzelm@30845
  1344
list any longer, but is inferred from the specification.  Particularly
wenzelm@30845
  1345
in HOL, write
wenzelm@30845
  1346
wenzelm@30845
  1347
    class foo = ...
wenzelm@30845
  1348
wenzelm@30845
  1349
instead of
wenzelm@30845
  1350
wenzelm@30845
  1351
    class foo = type + ...
wenzelm@30845
  1352
wenzelm@30845
  1353
* Class target: global versions of theorems stemming do not carry a
wenzelm@30845
  1354
parameter prefix any longer.  INCOMPATIBILITY.
wenzelm@30845
  1355
wenzelm@30845
  1356
* Class 'instance' command no longer accepts attached definitions.
wenzelm@30845
  1357
INCOMPATIBILITY, use proper 'instantiation' target instead.
wenzelm@30845
  1358
wenzelm@30845
  1359
* Recovered hiding of consts, which was accidentally broken in
wenzelm@30845
  1360
Isabelle2007.  Potential INCOMPATIBILITY, ``hide const c'' really
wenzelm@30845
  1361
makes c inaccessible; consider using ``hide (open) const c'' instead.
wenzelm@30845
  1362
wenzelm@30845
  1363
* Slightly more coherent Pure syntax, with updated documentation in
wenzelm@30845
  1364
isar-ref manual.  Removed locales meta_term_syntax and
wenzelm@30845
  1365
meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
wenzelm@30845
  1366
INCOMPATIBILITY in rare situations.  Note that &&& should not be used
wenzelm@30845
  1367
directly in regular applications.
wenzelm@30845
  1368
wenzelm@30845
  1369
* There is a new syntactic category "float_const" for signed decimal
wenzelm@30845
  1370
fractions (e.g. 123.45 or -123.45).
wenzelm@30845
  1371
wenzelm@30845
  1372
* Removed exotic 'token_translation' command.  INCOMPATIBILITY, use ML
wenzelm@30845
  1373
interface with 'setup' command instead.
wenzelm@30845
  1374
wenzelm@30845
  1375
* Command 'local_setup' is similar to 'setup', but operates on a local
wenzelm@30845
  1376
theory context.
haftmann@27104
  1377
wenzelm@28114
  1378
* The 'axiomatization' command now only works within a global theory
wenzelm@28114
  1379
context.  INCOMPATIBILITY.
wenzelm@28114
  1380
wenzelm@30845
  1381
* Goal-directed proof now enforces strict proof irrelevance wrt. sort
wenzelm@30845
  1382
hypotheses.  Sorts required in the course of reasoning need to be
wenzelm@30845
  1383
covered by the constraints in the initial statement, completed by the
wenzelm@30845
  1384
type instance information of the background theory.  Non-trivial sort
wenzelm@30845
  1385
hypotheses, which rarely occur in practice, may be specified via
wenzelm@30845
  1386
vacuous propositions of the form SORT_CONSTRAINT('a::c).  For example:
wenzelm@30845
  1387
wenzelm@30845
  1388
  lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
wenzelm@30845
  1389
wenzelm@30845
  1390
The result contains an implicit sort hypotheses as before --
wenzelm@30845
  1391
SORT_CONSTRAINT premises are eliminated as part of the canonical rule
wenzelm@30845
  1392
normalization.
wenzelm@30845
  1393
wenzelm@30845
  1394
* Generalized Isar history, with support for linear undo, direct state
wenzelm@30845
  1395
addressing etc.
wenzelm@30845
  1396
wenzelm@30845
  1397
* Changed defaults for unify configuration options:
wenzelm@30845
  1398
wenzelm@30845
  1399
  unify_trace_bound = 50 (formerly 25)
wenzelm@30845
  1400
  unify_search_bound = 60 (formerly 30)
wenzelm@30845
  1401
wenzelm@30845
  1402
* Different bookkeeping for code equations (INCOMPATIBILITY):
wenzelm@30845
  1403
wenzelm@30845
  1404
  a) On theory merge, the last set of code equations for a particular
wenzelm@30845
  1405
     constant is taken (in accordance with the policy applied by other
wenzelm@30845
  1406
     parts of the code generator framework).
wenzelm@30845
  1407
wenzelm@30845
  1408
  b) Code equations stemming from explicit declarations (e.g. code
wenzelm@30845
  1409
     attribute) gain priority over default code equations stemming
wenzelm@30845
  1410
     from definition, primrec, fun etc.
wenzelm@30845
  1411
wenzelm@30845
  1412
* Keyword 'code_exception' now named 'code_abort'.  INCOMPATIBILITY.
wenzelm@30845
  1413
haftmann@30965
  1414
* Unified theorem tables for both code generators.  Thus [code
wenzelm@30845
  1415
func] has disappeared and only [code] remains.  INCOMPATIBILITY.
wenzelm@30577
  1416
wenzelm@30577
  1417
* Command 'find_consts' searches for constants based on type and name
wenzelm@30577
  1418
patterns, e.g.
kleing@29883
  1419
kleing@29883
  1420
    find_consts "_ => bool"
kleing@29883
  1421
wenzelm@30106
  1422
By default, matching is against subtypes, but it may be restricted to
wenzelm@30728
  1423
the whole type.  Searching by name is possible.  Multiple queries are
wenzelm@30106
  1424
conjunctive and queries may be negated by prefixing them with a
wenzelm@30106
  1425
hyphen:
kleing@29883
  1426
kleing@29883
  1427
    find_consts strict: "_ => bool" name: "Int" -"int => int"
kleing@29861
  1428
wenzelm@30845
  1429
* New 'find_theorems' criterion "solves" matches theorems that
wenzelm@30845
  1430
directly solve the current goal (modulo higher-order unification).
wenzelm@30845
  1431
wenzelm@30845
  1432
* Auto solve feature for main theorem statements: whenever a new goal
wenzelm@30845
  1433
is stated, "find_theorems solves" is called; any theorems that could
wenzelm@30845
  1434
solve the lemma directly are listed as part of the goal state.
wenzelm@30845
  1435
Cf. associated options in Proof General Isabelle settings menu,
wenzelm@30845
  1436
enabled by default, with reasonable timeout for pathological cases of
wenzelm@30845
  1437
higher-order unification.
webertj@30415
  1438
haftmann@27104
  1439
wenzelm@27381
  1440
*** Document preparation ***
wenzelm@27381
  1441
wenzelm@27381
  1442
* Antiquotation @{lemma} now imitates a regular terminal proof,
wenzelm@27392
  1443
demanding keyword 'by' and supporting the full method expression
wenzelm@27519
  1444
syntax just like the Isar command 'by'.
wenzelm@27381
  1445
wenzelm@27381
  1446
haftmann@27104
  1447
*** HOL ***
haftmann@27104
  1448
wenzelm@30845
  1449
* Integrated main parts of former image HOL-Complex with HOL.  Entry
wenzelm@30845
  1450
points Main and Complex_Main remain as before.
wenzelm@30845
  1451
wenzelm@30845
  1452
* Logic image HOL-Plain provides a minimal HOL with the most important
wenzelm@30845
  1453
tools available (inductive, datatype, primrec, ...).  This facilitates
wenzelm@30845
  1454
experimentation and tool development.  Note that user applications
wenzelm@30845
  1455
(and library theories) should never refer to anything below theory
wenzelm@30845
  1456
Main, as before.
wenzelm@30845
  1457
wenzelm@30845
  1458
* Logic image HOL-Main stops at theory Main, and thus facilitates
wenzelm@30845
  1459
experimentation due to shorter build times.
wenzelm@30845
  1460
wenzelm@30845
  1461
* Logic image HOL-NSA contains theories of nonstandard analysis which
wenzelm@30845
  1462
were previously part of former HOL-Complex.  Entry point Hyperreal
wenzelm@30845
  1463
remains valid, but theories formerly using Complex_Main should now use
wenzelm@30845
  1464
new entry point Hypercomplex.
wenzelm@30845
  1465
wenzelm@30845
  1466
* Generic ATP manager for Sledgehammer, based on ML threads instead of
wenzelm@30845
  1467
Posix processes.  Avoids potentially expensive forking of the ML
wenzelm@30845
  1468
process.  New thread-based implementation also works on non-Unix
wenzelm@30845
  1469
platforms (Cygwin).  Provers are no longer hardwired, but defined
wenzelm@30845
  1470
within the theory via plain ML wrapper functions.  Basic Sledgehammer
wenzelm@30845
  1471
commands are covered in the isar-ref manual.
wenzelm@30845
  1472
wenzelm@30845
  1473
* Wrapper scripts for remote SystemOnTPTP service allows to use
wenzelm@30845
  1474
sledgehammer without local ATP installation (Vampire etc.). Other
wenzelm@30845
  1475
provers may be included via suitable ML wrappers, see also
wenzelm@30845
  1476
src/HOL/ATP_Linkup.thy.
wenzelm@30845
  1477
wenzelm@30845
  1478
* ATP selection (E/Vampire/Spass) is now via Proof General's settings
wenzelm@30845
  1479
menu.
wenzelm@30845
  1480
wenzelm@30845
  1481
* The metis method no longer fails because the theorem is too trivial
wenzelm@30845
  1482
(contains the empty clause).
wenzelm@30845
  1483
wenzelm@30845
  1484
* The metis method now fails in the usual manner, rather than raising
wenzelm@30845
  1485
an exception, if it determines that it cannot prove the theorem.
wenzelm@30845
  1486
wenzelm@30845
  1487
* Method "coherent" implements a prover for coherent logic (see also
wenzelm@30845
  1488
src/Tools/coherent.ML).
wenzelm@30845
  1489
wenzelm@30845
  1490
* Constants "undefined" and "default" replace "arbitrary".  Usually
wenzelm@30845
  1491
"undefined" is the right choice to replace "arbitrary", though
wenzelm@30845
  1492
logically there is no difference.  INCOMPATIBILITY.
wenzelm@30845
  1493
wenzelm@30845
  1494
* Command "value" now integrates different evaluation mechanisms.  The
wenzelm@30845
  1495
result of the first successful evaluation mechanism is printed.  In
wenzelm@30845
  1496
square brackets a particular named evaluation mechanisms may be
wenzelm@30845
  1497
specified (currently, [SML], [code] or [nbe]).  See further
wenzelm@30845
  1498
src/HOL/ex/Eval_Examples.thy.
wenzelm@30845
  1499
wenzelm@30845
  1500
* Normalization by evaluation now allows non-leftlinear equations.
wenzelm@30845
  1501
Declare with attribute [code nbe].
wenzelm@30845
  1502
wenzelm@30845
  1503
* Methods "case_tac" and "induct_tac" now refer to the very same rules
wenzelm@30845
  1504
as the structured Isar versions "cases" and "induct", cf. the
wenzelm@30845
  1505
corresponding "cases" and "induct" attributes.  Mutual induction rules
wenzelm@30845
  1506
are now presented as a list of individual projections
wenzelm@30845
  1507
(e.g. foo_bar.inducts for types foo and bar); the old format with
wenzelm@30845
  1508
explicit HOL conjunction is no longer supported.  INCOMPATIBILITY, in
wenzelm@30845
  1509
rare situations a different rule is selected --- notably nested tuple
wenzelm@30845
  1510
elimination instead of former prod.exhaust: use explicit (case_tac t
wenzelm@30845
  1511
rule: prod.exhaust) here.
wenzelm@30845
  1512
wenzelm@30845
  1513
* Attributes "cases", "induct", "coinduct" support "del" option.
wenzelm@30845
  1514
wenzelm@30845
  1515
* Removed fact "case_split_thm", which duplicates "case_split".
wenzelm@30845
  1516
wenzelm@30845
  1517
* The option datatype has been moved to a new theory Option.  Renamed
wenzelm@30845
  1518
option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
wenzelm@30845
  1519
wenzelm@30845
  1520
* New predicate "strict_mono" classifies strict functions on partial
wenzelm@30845
  1521
orders.  With strict functions on linear orders, reasoning about
wenzelm@30845
  1522
(in)equalities is facilitated by theorems "strict_mono_eq",
wenzelm@30845
  1523
"strict_mono_less_eq" and "strict_mono_less".
wenzelm@30845
  1524
wenzelm@30845
  1525
* Some set operations are now proper qualified constants with
wenzelm@30845
  1526
authentic syntax.  INCOMPATIBILITY:
haftmann@30304
  1527
haftmann@30304
  1528
    op Int ~>   Set.Int
haftmann@30304
  1529
    op Un ~>    Set.Un
haftmann@30304
  1530
    INTER ~>    Set.INTER
haftmann@30304
  1531
    UNION ~>    Set.UNION
haftmann@30304
  1532
    Inter ~>    Set.Inter
haftmann@30304
  1533
    Union ~>    Set.Union
haftmann@30304
  1534
    {} ~>       Set.empty
haftmann@30304
  1535
    UNIV ~>     Set.UNIV
haftmann@30304
  1536
wenzelm@30845
  1537
* Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
wenzelm@30845
  1538
theory Set.
wenzelm@30845
  1539
wenzelm@30845
  1540
* Auxiliary class "itself" has disappeared -- classes without any
wenzelm@30845
  1541
parameter are treated as expected by the 'class' command.
haftmann@29797
  1542
haftmann@29823
  1543
* Leibnitz's Series for Pi and the arcus tangens and logarithm series.
haftmann@29823
  1544
wenzelm@30845
  1545
* Common decision procedures (Cooper, MIR, Ferrack, Approximation,
wenzelm@30845
  1546
Dense_Linear_Order) are now in directory HOL/Decision_Procs.
wenzelm@30845
  1547
wenzelm@30845
  1548
* Theory src/HOL/Decision_Procs/Approximation provides the new proof
wenzelm@30845
  1549
method "approximation".  It proves formulas on real values by using
wenzelm@30845
  1550
interval arithmetic.  In the formulas are also the transcendental
wenzelm@30845
  1551
functions sin, cos, tan, atan, ln, exp and the constant pi are
wenzelm@30845
  1552
allowed. For examples see
wenzelm@30845
  1553
src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
haftmann@29823
  1554
haftmann@29823
  1555
* Theory "Reflection" now resides in HOL/Library.
haftmann@29650
  1556
wenzelm@30845
  1557
* Entry point to Word library now simply named "Word".
wenzelm@30845
  1558
INCOMPATIBILITY.
haftmann@29628
  1559
haftmann@29197
  1560
* Made source layout more coherent with logical distribution
haftmann@29197
  1561
structure:
haftmann@28952
  1562
haftmann@28952
  1563
    src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
haftmann@28952
  1564
    src/HOL/Library/Code_Message.thy ~> src/HOL/
haftmann@28952
  1565
    src/HOL/Library/GCD.thy ~> src/HOL/
haftmann@28952
  1566
    src/HOL/Library/Order_Relation.thy ~> src/HOL/
haftmann@28952
  1567
    src/HOL/Library/Parity.thy ~> src/HOL/
haftmann@28952
  1568
    src/HOL/Library/Univ_Poly.thy ~> src/HOL/
huffman@30176
  1569
    src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
haftmann@28952
  1570
    src/HOL/Real/Lubs.thy ~> src/HOL/
haftmann@28952
  1571
    src/HOL/Real/PReal.thy ~> src/HOL/
haftmann@28952
  1572
    src/HOL/Real/Rational.thy ~> src/HOL/
haftmann@28952
  1573
    src/HOL/Real/RComplete.thy ~> src/HOL/
haftmann@28952
  1574
    src/HOL/Real/RealDef.thy ~> src/HOL/
haftmann@28952
  1575
    src/HOL/Real/RealPow.thy ~> src/HOL/
haftmann@28952
  1576
    src/HOL/Real/Real.thy ~> src/HOL/
haftmann@28952
  1577
    src/HOL/Complex/Complex_Main.thy ~> src/HOL/
haftmann@28952
  1578
    src/HOL/Complex/Complex.thy ~> src/HOL/
huffman@30176
  1579
    src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
huffman@30176
  1580
    src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
haftmann@28952
  1581
    src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
haftmann@28952
  1582
    src/HOL/Hyperreal/Fact.thy ~> src/HOL/
haftmann@28952
  1583
    src/HOL/Hyperreal/Integration.thy ~> src/HOL/
haftmann@28952
  1584
    src/HOL/Hyperreal/Lim.thy ~> src/HOL/
haftmann@28952
  1585
    src/HOL/Hyperreal/Ln.thy ~> src/HOL/
haftmann@28952
  1586
    src/HOL/Hyperreal/Log.thy ~> src/HOL/
haftmann@28952
  1587
    src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
haftmann@28952
  1588
    src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
haftmann@28952
  1589
    src/HOL/Hyperreal/Series.thy ~> src/HOL/
haftmann@29197
  1590
    src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
haftmann@28952
  1591
    src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
haftmann@28952
  1592
    src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
haftmann@28952
  1593
    src/HOL/Real/Float ~> src/HOL/Library/
haftmann@29197
  1594
    src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
haftmann@29197
  1595
    src/HOL/Real/RealVector.thy ~> src/HOL/
haftmann@28952
  1596
haftmann@28952
  1597
    src/HOL/arith_data.ML ~> src/HOL/Tools
haftmann@28952
  1598
    src/HOL/hologic.ML ~> src/HOL/Tools
haftmann@28952
  1599
    src/HOL/simpdata.ML ~> src/HOL/Tools
haftmann@28952
  1600
    src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
haftmann@28952
  1601
    src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
haftmann@28952
  1602
    src/HOL/nat_simprocs.ML ~> src/HOL/Tools
haftmann@28952
  1603
    src/HOL/Real/float_arith.ML ~> src/HOL/Tools
haftmann@28952
  1604
    src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
haftmann@28952
  1605
    src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
haftmann@28952
  1606
    src/HOL/Real/real_arith.ML ~> src/HOL/Tools
haftmann@28952
  1607
haftmann@29398
  1608
    src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  1609
    src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  1610
    src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  1611
    src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  1612
    src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  1613
    src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  1614
wenzelm@30845
  1615
* If methods "eval" and "evaluation" encounter a structured proof
wenzelm@30845
  1616
state with !!/==>, only the conclusion is evaluated to True (if
wenzelm@30845
  1617
possible), avoiding strange error messages.
wenzelm@30845
  1618
wenzelm@30845
  1619
* Method "sizechange" automates termination proofs using (a
wenzelm@30845
  1620
modification of) the size-change principle.  Requires SAT solver.  See
wenzelm@30845
  1621
src/HOL/ex/Termination.thy for examples.
wenzelm@30845
  1622
wenzelm@30845
  1623
* Simplifier: simproc for let expressions now unfolds if bound
wenzelm@30845
  1624
variable occurs at most once in let expression body.  INCOMPATIBILITY.
wenzelm@30845
  1625
wenzelm@30845
  1626
* Method "arith": Linear arithmetic now ignores all inequalities when
wenzelm@30845
  1627
fast_arith_neq_limit is exceeded, instead of giving up entirely.
wenzelm@30845
  1628
wenzelm@30845
  1629
* New attribute "arith" for facts that should always be used
wenzelm@30845
  1630
automatically by arithmetic. It is intended to be used locally in
wenzelm@30845
  1631
proofs, e.g.
wenzelm@30845
  1632
wenzelm@30845
  1633
  assumes [arith]: "x > 0"
wenzelm@30845
  1634
nipkow@30706
  1635
Global usage is discouraged because of possible performance impact.
nipkow@30706
  1636
wenzelm@30845
  1637
* New classes "top" and "bot" with corresponding operations "top" and
wenzelm@30845
  1638
"bot" in theory Orderings; instantiation of class "complete_lattice"
wenzelm@30845
  1639
requires instantiation of classes "top" and "bot".  INCOMPATIBILITY.
wenzelm@30845
  1640
wenzelm@30845
  1641
* Changed definition lemma "less_fun_def" in order to provide an
wenzelm@30845
  1642
instance for preorders on functions; use lemma "less_le" instead.
wenzelm@30845
  1643
INCOMPATIBILITY.
wenzelm@30845
  1644
wenzelm@30845
  1645
* Theory Orderings: class "wellorder" moved here, with explicit
wenzelm@30845
  1646
induction rule "less_induct" as assumption.  For instantiation of
wenzelm@30845
  1647
"wellorder" by means of predicate "wf", use rule wf_wellorderI.
wenzelm@30845
  1648
INCOMPATIBILITY.
wenzelm@30845
  1649
wenzelm@30845
  1650
* Theory Orderings: added class "preorder" as superclass of "order".
wenzelm@27793
  1651
INCOMPATIBILITY: Instantiation proofs for order, linorder
wenzelm@27793
  1652
etc. slightly changed.  Some theorems named order_class.* now named
wenzelm@27793
  1653
preorder_class.*.
wenzelm@27793
  1654
wenzelm@30845
  1655
* Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
wenzelm@30845
  1656
"diag" to "Id_on".
wenzelm@30845
  1657
wenzelm@30845
  1658
* Theory Finite_Set: added a new fold combinator of type
wenzelm@30845
  1659
nipkow@28855
  1660
  ('a => 'b => 'b) => 'b => 'a set => 'b
wenzelm@30845
  1661
wenzelm@30845
  1662
Occasionally this is more convenient than the old fold combinator
wenzelm@30845
  1663
which is now defined in terms of the new one and renamed to
wenzelm@30845
  1664
fold_image.
wenzelm@30845
  1665
wenzelm@30845
  1666
* Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
wenzelm@30845
  1667
and "ring_simps" have been replaced by "algebra_simps" (which can be
wenzelm@30845
  1668
extended with further lemmas!).  At the moment both still exist but
wenzelm@30845
  1669
the former will disappear at some point.
wenzelm@30845
  1670
wenzelm@30845
  1671
* Theory Power: Lemma power_Suc is now declared as a simp rule in
wenzelm@30845
  1672
class recpower.  Type-specific simp rules for various recpower types
wenzelm@30845
  1673
have been removed.  INCOMPATIBILITY, rename old lemmas as follows:
huffman@30273
  1674
huffman@30273
  1675
rat_power_0    -> power_0
huffman@30273
  1676
rat_power_Suc  -> power_Suc
huffman@30273
  1677
realpow_0      -> power_0
huffman@30273
  1678
realpow_Suc    -> power_Suc
huffman@30273
  1679
complexpow_0   -> power_0
huffman@30273
  1680
complexpow_Suc -> power_Suc
huffman@30273
  1681
power_poly_0   -> power_0
huffman@30273
  1682
power_poly_Suc -> power_Suc
huffman@30273
  1683
wenzelm@30845
  1684
* Theories Ring_and_Field and Divides: Definition of "op dvd" has been
wenzelm@27793
  1685
moved to separate class dvd in Ring_and_Field; a couple of lemmas on
wenzelm@27793
  1686
dvd has been generalized to class comm_semiring_1.  Likewise a bunch
wenzelm@27793
  1687
of lemmas from Divides has been generalized from nat to class
wenzelm@27793
  1688
semiring_div.  INCOMPATIBILITY.  This involves the following theorem
wenzelm@27793
  1689
renames resulting from duplicate elimination:
haftmann@27651
  1690
haftmann@27651
  1691
    dvd_def_mod ~>          dvd_eq_mod_eq_0
haftmann@27651
  1692
    zero_dvd_iff ~>         dvd_0_left_iff
haftmann@28559
  1693
    dvd_0 ~>                dvd_0_right
haftmann@27651
  1694
    DIVISION_BY_ZERO_DIV ~> div_by_0
haftmann@27651
  1695
    DIVISION_BY_ZERO_MOD ~> mod_by_0
haftmann@27651
  1696
    mult_div ~>             div_mult_self2_is_id
haftmann@27651
  1697
    mult_mod ~>             mod_mult_self2_is_0
haftmann@27651
  1698
wenzelm@30845
  1699
* Theory IntDiv: removed many lemmas that are instances of class-based
wenzelm@30845
  1700
generalizations (from Divides and Ring_and_Field).  INCOMPATIBILITY,
wenzelm@30845
  1701
rename old lemmas as follows:
nipkow@30044
  1702
nipkow@30044
  1703
dvd_diff               -> nat_dvd_diff
nipkow@30044
  1704
dvd_zminus_iff         -> dvd_minus_iff
nipkow@30224
  1705
mod_add1_eq            -> mod_add_eq
nipkow@30224
  1706
mod_mult1_eq           -> mod_mult_right_eq
nipkow@30224
  1707
mod_mult1_eq'          -> mod_mult_left_eq
nipkow@30224
  1708
mod_mult_distrib_mod   -> mod_mult_eq
nipkow@30044
  1709
nat_mod_add_left_eq    -> mod_add_left_eq
nipkow@30044
  1710
nat_mod_add_right_eq   -> mod_add_right_eq
nipkow@30044
  1711
nat_mod_div_trivial    -> mod_div_trivial
nipkow@30044
  1712
nat_mod_mod_trivial    -> mod_mod_trivial
nipkow@30044
  1713
zdiv_zadd_self1        -> div_add_self1
nipkow@30044
  1714
zdiv_zadd_self2        -> div_add_self2
nipkow@30181
  1715
zdiv_zmult_self1       -> div_mult_self2_is_id
nipkow@30044
  1716
zdiv_zmult_self2       -> div_mult_self1_is_id
nipkow@30044
  1717
zdvd_triv_left         -> dvd_triv_left
nipkow@30044
  1718
zdvd_triv_right        -> dvd_triv_right
nipkow@30044
  1719
zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
nipkow@30085
  1720
zmod_eq0_zdvd_iff      -> dvd_eq_mod_eq_0[symmetric]
nipkow@30044
  1721
zmod_zadd_left_eq      -> mod_add_left_eq
nipkow@30044
  1722
zmod_zadd_right_eq     -> mod_add_right_eq
nipkow@30044
  1723
zmod_zadd_self1        -> mod_add_self1
nipkow@30044
  1724
zmod_zadd_self2        -> mod_add_self2
nipkow@30224
  1725
zmod_zadd1_eq          -> mod_add_eq
nipkow@30044
  1726
zmod_zdiff1_eq         -> mod_diff_eq
nipkow@30044
  1727
zmod_zdvd_zmod         -> mod_mod_cancel
nipkow@30044
  1728
zmod_zmod_cancel       -> mod_mod_cancel
nipkow@30044
  1729
zmod_zmult_self1       -> mod_mult_self2_is_0
nipkow@30044
  1730
zmod_zmult_self2       -> mod_mult_self1_is_0
nipkow@30044
  1731
zmod_1                 -> mod_by_1
nipkow@30044
  1732
zdiv_1                 -> div_by_1
nipkow@30044
  1733
zdvd_abs1              -> abs_dvd_iff
nipkow@30044
  1734
zdvd_abs2              -> dvd_abs_iff
nipkow@30044
  1735
zdvd_refl              -> dvd_refl
nipkow@30044
  1736
zdvd_trans             -> dvd_trans
nipkow@30044
  1737
zdvd_zadd              -> dvd_add
nipkow@30044
  1738
zdvd_zdiff             -> dvd_diff
nipkow@30044
  1739
zdvd_zminus_iff        -> dvd_minus_iff
nipkow@30044
  1740
zdvd_zminus2_iff       -> minus_dvd_iff
nipkow@30044
  1741
zdvd_zmultD            -> dvd_mult_right
nipkow@30044
  1742
zdvd_zmultD2           -> dvd_mult_left
nipkow@30044
  1743
zdvd_zmult_mono        -> mult_dvd_mono
nipkow@30044
  1744
zdvd_0_right           -> dvd_0_right
nipkow@30044
  1745
zdvd_0_left            -> dvd_0_left_iff
nipkow@30044
  1746
zdvd_1_left            -> one_dvd
nipkow@30044
  1747
zminus_dvd_iff         -> minus_dvd_iff
nipkow@30044
  1748
wenzelm@30845
  1749
* Theory Rational: 'Fract k 0' now equals '0'.  INCOMPATIBILITY.
wenzelm@30845
  1750
wenzelm@30845
  1751
* The real numbers offer decimal input syntax: 12.34 is translated
wenzelm@30845
  1752
into 1234/10^2. This translation is not reversed upon output.
wenzelm@30845
  1753
wenzelm@30845
  1754
* Theory Library/Polynomial defines an abstract type 'a poly of
wenzelm@30845
  1755
univariate polynomials with coefficients of type 'a.  In addition to
wenzelm@30845
  1756
the standard ring operations, it also supports div and mod.  Code
wenzelm@30845
  1757
generation is also supported, using list-style constructors.
wenzelm@30845
  1758
wenzelm@30845
  1759
* Theory Library/Inner_Product defines a class of real_inner for real
wenzelm@30845
  1760
inner product spaces, with an overloaded operation inner :: 'a => 'a
wenzelm@30845
  1761
=> real.  Class real_inner is a subclass of real_normed_vector from
wenzelm@30845
  1762
theory RealVector.
wenzelm@30845
  1763
wenzelm@30845
  1764
* Theory Library/Product_Vector provides instances for the product
wenzelm@30845
  1765
type 'a * 'b of several classes from RealVector and Inner_Product.
wenzelm@30845
  1766
Definitions of addition, subtraction, scalar multiplication, norms,
wenzelm@30845
  1767
and inner products are included.
wenzelm@30845
  1768
wenzelm@30845
  1769
* Theory Library/Bit defines the field "bit" of integers modulo 2.  In
wenzelm@30845
  1770
addition to the field operations, numerals and case syntax are also
wenzelm@30845
  1771
supported.
wenzelm@30845
  1772
wenzelm@30845
  1773
* Theory Library/Diagonalize provides constructive version of Cantor's
wenzelm@30845
  1774
first diagonalization argument.
wenzelm@30845
  1775
wenzelm@30845
  1776
* Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
wenzelm@27599
  1777
zlcm (for int); carried together from various gcd/lcm developements in
wenzelm@30845
  1778
the HOL Distribution.  Constants zgcd and zlcm replace former igcd and
wenzelm@30845
  1779
ilcm; corresponding theorems renamed accordingly.  INCOMPATIBILITY,
wenzelm@30845
  1780
may recover tupled syntax as follows:
haftmann@27556
  1781
haftmann@27556
  1782
    hide (open) const gcd
haftmann@27556
  1783
    abbreviation gcd where
haftmann@27556
  1784
      "gcd == (%(a, b). GCD.gcd a b)"
haftmann@27556
  1785
    notation (output)
haftmann@27556
  1786
      GCD.gcd ("gcd '(_, _')")
haftmann@27556
  1787
wenzelm@30845
  1788
The same works for lcm, zgcd, zlcm.
wenzelm@30845
  1789
wenzelm@30845
  1790
* Theory Library/Nat_Infinity: added addition, numeral syntax and more
wenzelm@30845
  1791
instantiations for algebraic structures.  Removed some duplicate
wenzelm@30845
  1792
theorems.  Changes in simp rules.  INCOMPATIBILITY.
wenzelm@30845
  1793
wenzelm@30845
  1794
* ML antiquotation @{code} takes a constant as argument and generates
haftmann@27651
  1795
corresponding code in background and inserts name of the corresponding
haftmann@27651
  1796
resulting ML value/function/datatype constructor binding in place.
haftmann@27651
  1797
All occurrences of @{code} with a single ML block are generated
haftmann@27651
  1798
simultaneously.  Provides a generic and safe interface for
wenzelm@30845
  1799
instrumentalizing code generation.  See
wenzelm@30845
  1800
src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
wenzelm@30845
  1801
In future you ought to refrain from ad-hoc compiling generated SML
wenzelm@30845
  1802
code on the ML toplevel.  Note that (for technical reasons) @{code}
wenzelm@30845
  1803
cannot refer to constants for which user-defined serializations are
wenzelm@30845
  1804
set.  Refer to the corresponding ML counterpart directly in that
wenzelm@30845
  1805
cases.
wenzelm@27122
  1806
wenzelm@27122
  1807
* Command 'rep_datatype': instead of theorem names the command now
wenzelm@27122
  1808
takes a list of terms denoting the constructors of the type to be
wenzelm@27122
  1809
represented as datatype.  The characteristic theorems have to be
wenzelm@27122
  1810
proven.  INCOMPATIBILITY.  Also observe that the following theorems
wenzelm@27122
  1811
have disappeared in favour of existing ones:
wenzelm@27122
  1812
haftmann@27104
  1813
    unit_induct                 ~> unit.induct
haftmann@27104
  1814
    prod_induct                 ~> prod.induct
haftmann@27104
  1815
    sum_induct                  ~> sum.induct
haftmann@27104
  1816
    Suc_Suc_eq                  ~> nat.inject
haftmann@27104
  1817
    Suc_not_Zero Zero_not_Suc   ~> nat.distinct
haftmann@27104
  1818
haftmann@27104
  1819
ballarin@27696
  1820
*** HOL-Algebra ***
ballarin@27696
  1821
ballarin@27713
  1822
* New locales for orders and lattices where the equivalence relation
wenzelm@30106
  1823
is not restricted to equality.  INCOMPATIBILITY: all order and lattice
wenzelm@30106
  1824
locales use a record structure with field eq for the equivalence.
ballarin@27713
  1825
ballarin@27713
  1826
* New theory of factorial domains.
ballarin@27713
  1827
wenzelm@30845
  1828
* Units_l_inv and Units_r_inv are now simp rules by default.
ballarin@27696
  1829
INCOMPATIBILITY.  Simplifier proof that require deletion of l_inv
ballarin@27696
  1830
and/or r_inv will now also require deletion of these lemmas.
ballarin@27696
  1831
wenzelm@30845
  1832
* Renamed the following theorems, INCOMPATIBILITY:
wenzelm@30845
  1833
ballarin@27696
  1834
UpperD ~> Upper_memD
ballarin@27696
  1835
LowerD ~> Lower_memD
ballarin@27696
  1836
least_carrier ~> least_closed
ballarin@27696
  1837
greatest_carrier ~> greatest_closed
ballarin@27696
  1838
greatest_Lower_above ~> greatest_Lower_below
ballarin@27717
  1839
one_zero ~> carrier_one_zero
ballarin@27717
  1840
one_not_zero ~> carrier_one_not_zero  (collision with assumption)
ballarin@27696
  1841
wenzelm@27793
  1842
wenzelm@30849
  1843
*** HOL-Nominal ***
wenzelm@30849
  1844
wenzelm@30855
  1845
* Nominal datatypes can now contain type-variables.
wenzelm@30855
  1846
wenzelm@30855
  1847
* Commands 'nominal_inductive' and 'equivariance' work with local
wenzelm@30855
  1848
theory targets.
wenzelm@30855
  1849
wenzelm@30855
  1850
* Nominal primrec can now works with local theory targets and its
wenzelm@30855
  1851
specification syntax now conforms to the general format as seen in
wenzelm@30855
  1852
'inductive' etc.
wenzelm@30855
  1853
wenzelm@30855
  1854
* Method "perm_simp" honours the standard simplifier attributes
wenzelm@30855
  1855
(no_asm), (no_asm_use) etc.
wenzelm@30855
  1856
wenzelm@30855
  1857
* The new predicate #* is defined like freshness, except that on the
wenzelm@30855
  1858
left hand side can be a set or list of atoms.
wenzelm@30855
  1859
wenzelm@30855
  1860
* Experimental command 'nominal_inductive2' derives strong induction
wenzelm@30855
  1861
principles for inductive definitions.  In contrast to
wenzelm@30855
  1862
'nominal_inductive', which can only deal with a fixed number of
wenzelm@30855
  1863
binders, it can deal with arbitrary expressions standing for sets of
wenzelm@30855
  1864
atoms to be avoided.  The only inductive definition we have at the
wenzelm@30855
  1865
moment that needs this generalisation is the typing rule for Lets in
wenzelm@30855
  1866
the algorithm W:
wenzelm@30855
  1867
wenzelm@30855
  1868
 Gamma |- t1 : T1   (x,close Gamma T1)::Gamma |- t2 : T2   x#Gamma
wenzelm@30855
  1869
 -----------------------------------------------------------------
wenzelm@30855
  1870
         Gamma |- Let x be t1 in t2 : T2
wenzelm@30855
  1871
wenzelm@30855
  1872
In this rule one wants to avoid all the binders that are introduced by
wenzelm@30855
  1873
"close Gamma T1".  We are looking for other examples where this
wenzelm@30855
  1874
feature might be useful.  Please let us know.
wenzelm@30849
  1875
wenzelm@30849
  1876
huffman@30176
  1877
*** HOLCF ***
huffman@30176
  1878
huffman@30176
  1879
* Reimplemented the simplification procedure for proving continuity
huffman@30176
  1880
subgoals.  The new simproc is extensible; users can declare additional
huffman@30176
  1881
continuity introduction rules with the attribute [cont2cont].
huffman@30176
  1882
huffman@30176
  1883
* The continuity simproc now uses a different introduction rule for
huffman@30176
  1884
solving continuity subgoals on terms with lambda abstractions.  In
huffman@30176
  1885
some rare cases the new simproc may fail to solve subgoals that the
huffman@30176
  1886
old one could solve, and "simp add: cont2cont_LAM" may be necessary.
huffman@30176
  1887
Potential INCOMPATIBILITY.
huffman@30176
  1888
wenzelm@30847
  1889
* Command 'fixrec': specification syntax now conforms to the general
wenzelm@30855
  1890
format as seen in 'inductive' etc.  See src/HOLCF/ex/Fixrec_ex.thy for
wenzelm@30855
  1891
examples.  INCOMPATIBILITY.
wenzelm@30845
  1892
wenzelm@30845
  1893
wenzelm@30845
  1894
*** ZF ***
wenzelm@30845
  1895
wenzelm@30845
  1896
* Proof of Zorn's Lemma for partial orders.
huffman@30176
  1897
huffman@30176
  1898
wenzelm@27246
  1899
*** ML ***
wenzelm@28088
  1900
wenzelm@30845
  1901
* Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
wenzelm@30845
  1902
Poly/ML 5.2.1 or later.  Important note: the TimeLimit facility
wenzelm@30845
  1903
depends on multithreading, so timouts will not work before Poly/ML
wenzelm@30845
  1904
5.2.1!
wenzelm@30845
  1905
wenzelm@29161
  1906
* High-level support for concurrent ML programming, see
wenzelm@29161
  1907
src/Pure/Cuncurrent.  The data-oriented model of "future values" is
wenzelm@29161
  1908
particularly convenient to organize independent functional
wenzelm@29161
  1909
computations.  The concept of "synchronized variables" provides a
wenzelm@29161
  1910
higher-order interface for components with shared state, avoiding the
wenzelm@30845
  1911
delicate details of mutexes and condition variables.  (Requires
wenzelm@30845
  1912
Poly/ML 5.2.1 or later.)
wenzelm@30845
  1913
wenzelm@30845
  1914
* ML bindings produced via Isar commands are stored within the Isar
wenzelm@30845
  1915
context (theory or proof).  Consequently, commands like 'use' and 'ML'
wenzelm@30845
  1916
become thread-safe and work with undo as expected (concerning
wenzelm@30845
  1917
top-level bindings, not side-effects on global references).
wenzelm@30845
  1918
INCOMPATIBILITY, need to provide proper Isar context when invoking the
wenzelm@30845
  1919
compiler at runtime; really global bindings need to be given outside a
wenzelm@30845
  1920
theory.  (Requires Poly/ML 5.2 or later.)
wenzelm@30845
  1921
wenzelm@30845
  1922
* Command 'ML_prf' is analogous to 'ML' but works within a proof
wenzelm@30845
  1923
context.  Top-level ML bindings are stored within the proof context in
wenzelm@30845
  1924
a purely sequential fashion, disregarding the nested proof structure.
wenzelm@30845
  1925
ML bindings introduced by 'ML_prf' are discarded at the end of the
wenzelm@30845
  1926
proof.  (Requires Poly/ML 5.2 or later.)
wenzelm@29161
  1927
wenzelm@30530
  1928
* Simplified ML attribute and method setup, cf. functions Attrib.setup
wenzelm@30845
  1929
and Method.setup, as well as Isar commands 'attribute_setup' and
wenzelm@30547
  1930
'method_setup'.  INCOMPATIBILITY for 'method_setup', need to simplify
wenzelm@30547
  1931
existing code accordingly, or use plain 'setup' together with old
wenzelm@30547
  1932
Method.add_method.
wenzelm@30530
  1933
wenzelm@28294
  1934
* Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
wenzelm@28294
  1935
to 'a -> thm, while results are always tagged with an authentic oracle
wenzelm@28294
  1936
name.  The Isar command 'oracle' is now polymorphic, no argument type
wenzelm@28294
  1937
is specified.  INCOMPATIBILITY, need to simplify existing oracle code
wenzelm@28294
  1938
accordingly.  Note that extra performance may be gained by producing
wenzelm@28294
  1939
the cterm carefully, avoiding slow Thm.cterm_of.
wenzelm@28294
  1940
wenzelm@30845
  1941
* Simplified interface for defining document antiquotations via
wenzelm@30845
  1942
ThyOutput.antiquotation, ThyOutput.output, and optionally
wenzelm@30845
  1943
ThyOutput.maybe_pretty_source.  INCOMPATIBILITY, need to simplify user
wenzelm@30845
  1944
antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
wenzelm@30845
  1945
examples.
wenzelm@28099
  1946
wenzelm@30395
  1947
* More systematic treatment of long names, abstract name bindings, and
wenzelm@30395
  1948
name space operations.  Basic operations on qualified names have been
wenzelm@30399
  1949
move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
wenzelm@30395
  1950
Long_Name.append.  Old type bstring has been mostly replaced by
wenzelm@30395
  1951
abstract type binding (see structure Binding), which supports precise
wenzelm@30845
  1952
qualification by packages and local theory targets, as well as proper
wenzelm@30845
  1953
tracking of source positions.  INCOMPATIBILITY, need to wrap old
wenzelm@30845
  1954
bstring values into Binding.name, or better pass through abstract
wenzelm@30399
  1955
bindings everywhere.  See further src/Pure/General/long_name.ML,
wenzelm@30395
  1956
src/Pure/General/binding.ML and src/Pure/General/name_space.ML
wenzelm@30395
  1957
wenzelm@28089
  1958
* Result facts (from PureThy.note_thms, ProofContext.note_thms,
wenzelm@28089
  1959
LocalTheory.note etc.) now refer to the *full* internal name, not the
wenzelm@28089
  1960
bstring as before.  INCOMPATIBILITY, not detected by ML type-checking!
wenzelm@28089
  1961
wenzelm@27287
  1962
* Disposed old type and term read functions (Sign.read_def_typ,
wenzelm@27287
  1963
Sign.read_typ, Sign.read_def_terms, Sign.read_term,
wenzelm@27287
  1964
Thm.read_def_cterms, Thm.read_cterm etc.).  INCOMPATIBILITY, should
wenzelm@27287
  1965
use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
wenzelm@27269
  1966
Syntax.read_term_global etc.; see also OldGoals.read_term as last
wenzelm@27269
  1967
resort for legacy applications.
wenzelm@27269
  1968
wenzelm@30609
  1969
* Disposed old declarations, tactics, tactic combinators that refer to
wenzelm@30609
  1970
the simpset or claset of an implicit theory (such as Addsimps,
wenzelm@30609
  1971
Simp_tac, SIMPSET).  INCOMPATIBILITY, should use @{simpset} etc. in
wenzelm@30609
  1972
embedded ML text, or local_simpset_of with a proper context passed as
wenzelm@30609
  1973
explicit runtime argument.
wenzelm@30609
  1974
wenzelm@30845
  1975
* Rules and tactics that read instantiations (read_instantiate,
wenzelm@30845
  1976
res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
wenzelm@30845
  1977
context, which is required for parsing and type-checking.  Moreover,
wenzelm@30845
  1978
the variables are specified as plain indexnames, not string encodings
wenzelm@30845
  1979
thereof.  INCOMPATIBILITY.
wenzelm@30845
  1980
wenzelm@30845
  1981
* Generic Toplevel.add_hook interface allows to analyze the result of
wenzelm@30845
  1982
transactions.  E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
wenzelm@30845
  1983
for theorem dependency output of transactions resulting in a new
wenzelm@30845
  1984
theory state.
wenzelm@30845
  1985
wenzelm@30845
  1986
* ML antiquotations: block-structured compilation context indicated by
wenzelm@27391
  1987
\<lbrace> ... \<rbrace>; additional antiquotation forms:
wenzelm@27391
  1988
wenzelm@30845
  1989
  @{binding name}                         - basic name binding
wenzelm@27519
  1990
  @{let ?pat = term}                      - term abbreviation (HO matching)
wenzelm@27519
  1991
  @{note name = fact}                     - fact abbreviation
wenzelm@27519
  1992
  @{thm fact}                             - singleton fact (with attributes)
wenzelm@27519
  1993
  @{thms fact}                            - general fact (with attributes)
wenzelm@27519
  1994
  @{lemma prop by method}                 - singleton goal
wenzelm@27519
  1995
  @{lemma prop by meth1 meth2}            - singleton goal
wenzelm@27519
  1996
  @{lemma prop1 ... propN by method}      - general goal
wenzelm@27519
  1997
  @{lemma prop1 ... propN by meth1 meth2} - general goal
wenzelm@27519
  1998
  @{lemma (open) ...}                     - open derivation
wenzelm@27380
  1999
wenzelm@27246
  2000
wenzelm@27979
  2001
*** System ***
wenzelm@27979
  2002
wenzelm@28248
  2003
* The Isabelle "emacs" tool provides a specific interface to invoke
wenzelm@28248
  2004
Proof General / Emacs, with more explicit failure if that is not
wenzelm@28248
  2005
installed (the old isabelle-interface script silently falls back on
wenzelm@28248
  2006
isabelle-process).  The PROOFGENERAL_HOME setting determines the
wenzelm@28248
  2007
installation location of the Proof General distribution.
wenzelm@28248
  2008
wenzelm@27979
  2009
* Isabelle/lib/classes/Pure.jar provides basic support to integrate
wenzelm@27979
  2010
the Isabelle process into a JVM/Scala application.  See
wenzelm@27979
  2011
Isabelle/lib/jedit/plugin for a minimal example.  (The obsolete Java
wenzelm@27979
  2012
process wrapper has been discontinued.)
wenzelm@27979
  2013
wenzelm@30845
  2014
* Added homegrown Isabelle font with unicode layout, see lib/fonts.
wenzelm@30845
  2015
wenzelm@30845
  2016
* Various status messages (with exact source position information) are
wenzelm@27979
  2017
emitted, if proper markup print mode is enabled.  This allows
wenzelm@27979
  2018
user-interface components to provide detailed feedback on internal
wenzelm@27979
  2019
prover operations.
wenzelm@27979
  2020
wenzelm@27979
  2021
wenzelm@27143
  2022
wenzelm@27008
  2023
New in Isabelle2008 (June 2008)
wenzelm@27008
  2024
-------------------------------
wenzelm@25464
  2025
wenzelm@25522
  2026
*** General ***
wenzelm@25522
  2027
wenzelm@27061
  2028
* The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
wenzelm@27061
  2029
and updated, with formally checked references as hyperlinks.
wenzelm@27061
  2030
wenzelm@25994
  2031
* Theory loader: use_thy (and similar operations) no longer set the
wenzelm@25994
  2032
implicit ML context, which was occasionally hard to predict and in
wenzelm@25994
  2033
conflict with concurrency.  INCOMPATIBILITY, use ML within Isar which
wenzelm@25994
  2034
provides a proper context already.
wenzelm@25994
  2035
wenzelm@26323
  2036
* Theory loader: old-style ML proof scripts being *attached* to a thy
wenzelm@26323
  2037
file are no longer supported.  INCOMPATIBILITY, regular 'uses' and
wenzelm@26323
  2038
'use' within a theory file will do the job.
wenzelm@26323
  2039
wenzelm@26650
  2040
* Name space merge now observes canonical order, i.e. the second space
wenzelm@26650
  2041
is inserted into the first one, while existing entries in the first
wenzelm@26659
  2042
space take precedence.  INCOMPATIBILITY in rare situations, may try to
wenzelm@26650
  2043
swap theory imports.
wenzelm@26650
  2044
wenzelm@27067
  2045
* Syntax: symbol \<chi> is now considered a letter.  Potential
wenzelm@27067
  2046
INCOMPATIBILITY in identifier syntax etc.
wenzelm@27067
  2047
wenzelm@27067
  2048
* Outer syntax: string tokens no longer admit escaped white space,
wenzelm@27067
  2049
which was an accidental (undocumented) feature.  INCOMPATIBILITY, use
wenzelm@27067
  2050
white space without escapes.
wenzelm@27067
  2051
wenzelm@27067
  2052
* Outer syntax: string tokens may contain arbitrary character codes
wenzelm@27067
  2053
specified via 3 decimal digits (as in SML).  E.g. "foo\095bar" for
wenzelm@27067
  2054
"foo_bar".
wenzelm@27067
  2055
wenzelm@25522
  2056
haftmann@25502
  2057
*** Pure ***
haftmann@25502
  2058
wenzelm@26718
  2059
* Context-dependent token translations.  Default setup reverts locally
wenzelm@26718
  2060
fixed variables, and adds hilite markup for undeclared frees.
wenzelm@26718
  2061
berghofe@26681
  2062
* Unused theorems can be found using the new command 'unused_thms'.
berghofe@26681
  2063
There are three ways of invoking it:
berghofe@26681
  2064
berghofe@26681
  2065
(1) unused_thms
berghofe@26681
  2066
     Only finds unused theorems in the current theory.
berghofe@26681
  2067
berghofe@26681
  2068
(2) unused_thms thy_1 ... thy_n -
berghofe@26681
  2069
     Finds unused theorems in the current theory and all of its ancestors,
berghofe@26681
  2070
     excluding the theories thy_1 ... thy_n and all of their ancestors.
berghofe@26681
  2071
berghofe@26681
  2072
(3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
berghofe@26681
  2073
     Finds unused theorems in the theories thy'_1 ... thy'_m and all of
berghofe@26681
  2074
     their ancestors, excluding the theories thy_1 ... thy_n and all of
berghofe@26681
  2075
     their ancestors.
berghofe@26681
  2076
wenzelm@26718
  2077
In order to increase the readability of the list produced by
wenzelm@26718
  2078
unused_thms, theorems that have been created by a particular instance
wenzelm@26874
  2079
of a theory command such as 'inductive' or 'function' are considered
wenzelm@26874
  2080
to belong to the same "group", meaning that if at least one theorem in
wenzelm@26718
  2081
this group is used, the other theorems in the same group are no longer
wenzelm@26718
  2082
reported as unused.  Moreover, if all theorems in the group are
wenzelm@26718
  2083
unused, only one theorem in the group is displayed.
wenzelm@26718
  2084
wenzelm@26718
  2085
Note that proof objects have to be switched on in order for
wenzelm@26718
  2086
unused_thms to work properly (i.e. !proofs must be >= 1, which is
wenzelm@26874
  2087
usually the case when using Proof General with the default settings).
berghofe@26681
  2088
wenzelm@26650
  2089
* Authentic naming of facts disallows ad-hoc overwriting of previous
wenzelm@26650
  2090
theorems within the same name space.  INCOMPATIBILITY, need to remove
wenzelm@26650
  2091
duplicate fact bindings, or even accidental fact duplications.  Note
wenzelm@26650
  2092
that tools may maintain dynamically scoped facts systematically, using
wenzelm@26650
  2093
PureThy.add_thms_dynamic.
wenzelm@26650
  2094
wenzelm@26660
  2095
* Command 'hide' now allows to hide from "fact" name space as well.
wenzelm@26660
  2096
wenzelm@26496
  2097
* Eliminated destructive theorem database, simpset, claset, and
wenzelm@26496
  2098
clasimpset.  Potential INCOMPATIBILITY, really need to observe linear
wenzelm@26496
  2099
update of theories within ML code.
wenzelm@26479
  2100
wenzelm@26955
  2101
* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm@26955
  2102
INCOMPATIBILITY, object-logics depending on former Pure require
wenzelm@26955
  2103
additional setup PureThy.old_appl_syntax_setup; object-logics
wenzelm@26955
  2104
depending on former CPure need to refer to Pure.
wenzelm@26650
  2105
wenzelm@26495
  2106
* Commands 'use' and 'ML' are now purely functional, operating on
wenzelm@26479
  2107
theory/local_theory.  Removed former 'ML_setup' (on theory), use 'ML'
wenzelm@26479
  2108
instead.  Added 'ML_val' as mere diagnostic replacement for 'ML'.
wenzelm@26479
  2109
INCOMPATIBILITY.
wenzelm@26479
  2110
wenzelm@26874
  2111
* Command 'setup': discontinued implicit version with ML reference.
wenzelm@26434
  2112
wenzelm@25970
  2113
* Instantiation target allows for simultaneous specification of class
wenzelm@25970
  2114
instance operations together with an instantiation proof.
wenzelm@25970
  2115
Type-checking phase allows to refer to class operations uniformly.
wenzelm@27067
  2116
See src/HOL/Complex/Complex.thy for an Isar example and
wenzelm@27067
  2117
src/HOL/Library/Eval.thy for an ML example.
haftmann@25502
  2118
wenzelm@26201
  2119
* Indexing of literal facts: be more serious about including only
wenzelm@26201
  2120
facts from the visible specification/proof context, but not the
wenzelm@26201
  2121
background context (locale etc.).  Affects `prop` notation and method
wenzelm@26201
  2122
"fact".  INCOMPATIBILITY: need to name facts explicitly in rare
wenzelm@26201
  2123
situations.
wenzelm@26201
  2124
wenzelm@26925
  2125
* Method "cases", "induct", "coinduct": removed obsolete/undocumented
wenzelm@26925
  2126
"(open)" option, which used to expose internal bound variables to the
wenzelm@26925
  2127
proof text.
wenzelm@26925
  2128
wenzelm@26925
  2129
* Isar statements: removed obsolete case "rule_context".
wenzelm@26925
  2130
INCOMPATIBILITY, better use explicit fixes/assumes.
wenzelm@26925
  2131
wenzelm@26874
  2132
* Locale proofs: default proof step now includes 'unfold_locales';
wenzelm@26874
  2133
hence 'proof' without argument may be used to unfold locale
wenzelm@26874
  2134
predicates.
ballarin@26765
  2135
ballarin@26765
  2136
haftmann@26762
  2137
*** Document preparation ***
haftmann@26762
  2138
wenzelm@26914
  2139
* Simplified pdfsetup.sty: color/hyperref is used unconditionally for
wenzelm@26914
  2140
both pdf and dvi (hyperlinks usually work in xdvi as well); removed
wenzelm@26914
  2141
obsolete thumbpdf setup (contemporary PDF viewers do this on the
wenzelm@26914
  2142
spot); renamed link color from "darkblue" to "linkcolor" (default
wenzelm@26920
  2143
value unchanged, can be redefined via \definecolor); no longer sets
wenzelm@26920
  2144
"a4paper" option (unnecessary or even intrusive).
wenzelm@26914
  2145
wenzelm@27008
  2146
* Antiquotation @{lemma A method} proves proposition A by the given
wenzelm@27008
  2147
method (either a method name or a method name plus (optional) method
wenzelm@27008
  2148
arguments in parentheses) and prints A just like @{prop A}.
haftmann@26762
  2149
haftmann@26762
  2150
wenzelm@25464
  2151
*** HOL ***
wenzelm@25464
  2152
wenzelm@27067
  2153
* New primrec package.  Specification syntax conforms in style to
wenzelm@27067
  2154
definition/function/....  No separate induction rule is provided.  The
wenzelm@27067
  2155
"primrec" command distinguishes old-style and new-style specifications
wenzelm@27067
  2156
by syntax.  The former primrec package is now named OldPrimrecPackage.
wenzelm@27067
  2157
When adjusting theories, beware: constants stemming from new-style
wenzelm@27067
  2158
primrec specifications have authentic syntax.
wenzelm@27067
  2159
wenzelm@27067
  2160
* Metis prover is now an order of magnitude faster, and also works
wenzelm@27067
  2161
with multithreading.
wenzelm@27067
  2162
wenzelm@27067
  2163
* Metis: the maximum number of clauses that can be produced from a
wenzelm@27067
  2164
theorem is now given by the attribute max_clauses.  Theorems that
wenzelm@27067
  2165
exceed this number are ignored, with a warning printed.
wenzelm@27067
  2166
wenzelm@27067
  2167
* Sledgehammer no longer produces structured proofs by default. To
wenzelm@27067
  2168
enable, declare [[sledgehammer_full = true]].  Attributes
wenzelm@27067
  2169
reconstruction_modulus, reconstruction_sorts renamed
wenzelm@27067
  2170
sledgehammer_modulus, sledgehammer_sorts.  INCOMPATIBILITY.
wenzelm@27067
  2171
haftmann@27104
  2172
* Method "induct_scheme" derives user-specified induction rules
wenzelm@27067
  2173
from well-founded induction and completeness of patterns. This factors
wenzelm@27067
  2174
out some operations that are done internally by the function package
wenzelm@27067
  2175
and makes them available separately.  See
wenzelm@27067
  2176
src/HOL/ex/Induction_Scheme.thy for examples.
wenzelm@27067
  2177
wenzelm@27067
  2178
* More flexible generation of measure functions for termination
wenzelm@27067
  2179
proofs: Measure functions can be declared by proving a rule of the
wenzelm@27067
  2180
form "is_measure f" and giving it the [measure_function] attribute.
wenzelm@27067
  2181
The "is_measure" predicate is logically meaningless (always true), and
wenzelm@27067
  2182
just guides the heuristic.  To find suitable measure functions, the
wenzelm@27067
  2183
termination prover sets up the goal "is_measure ?f" of the appropriate
wenzelm@27067
  2184
type and generates all solutions by prolog-style backwards proof using
wenzelm@27067
  2185
the declared rules.
wenzelm@27067
  2186
wenzelm@27067
  2187
This setup also deals with rules like 
wenzelm@27067
  2188
wenzelm@27067
  2189
  "is_measure f ==> is_measure (list_size f)"
wenzelm@27067
  2190
wenzelm@27067
  2191
which accommodates nested datatypes that recurse through lists.
wenzelm@27067
  2192
Similar rules are predeclared for products and option types.
wenzelm@27067
  2193
berghofe@26964
  2194
* Turned the type of sets "'a set" into an abbreviation for "'a => bool"
berghofe@26964
  2195
berghofe@26964
  2196
  INCOMPATIBILITIES:
berghofe@26964
  2197
wenzelm@27008
  2198
  - Definitions of overloaded constants on sets have to be replaced by
wenzelm@27008
  2199
    definitions on => and bool.
berghofe@26964
  2200
berghofe@26964
  2201
  - Some definitions of overloaded operators on sets can now be proved
wenzelm@27008
  2202
    using the definitions of the operators on => and bool.  Therefore,
wenzelm@27008
  2203
    the following theorems have been renamed:
berghofe@26964
  2204
berghofe@26964
  2205
      subset_def   -> subset_eq
berghofe@26964
  2206
      psubset_def  -> psubset_eq
berghofe@26964
  2207
      set_diff_def -> set_diff_eq
berghofe@26964
  2208
      Compl_def    -> Compl_eq
berghofe@26964
  2209
      Sup_set_def  -> Sup_set_eq
berghofe@26964
  2210
      Inf_set_def  -> Inf_set_eq
berghofe@26964
  2211
      sup_set_def  -> sup_set_eq
berghofe@26964
  2212
      inf_set_def  -> inf_set_eq
berghofe@26964
  2213
berghofe@26964
  2214
  - Due to the incompleteness of the HO unification algorithm, some
berghofe@26964
  2215
    rules such as subst may require manual instantiation, if some of
berghofe@26964
  2216
    the unknowns in the rule is a set.
berghofe@26964
  2217
berghofe@26964
  2218
  - Higher order unification and forward proofs:
berghofe@26964
  2219
    The proof pattern
berghofe@26964
  2220
berghofe@26964
  2221
      have "P (S::'a set)" <...>
berghofe@26964
  2222
      then have "EX S. P S" ..
berghofe@26964
  2223
wenzelm@27008
  2224
    no longer works (due to the incompleteness of the HO unification
wenzelm@27008
  2225
    algorithm) and must be replaced by the pattern
berghofe@26964
  2226
berghofe@26964
  2227
      have "EX S. P S"
berghofe@26964
  2228
      proof
berghofe@26964
  2229
        show "P S" <...>
berghofe@26964
  2230
      qed
berghofe@26964
  2231
berghofe@26964
  2232
  - Calculational reasoning with subst (or similar rules):
berghofe@26964
  2233
    The proof pattern
berghofe@26964
  2234
berghofe@26964
  2235
      have "P (S::'a set)" <...>
berghofe@26964
  2236
      also have "S = T" <...>
berghofe@26964
  2237
      finally have "P T" .
berghofe@26964
  2238
wenzelm@27008
  2239
    no longer works (for similar reasons as the previous example) and
wenzelm@27008
  2240
    must be replaced by something like
berghofe@26964
  2241
berghofe@26964
  2242
      have "P (S::'a set)" <...>
berghofe@26964
  2243
      moreover have "S = T" <...>
berghofe@26964
  2244
      ultimately have "P T" by simp
berghofe@26964
  2245
berghofe@26964
  2246
  - Tactics or packages written in ML code:
berghofe@26964
  2247
    Code performing pattern matching on types via
berghofe@26964
  2248
berghofe@26964
  2249
      Type ("set", [T]) => ...
berghofe@26964
  2250
wenzelm@27008
  2251
    must be rewritten. Moreover, functions like strip_type or
wenzelm@27008
  2252
    binder_types no longer return the right value when applied to a
wenzelm@27008
  2253
    type of the form
berghofe@26964
  2254
berghofe@26964
  2255
      T1 => ... => Tn => U => bool
berghofe@26964
  2256
berghofe@26964
  2257
    rather than
berghofe@26964
  2258
berghofe@26964
  2259
      T1 => ... => Tn => U set
berghofe@26964
  2260
wenzelm@26874
  2261
* Merged theories Wellfounded_Recursion, Accessible_Part and
wenzelm@27067
  2262
Wellfounded_Relations to theory Wellfounded.
krauss@26748
  2263
haftmann@26513
  2264
* Explicit class "eq" for executable equality.  INCOMPATIBILITY.
haftmann@26513
  2265
wenzelm@26874
  2266
* Class finite no longer treats UNIV as class parameter.  Use class
wenzelm@26874
  2267
enum from theory Library/Enum instead to achieve a similar effect.
haftmann@26445
  2268
INCOMPATIBILITY.
haftmann@26445
  2269
wenzelm@26874
  2270
* Theory List: rule list_induct2 now has explicitly named cases "Nil"
wenzelm@26874
  2271
and "Cons".  INCOMPATIBILITY.
wenzelm@26874
  2272
wenzelm@26422
  2273
* HOL (and FOL): renamed variables in rules imp_elim and swap.
wenzelm@26422
  2274
Potential INCOMPATIBILITY.
wenzelm@26422
  2275
wenzelm@26874
  2276
* Theory Product_Type: duplicated lemmas split_Pair_apply and
wenzelm@26874
  2277
injective_fst_snd removed, use split_eta and prod_eqI instead.
wenzelm@26874
  2278
Renamed upd_fst to apfst and upd_snd to apsnd.  INCOMPATIBILITY.
haftmann@26355
  2279
wenzelm@26335
  2280
* Theory Nat: removed redundant lemmas that merely duplicate lemmas of
wenzelm@26335
  2281
the same name in theory Orderings:
wenzelm@26335
  2282
wenzelm@26335
  2283
  less_trans
wenzelm@26335
  2284
  less_linear
wenzelm@26335
  2285
  le_imp_less_or_eq
wenzelm@26335
  2286
  le_less_trans
wenzelm@26335
  2287
  less_le_trans
wenzelm@26335
  2288
  less_not_sym
wenzelm@26335
  2289
  less_asym
wenzelm@26335
  2290
wenzelm@26335
  2291
Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
wenzelm@26335
  2292
less_irrefl_nat.  Potential INCOMPATIBILITY due to more general types
wenzelm@26335
  2293
and different variable names.
wenzelm@26315
  2294
haftmann@26231
  2295
* Library/Option_ord.thy: Canonical order on option type.
haftmann@26231
  2296
wenzelm@27008
  2297
* Library/RBT.thy: Red-black trees, an efficient implementation of
wenzelm@27008
  2298
finite maps.
krauss@26197
  2299
haftmann@26231
  2300
* Library/Countable.thy: Type class for countable types.
haftmann@26231
  2301
wenzelm@26180
  2302
* Theory Int: The representation of numerals has changed.  The infix
wenzelm@26180
  2303
operator BIT and the bit datatype with constructors B0 and B1 have
wenzelm@26180
  2304
disappeared.  INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
wenzelm@26180
  2305
place of "x BIT bit.B0" and "y BIT bit.B1", respectively.  Theorems
wenzelm@26180
  2306
involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
wenzelm@26180
  2307
accordingly.
wenzelm@26180
  2308
wenzelm@26180
  2309
* Theory Nat: definition of <= and < on natural numbers no longer
wenzelm@26180
  2310
depend on well-founded relations.  INCOMPATIBILITY.  Definitions
wenzelm@26180
  2311
le_def and less_def have disappeared.  Consider lemmas not_less
wenzelm@26180
  2312
[symmetric, where ?'a = nat] and less_eq [symmetric] instead.
wenzelm@26180
  2313
wenzelm@26180
  2314
* Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
wenzelm@26180
  2315
(whose purpose mainly is for various fold_set functionals) have been
wenzelm@26874
  2316
abandoned in favor of the existing algebraic classes
wenzelm@26180
  2317
ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
wenzelm@26180
  2318
lower_semilattice (resp. upper_semilattice) and linorder.
haftmann@26139
  2319
INCOMPATIBILITY.
haftmann@26041
  2320
wenzelm@26180
  2321
* Theory Transitive_Closure: induct and cases rules now declare proper
wenzelm@26180
  2322
case_names ("base" and "step").  INCOMPATIBILITY.
wenzelm@26180
  2323
wenzelm@26180
  2324
* Theorem Inductive.lfp_ordinal_induct generalized to complete
wenzelm@26180
  2325
lattices.  The form set-specific version is available as
wenzelm@26180
  2326
Inductive.lfp_ordinal_induct_set.
haftmann@26013
  2327
wenzelm@26874
  2328
* Renamed theorems "power.simps" to "power_int.simps".
wenzelm@27067
  2329
INCOMPATIBILITY.
haftmann@25961
  2330
wenzelm@26180
  2331
* Class semiring_div provides basic abstract properties of semirings
haftmann@25942
  2332
with division and modulo operations.  Subsumes former class dvd_mod.
haftmann@25942
  2333
wenzelm@26180
  2334
* Merged theories IntDef, Numeral and IntArith into unified theory
wenzelm@26180
  2335
Int.  INCOMPATIBILITY.
wenzelm@26180
  2336
wenzelm@26180
  2337
* Theory Library/Code_Index: type "index" now represents natural
wenzelm@26180
  2338
numbers rather than integers.  INCOMPATIBILITY.
wenzelm@26180
  2339
wenzelm@26180
  2340
* New class "uminus" with operation "uminus" (split of from class
wenzelm@26180
  2341
"minus" which now only has operation "minus", binary).
haftmann@25919
  2342
INCOMPATIBILITY.
haftmann@25919
  2343
wenzelm@25522
  2344
* Constants "card", "internal_split", "option_map" now with authentic
haftmann@25919
  2345
syntax.  INCOMPATIBILITY.
wenzelm@25522
  2346
wenzelm@25522
  2347
* Definitions subset_def, psubset_def, set_diff_def, Compl_def,
wenzelm@25522
  2348
le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
wenzelm@25522
  2349
sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
wenzelm@25522
  2350
Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
wenzelm@25522
  2351
Sup_set_def, le_def, less_def, option_map_def now with object
haftmann@25919
  2352
equality.  INCOMPATIBILITY.
wenzelm@25464
  2353
schirmer@25705
  2354
* Records. Removed K_record, and replaced it by pure lambda term
wenzelm@25726
  2355
%x. c. The simplifier setup is now more robust against eta expansion.
schirmer@25705
  2356
INCOMPATIBILITY: in cases explicitly referring to K_record.
wenzelm@25464
  2357
wenzelm@27067
  2358
* Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
wenzelm@27067
  2359
wenzelm@27067
  2360
* Library/ListVector: new theory of arithmetic vector operations.
wenzelm@27067
  2361
wenzelm@27067
  2362
* Library/Order_Relation: new theory of various orderings as sets of
wenzelm@27067
  2363
pairs.  Defines preorders, partial orders, linear orders and
wenzelm@27067
  2364
well-orders on sets and on types.
krauss@26877
  2365
wenzelm@25726
  2366
krauss@26197
  2367
*** ZF ***
krauss@26197
  2368
wenzelm@26874
  2369
* Renamed some theories to allow to loading both ZF and HOL in the
wenzelm@26874
  2370
same session:
wenzelm@26874
  2371
wenzelm@26874
  2372
  Datatype  -> Datatype_ZF
wenzelm@26874
  2373
  Inductive -> Inductive_ZF
wenzelm@26874
  2374
  Int       -> Int_ZF
wenzelm@26874
  2375
  IntDiv    -> IntDiv_ZF
wenzelm@26874
  2376
  Nat       -> Nat_ZF
wenzelm@26874
  2377
  List      -> List_ZF
wenzelm@26874
  2378
  Main      -> Main_ZF
wenzelm@26874
  2379
wenzelm@26874
  2380
INCOMPATIBILITY: ZF theories that import individual theories below
wenzelm@26874
  2381
Main might need to be adapted.  Regular theory Main is still
wenzelm@26874
  2382
available, as trivial extension of Main_ZF.
krauss@26197
  2383
krauss@26197
  2384
wenzelm@25737
  2385
*** ML ***
wenzelm@25737
  2386
wenzelm@27067
  2387
* ML within Isar: antiquotation @{const name} or @{const
wenzelm@27067
  2388
name(typargs)} produces statically-checked Const term.
wenzelm@27067
  2389
wenzelm@26401
  2390
* Functor NamedThmsFun: data is available to the user as dynamic fact
wenzelm@26724
  2391
(of the same name).  Removed obsolete print command.
wenzelm@26401
  2392
wenzelm@27067
  2393
* Removed obsolete "use_legacy_bindings" function.
wenzelm@26188
  2394
wenzelm@25737
  2395
* The ``print mode'' is now a thread-local value derived from a global
wenzelm@25737
  2396
template (the former print_mode reference), thus access becomes
wenzelm@25737
  2397
non-critical.  The global print_mode reference is for session
wenzelm@25737
  2398
management only; user-code should use print_mode_value,
wenzelm@25737
  2399
print_mode_active, PrintMode.setmp etc.  INCOMPATIBILITY.
wenzelm@25737
  2400
wenzelm@26874
  2401
* Functions system/system_out provide a robust way to invoke external
wenzelm@29161
  2402
shell commands, with propagation of interrupts (requires Poly/ML
wenzelm@29161
  2403
5.2.1).  Do not use OS.Process.system etc. from the basis library!
wenzelm@26222
  2404
wenzelm@25737
  2405
wenzelm@25626
  2406
*** System ***
wenzelm@25626
  2407
wenzelm@25971
  2408
* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
wenzelm@25971
  2409
in accordance with Proof General 3.7, which prefers GNU emacs.
wenzelm@25970
  2410
wenzelm@25626
  2411
* isatool tty runs Isabelle process with plain tty interaction;
wenzelm@25626
  2412
optional line editor may be specified via ISABELLE_LINE_EDITOR
wenzelm@25626
  2413
setting, the default settings attempt to locate "ledit" and "rlwrap".
wenzelm@25626
  2414
wenzelm@25651
  2415
* isatool browser now works with Cygwin as well, using general
wenzelm@25651
  2416
"javapath" function defined in Isabelle process environment.
wenzelm@25651
  2417
wenzelm@27067
  2418
* YXML notation provides a simple and efficient alternative to
wenzelm@27067
  2419
standard XML transfer syntax.  See src/Pure/General/yxml.ML and
wenzelm@27067
  2420
isatool yxml as described in the Isabelle system manual.
wenzelm@25651
  2421
wenzelm@25652
  2422
* JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
wenzelm@25651
  2423
provides general wrapper for managing an Isabelle process in a robust
wenzelm@25651
  2424
fashion, with ``cooked'' output from stdin/stderr.
wenzelm@25651
  2425
wenzelm@25855
  2426
* Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
wenzelm@25855
  2427
based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
wenzelm@25855
  2428
wenzelm@27067
  2429
* Removed obsolete THIS_IS_ISABELLE_BUILD feature.  NB: the documented
wenzelm@27067
  2430
way of changing the user's settings is via
wenzelm@27067
  2431
ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
wenzelm@27067
  2432
script.
wenzelm@27067
  2433
wenzelm@27067
  2434
* Multithreading.max_threads := 0 refers to the number of actual CPU
wenzelm@27067
  2435
cores of the underlying machine, which is a good starting point for
wenzelm@27067
  2436
optimal performance tuning.  The corresponding usedir option -M allows
wenzelm@27067
  2437
"max" as an alias for "0".  WARNING: does not work on certain versions
wenzelm@27067
  2438
of Mac OS (with Poly/ML 5.1).
wenzelm@27067
  2439
wenzelm@27067
  2440
* isabelle-process: non-ML sessions are run with "nice", to reduce the
wenzelm@27067
  2441
adverse effect of Isabelle flooding interactive front-ends (notably
wenzelm@27067
  2442
ProofGeneral / XEmacs).
wenzelm@27067
  2443
wenzelm@25626
  2444
wenzelm@25464
  2445
wenzelm@25429
  2446
New in Isabelle2007 (November 2007)
wenzelm@25429
  2447
-----------------------------------
wenzelm@17754
  2448
wenzelm@17754
  2449
*** General ***
wenzelm@17754
  2450
wenzelm@22826
  2451
* More uniform information about legacy features, notably a
wenzelm@22826
  2452
warning/error of "Legacy feature: ...", depending on the state of the
wenzelm@23367
  2453
tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
wenzelm@23367
  2454
legacy features will disappear eventually.
wenzelm@22826
  2455
wenzelm@17918
  2456
* Theory syntax: the header format ``theory A = B + C:'' has been
wenzelm@17918
  2457
discontinued in favour of ``theory A imports B C begin''.  Use isatool
wenzelm@17918
  2458
fixheaders to convert existing theory files.  INCOMPATIBILITY.
wenzelm@17918
  2459
wenzelm@17918
  2460
* Theory syntax: the old non-Isar theory file format has been
wenzelm@17918
  2461
discontinued altogether.  Note that ML proof scripts may still be used
wenzelm@17918
  2462
with Isar theories; migration is usually quite simple with the ML
wenzelm@17918
  2463
function use_legacy_bindings.  INCOMPATIBILITY.
wenzelm@17918
  2464
wenzelm@22871
  2465
* Theory syntax: some popular names (e.g. 'class', 'declaration',
wenzelm@22871
  2466
'fun', 'help', 'if') are now keywords.  INCOMPATIBILITY, use double
wenzelm@22871
  2467
quotes.
wenzelm@19814
  2468
wenzelm@23888
  2469
* Theory loader: be more serious about observing the static theory
wenzelm@23888
  2470
header specifications (including optional directories), but not the
wenzelm@24172
  2471
accidental file locations of previously successful loads.  The strict
wenzelm@24172
  2472
update policy of former update_thy is now already performed by
wenzelm@24172
  2473
use_thy, so the former has been removed; use_thys updates several
wenzelm@24172
  2474
theories simultaneously, just as 'imports' within a theory header
wenzelm@24172
  2475
specification, but without merging the results.  Potential
wenzelm@24172
  2476
INCOMPATIBILITY: may need to refine theory headers and commands
wenzelm@24172
  2477
ROOT.ML which depend on load order.
wenzelm@23888
  2478
wenzelm@23888
  2479
* Theory loader: optional support for content-based file
wenzelm@23888
  2480
identification, instead of the traditional scheme of full physical
wenzelm@23889
  2481
path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
wenzelm@23888
  2482
(cf. the system manual).  The new scheme allows to work with
wenzelm@23888
  2483
non-finished theories in persistent session images, such that source
wenzelm@23888
  2484
files may be moved later on without requiring reloads.
wenzelm@23888
  2485
wenzelm@24187
  2486
* Theory loader: old-style ML proof scripts being *attached* to a thy
wenzelm@24187
  2487
file (with the same base name as the theory) are considered a legacy
wenzelm@24800
  2488
feature, which will disappear eventually. Even now, the theory loader
wenzelm@24800
  2489
no longer maintains dependencies on such files.
wenzelm@24800
  2490
wenzelm@24800
  2491
* Syntax: the scope for resolving ambiguities via type-inference is
wenzelm@24800
  2492
now limited to individual terms, instead of whole simultaneous
wenzelm@24234
  2493
specifications as before. This greatly reduces the complexity of the
wenzelm@24234
  2494
syntax module and improves flexibility by separating parsing and
wenzelm@24234
  2495
type-checking. INCOMPATIBILITY: additional type-constraints (explicit
wenzelm@24234
  2496
'fixes' etc.) are required in rare situations.
wenzelm@24234
  2497
wenzelm@25034
  2498
* Syntax: constants introduced by new-style packages ('definition',
wenzelm@25034
  2499
'abbreviation' etc.) are passed through the syntax module in
wenzelm@25034
  2500
``authentic mode''. This means that associated mixfix annotations
wenzelm@25034
  2501
really stick to such constants, independently of potential name space
wenzelm@25034
  2502
ambiguities introduced later on. INCOMPATIBILITY: constants in parse
wenzelm@25034
  2503
trees are represented slightly differently, may need to adapt syntax
wenzelm@25034
  2504
translations accordingly. Use CONST marker in 'translations' and
wenzelm@25034
  2505
@{const_syntax} antiquotation in 'parse_translation' etc.
wenzelm@25034
  2506
wenzelm@17981
  2507
* Legacy goal package: reduced interface to the bare minimum required
wenzelm@17981
  2508
to keep existing proof scripts running.  Most other user-level
wenzelm@17981
  2509
functions are now part of the OldGoals structure, which is *not* open
wenzelm@17981
  2510
by default (consider isatool expandshort before open OldGoals).
wenzelm@17981
  2511
Removed top_sg, prin, printyp, pprint_term/typ altogether, because
wenzelm@17981
  2512
these tend to cause confusion about the actual goal (!) context being
wenzelm@17981
  2513
used here, which is not necessarily the same as the_context().
wenzelm@17918
  2514
wenzelm@23379
  2515
* Command 'find_theorems': supports "*" wild-card in "name:"
wenzelm@23379
  2516
criterion; "with_dups" option.  Certain ProofGeneral versions might
wenzelm@23379
  2517
support a specific search form (see ProofGeneral/CHANGES).
webertj@22965
  2518
wenzelm@20370
  2519
* The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
wenzelm@20370
  2520
by default, which means that "prems" (and also "fixed variables") are
wenzelm@20370
  2521
suppressed from proof state output.  Note that the ProofGeneral
wenzelm@20370
  2522
settings mechanism allows to change and save options persistently, but
wenzelm@20370
  2523
older versions of Isabelle will fail to start up if a negative prems
wenzelm@20370
  2524
limit is imposed.
wenzelm@20370
  2525
wenzelm@21308
  2526
* Local theory targets may be specified by non-nested blocks of
wenzelm@21308
  2527
``context/locale/class ... begin'' followed by ``end''.  The body may
wenzelm@21308
  2528
contain definitions, theorems etc., including any derived mechanism
wenzelm@21308
  2529
that has been implemented on top of these primitives.  This concept
wenzelm@21308
  2530
generalizes the existing ``theorem (in ...)'' towards more versatility
wenzelm@21308
  2531
and scalability.
wenzelm@21308
  2532
wenzelm@21960
  2533
* Proof General interface: proper undo of final 'end' command;
wenzelm@21960
  2534
discontinued Isabelle/classic mode (ML proof scripts).
wenzelm@21960
  2535
wenzelm@17754
  2536
wenzelm@17865
  2537
*** Document preparation ***
wenzelm@17865
  2538
wenzelm@21717
  2539
* Added antiquotation @{theory name} which prints the given name,
wenzelm@21717
  2540
after checking that it refers to a valid ancestor theory in the
wenzelm@21717
  2541
current context.
haftmann@21339
  2542
wenzelm@17869
  2543
* Added antiquotations @{ML_type text} and @{ML_struct text} which
wenzelm@17869
  2544
check the given source text as ML type/structure, printing verbatim.
wenzelm@17865
  2545
wenzelm@21717
  2546
* Added antiquotation @{abbrev "c args"} which prints the abbreviation
wenzelm@21717
  2547
"c args == rhs" given in the current context.  (Any number of
wenzelm@21735
  2548
arguments may be given on the LHS.)
wenzelm@21717
  2549
wenzelm@21717
  2550
wenzelm@17779
  2551
*** Pure ***
wenzelm@17779
  2552
wenzelm@24800
  2553
* The 'class' package offers a combination of axclass and locale to
wenzelm@25129
  2554
achieve Haskell-like type classes in Isabelle.  Definitions and
wenzelm@25129
  2555
theorems within a class context produce both relative results (with
wenzelm@25129
  2556
implicit parameters according to the locale context), and polymorphic
wenzelm@25129
  2557
constants with qualified polymorphism (according to the class
wenzelm@25129
  2558
context).  Within the body context of a 'class' target, a separate
wenzelm@25129
  2559
syntax layer ("user space type system") takes care of converting
wenzelm@25129
  2560
between global polymorphic consts and internal locale representation.
wenzelm@25177
  2561
See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
haftmann@25184
  2562
"isatool doc classes" provides a tutorial.
wenzelm@20807
  2563
haftmann@25199
  2564
* Generic code generator framework allows to generate executable
wenzelm@24800
  2565
code for ML and Haskell (including Isabelle classes).  A short usage
wenzelm@24800
  2566
sketch:
haftmann@20188
  2567
haftmann@20188
  2568
    internal compilation:
haftmann@25199
  2569
        export_code <list of constants (term syntax)> in SML
haftmann@20453
  2570
    writing SML code to a file:
haftmann@25199
  2571
        export_code <list of constants (term syntax)> in SML <filename>
haftmann@22735
  2572
    writing OCaml code to a file:
haftmann@25199
  2573
        export_code <list of constants (term syntax)> in OCaml <filename>
haftmann@20188
  2574
    writing Haskell code to a bunch of files:
haftmann@25199
  2575
        export_code <list of constants (term syntax)> in Haskell <filename>
haftmann@25199
  2576
haftmann@25199
  2577
    evaluating closed propositions to True/False using code generation:
haftmann@25184
  2578
        method ``eval''
haftmann@25184
  2579
haftmann@25184
  2580
Reasonable default setup of framework in HOL.
haftmann@20453
  2581
haftmann@20453
  2582
Theorem attributs for selecting and transforming function equations theorems:
haftmann@20453
  2583
haftmann@22845
  2584
    [code fun]:        select a theorem as function equation for a specific constant
haftmann@22845
  2585
    [code fun del]:    deselect a theorem as function equation for a specific constant
haftmann@22845
  2586
    [code inline]:     select an equation theorem for unfolding (inlining) in place
haftmann@22845
  2587
    [code inline del]: deselect an equation theorem for unfolding (inlining) in place
haftmann@20453
  2588
haftmann@22735
  2589
User-defined serializations (target in {SML, OCaml, Haskell}):
haftmann@20453
  2590
haftmann@20453
  2591
    code_const <and-list of constants (term syntax)>
haftmann@20453
  2592
      {(target) <and-list of const target syntax>}+
haftmann@20453
  2593
haftmann@20453
  2594
    code_type <and-list of type constructors>
haftmann@20453
  2595
      {(target) <and-list of type target syntax>}+
haftmann@20453
  2596
haftmann@20453
  2597
    code_instance <and-list of instances>
haftmann@20453
  2598
      {(target)}+
haftmann@20453
  2599
        where instance ::= <type constructor> :: <class>
haftmann@20453
  2600
haftmann@20453
  2601
    code_class <and_list of classes>
haftmann@20453
  2602
      {(target) <and-list of class target syntax>}+
haftmann@20453
  2603
        where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
haftmann@20453
  2604
haftmann@25199
  2605
code_instance and code_class only are effective to target Haskell.
haftmann@22735
  2606
wenzelm@25177
  2607
For example usage see src/HOL/ex/Codegenerator.thy and
wenzelm@25177
  2608
src/HOL/ex/Codegenerator_Pretty.thy.  A separate tutorial on code
wenzelm@24800
  2609
generation from Isabelle/HOL theories is available via "isatool doc
wenzelm@24800
  2610
codegen".
haftmann@20188
  2611
wenzelm@25129
  2612
* Code generator: consts in 'consts_code' Isar commands are now
wenzelm@25129
  2613
referred to by usual term syntax (including optional type
wenzelm@25129
  2614
annotations).
wenzelm@25129
  2615
wenzelm@19254
  2616
* Command 'no_translations' removes translation rules from theory
wenzelm@19254
  2617
syntax.
wenzelm@19254
  2618
wenzelm@19625
  2619
* Overloaded definitions are now actually checked for acyclic
wenzelm@19714
  2620
dependencies.  The overloading scheme is slightly more general than
wenzelm@19714
  2621
that of Haskell98, although Isabelle does not demand an exact
wenzelm@19714
  2622
correspondence to type class and instance declarations.
wenzelm@19714
  2623
INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
wenzelm@19714
  2624
exotic versions of overloading -- at the discretion of the user!
wenzelm@19711
  2625
wenzelm@19711
  2626
Polymorphic constants are represented via type arguments, i.e. the
wenzelm@19711
  2627
instantiation that matches an instance against the most general
wenzelm@19711
  2628
declaration given in the signature.  For example, with the declaration
wenzelm@19711
  2629
c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
wenzelm@19711
  2630
as c(nat).  Overloading is essentially simultaneous structural
wenzelm@19711
  2631
recursion over such type arguments.  Incomplete specification patterns
wenzelm@19714
  2632
impose global constraints on all occurrences, e.g. c('a * 'a) on the
wenzelm@19715
  2633
LHS means that more general c('a * 'b) will be disallowed on any RHS.
wenzelm@19714
  2634
Command 'print_theory' outputs the normalized system of recursive
wenzelm@19714
  2635
equations, see section "definitions".
wenzelm@19625
  2636
wenzelm@24086
  2637
* Configuration options are maintained within the theory or proof
wenzelm@24086
  2638
context (with name and type bool/int/string), providing a very simple
wenzelm@24086
  2639
interface to a poor-man's version of general context data.  Tools may
wenzelm@24110
  2640
declare options in ML (e.g. using Attrib.config_int) and then refer to
wenzelm@24110
  2641
these values using Config.get etc.  Users may change options via an
wenzelm@24110
  2642
associated attribute of the same name.  This form of context
wenzelm@24110
  2643
declaration works particularly well with commands 'declare' or
wenzelm@24110
  2644
'using', for example ``declare [[foo = 42]]''.  Thus it has become
wenzelm@24110
  2645
very easy to avoid global references, which would not observe Isar
wenzelm@24110
  2646
toplevel undo/redo and fail to work with multithreading.
wenzelm@24086
  2647
wenzelm@24172
  2648
Various global ML references of Pure and HOL have been turned into
wenzelm@24172
  2649
configuration options:
wenzelm@24172
  2650
wenzelm@24172
  2651
  Unify.search_bound		unify_search_bound
wenzelm@24172
  2652
  Unify.trace_bound		unify_trace_bound
wenzelm@24172
  2653
  Unify.trace_simp		unify_trace_simp
wenzelm@24172
  2654
  Unify.trace_types		unify_trace_types
wenzelm@24172
  2655
  Simplifier.simp_depth_limit	simp_depth_limit
wenzelm@24172
  2656
  Blast.depth_limit		blast_depth_limit
wenzelm@24172
  2657
  DatatypeProp.dtK		datatype_distinctness_limit
wenzelm@24172
  2658
  fast_arith_neq_limit  	fast_arith_neq_limit
wenzelm@24172
  2659
  fast_arith_split_limit	fast_arith_split_limit
wenzelm@24172
  2660
wenzelm@24086
  2661
* Named collections of theorems may be easily installed as context
wenzelm@24800
  2662
data using the functor NamedThmsFun (see also
wenzelm@24086
  2663
src/Pure/Tools/named_thms.ML).  The user may add or delete facts via
wenzelm@24110
  2664
attributes; there is also a toplevel print command.  This facility is
wenzelm@24110
  2665
just a common case of general context data, which is the preferred way
wenzelm@24110
  2666
for anything more complex than just a list of facts in canonical
wenzelm@24110
  2667
order.
wenzelm@24086
  2668
wenzelm@24032
  2669
* Isar: command 'declaration' augments a local theory by generic
wenzelm@24032
  2670
declaration functions written in ML.  This enables arbitrary content
wenzelm@24032
  2671
being added to the context, depending on a morphism that tells the
wenzelm@24032
  2672
difference of the original declaration context wrt. the application
wenzelm@24