NEWS
author schirmer
Thu May 06 20:43:30 2004 +0200 (2004-05-06)
changeset 14709 d01983034ded
parent 14707 2d6350d7b9b7
child 14731 5670fc027a3b
permissions -rw-r--r--
tuned HOL/record package; enabled record_upd_simproc by default.
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@14655
     4
New in this Isabelle release
wenzelm@14655
     5
----------------------------
wenzelm@14655
     6
wenzelm@14655
     7
*** General ***
wenzelm@14655
     8
wenzelm@14655
     9
* Pure: considerably improved version of 'constdefs' command.  Now
wenzelm@14655
    10
performs automatic type-inference of declared constants; additional
wenzelm@14655
    11
support for local structure declarations (cf. locales and HOL
wenzelm@14655
    12
records), see also isar-ref manual.  Potential INCOMPATIBILITY: need
wenzelm@14655
    13
to observe strictly sequential dependencies of definitions within a
wenzelm@14698
    14
single 'constdefs' section; moreover, the declared name needs to be an
wenzelm@14698
    15
identifier.  If all fails, consider to fall back on 'consts' and
wenzelm@14698
    16
'defs' separately.
wenzelm@14655
    17
wenzelm@14698
    18
* Pure: improved indexed syntax and implicit structures.  First of
wenzelm@14699
    19
all, indexed syntax provides a notational device for subscripted
wenzelm@14698
    20
application, using the new syntax \<^bsub>term\<^esub> for arbitrary
wenzelm@14698
    21
expressions.  Secondly, in a local context with structure
wenzelm@14698
    22
declarations, number indexes \<^sub>n or the empty index (default
wenzelm@14707
    23
number 1) refer to a certain fixed variable implicitly; option
wenzelm@14707
    24
show_structs controls printing of implicit structures.  Typical
wenzelm@14698
    25
applications of these concepts involve record types and locales.
wenzelm@14698
    26
wenzelm@14707
    27
* Pure: 'advanced' translation functions (parse_translation etc.) may
wenzelm@14707
    28
depend on the signature of the theory context being presently used for
wenzelm@14707
    29
parsing/printing, see also isar-ref manual.
wenzelm@14707
    30
wenzelm@14698
    31
* Pure: tuned internal renaming of symbolic identifiers -- attach
wenzelm@14698
    32
primes instead of base 26 numbers.
wenzelm@14698
    33
wenzelm@14707
    34
schirmer@14700
    35
*** HOL ***
schirmer@14700
    36
schirmer@14709
    37
schirmer@14709
    38
* HOL/record: reimplementation of records. Improved scalability for records with
schirmer@14709
    39
many fields, avoiding performance problems for type inference. Records are no 
schirmer@14709
    40
longer composed of nested field types,
schirmer@14709
    41
but of nested extension types. Therefore the record type only grows
schirmer@14709
    42
linear in the number of extensions and not in the number of fields.
schirmer@14709
    43
The top-level (users) view on records is preserved. 
wenzelm@14707
    44
Potential INCOMPATIBILITY only in strange cases, where the theory
schirmer@14709
    45
depends on the old record representation. The type generated for
schirmer@14709
    46
a record is called <record_name>_ext_type.    
schirmer@14709
    47
schirmer@14709
    48
schirmer@14709
    49
* Simplifier: "record_upd_simproc" for simplification of multiple record 
schirmer@14709
    50
updates enabled by default. 
schirmer@14709
    51
INCOMPATIBILITY: old proofs break occasionally, since simplification
schirmer@14709
    52
is more powerful by default.
wenzelm@14655
    53
wenzelm@14682
    54
*** HOLCF ***
wenzelm@14682
    55
wenzelm@14682
    56
* HOLCF: discontinued special version of 'constdefs' (which used to
wenzelm@14682
    57
support continuous functions) in favor of the general Pure one with
wenzelm@14682
    58
full type-inference.
wenzelm@14682
    59
wenzelm@14682
    60
wenzelm@14655
    61
wenzelm@14606
    62
New in Isabelle2004 (April 2004)
wenzelm@14606
    63
--------------------------------
wenzelm@13280
    64
skalberg@14171
    65
*** General ***
skalberg@14171
    66
ballarin@14398
    67
* Provers/order.ML:  new efficient reasoner for partial and linear orders.
ballarin@14398
    68
  Replaces linorder.ML.
ballarin@14398
    69
wenzelm@14606
    70
* Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
wenzelm@14606
    71
  (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
skalberg@14173
    72
  (\<a>...\<z>), are now considered normal letters, and can therefore
skalberg@14173
    73
  be used anywhere where an ASCII letter (a...zA...Z) has until
skalberg@14173
    74
  now. COMPATIBILITY: This obviously changes the parsing of some
skalberg@14173
    75
  terms, especially where a symbol has been used as a binder, say
skalberg@14173
    76
  '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
skalberg@14173
    77
  as an identifier.  Fix it by inserting a space around former
skalberg@14173
    78
  symbols.  Call 'isatool fixgreek' to try to fix parsing errors in
skalberg@14173
    79
  existing theory and ML files.
skalberg@14171
    80
paulson@14237
    81
* Pure: Macintosh and Windows line-breaks are now allowed in theory files.
paulson@14237
    82
kleing@14234
    83
* Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now 
wenzelm@14606
    84
  allowed in identifiers. Similar to Greek letters \<^isub> is now considered 
kleing@14234
    85
  a normal (but invisible) letter. For multiple letter subscripts repeat 
kleing@14234
    86
  \<^isub> like this: x\<^isub>1\<^isub>2. 
kleing@14233
    87
kleing@14333
    88
* Pure: There are now sub-/superscripts that can span more than one
kleing@14333
    89
  character. Text between \<^bsub> and \<^esub> is set in subscript in
wenzelm@14606
    90
  ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
wenzelm@14606
    91
  superscript. The new control characters are not identifier parts.
kleing@14333
    92
schirmer@14561
    93
* Pure: Control-symbols of the form \<^raw:...> will literally print the
wenzelm@14606
    94
  content of "..." to the latex file instead of \isacntrl... . The "..."
wenzelm@14606
    95
  may consist of any printable characters excluding the end bracket >.
schirmer@14361
    96
paulson@14237
    97
* Pure: Using new Isar command "finalconsts" (or the ML functions
paulson@14237
    98
  Theory.add_finals or Theory.add_finals_i) it is now possible to
paulson@14237
    99
  declare constants "final", which prevents their being given a definition
paulson@14237
   100
  later.  It is useful for constants whose behaviour is fixed axiomatically
skalberg@14224
   101
  rather than definitionally, such as the meta-logic connectives.
skalberg@14224
   102
wenzelm@14606
   103
* Pure: 'instance' now handles general arities with general sorts
wenzelm@14606
   104
  (i.e. intersections of classes),
skalberg@14503
   105
kleing@14547
   106
* Presentation: generated HTML now uses a CSS style sheet to make layout
wenzelm@14606
   107
  (somewhat) independent of content. It is copied from lib/html/isabelle.css. 
kleing@14547
   108
  It can be changed to alter the colors/layout of generated pages.
kleing@14547
   109
wenzelm@14556
   110
ballarin@14175
   111
*** Isar ***
ballarin@14175
   112
ballarin@14508
   113
* Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
ballarin@14508
   114
  cut_tac, subgoal_tac and thin_tac:
ballarin@14175
   115
  - Now understand static (Isar) contexts.  As a consequence, users of Isar
ballarin@14175
   116
    locales are no longer forced to write Isar proof scripts.
ballarin@14175
   117
    For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
ballarin@14175
   118
    emulations.
ballarin@14175
   119
  - INCOMPATIBILITY: names of variables to be instantiated may no
ballarin@14211
   120
    longer be enclosed in quotes.  Instead, precede variable name with `?'.
ballarin@14211
   121
    This is consistent with the instantiation attribute "where".
ballarin@14211
   122
ballarin@14257
   123
* Attributes "where" and "of":
ballarin@14285
   124
  - Now take type variables of instantiated theorem into account when reading
ballarin@14285
   125
    the instantiation string.  This fixes a bug that caused instantiated
ballarin@14285
   126
    theorems to have too special types in some circumstances.
ballarin@14285
   127
  - "where" permits explicit instantiations of type variables.
ballarin@14257
   128
wenzelm@14556
   129
* Calculation commands "moreover" and "also" no longer interfere with
wenzelm@14556
   130
  current facts ("this"), admitting arbitrary combinations with "then"
wenzelm@14556
   131
  and derived forms.
kleing@14283
   132
ballarin@14211
   133
* Locales:
ballarin@14211
   134
  - Goal statements involving the context element "includes" no longer
ballarin@14211
   135
    generate theorems with internal delta predicates (those ending on
ballarin@14211
   136
    "_axioms") in the premise.
ballarin@14211
   137
    Resolve particular premise with <locale>.intro to obtain old form.
ballarin@14211
   138
  - Fixed bug in type inference ("unify_frozen") that prevented mix of target
ballarin@14211
   139
    specification and "includes" elements in goal statement.
ballarin@14254
   140
  - Rule sets <locale>.intro and <locale>.axioms no longer declared as
ballarin@14254
   141
    [intro?] and [elim?] (respectively) by default.
ballarin@14508
   142
  - Experimental command for instantiation of locales in proof contexts:
ballarin@14551
   143
        instantiate <label>[<attrs>]: <loc>
ballarin@14508
   144
    Instantiates locale <loc> and adds all its theorems to the current context
ballarin@14551
   145
    taking into account their attributes.  Label and attrs are optional
ballarin@14551
   146
    modifiers, like in theorem declarations.  If present, names of
ballarin@14551
   147
    instantiated theorems are qualified with <label>, and the attributes
ballarin@14551
   148
    <attrs> are applied after any attributes these theorems might have already.
ballarin@14551
   149
      If the locale has assumptions, a chained fact of the form
ballarin@14508
   150
    "<loc> t1 ... tn" is expected from which instantiations of the parameters
ballarin@14551
   151
    are derived.  The command does not support old-style locales declared
ballarin@14551
   152
    with "locale (open)".
ballarin@14551
   153
      A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
ballarin@14175
   154
ballarin@14175
   155
* HOL: Tactic emulation methods induct_tac and case_tac understand static
ballarin@14175
   156
  (Isar) contexts.
ballarin@14175
   157
wenzelm@14556
   158
kleing@14136
   159
*** HOL ***
kleing@14136
   160
kleing@14624
   161
* Proof import: new image HOL4 contains the imported library from
kleing@14624
   162
  the HOL4 system with about 2500 theorems. It is imported by
kleing@14624
   163
  replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
kleing@14624
   164
  can be used like any other Isabelle image.  See
kleing@14624
   165
  HOL/Import/HOL/README for more information.
kleing@14624
   166
ballarin@14398
   167
* Simplifier:
ballarin@14398
   168
  - Much improved handling of linear and partial orders.
ballarin@14398
   169
    Reasoners for linear and partial orders are set up for type classes
ballarin@14398
   170
    "linorder" and "order" respectively, and are added to the default simpset
ballarin@14398
   171
    as solvers.  This means that the simplifier can build transitivity chains
ballarin@14398
   172
    to solve goals from the assumptions.
ballarin@14398
   173
  - INCOMPATIBILITY: old proofs break occasionally.  Typically, applications
ballarin@14398
   174
    of blast or auto after simplification become unnecessary because the goal
ballarin@14398
   175
    is solved by simplification already.
ballarin@14398
   176
paulson@14389
   177
* Numerics: new theory Ring_and_Field contains over 250 basic numerical laws, 
paulson@14389
   178
    all proved in axiomatic type classes for semirings, rings and fields.
paulson@14389
   179
paulson@14389
   180
* Numerics:
paulson@14389
   181
  - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
paulson@14389
   182
    now formalized using the Ring_and_Field theory mentioned above. 
paulson@14389
   183
  - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
paulson@14389
   184
    than before, because now they are set up once in a generic manner.
paulson@14480
   185
  - INCOMPATIBILITY: many type-specific arithmetic laws have gone. 
paulson@14480
   186
    Look for the general versions in Ring_and_Field (and Power if they concern
paulson@14480
   187
    exponentiation).
paulson@14389
   188
paulson@14401
   189
* Type "rat" of the rational numbers is now available in HOL-Complex.
paulson@14389
   190
schirmer@14255
   191
* Records:
schirmer@14255
   192
  - Record types are now by default printed with their type abbreviation
schirmer@14255
   193
    instead of the list of all field types. This can be configured via
schirmer@14255
   194
    the reference "print_record_type_abbr".
schirmer@14255
   195
  - Simproc "record_upd_simproc" for simplification of multiple updates added 
schirmer@14255
   196
    (not enabled by default).
schirmer@14427
   197
  - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
schirmer@14427
   198
    EX x. x = sel r to True (not enabled by default).
schirmer@14255
   199
  - Tactic "record_split_simp_tac" to split and simplify records added.
schirmer@14255
   200
 
kleing@14136
   201
* 'specification' command added, allowing for definition by
skalberg@14224
   202
  specification.  There is also an 'ax_specification' command that
skalberg@14224
   203
  introduces the new constants axiomatically.
kleing@14136
   204
nipkow@14375
   205
* arith(_tac) is now able to generate counterexamples for reals as well.
nipkow@14375
   206
ballarin@14399
   207
* HOL-Algebra: new locale "ring" for non-commutative rings.
ballarin@14399
   208
paulson@14243
   209
* HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
kleing@14610
   210
  definitions, thanks to Sava Krsti\'{c} and John Matthews.
kleing@14610
   211
kleing@14610
   212
* HOL-Matrix: a first theory for matrices in HOL with an application of 
kleing@14610
   213
  matrix theory to linear programming.
kleing@14136
   214
nipkow@14380
   215
* Unions and Intersections:
nipkow@14380
   216
  The x-symbol output syntax of UN and INT has been changed
nipkow@14380
   217
  from "\<Union>x \<in> A. B" to "\<Union\<^bsub>x \<in> A\<^esub> B"
nipkow@14380
   218
  i.e. the index formulae has become a subscript, like in normal math.
nipkow@14380
   219
  Similarly for "\<Union>x. B", and for \<Inter> instead of \<Union>.
nipkow@14380
   220
  The subscript version is also accepted as input syntax.
nipkow@14380
   221
kleing@14418
   222
* Unions and Intersections over Intervals:
kleing@14418
   223
  There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is 
kleing@14418
   224
  also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A" 
kleing@14418
   225
  like in normal math, and corresponding versions for < and for intersection.
kleing@14418
   226
paulson@14401
   227
* ML: the legacy theory structures Int and List have been removed. They had
paulson@14401
   228
  conflicted with ML Basis Library structures having the same names.
nipkow@14380
   229
webertj@14464
   230
* 'refute' command added to search for (finite) countermodels.  Only works
webertj@14464
   231
  for a fragment of HOL.  The installation of an external SAT solver is
webertj@14464
   232
  highly recommended.  See "HOL/Refute.thy" for details.
webertj@14464
   233
berghofe@14602
   234
* 'quickcheck' command: Allows to find counterexamples by evaluating
berghofe@14602
   235
  formulae under an assignment of free variables to random values.
berghofe@14602
   236
  In contrast to 'refute', it can deal with inductive datatypes,
berghofe@14602
   237
  but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
berghofe@14602
   238
  for examples.
webertj@14464
   239
wenzelm@14606
   240
oheimb@14536
   241
*** HOLCF ***
oheimb@14536
   242
oheimb@14536
   243
* Streams now come with concatenation and are part of the HOLCF image
oheimb@14536
   244
wenzelm@14572
   245
wenzelm@14572
   246
kleing@14136
   247
New in Isabelle2003 (May 2003)
wenzelm@14606
   248
------------------------------
kleing@14136
   249
wenzelm@13280
   250
*** General ***
wenzelm@13280
   251
berghofe@13618
   252
* Provers/simplifier:
berghofe@13618
   253
nipkow@13781
   254
  - Completely reimplemented method simp (ML: Asm_full_simp_tac):
berghofe@13618
   255
    Assumptions are now subject to complete mutual simplification,
berghofe@13618
   256
    not just from left to right. The simplifier now preserves
berghofe@13618
   257
    the order of assumptions.
berghofe@13618
   258
berghofe@13618
   259
    Potential INCOMPATIBILITY:
berghofe@13618
   260
nipkow@13781
   261
    -- simp sometimes diverges where the old version did
nipkow@13781
   262
       not, e.g. invoking simp on the goal
berghofe@13618
   263
berghofe@13618
   264
        [| P (f x); y = x; f x = f y |] ==> Q
berghofe@13618
   265
nipkow@13781
   266
       now gives rise to the infinite reduction sequence
nipkow@13781
   267
nipkow@13781
   268
        P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
nipkow@13781
   269
nipkow@13781
   270
       Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
nipkow@13781
   271
       kind of problem.
nipkow@13781
   272
nipkow@13781
   273
    -- Tactics combining classical reasoner and simplification (such as auto)
nipkow@13781
   274
       are also affected by this change, because many of them rely on
nipkow@13781
   275
       simp. They may sometimes diverge as well or yield a different numbers
nipkow@13781
   276
       of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
nipkow@13781
   277
       in case of problems. Sometimes subsequent calls to the classical
nipkow@13781
   278
       reasoner will fail because a preceeding call to the simplifier too
nipkow@13781
   279
       eagerly simplified the goal, e.g. deleted redundant premises.
berghofe@13618
   280
berghofe@13618
   281
  - The simplifier trace now shows the names of the applied rewrite rules
berghofe@13618
   282
nipkow@13829
   283
  - You can limit the number of recursive invocations of the simplifier
nipkow@13829
   284
    during conditional rewriting (where the simplifie tries to solve the
nipkow@13829
   285
    conditions before applying the rewrite rule):
nipkow@13829
   286
    ML "simp_depth_limit := n"
nipkow@13829
   287
    where n is an integer. Thus you can force termination where previously
nipkow@13829
   288
    the simplifier would diverge.
nipkow@13829
   289
ballarin@13835
   290
  - Accepts free variables as head terms in congruence rules.  Useful in Isar.
nipkow@13829
   291
ballarin@13938
   292
  - No longer aborts on failed congruence proof.  Instead, the
ballarin@13938
   293
    congruence is ignored.
ballarin@13938
   294
berghofe@14008
   295
* Pure: New generic framework for extracting programs from constructive
berghofe@14008
   296
  proofs. See HOL/Extraction.thy for an example instantiation, as well
berghofe@14008
   297
  as HOL/Extraction for some case studies.
berghofe@14008
   298
nipkow@13868
   299
* Pure: The main goal of the proof state is no longer shown by default, only
nipkow@13868
   300
the subgoals. This behaviour is controlled by a new flag.
ballarin@13835
   301
   PG menu: Isabelle/Isar -> Settings -> Show Main Goal
nipkow@13815
   302
(ML: Proof.show_main_goal).
nipkow@13815
   303
nipkow@13815
   304
* Pure: You can find all matching introduction rules for subgoal 1, i.e. all
nipkow@13815
   305
rules whose conclusion matches subgoal 1:
nipkow@13815
   306
      PG menu: Isabelle/Isar -> Show me -> matching rules
nipkow@13815
   307
The rules are ordered by how closely they match the subgoal.
nipkow@13815
   308
In particular, rules that solve a subgoal outright are displayed first
nipkow@13815
   309
(or rather last, the way they are printed).
nipkow@13815
   310
(ML: ProofGeneral.print_intros())
nipkow@13815
   311
nipkow@13815
   312
* Pure: New flag trace_unify_fail causes unification to print
nipkow@13781
   313
diagnostic information (PG: in trace buffer) when it fails. This is
nipkow@13781
   314
useful for figuring out why single step proofs like rule, erule or
nipkow@13781
   315
assumption failed.
nipkow@13781
   316
nipkow@13815
   317
* Pure: Locale specifications now produce predicate definitions
wenzelm@13410
   318
according to the body of text (covering assumptions modulo local
wenzelm@13410
   319
definitions); predicate "loc_axioms" covers newly introduced text,
wenzelm@13410
   320
while "loc" is cumulative wrt. all included locale expressions; the
wenzelm@13410
   321
latter view is presented only on export into the global theory
wenzelm@13410
   322
context; potential INCOMPATIBILITY, use "(open)" option to fall back
wenzelm@13410
   323
on the old view without predicates;
wenzelm@13410
   324
wenzelm@13459
   325
* Pure: predefined locales "var" and "struct" are useful for sharing
wenzelm@13459
   326
parameters (as in CASL, for example); just specify something like
wenzelm@13459
   327
``var x + var y + struct M'' as import;
wenzelm@13459
   328
wenzelm@13463
   329
* Pure: improved thms_containing: proper indexing of facts instead of
wenzelm@13463
   330
raw theorems; check validity of results wrt. current name space;
wenzelm@13463
   331
include local facts of proof configuration (also covers active
wenzelm@13541
   332
locales), cover fixed variables in index; may use "_" in term
wenzelm@13541
   333
specification; an optional limit for the number of printed facts may
wenzelm@13541
   334
be given (the default is 40);
wenzelm@13541
   335
wenzelm@13541
   336
* Pure: disallow duplicate fact bindings within new-style theory files
wenzelm@13541
   337
(batch-mode only);
wenzelm@13540
   338
wenzelm@13463
   339
* Provers: improved induct method: assumptions introduced by case
wenzelm@13463
   340
"foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
wenzelm@13463
   341
the goal statement); "foo" still refers to all facts collectively;
wenzelm@13463
   342
paulson@13550
   343
* Provers: the function blast.overloaded has been removed: all constants
paulson@13550
   344
are regarded as potentially overloaded, which improves robustness in exchange
paulson@13550
   345
for slight decrease in efficiency;
paulson@13550
   346
nipkow@13781
   347
* Provers/linorder: New generic prover for transitivity reasoning over
nipkow@13781
   348
linear orders.  Note: this prover is not efficient!
nipkow@13781
   349
wenzelm@13522
   350
* Isar: preview of problems to finish 'show' now produce an error
wenzelm@13522
   351
rather than just a warning (in interactive mode);
wenzelm@13522
   352
wenzelm@13280
   353
nipkow@13158
   354
*** HOL ***
nipkow@13158
   355
nipkow@13899
   356
* arith(_tac)
nipkow@13899
   357
nipkow@13899
   358
 - Produces a counter example if it cannot prove a goal.
nipkow@13899
   359
   Note that the counter example may be spurious if the goal is not a formula
nipkow@13899
   360
   of quantifier-free linear arithmetic.
nipkow@13899
   361
   In ProofGeneral the counter example appears in the trace buffer.
nipkow@13899
   362
nipkow@13899
   363
 - Knows about div k and mod k where k is a numeral of type nat or int.
nipkow@13899
   364
nipkow@13899
   365
 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
nipkow@13899
   366
   linear arithmetic fails. This takes account of quantifiers and divisibility.
nipkow@13899
   367
   Presburger arithmetic can also be called explicitly via presburger(_tac). 
nipkow@13899
   368
nipkow@13899
   369
* simp's arithmetic capabilities have been enhanced a bit: it now
nipkow@13899
   370
takes ~= in premises into account (by performing a case split);
nipkow@13899
   371
nipkow@13899
   372
* simp reduces "m*(n div m) + n mod m" to n, even if the two summands
nipkow@13899
   373
are distributed over a sum of terms;
nipkow@13899
   374
ballarin@13735
   375
* New tactic "trans_tac" and method "trans" instantiate
ballarin@13735
   376
Provers/linorder.ML for axclasses "order" and "linorder" (predicates
ballarin@13735
   377
"<=", "<" and "="). 
ballarin@13735
   378
paulson@13587
   379
* function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main 
paulson@13587
   380
HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
paulson@13587
   381
wenzelm@13443
   382
* 'typedef' command has new option "open" to suppress the set
wenzelm@13443
   383
definition;
wenzelm@13443
   384
wenzelm@13522
   385
* functions Min and Max on finite sets have been introduced (theory
wenzelm@13522
   386
Finite_Set);
nipkow@13492
   387
wenzelm@13443
   388
* attribute [symmetric] now works for relations as well; it turns
wenzelm@13443
   389
(x,y) : R^-1 into (y,x) : R, and vice versa;
wenzelm@13443
   390
nipkow@13613
   391
* induct over a !!-quantified statement (say !!x1..xn):
nipkow@13613
   392
  each "case" automatically performs "fix x1 .. xn" with exactly those names.
nipkow@13613
   393
nipkow@13899
   394
* Map: `empty' is no longer a constant but a syntactic abbreviation for
nipkow@13899
   395
%x. None. Warning: empty_def now refers to the previously hidden definition
nipkow@13899
   396
of the empty set.
nipkow@13899
   397
ballarin@14018
   398
* Algebra: formalization of classical algebra.  Intended as base for
ballarin@14018
   399
any algebraic development in Isabelle.  Currently covers group theory
ballarin@14018
   400
(up to Sylow's theorem) and ring theory (Universal Property of
ballarin@14018
   401
Univariate Polynomials).  Contributions welcome;
paulson@13960
   402
paulson@13960
   403
* GroupTheory: deleted, since its material has been moved to Algebra;
paulson@13960
   404
paulson@13966
   405
* Complex: new directory of the complex numbers with numeric constants, 
paulson@13966
   406
nonstandard complex numbers, and some complex analysis, standard and 
paulson@13966
   407
nonstandard (Jacques Fleuriot);
paulson@13966
   408
paulson@13966
   409
* HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
paulson@13966
   410
paulson@13966
   411
* Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques 
paulson@13966
   412
Fleuriot);
paulson@13960
   413
wenzelm@13549
   414
* Real/HahnBanach: updated and adapted to locales;
wenzelm@13549
   415
ballarin@13995
   416
* NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
ballarin@13995
   417
Gray and Kramer);
paulson@13872
   418
paulson@13872
   419
* UNITY: added the Meier-Sanders theory of progress sets;
paulson@13872
   420
kleing@14011
   421
* MicroJava: bytecode verifier and lightweight bytecode verifier
kleing@14011
   422
as abstract algorithms, instantiated to the JVM;
kleing@14011
   423
schirmer@14010
   424
* Bali: Java source language formalization. Type system, operational
schirmer@14010
   425
semantics, axiomatic semantics. Supported language features:
schirmer@14010
   426
classes, interfaces, objects,virtual methods, static methods,
schirmer@14010
   427
static/instance fields, arrays, access modifiers, definite
schirmer@14010
   428
assignment, exceptions.
wenzelm@13549
   429
kleing@14011
   430
wenzelm@13549
   431
*** ZF ***
wenzelm@13549
   432
wenzelm@13549
   433
* ZF/Constructible: consistency proof for AC (Gödel's constructible
wenzelm@13549
   434
universe, etc.);
wenzelm@13549
   435
paulson@13872
   436
* Main ZF: virtually all theories converted to new-style format;
nipkow@13518
   437
wenzelm@13280
   438
wenzelm@13478
   439
*** ML ***
wenzelm@13478
   440
wenzelm@13478
   441
* Pure: Tactic.prove provides sane interface for internal proofs;
wenzelm@13478
   442
omits the infamous "standard" operation, so this is more appropriate
wenzelm@13478
   443
than prove_goalw_cterm in many situations (e.g. in simprocs);
wenzelm@13478
   444
wenzelm@13478
   445
* Pure: improved error reporting of simprocs;
wenzelm@13478
   446
wenzelm@13478
   447
* Provers: Simplifier.simproc(_i) provides sane interface for setting
wenzelm@13478
   448
up simprocs;
wenzelm@13478
   449
wenzelm@13478
   450
kleing@13953
   451
*** Document preparation ***
kleing@13953
   452
kleing@13953
   453
* uses \par instead of \\ for line breaks in theory text. This may
kleing@13953
   454
shift some page breaks in large documents. To get the old behaviour
kleing@13953
   455
use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
kleing@13953
   456
kleing@13953
   457
* minimized dependencies of isabelle.sty and isabellesym.sty on 
kleing@13953
   458
other packages
kleing@13953
   459
kleing@13953
   460
* \<euro> now needs package babel/greek instead of marvosym (which
kleing@13953
   461
broke \Rightarrow)
kleing@13953
   462
kleing@13954
   463
* normal size for \<zero>...\<nine> (uses \mathbf instead of 
kleing@13954
   464
textcomp package)
kleing@13953
   465
wenzelm@13280
   466
wenzelm@14572
   467
wenzelm@12984
   468
New in Isabelle2002 (March 2002)
wenzelm@12984
   469
--------------------------------
wenzelm@11474
   470
wenzelm@11572
   471
*** Document preparation ***
wenzelm@11572
   472
wenzelm@11842
   473
* greatly simplified document preparation setup, including more
wenzelm@11842
   474
graceful interpretation of isatool usedir -i/-d/-D options, and more
wenzelm@11842
   475
instructive isatool mkdir; users should basically be able to get
wenzelm@12899
   476
started with "isatool mkdir HOL Test && isatool make"; alternatively,
wenzelm@12899
   477
users may run a separate document processing stage manually like this:
wenzelm@12899
   478
"isatool usedir -D output HOL Test && isatool document Test/output";
wenzelm@11842
   479
wenzelm@11842
   480
* theory dependency graph may now be incorporated into documents;
wenzelm@11842
   481
isatool usedir -g true will produce session_graph.eps/.pdf for use
wenzelm@11842
   482
with \includegraphics of LaTeX;
wenzelm@11842
   483
wenzelm@11864
   484
* proper spacing of consecutive markup elements, especially text
wenzelm@11864
   485
blocks after section headings;
wenzelm@11864
   486
wenzelm@11572
   487
* support bold style (for single symbols only), input syntax is like
wenzelm@11572
   488
this: "\<^bold>\<alpha>" or "\<^bold>A";
wenzelm@11572
   489
wenzelm@11814
   490
* \<bullet> is now output as bold \cdot by default, which looks much
wenzelm@11572
   491
better in printed text;
wenzelm@11572
   492
wenzelm@11712
   493
* added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
wenzelm@11712
   494
note that these symbols are currently unavailable in Proof General /
wenzelm@12769
   495
X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
wenzelm@12690
   496
wenzelm@12690
   497
* isatool latex no longer depends on changed TEXINPUTS, instead
wenzelm@12690
   498
isatool document copies the Isabelle style files to the target
wenzelm@12690
   499
location;
wenzelm@11712
   500
wenzelm@11572
   501
wenzelm@11633
   502
*** Isar ***
wenzelm@11633
   503
wenzelm@12312
   504
* Pure/Provers: improved proof by cases and induction;
wenzelm@12280
   505
  - 'case' command admits impromptu naming of parameters (such as
wenzelm@12280
   506
    "case (Suc n)");
wenzelm@12280
   507
  - 'induct' method divinates rule instantiation from the inductive
wenzelm@12280
   508
    claim; no longer requires excessive ?P bindings for proper
wenzelm@12280
   509
    instantiation of cases;
wenzelm@12280
   510
  - 'induct' method properly enumerates all possibilities of set/type
wenzelm@12280
   511
    rules; as a consequence facts may be also passed through *type*
wenzelm@12280
   512
    rules without further ado;
wenzelm@12280
   513
  - 'induct' method now derives symbolic cases from the *rulified*
wenzelm@12280
   514
    rule (before it used to rulify cases stemming from the internal
wenzelm@12280
   515
    atomized version); this means that the context of a non-atomic
wenzelm@12280
   516
    statement becomes is included in the hypothesis, avoiding the
wenzelm@12280
   517
    slightly cumbersome show "PROP ?case" form;
wenzelm@12280
   518
  - 'induct' may now use elim-style induction rules without chaining
wenzelm@12280
   519
    facts, using ``missing'' premises from the goal state; this allows
wenzelm@12280
   520
    rules stemming from inductive sets to be applied in unstructured
wenzelm@12280
   521
    scripts, while still benefitting from proper handling of non-atomic
wenzelm@12280
   522
    statements; NB: major inductive premises need to be put first, all
wenzelm@12280
   523
    the rest of the goal is passed through the induction;
wenzelm@12280
   524
  - 'induct' proper support for mutual induction involving non-atomic
wenzelm@12280
   525
    rule statements (uses the new concept of simultaneous goals, see
wenzelm@12280
   526
    below);
wenzelm@12853
   527
  - append all possible rule selections, but only use the first
wenzelm@12853
   528
    success (no backtracking);
wenzelm@11995
   529
  - removed obsolete "(simplified)" and "(stripped)" options of methods;
wenzelm@12754
   530
  - undeclared rule case names default to numbers 1, 2, 3, ...;
wenzelm@12754
   531
  - added 'print_induct_rules' (covered by help item in recent Proof
wenzelm@12754
   532
    General versions);
wenzelm@11995
   533
  - moved induct/cases attributes to Pure, methods to Provers;
wenzelm@11995
   534
  - generic method setup instantiated for FOL and HOL;
wenzelm@11986
   535
wenzelm@12163
   536
* Pure: support multiple simultaneous goal statements, for example
wenzelm@12163
   537
"have a: A and b: B" (same for 'theorem' etc.); being a pure
wenzelm@12163
   538
meta-level mechanism, this acts as if several individual goals had
wenzelm@12163
   539
been stated separately; in particular common proof methods need to be
wenzelm@12163
   540
repeated in order to cover all claims; note that a single elimination
wenzelm@12163
   541
step is *not* sufficient to establish the two conjunctions, so this
wenzelm@12163
   542
fails:
wenzelm@12163
   543
wenzelm@12163
   544
  assume "A & B" then have A and B ..   (*".." fails*)
wenzelm@12163
   545
wenzelm@12163
   546
better use "obtain" in situations as above; alternative refer to
wenzelm@12163
   547
multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
wenzelm@12163
   548
wenzelm@12078
   549
* Pure: proper integration with ``locales''; unlike the original
wenzelm@12210
   550
version by Florian Kammüller, Isar locales package high-level proof
wenzelm@12078
   551
contexts rather than raw logical ones (e.g. we admit to include
wenzelm@12280
   552
attributes everywhere); operations on locales include merge and
wenzelm@12964
   553
rename; support for implicit arguments (``structures''); simultaneous
wenzelm@12964
   554
type-inference over imports and text; see also HOL/ex/Locales.thy for
wenzelm@12964
   555
some examples;
wenzelm@12078
   556
wenzelm@12707
   557
* Pure: the following commands have been ``localized'', supporting a
wenzelm@12707
   558
target locale specification "(in name)": 'lemma', 'theorem',
wenzelm@12707
   559
'corollary', 'lemmas', 'theorems', 'declare'; the results will be
wenzelm@12707
   560
stored both within the locale and at the theory level (exported and
wenzelm@12707
   561
qualified by the locale name);
wenzelm@12707
   562
wenzelm@12964
   563
* Pure: theory goals may now be specified in ``long'' form, with
wenzelm@12964
   564
ad-hoc contexts consisting of arbitrary locale elements. for example
wenzelm@12964
   565
``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
wenzelm@12964
   566
definitions may be given, too); the result is a meta-level rule with
wenzelm@12964
   567
the context elements being discharged in the obvious way;
wenzelm@12964
   568
wenzelm@12964
   569
* Pure: new proof command 'using' allows to augment currently used
wenzelm@12964
   570
facts after a goal statement ('using' is syntactically analogous to
wenzelm@12964
   571
'apply', but acts on the goal's facts only); this allows chained facts
wenzelm@12964
   572
to be separated into parts given before and after a claim, as in
wenzelm@12964
   573
``from a and b have C using d and e <proof>'';
wenzelm@12078
   574
wenzelm@11722
   575
* Pure: renamed "antecedent" case to "rule_context";
wenzelm@11722
   576
wenzelm@12964
   577
* Pure: new 'judgment' command records explicit information about the
wenzelm@12964
   578
object-logic embedding (used by several tools internally); no longer
wenzelm@12964
   579
use hard-wired "Trueprop";
wenzelm@12964
   580
wenzelm@11738
   581
* Pure: added 'corollary' command;
wenzelm@11738
   582
wenzelm@11722
   583
* Pure: fixed 'token_translation' command;
wenzelm@11722
   584
wenzelm@11899
   585
* Pure: removed obsolete 'exported' attribute;
wenzelm@11899
   586
wenzelm@11933
   587
* Pure: dummy pattern "_" in is/let is now automatically lifted over
wenzelm@11933
   588
bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
wenzelm@11899
   589
supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
wenzelm@11899
   590
wenzelm@11952
   591
* Pure: method 'atomize' presents local goal premises as object-level
wenzelm@11952
   592
statements (atomic meta-level propositions); setup controlled via
wenzelm@11952
   593
rewrite rules declarations of 'atomize' attribute; example
wenzelm@11952
   594
application: 'induct' method with proper rule statements in improper
wenzelm@11952
   595
proof *scripts*;
wenzelm@11952
   596
wenzelm@12106
   597
* Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
wenzelm@12106
   598
now consider the syntactic context of assumptions, giving a better
wenzelm@12106
   599
chance to get type-inference of the arguments right (this is
wenzelm@12106
   600
especially important for locales);
wenzelm@12106
   601
wenzelm@12312
   602
* Pure: "sorry" no longer requires quick_and_dirty in interactive
wenzelm@12312
   603
mode;
wenzelm@12312
   604
wenzelm@12405
   605
* Pure/obtain: the formal conclusion "thesis", being marked as
wenzelm@12405
   606
``internal'', may no longer be reference directly in the text;
wenzelm@12405
   607
potential INCOMPATIBILITY, may need to use "?thesis" in rare
wenzelm@12405
   608
situations;
wenzelm@12405
   609
wenzelm@12405
   610
* Pure: generic 'sym' attribute which declares a rule both as pure
wenzelm@12405
   611
'elim?' and for the 'symmetric' operation;
wenzelm@12405
   612
wenzelm@12877
   613
* Pure: marginal comments ``--'' may now occur just anywhere in the
wenzelm@12877
   614
text; the fixed correlation with particular command syntax has been
wenzelm@12877
   615
discontinued;
wenzelm@12877
   616
berghofe@13023
   617
* Pure: new method 'rules' is particularly well-suited for proof
berghofe@13023
   618
search in intuitionistic logic; a bit slower than 'blast' or 'fast',
berghofe@13023
   619
but often produces more compact proof terms with less detours;
berghofe@13023
   620
wenzelm@12364
   621
* Pure/Provers/classical: simplified integration with pure rule
wenzelm@12364
   622
attributes and methods; the classical "intro?/elim?/dest?"
wenzelm@12364
   623
declarations coincide with the pure ones; the "rule" method no longer
wenzelm@12364
   624
includes classically swapped intros; "intro" and "elim" methods no
wenzelm@12364
   625
longer pick rules from the context; also got rid of ML declarations
wenzelm@12364
   626
AddXIs/AddXEs/AddXDs; all of this has some potential for
wenzelm@12364
   627
INCOMPATIBILITY;
wenzelm@12364
   628
wenzelm@12405
   629
* Provers/classical: attribute 'swapped' produces classical inversions
wenzelm@12405
   630
of introduction rules;
wenzelm@12405
   631
wenzelm@12364
   632
* Provers/simplifier: 'simplified' attribute may refer to explicit
wenzelm@12364
   633
rules instead of full simplifier context; 'iff' attribute handles
wenzelm@12364
   634
conditional rules;
wenzelm@11936
   635
wenzelm@11745
   636
* HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
wenzelm@11745
   637
wenzelm@11690
   638
* HOL: 'recdef' now fails on unfinished automated proofs, use
wenzelm@11633
   639
"(permissive)" option to recover old behavior;
wenzelm@11633
   640
wenzelm@11933
   641
* HOL: 'inductive' no longer features separate (collective) attributes
wenzelm@11933
   642
for 'intros' (was found too confusing);
wenzelm@11933
   643
wenzelm@12405
   644
* HOL: properly declared induction rules less_induct and
wenzelm@12405
   645
wf_induct_rule;
wenzelm@12405
   646
kleing@11788
   647
wenzelm@11474
   648
*** HOL ***
wenzelm@11474
   649
wenzelm@11702
   650
* HOL: moved over to sane numeral syntax; the new policy is as
wenzelm@11702
   651
follows:
wenzelm@11702
   652
wenzelm@11702
   653
  - 0 and 1 are polymorphic constants, which are defined on any
wenzelm@11702
   654
  numeric type (nat, int, real etc.);
wenzelm@11702
   655
wenzelm@11702
   656
  - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
wenzelm@11702
   657
  binary representation internally;
wenzelm@11702
   658
wenzelm@11702
   659
  - type nat has special constructor Suc, and generally prefers Suc 0
wenzelm@11702
   660
  over 1::nat and Suc (Suc 0) over 2::nat;
wenzelm@11702
   661
wenzelm@12364
   662
This change may cause significant problems of INCOMPATIBILITY; here
wenzelm@12364
   663
are some hints on converting existing sources:
wenzelm@11702
   664
wenzelm@11702
   665
  - due to the new "num" token, "-0" and "-1" etc. are now atomic
wenzelm@11702
   666
  entities, so expressions involving "-" (unary or binary minus) need
wenzelm@11702
   667
  to be spaced properly;
wenzelm@11702
   668
wenzelm@11702
   669
  - existing occurrences of "1" may need to be constraint "1::nat" or
wenzelm@11702
   670
  even replaced by Suc 0; similar for old "2";
wenzelm@11702
   671
wenzelm@11702
   672
  - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
wenzelm@11702
   673
wenzelm@11702
   674
  - remove all special provisions on numerals in proofs;
wenzelm@11702
   675
wenzelm@13042
   676
* HOL: simp rules nat_number expand numerals on nat to Suc/0
wenzelm@12837
   677
representation (depends on bin_arith_simps in the default context);
wenzelm@12837
   678
wenzelm@12736
   679
* HOL: symbolic syntax for x^2 (numeral 2);
wenzelm@12736
   680
wenzelm@12335
   681
* HOL: the class of all HOL types is now called "type" rather than
wenzelm@12335
   682
"term"; INCOMPATIBILITY, need to adapt references to this type class
wenzelm@12335
   683
in axclass/classes, instance/arities, and (usually rare) occurrences
wenzelm@12335
   684
in typings (of consts etc.); internally the class is called
wenzelm@12335
   685
"HOL.type", ML programs should refer to HOLogic.typeS;
wenzelm@12335
   686
wenzelm@12280
   687
* HOL/record package improvements:
wenzelm@12280
   688
  - new derived operations "fields" to build a partial record section,
wenzelm@12280
   689
    "extend" to promote a fixed record to a record scheme, and
wenzelm@12280
   690
    "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
wenzelm@12280
   691
    declared as simp by default;
wenzelm@12587
   692
  - shared operations ("more", "fields", etc.) now need to be always
wenzelm@12587
   693
    qualified) --- potential INCOMPATIBILITY;
wenzelm@12280
   694
  - removed "make_scheme" operations (use "make" with "extend") --
wenzelm@12280
   695
    INCOMPATIBILITY;
wenzelm@11937
   696
  - removed "more" class (simply use "term") -- INCOMPATIBILITY;
wenzelm@12253
   697
  - provides cases/induct rules for use with corresponding Isar
wenzelm@12253
   698
    methods (for concrete records, record schemes, concrete more
wenzelm@12280
   699
    parts, and schematic more parts -- in that order);
wenzelm@11930
   700
  - internal definitions directly based on a light-weight abstract
wenzelm@11930
   701
    theory of product types over typedef rather than datatype;
wenzelm@11930
   702
berghofe@13023
   703
* HOL: generic code generator for generating executable ML code from
berghofe@13023
   704
specifications; specific support for HOL constructs such as inductive
berghofe@13023
   705
datatypes and sets, as well as recursive functions; can be invoked
berghofe@13023
   706
via 'generate_code' theory section;
berghofe@13023
   707
wenzelm@11933
   708
* HOL: canonical cases/induct rules for n-tuples (n = 3..7);
wenzelm@11933
   709
paulson@13824
   710
* HOL: consolidated and renamed several theories.  In particular:
paulson@13824
   711
	Ord.thy has been absorbed into HOL.thy
paulson@13824
   712
	String.thy has been absorbed into List.thy
paulson@13824
   713
 
wenzelm@11802
   714
* HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
wenzelm@11802
   715
(beware of argument permutation!);
wenzelm@11802
   716
wenzelm@11657
   717
* HOL: linorder_less_split superseded by linorder_cases;
wenzelm@11657
   718
wenzelm@12917
   719
* HOL/List: "nodups" renamed to "distinct";
nipkow@12889
   720
wenzelm@11633
   721
* HOL: added "The" definite description operator; move Hilbert's "Eps"
paulson@13824
   722
to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
paulson@13824
   723
  - Ex_def has changed, now need to use some_eq_ex
wenzelm@11437
   724
wenzelm@11572
   725
* HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
wenzelm@11572
   726
in this (rare) case use:
wenzelm@11572
   727
wenzelm@11572
   728
  delSWrapper "split_all_tac"
wenzelm@11572
   729
  addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
wenzelm@11572
   730
wenzelm@11572
   731
* HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
wenzelm@11474
   732
MAY FAIL;
nipkow@11361
   733
wenzelm@11572
   734
* HOL: introduced f^n = f o ... o f; warning: due to the limits of
wenzelm@11572
   735
Isabelle's type classes, ^ on functions and relations has too general
wenzelm@11572
   736
a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
wenzelm@11572
   737
necessary to attach explicit type constraints;
nipkow@11307
   738
wenzelm@12917
   739
* HOL/Relation: the prefix name of the infix "O" has been changed from
wenzelm@12917
   740
"comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
wenzelm@12917
   741
renamed accordingly (eg "compI" -> "rel_compI").
nipkow@12489
   742
wenzelm@11487
   743
* HOL: syntax translations now work properly with numerals and records
wenzelm@11487
   744
expressions;
wenzelm@11474
   745
wenzelm@12457
   746
* HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
wenzelm@12457
   747
of "lam" -- INCOMPATIBILITY;
wenzelm@11474
   748
wenzelm@11933
   749
* HOL: got rid of some global declarations (potential INCOMPATIBILITY
wenzelm@11933
   750
for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
wenzelm@11933
   751
renamed "Product_Type.unit";
wenzelm@11611
   752
nipkow@12564
   753
* HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
nipkow@12564
   754
wenzelm@12924
   755
* HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
wenzelm@12924
   756
the "cases" method);
wenzelm@12924
   757
wenzelm@12597
   758
* HOL/GroupTheory: group theory examples including Sylow's theorem (by
wenzelm@12597
   759
Florian Kammüller);
wenzelm@12597
   760
wenzelm@12608
   761
* HOL/IMP: updated and converted to new-style theory format; several
wenzelm@12608
   762
parts turned into readable document, with proper Isar proof texts and
wenzelm@12608
   763
some explanations (by Gerwin Klein);
wenzelm@12597
   764
wenzelm@12734
   765
* HOL-Real: added Complex_Numbers (by Gertrud Bauer);
wenzelm@12734
   766
wenzelm@12690
   767
* HOL-Hyperreal is now a logic image;
wenzelm@12690
   768
wenzelm@11611
   769
wenzelm@12022
   770
*** HOLCF ***
wenzelm@12022
   771
wenzelm@12622
   772
* Isar: consts/constdefs supports mixfix syntax for continuous
wenzelm@12622
   773
operations;
wenzelm@12622
   774
wenzelm@12622
   775
* Isar: domain package adapted to new-style theory format, e.g. see
wenzelm@12622
   776
HOLCF/ex/Dnat.thy;
wenzelm@12622
   777
wenzelm@12622
   778
* theory Lift: proper use of rep_datatype lift instead of ML hacks --
wenzelm@12280
   779
potential INCOMPATIBILITY; now use plain induct_tac instead of former
wenzelm@12280
   780
lift.induct_tac, always use UU instead of Undef;
wenzelm@12022
   781
wenzelm@12597
   782
* HOLCF/IMP: updated and converted to new-style theory;
wenzelm@12597
   783
wenzelm@12022
   784
wenzelm@11474
   785
*** ZF ***
wenzelm@11474
   786
wenzelm@12622
   787
* Isar: proper integration of logic-specific tools and packages,
wenzelm@12622
   788
including theory commands '(co)inductive', '(co)datatype',
wenzelm@12622
   789
'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
wenzelm@12622
   790
'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
wenzelm@12622
   791
wenzelm@12622
   792
* theory Main no longer includes AC; for the Axiom of Choice, base
wenzelm@12622
   793
your theory on Main_ZFC;
wenzelm@12622
   794
wenzelm@12622
   795
* the integer library now covers quotients and remainders, with many
wenzelm@12622
   796
laws relating division to addition, multiplication, etc.;
paulson@12563
   797
wenzelm@12280
   798
* ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
wenzelm@12280
   799
typeless version of the formalism;
wenzelm@12280
   800
wenzelm@13025
   801
* ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
wenzelm@13025
   802
format;
wenzelm@12608
   803
wenzelm@12280
   804
* ZF/Induct: new directory for examples of inductive definitions,
wenzelm@12608
   805
including theory Multiset for multiset orderings; converted to
wenzelm@12608
   806
new-style theory format;
wenzelm@12177
   807
wenzelm@13025
   808
* ZF: many new theorems about lists, ordinals, etc.;
paulson@12850
   809
wenzelm@11474
   810
wenzelm@11474
   811
*** General ***
wenzelm@11474
   812
wenzelm@12280
   813
* Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
wenzelm@12280
   814
variable proof controls level of detail: 0 = no proofs (only oracle
wenzelm@12280
   815
dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
wenzelm@12280
   816
also ref manual for further ML interfaces;
wenzelm@12280
   817
wenzelm@12280
   818
* Pure/axclass: removed obsolete ML interface
wenzelm@12280
   819
goal_subclass/goal_arity;
wenzelm@12280
   820
wenzelm@12280
   821
* Pure/syntax: new token syntax "num" for plain numerals (without "#"
wenzelm@12280
   822
of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
wenzelm@12280
   823
separate tokens, so expressions involving minus need to be spaced
wenzelm@12280
   824
properly;
wenzelm@12280
   825
wenzelm@12312
   826
* Pure/syntax: support non-oriented infixes, using keyword "infix"
wenzelm@12312
   827
rather than "infixl" or "infixr";
wenzelm@12312
   828
wenzelm@12312
   829
* Pure/syntax: concrete syntax for dummy type variables admits genuine
wenzelm@12312
   830
sort constraint specifications in type inference; e.g. "x::_::foo"
wenzelm@12312
   831
ensures that the type of "x" is of sort "foo" (but not necessarily a
wenzelm@12312
   832
type variable);
wenzelm@12280
   833
wenzelm@12280
   834
* Pure/syntax: print modes "type_brackets" and "no_type_brackets"
wenzelm@12280
   835
control output of nested => (types); the default behavior is
wenzelm@12280
   836
"type_brackets";
wenzelm@12280
   837
wenzelm@12280
   838
* Pure/syntax: builtin parse translation for "_constify" turns valued
wenzelm@11817
   839
tokens into AST constants;
wenzelm@11474
   840
wenzelm@12280
   841
* Pure/syntax: prefer later declarations of translations and print
wenzelm@12280
   842
translation functions; potential INCOMPATIBILITY: need to reverse
wenzelm@12280
   843
multiple declarations for same syntax element constant;
wenzelm@12280
   844
wenzelm@12832
   845
* Pure/show_hyps reset by default (in accordance to existing Isar
wenzelm@12832
   846
practice);
wenzelm@12832
   847
wenzelm@12280
   848
* Provers/classical: renamed addaltern to addafter, addSaltern to
wenzelm@12280
   849
addSafter;
wenzelm@12280
   850
wenzelm@12280
   851
* Provers/clasimp: ``iff'' declarations now handle conditional rules
wenzelm@12280
   852
as well;
wenzelm@12253
   853
wenzelm@12538
   854
* system: tested support for MacOS X; should be able to get Isabelle +
wenzelm@12538
   855
Proof General to work in a plain Terminal after installing Poly/ML
wenzelm@12538
   856
(e.g. from the Isabelle distribution area) and GNU bash alone
wenzelm@12538
   857
(e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
wenzelm@12538
   858
support requires further installations, e.g. from
wenzelm@12538
   859
http://fink.sourceforge.net/);
wenzelm@12538
   860
wenzelm@12280
   861
* system: support Poly/ML 4.1.1 (able to manage larger heaps);
wenzelm@11551
   862
wenzelm@12753
   863
* system: reduced base memory usage by Poly/ML (approx. 20 MB instead
wenzelm@12753
   864
of 40 MB), cf. ML_OPTIONS;
wenzelm@12753
   865
wenzelm@11633
   866
* system: Proof General keywords specification is now part of the
wenzelm@11633
   867
Isabelle distribution (see etc/isar-keywords.el);
wenzelm@11633
   868
wenzelm@12728
   869
* system: support for persistent Proof General sessions (refrain from
wenzelm@12728
   870
outdating all loaded theories on startup); user may create writable
wenzelm@12728
   871
logic images like this: ``isabelle -q HOL Test'';
wenzelm@12597
   872
wenzelm@11551
   873
* system: smart selection of Isabelle process versus Isabelle
wenzelm@11572
   874
interface, accommodates case-insensitive file systems (e.g. HFS+); may
wenzelm@11572
   875
run both "isabelle" and "Isabelle" even if file names are badly
wenzelm@11572
   876
damaged (executable inspects the case of the first letter of its own
wenzelm@11572
   877
name); added separate "isabelle-process" and "isabelle-interface";
wenzelm@11551
   878
wenzelm@12472
   879
* system: refrain from any attempt at filtering input streams; no
wenzelm@12472
   880
longer support ``8bit'' encoding of old isabelle font, instead proper
wenzelm@12472
   881
iso-latin characters may now be used; the related isatools
wenzelm@12472
   882
"symbolinput" and "nonascii" have disappeared as well;
wenzelm@12472
   883
wenzelm@12472
   884
* system: removed old "xterm" interface (the print modes "xterm" and
wenzelm@12472
   885
"xterm_color" are still available for direct use in a suitable
wenzelm@12472
   886
terminal);
wenzelm@12472
   887
paulson@11314
   888
oheimb@11169
   889
wenzelm@11062
   890
New in Isabelle99-2 (February 2001)
wenzelm@11062
   891
-----------------------------------
wenzelm@11062
   892
nipkow@10224
   893
*** Overview of INCOMPATIBILITIES ***
nipkow@10224
   894
paulson@11241
   895
* HOL: please note that theories in the Library and elsewhere often use the
paulson@11241
   896
new-style (Isar) format; to refer to their theorems in an ML script you must
wenzelm@12622
   897
bind them to ML identifers by e.g.      val thm_name = thm "thm_name";
paulson@11241
   898
wenzelm@11043
   899
* HOL: inductive package no longer splits induction rule aggressively,
wenzelm@11043
   900
but only as far as specified by the introductions given; the old
oheimb@11130
   901
format may be recovered via ML function complete_split_rule or attribute
wenzelm@11043
   902
'split_rule (complete)';
wenzelm@11043
   903
wenzelm@10998
   904
* HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
wenzelm@10998
   905
gfp_Tarski to gfp_unfold;
nipkow@10224
   906
paulson@10288
   907
* HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
paulson@10288
   908
wenzelm@10858
   909
* HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
wenzelm@10858
   910
relation); infix "^^" has been renamed "``"; infix "``" has been
wenzelm@10858
   911
renamed "`"; "univalent" has been renamed "single_valued";
nipkow@10793
   912
wenzelm@10998
   913
* HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
wenzelm@10998
   914
operation;
wenzelm@10998
   915
nipkow@10868
   916
* HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
nipkow@10856
   917
wenzelm@10391
   918
* Isar: 'obtain' no longer declares "that" fact as simp/intro;
wenzelm@10391
   919
wenzelm@10401
   920
* Isar/HOL: method 'induct' now handles non-atomic goals; as a
wenzelm@10401
   921
consequence, it is no longer monotonic wrt. the local goal context
wenzelm@10401
   922
(which is now passed through the inductive cases);
wenzelm@10401
   923
wenzelm@10976
   924
* Document preparation: renamed standard symbols \<ll> to \<lless> and
wenzelm@10976
   925
\<gg> to \<ggreater>;
wenzelm@10976
   926
nipkow@10224
   927
wenzelm@10245
   928
*** Document preparation ***
wenzelm@10245
   929
wenzelm@10858
   930
* \isabellestyle{NAME} selects version of Isabelle output (currently
wenzelm@10858
   931
available: are "it" for near math-mode best-style output, "sl" for
wenzelm@10858
   932
slanted text style, and "tt" for plain type-writer; if no
wenzelm@10858
   933
\isabellestyle command is given, output is according to slanted
wenzelm@10858
   934
type-writer);
wenzelm@10858
   935
wenzelm@10322
   936
* support sub/super scripts (for single symbols only), input syntax is
wenzelm@10322
   937
like this: "A\<^sup>*" or "A\<^sup>\<star>";
wenzelm@10322
   938
wenzelm@10858
   939
* some more standard symbols; see Appendix A of the system manual for
wenzelm@11062
   940
the complete list of symbols defined in isabellesym.sty;
wenzelm@10858
   941
wenzelm@10998
   942
* improved isabelle style files; more abstract symbol implementation
wenzelm@10998
   943
(should now use \isamath{...} and \isatext{...} in custom symbol
wenzelm@10998
   944
definitions);
wenzelm@10998
   945
wenzelm@10634
   946
* antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
wenzelm@10634
   947
state; Note that presentation of goal states does not conform to
wenzelm@10634
   948
actual human-readable proof documents.  Please do not include goal
wenzelm@10634
   949
states into document output unless you really know what you are doing!
wenzelm@10322
   950
wenzelm@11062
   951
* proper indentation of antiquoted output with proportional LaTeX
wenzelm@11062
   952
fonts;
wenzelm@10862
   953
wenzelm@11050
   954
* no_document ML operator temporarily disables LaTeX document
wenzelm@11050
   955
generation;
wenzelm@11050
   956
wenzelm@11062
   957
* isatool unsymbolize tunes sources for plain ASCII communication;
wenzelm@11062
   958
wenzelm@10322
   959
wenzelm@10306
   960
*** Isar ***
wenzelm@10306
   961
wenzelm@10547
   962
* Pure: Isar now suffers initial goal statements to contain unbound
wenzelm@10547
   963
schematic variables (this does not conform to actual readable proof
wenzelm@10547
   964
documents, due to unpredictable outcome and non-compositional proof
wenzelm@10547
   965
checking); users who know what they are doing may use schematic goals
wenzelm@10547
   966
for Prolog-style synthesis of proven results;
wenzelm@10547
   967
wenzelm@10391
   968
* Pure: assumption method (an implicit finishing) now handles actual
wenzelm@10391
   969
rules as well;
wenzelm@10391
   970
wenzelm@10391
   971
* Pure: improved 'obtain' --- moved to Pure, insert "that" into
wenzelm@10391
   972
initial goal, declare "that" only as Pure intro (only for single
wenzelm@10391
   973
steps); the "that" rule assumption may now be involved in implicit
wenzelm@10391
   974
finishing, thus ".." becomes a feasible for trivial obtains;
wenzelm@10391
   975
wenzelm@10391
   976
* Pure: default proof step now includes 'intro_classes'; thus trivial
wenzelm@10391
   977
instance proofs may be performed by "..";
wenzelm@10391
   978
wenzelm@10391
   979
* Pure: ?thesis / ?this / "..." now work for pure meta-level
wenzelm@10391
   980
statements as well;
wenzelm@10306
   981
wenzelm@11097
   982
* Pure: more robust selection of calculational rules;
wenzelm@11097
   983
wenzelm@10858
   984
* Pure: the builtin notion of 'finished' goal now includes the ==-refl
wenzelm@10858
   985
rule (as well as the assumption rule);
wenzelm@10858
   986
wenzelm@10858
   987
* Pure: 'thm_deps' command visualizes dependencies of theorems and
wenzelm@10858
   988
lemmas, using the graph browser tool;
wenzelm@10858
   989
wenzelm@10944
   990
* Pure: predict failure of "show" in interactive mode;
wenzelm@10944
   991
wenzelm@11016
   992
* Pure: 'thms_containing' now takes actual terms as arguments;
wenzelm@11016
   993
wenzelm@10401
   994
* HOL: improved method 'induct' --- now handles non-atomic goals
wenzelm@10401
   995
(potential INCOMPATIBILITY); tuned error handling;
wenzelm@10401
   996
wenzelm@10557
   997
* HOL: cases and induct rules now provide explicit hints about the
wenzelm@10547
   998
number of facts to be consumed (0 for "type" and 1 for "set" rules);
wenzelm@10547
   999
any remaining facts are inserted into the goal verbatim;
wenzelm@10547
  1000
wenzelm@10858
  1001
* HOL: local contexts (aka cases) may now contain term bindings as
wenzelm@10858
  1002
well; the 'cases' and 'induct' methods new provide a ?case binding for
wenzelm@10858
  1003
the result to be shown in each case;
wenzelm@10858
  1004
wenzelm@10770
  1005
* HOL: added 'recdef_tc' command;
wenzelm@10770
  1006
wenzelm@11016
  1007
* isatool convert assists in eliminating legacy ML scripts;
wenzelm@11016
  1008
wenzelm@10306
  1009
wenzelm@10245
  1010
*** HOL ***
wenzelm@10245
  1011
wenzelm@10245
  1012
* HOL/Library: a collection of generic theories to be used together
wenzelm@10245
  1013
with main HOL; the theory loader path already includes this directory
wenzelm@10245
  1014
by default; the following existing theories have been moved here:
wenzelm@10245
  1015
HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
wenzelm@10337
  1016
(as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
wenzelm@10245
  1017
wenzelm@10966
  1018
* HOL/Unix: "Some aspects of Unix file-system security", a typical
wenzelm@10966
  1019
modelling and verification task performed in Isabelle/HOL +
wenzelm@10966
  1020
Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
wenzelm@10966
  1021
wenzelm@11094
  1022
* HOL/Algebra: special summation operator SUM no longer exists, it has
wenzelm@11094
  1023
been replaced by setsum; infix 'assoc' now has priority 50 (like
wenzelm@11094
  1024
'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
wenzelm@11094
  1025
'domain', this makes the theory consistent with mathematical
wenzelm@11094
  1026
literature;
wenzelm@11094
  1027
wenzelm@10514
  1028
* HOL basics: added overloaded operations "inverse" and "divide"
wenzelm@10726
  1029
(infix "/"), syntax for generic "abs" operation, generic summation
wenzelm@11094
  1030
operator \<Sum>;
wenzelm@10452
  1031
wenzelm@10391
  1032
* HOL/typedef: simplified package, provide more useful rules (see also
wenzelm@10391
  1033
HOL/subset.thy);
wenzelm@10391
  1034
wenzelm@10915
  1035
* HOL/datatype: induction rule for arbitrarily branching datatypes is
wenzelm@10915
  1036
now expressed as a proper nested rule (old-style tactic scripts may
wenzelm@10915
  1037
require atomize_strip_tac to cope with non-atomic premises);
wenzelm@10915
  1038
wenzelm@10915
  1039
* HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
wenzelm@10915
  1040
to "split_conv" (old name still available for compatibility);
wenzelm@10915
  1041
wenzelm@10915
  1042
* HOL: improved concrete syntax for strings (e.g. allows translation
wenzelm@10915
  1043
rules with string literals);
wenzelm@10915
  1044
paulson@12245
  1045
* HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
paulson@12245
  1046
 and Fleuriot's mechanization of analysis, including the transcendental
paulson@12245
  1047
 functions for the reals;
paulson@10756
  1048
wenzelm@11094
  1049
* HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
wenzelm@10391
  1050
wenzelm@10858
  1051
paulson@10474
  1052
*** CTT ***
paulson@10474
  1053
wenzelm@10547
  1054
* CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
wenzelm@10547
  1055
"lam" is displayed as TWO lambda-symbols
paulson@10474
  1056
wenzelm@10547
  1057
* CTT: theory Main now available, containing everything (that is, Bool
wenzelm@10547
  1058
and Arith);
wenzelm@10547
  1059
paulson@10474
  1060
wenzelm@10391
  1061
*** General ***
wenzelm@10391
  1062
wenzelm@10547
  1063
* Pure: the Simplifier has been implemented properly as a derived rule
wenzelm@10547
  1064
outside of the actual kernel (at last!); the overall performance
wenzelm@10547
  1065
penalty in practical applications is about 50%, while reliability of
wenzelm@10547
  1066
the Isabelle inference kernel has been greatly improved;
wenzelm@10547
  1067
wenzelm@11112
  1068
* print modes "brackets" and "no_brackets" control output of nested =>
wenzelm@11112
  1069
(types) and ==> (props); the default behaviour is "brackets";
wenzelm@11112
  1070
wenzelm@10391
  1071
* Provers: fast_tac (and friends) now handle actual object-logic rules
wenzelm@10391
  1072
as assumptions as well;
wenzelm@10391
  1073
wenzelm@11124
  1074
* system: support Poly/ML 4.0;
wenzelm@11124
  1075
wenzelm@11124
  1076
* system: isatool install handles KDE version 1 or 2;
wenzelm@11124
  1077
wenzelm@10391
  1078
wenzelm@10245
  1079
wenzelm@10103
  1080
New in Isabelle99-1 (October 2000)
wenzelm@10103
  1081
----------------------------------
wenzelm@8015
  1082
wenzelm@10003
  1083
*** Overview of INCOMPATIBILITIES ***
paulson@8014
  1084
wenzelm@8848
  1085
* HOL: simplification of natural numbers is much changed; to partly
wenzelm@8848
  1086
recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
wenzelm@8848
  1087
issue the following ML commands:
wenzelm@8848
  1088
wenzelm@8848
  1089
  Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
wenzelm@8848
  1090
  Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
paulson@8788
  1091
wenzelm@10129
  1092
* HOL: simplification no longer dives into case-expressions; this is
wenzelm@10129
  1093
controlled by "t.weak_case_cong" for each datatype t;
wenzelm@10003
  1094
wenzelm@10003
  1095
* HOL: nat_less_induct renamed to less_induct;
wenzelm@10003
  1096
wenzelm@10003
  1097
* HOL: systematic renaming of the SOME (Eps) rules, may use isatool
wenzelm@10003
  1098
fixsome to patch .thy and .ML sources automatically;
paulson@8967
  1099
wenzelm@10003
  1100
  select_equality  -> some_equality
wenzelm@10003
  1101
  select_eq_Ex     -> some_eq_ex
wenzelm@10003
  1102
  selectI2EX       -> someI2_ex
wenzelm@10003
  1103
  selectI2         -> someI2
wenzelm@10003
  1104
  selectI          -> someI
wenzelm@10003
  1105
  select1_equality -> some1_equality
wenzelm@10003
  1106
  Eps_sym_eq       -> some_sym_eq_trivial
wenzelm@10003
  1107
  Eps_eq           -> some_eq_trivial
wenzelm@10003
  1108
wenzelm@10003
  1109
* HOL: exhaust_tac on datatypes superceded by new generic case_tac;
wenzelm@10003
  1110
wenzelm@10003
  1111
* HOL: removed obsolete theorem binding expand_if (refer to split_if
wenzelm@10003
  1112
instead);
wenzelm@10003
  1113
wenzelm@10003
  1114
* HOL: the recursion equations generated by 'recdef' are now called
wenzelm@10003
  1115
f.simps instead of f.rules;
wenzelm@10003
  1116
wenzelm@10003
  1117
* HOL: qed_spec_mp now also handles bounded ALL as well;
wenzelm@10003
  1118
wenzelm@10003
  1119
* HOL: 0 is now overloaded, so the type constraint ":: nat" may
wenzelm@10003
  1120
sometimes be needed;
wenzelm@10003
  1121
wenzelm@10003
  1122
* HOL: the constant for "f``x" is now "image" rather than "op ``";
paulson@8014
  1123
paulson@10065
  1124
* HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
paulson@10065
  1125
wenzelm@9330
  1126
* HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
wenzelm@9330
  1127
product is now "<*>" instead of "Times"; the lexicographic product is
wenzelm@9330
  1128
now "<*lex*>" instead of "**";
nipkow@8705
  1129
wenzelm@10003
  1130
* HOL: theory Sexp is now in HOL/Induct examples (it used to be part
wenzelm@10003
  1131
of main HOL, but was unused); better use HOL's datatype package;
paulson@9971
  1132
wenzelm@10137
  1133
* HOL: removed "symbols" syntax for constant "override" of theory Map;
wenzelm@10137
  1134
the old syntax may be recovered as follows:
wenzelm@10137
  1135
wenzelm@10137
  1136
  syntax (symbols)
wenzelm@10137
  1137
    override  :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
wenzelm@10137
  1138
      (infixl "\\<oplus>" 100)
wenzelm@10137
  1139
wenzelm@8848
  1140
* HOL/Real: "rabs" replaced by overloaded "abs" function;
wenzelm@8848
  1141
wenzelm@8887
  1142
* HOL/ML: even fewer consts are declared as global (see theories Ord,
wenzelm@8887
  1143
Lfp, Gfp, WF); this only affects ML packages that refer to const names
wenzelm@8887
  1144
internally;
wenzelm@8887
  1145
wenzelm@10003
  1146
* HOL and ZF: syntax for quotienting wrt an equivalence relation
wenzelm@10003
  1147
changed from A/r to A//r;
wenzelm@9908
  1148
wenzelm@10003
  1149
* ZF: new treatment of arithmetic (nat & int) may break some old
wenzelm@10003
  1150
proofs;
wenzelm@8921
  1151
wenzelm@10003
  1152
* Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
wenzelm@10003
  1153
rulify -> rule_format, elimify -> elim_format, ...);
paulson@9542
  1154
wenzelm@9941
  1155
* Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941
  1156
intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
wenzelm@9937
  1157
should have to change intro!! to intro? only); replaced "delrule" by
wenzelm@9937
  1158
"rule del";
wenzelm@9437
  1159
wenzelm@9612
  1160
* Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
wenzelm@9612
  1161
wenzelm@9437
  1162
* Provers: strengthened force_tac by using new first_best_tac;
oheimb@9402
  1163
wenzelm@10003
  1164
* LaTeX document preparation: several changes of isabelle.sty (see
wenzelm@10003
  1165
lib/texinputs);
wenzelm@8729
  1166
paulson@8014
  1167
wenzelm@8487
  1168
*** Document preparation ***
wenzelm@8358
  1169
wenzelm@9198
  1170
* formal comments (text blocks etc.) in new-style theories may now
wenzelm@9753
  1171
contain antiquotations of thm/prop/term/typ/text to be presented
wenzelm@9753
  1172
according to latex print mode; concrete syntax is like this:
wenzelm@9753
  1173
@{term[show_types] "f(x) = a + x"};
wenzelm@9198
  1174
wenzelm@8358
  1175
* isatool mkdir provides easy setup of Isabelle session directories,
wenzelm@8518
  1176
including proper document sources;
wenzelm@8358
  1177
wenzelm@8358
  1178
* generated LaTeX sources are now deleted after successful run
wenzelm@8358
  1179
(isatool document -c); may retain a copy somewhere else via -D option
wenzelm@8358
  1180
of isatool usedir;
wenzelm@8358
  1181
wenzelm@8566
  1182
* isatool usedir -D now lets isatool latex -o sty update the Isabelle
wenzelm@10003
  1183
style files, achieving self-contained LaTeX sources and simplifying
wenzelm@10003
  1184
LaTeX debugging;
wenzelm@8566
  1185
wenzelm@8518
  1186
* old-style theories now produce (crude) LaTeX output as well;
wenzelm@8358
  1187
wenzelm@9057
  1188
* browser info session directories are now self-contained (may be put
wenzelm@9437
  1189
on WWW server seperately); improved graphs of nested sessions; removed
wenzelm@9437
  1190
graph for 'all sessions';
wenzelm@9057
  1191
wenzelm@10003
  1192
* several improvements in isabelle style files; \isabellestyle{it}
wenzelm@10003
  1193
produces fake math mode output; \isamarkupheader is now \section by
wenzelm@10003
  1194
default; see lib/texinputs/isabelle.sty etc.;
wenzelm@9489
  1195
wenzelm@8358
  1196
wenzelm@8184
  1197
*** Isar ***
wenzelm@8184
  1198
wenzelm@10003
  1199
* Isar/Pure: local results and corresponding term bindings are now
wenzelm@10003
  1200
subject to Hindley-Milner polymorphism (similar to ML); this
wenzelm@10003
  1201
accommodates incremental type-inference very nicely;
wenzelm@8283
  1202
wenzelm@10003
  1203
* Isar/Pure: new derived language element 'obtain' supports
wenzelm@10003
  1204
generalized existence reasoning;
wenzelm@8621
  1205
wenzelm@10003
  1206
* Isar/Pure: new calculational elements 'moreover' and 'ultimately'
wenzelm@10003
  1207
support accumulation of results, without applying any rules yet;
wenzelm@10003
  1208
useful to collect intermediate results without explicit name
wenzelm@10003
  1209
references, and for use with transitivity rules with more than 2
wenzelm@10003
  1210
premises;
wenzelm@8184
  1211
wenzelm@10003
  1212
* Isar/Pure: scalable support for case-analysis type proofs: new
wenzelm@10003
  1213
'case' language element refers to local contexts symbolically, as
wenzelm@10003
  1214
produced by certain proof methods; internally, case names are attached
wenzelm@10003
  1215
to theorems as "tags";
wenzelm@8440
  1216
wenzelm@10003
  1217
* Isar/Pure: theory command 'hide' removes declarations from
wenzelm@9330
  1218
class/type/const name spaces;
wenzelm@9330
  1219
wenzelm@10003
  1220
* Isar/Pure: theory command 'defs' supports option "(overloaded)" to
wenzelm@9330
  1221
indicate potential overloading;
wenzelm@9330
  1222
wenzelm@10003
  1223
* Isar/Pure: changed syntax of local blocks from {{ }} to { };
wenzelm@8621
  1224
wenzelm@10003
  1225
* Isar/Pure: syntax of sorts made 'inner', i.e. have to write
wenzelm@10003
  1226
"{a,b,c}" instead of {a,b,c};
wenzelm@9011
  1227
wenzelm@10003
  1228
* Isar/Pure now provides its own version of intro/elim/dest
wenzelm@10003
  1229
attributes; useful for building new logics, but beware of confusion
wenzelm@10003
  1230
with the version in Provers/classical;
wenzelm@9612
  1231
wenzelm@10003
  1232
* Isar/Pure: the local context of (non-atomic) goals is provided via
wenzelm@10003
  1233
case name 'antecedent';
wenzelm@8440
  1234
wenzelm@10003
  1235
* Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
wenzelm@10003
  1236
to the current context is now done automatically);
wenzelm@9383
  1237
wenzelm@10003
  1238
* Isar/Pure: theory command 'method_setup' provides a simple interface
wenzelm@10003
  1239
for definining proof methods in ML;
wenzelm@9612
  1240
wenzelm@10003
  1241
* Isar/Provers: intro/elim/dest attributes changed; renamed
wenzelm@9941
  1242
intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
wenzelm@9941
  1243
most cases, one should have to change intro!! to intro? only);
wenzelm@9941
  1244
replaced "delrule" by "rule del";
wenzelm@8283
  1245
wenzelm@10003
  1246
* Isar/Provers: new 'hypsubst' method, plain 'subst' method and
wenzelm@10003
  1247
'symmetric' attribute (the latter supercedes [RS sym]);
wenzelm@10003
  1248
wenzelm@10003
  1249
* Isar/Provers: splitter support (via 'split' attribute and 'simp'
wenzelm@10003
  1250
method modifier); 'simp' method: 'only:' modifier removes loopers as
wenzelm@10003
  1251
well (including splits);
wenzelm@10003
  1252
wenzelm@10003
  1253
* Isar/Provers: Simplifier and Classical methods now support all kind
wenzelm@10003
  1254
of modifiers used in the past, including 'cong', 'iff', etc.
wenzelm@10003
  1255
wenzelm@10003
  1256
* Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
wenzelm@10003
  1257
of Simplifier and Classical reasoner);
wenzelm@10003
  1258
wenzelm@10003
  1259
* Isar/HOL: new proof method 'cases' and improved version of 'induct'
wenzelm@10003
  1260
now support named cases; major packages (inductive, datatype, primrec,
wenzelm@10003
  1261
recdef) support case names and properly name parameters;
wenzelm@9612
  1262
wenzelm@10003
  1263
* Isar/HOL: new transitivity rules for substitution in inequalities --
wenzelm@10003
  1264
monotonicity conditions are extracted to be proven at end of
wenzelm@10003
  1265
calculations;
wenzelm@10003
  1266
wenzelm@10003
  1267
* Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
wenzelm@10003
  1268
method anyway;
wenzelm@10003
  1269
wenzelm@10003
  1270
* Isar/HOL: removed old expand_if = split_if; theorems if_splits =
wenzelm@10003
  1271
split_if split_if_asm; datatype package provides theorems foo.splits =
wenzelm@10003
  1272
foo.split foo.split_asm for each datatype;
wenzelm@10003
  1273
wenzelm@10003
  1274
* Isar/HOL: tuned inductive package, rename "intrs" to "intros"
wenzelm@10003
  1275
(potential INCOMPATIBILITY), emulation of mk_cases feature for proof
wenzelm@10003
  1276
scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
wenzelm@10003
  1277
use "(cases (simplified))" method in proper proof texts);
wenzelm@10003
  1278
wenzelm@10003
  1279
* Isar/HOL: added global 'arith_split' attribute for 'arith' method;
wenzelm@10003
  1280
wenzelm@10003
  1281
* Isar: names of theorems etc. may be natural numbers as well;
wenzelm@10003
  1282
wenzelm@10003
  1283
* Isar: 'pr' command: optional arguments for goals_limit and
wenzelm@9724
  1284
ProofContext.prems_limit; no longer prints theory contexts, but only
wenzelm@9724
  1285
proof states;
wenzelm@8487
  1286
wenzelm@10003
  1287
* Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
wenzelm@8518
  1288
additional print modes to be specified; e.g. "pr(latex)" will print
wenzelm@8518
  1289
proof state according to the Isabelle LaTeX style;
wenzelm@8487
  1290
wenzelm@10003
  1291
* Isar: improved support for emulating tactic scripts, including proof
wenzelm@9612
  1292
methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
wenzelm@9612
  1293
'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
wenzelm@9612
  1294
(for HOL datatypes);
wenzelm@8534
  1295
wenzelm@10003
  1296
* Isar: simplified (more robust) goal selection of proof methods: 1st
wenzelm@10003
  1297
goal, all goals, or explicit goal specifier (tactic emulation); thus
wenzelm@10003
  1298
'proof method scripts' have to be in depth-first order;
wenzelm@8673
  1299
wenzelm@10003
  1300
* Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
wenzelm@8729
  1301
wenzelm@10003
  1302
* Isar: removed 'help' command, which hasn't been too helpful anyway;
wenzelm@10003
  1303
should instead use individual commands for printing items
wenzelm@10003
  1304
(print_commands, print_methods etc.);
wenzelm@9224
  1305
wenzelm@10003
  1306
* Isar: added 'nothing' --- the empty list of theorems;
wenzelm@9239
  1307
wenzelm@8184
  1308
paulson@8014
  1309
*** HOL ***
paulson@8014
  1310
wenzelm@10080
  1311
* HOL/MicroJava: formalization of a fragment of Java, together with a
wenzelm@10080
  1312
corresponding virtual machine and a specification of its bytecode
wenzelm@10080
  1313
verifier and a lightweight bytecode verifier, including proofs of
wenzelm@10080
  1314
type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
wenzelm@10080
  1315
Cornelia Pusch (see also the homepage of project Bali at
wenzelm@10080
  1316
http://isabelle.in.tum.de/Bali/);
wenzelm@10080
  1317
wenzelm@8518
  1318
* HOL/Algebra: new theory of rings and univariate polynomials, by
wenzelm@8518
  1319
Clemens Ballarin;
paulson@8014
  1320
wenzelm@10157
  1321
* HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
wenzelm@10003
  1322
Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
wenzelm@10003
  1323
Rasmussen;
wenzelm@8570
  1324
wenzelm@10157
  1325
* HOL/Lattice: fundamental concepts of lattice theory and order
wenzelm@10157
  1326
structures, including duals, properties of bounds versus algebraic
wenzelm@10157
  1327
laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
wenzelm@10157
  1328
Theorem for complete lattices etc.; may also serve as a demonstration
wenzelm@10157
  1329
for abstract algebraic reasoning using axiomatic type classes, and
wenzelm@10157
  1330
mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
wenzelm@10157
  1331
wenzelm@10003
  1332
* HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
wenzelm@10003
  1333
von Oheimb;
paulson@9542
  1334
wenzelm@10164
  1335
* HOL/IMPP: extension of IMP with local variables and mutually
wenzelm@10164
  1336
recursive procedures, by David von Oheimb;
wenzelm@10164
  1337
wenzelm@10003
  1338
* HOL/Lambda: converted into new-style theory and document;
paulson@9542
  1339
wenzelm@10003
  1340
* HOL/ex/Multiquote: example of multiple nested quotations and
wenzelm@10003
  1341
anti-quotations -- basically a generalized version of de-Bruijn
wenzelm@10003
  1342
representation; very useful in avoiding lifting of operations;
wenzelm@8848
  1343
wenzelm@9612
  1344
* HOL/record: added general record equality rule to simpset; fixed
wenzelm@9612
  1345
select-update simplification procedure to handle extended records as
wenzelm@9612
  1346
well; admit "r" as field name;
paulson@9542
  1347
paulson@8967
  1348
* HOL: 0 is now overloaded over the new sort "zero", allowing its use with
paulson@8967
  1349
other numeric types and also as the identity of groups, rings, etc.;
paulson@8967
  1350
paulson@8967
  1351
* HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
paulson@8967
  1352
Types nat and int belong to this axclass;
paulson@8967
  1353
wenzelm@10003
  1354
* HOL: greatly improved simplification involving numerals of type nat, int, real:
paulson@8788
  1355
   (i + #8 + j) = Suc k simplifies to  #7 + (i + j) = k
paulson@8832
  1356
   i*j + k + j*#3*i     simplifies to  #4*(i*j) + k
paulson@8832
  1357
  two terms #m*u and #n*u are replaced by #(m+n)*u
paulson@8832
  1358
    (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
paulson@8832
  1359
  and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
paulson@8832
  1360
    or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
paulson@8736
  1361
wenzelm@10003
  1362
* HOL: meson_tac is available (previously in ex/meson.ML); it is a
wenzelm@10003
  1363
powerful prover for predicate logic but knows nothing of clasets; see
wenzelm@10003
  1364
ex/mesontest.ML and ex/mesontest2.ML for example applications;
paulson@9835
  1365
wenzelm@8848
  1366
* HOL: new version of "case_tac" subsumes both boolean case split and
wenzelm@8440
  1367
"exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
wenzelm@8518
  1368
exists, may define val exhaust_tac = case_tac for ad-hoc portability;
wenzelm@8440
  1369
wenzelm@8848
  1370
* HOL: simplification no longer dives into case-expressions: only the
wenzelm@10129
  1371
selector expression is simplified, but not the remaining arms; to
wenzelm@10129
  1372
enable full simplification of case-expressions for datatype t, you may
wenzelm@10129
  1373
remove t.weak_case_cong from the simpset, either globally (Delcongs
wenzelm@10129
  1374
[thm"t.weak_case_cong"];) or locally (delcongs [...]).
nipkow@8603
  1375
wenzelm@8848
  1376
* HOL/recdef: the recursion equations generated by 'recdef' for
wenzelm@8848
  1377
function 'f' are now called f.simps instead of f.rules; if all
wenzelm@8848
  1378
termination conditions are proved automatically, these simplification
wenzelm@8848
  1379
rules are added to the simpset, as in primrec; rules may be named
wenzelm@8848
  1380
individually as well, resulting in a separate list of theorems for
wenzelm@8848
  1381
each equation;
wenzelm@8848
  1382
wenzelm@9489
  1383
* HOL/While is a new theory that provides a while-combinator. It
wenzelm@9489
  1384
permits the definition of tail-recursive functions without the
wenzelm@9489
  1385
provision of a termination measure. The latter is necessary once the
wenzelm@9489
  1386
invariant proof rule for while is applied.
nipkow@9457
  1387
wenzelm@10003
  1388
* HOL: new (overloaded) notation for the set of elements below/above
wenzelm@10003
  1389
some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
nipkow@8925
  1390
wenzelm@8848
  1391
* HOL: theorems impI, allI, ballI bound as "strip";
wenzelm@8848
  1392
wenzelm@10003
  1393
* HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
nipkow@9746
  1394
induct_tac th "x1 ... xn" expects th to have a conclusion of the form
nipkow@9746
  1395
P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
nipkow@9746
  1396
wenzelm@10003
  1397
* HOL/Real: "rabs" replaced by overloaded "abs" function;
nipkow@9737
  1398
wenzelm@10003
  1399
* HOL: theory Sexp now in HOL/Induct examples (it used to be part of
wenzelm@10003
  1400
main HOL, but was unused);
nipkow@8626
  1401
wenzelm@10003
  1402
* HOL: fewer consts declared as global (e.g. have to refer to
wenzelm@10003
  1403
"Lfp.lfp" instead of "lfp" internally; affects ML packages only);
wenzelm@8887
  1404
wenzelm@10003
  1405
* HOL: tuned AST representation of nested pairs, avoiding bogus output
wenzelm@10003
  1406
in case of overlap with user translations (e.g. judgements over
wenzelm@10003
  1407
tuples); (note that the underlying logical represenation is still
wenzelm@10003
  1408
bogus);
wenzelm@9349
  1409
nipkow@8412
  1410
paulson@9542
  1411
*** ZF ***
paulson@9542
  1412
wenzelm@10003
  1413
* ZF: simplification automatically cancels common terms in arithmetic
wenzelm@10003
  1414
expressions over nat and int;
paulson@9542
  1415
wenzelm@10003
  1416
* ZF: new treatment of nat to minimize type-checking: all operators
wenzelm@10003
  1417
coerce their operands to a natural number using the function natify,
wenzelm@10003
  1418
making the algebraic laws unconditional;
paulson@9542
  1419
wenzelm@10003
  1420
* ZF: as above, for int: operators coerce their operands to an integer
wenzelm@10003
  1421
using the function intify;
paulson@9542
  1422
wenzelm@10003
  1423
* ZF: the integer library now contains many of the usual laws for the
wenzelm@10003
  1424
orderings, including $<=, and monotonicity laws for $+ and $*;
paulson@9542
  1425
wenzelm@10003
  1426
* ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
wenzelm@10003
  1427
simplification;
paulson@9388
  1428
wenzelm@10003
  1429
* FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
wenzelm@10003
  1430
to the simplifier and classical reasoner simultaneously;
paulson@9388
  1431
paulson@9388
  1432
wenzelm@8358
  1433
*** General ***
wenzelm@8358
  1434
wenzelm@10003
  1435
* Provers: blast_tac now handles actual object-logic rules as
wenzelm@10003
  1436
assumptions; note that auto_tac uses blast_tac internally as well;
wenzelm@10003
  1437
wenzelm@10003
  1438
* Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
wenzelm@10003
  1439
outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
wenzelm@10003
  1440
wenzelm@9941
  1441
* Provers: delrules now handles destruct rules as well (no longer need
wenzelm@9941
  1442
explicit make_elim);
wenzelm@9941
  1443
wenzelm@10003
  1444
* Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
wenzelm@10003
  1445
  [| inj ?f;          ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
wenzelm@10003
  1446
use instead the strong form,
wenzelm@10003
  1447
  [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
wenzelm@10003
  1448
in HOL, FOL and ZF the function cla_make_elim will create such rules
wenzelm@10003
  1449
from destruct-rules;
wenzelm@9489
  1450
wenzelm@9709
  1451
* Provers: Simplifier.easy_setup provides a fast path to basic
wenzelm@9709
  1452
Simplifier setup for new object-logics;
wenzelm@9709
  1453
wenzelm@9709
  1454
* Pure: AST translation rules no longer require constant head on LHS;
wenzelm@9349
  1455
wenzelm@9709
  1456
* Pure: improved name spaces: ambiguous output is qualified; support
wenzelm@9709
  1457
for hiding of names;
wenzelm@8729
  1458
wenzelm@10003
  1459
* system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
wenzelm@10003
  1460
XSYMBOL_HOME; no longer need to do manual configuration in most
wenzelm@10003
  1461
situations;
wenzelm@10003
  1462
wenzelm@9709
  1463
* system: compression of ML heaps images may now be controlled via -c
wenzelm@9709
  1464
option of isabelle and isatool usedir (currently only observed by
wenzelm@9709
  1465
Poly/ML);
wenzelm@8358
  1466
wenzelm@9981
  1467
* system: isatool installfonts may handle X-Symbol fonts as well (very
wenzelm@9981
  1468
useful for remote X11);
wenzelm@9981
  1469
wenzelm@9709
  1470
* system: provide TAGS file for Isabelle sources;
wenzelm@9052
  1471
wenzelm@9288
  1472
* ML: infix 'OF' is a version of 'MRS' with more appropriate argument
wenzelm@9288
  1473
order;
wenzelm@9288
  1474
wenzelm@8994
  1475
* ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
wenzelm@8994
  1476
timing flag supersedes proof_timing and Toplevel.trace;
wenzelm@8994
  1477
wenzelm@10003
  1478
* ML: new combinators |>> and |>>> for incremental transformations
wenzelm@10003
  1479
with secondary results (e.g. certain theory extensions):
wenzelm@10003
  1480
wenzelm@9330
  1481
* ML: PureThy.add_defs gets additional argument to indicate potential
wenzelm@9330
  1482
overloading (usually false);
wenzelm@9330
  1483
wenzelm@10003
  1484
* ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
wenzelm@10003
  1485
results;
wenzelm@8440
  1486
wenzelm@8358
  1487
wenzelm@8015
  1488
wenzelm@7986
  1489
New in Isabelle99 (October 1999)
wenzelm@7986
  1490
--------------------------------
oheimb@4649
  1491
paulson@5931
  1492
*** Overview of INCOMPATIBILITIES (see below for more details) ***
paulson@5931
  1493
paulson@6922
  1494
* HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
paulson@6922
  1495
are no longer simplified.  (This allows the simplifier to unfold recursive
paulson@6922
  1496
functional programs.)  To restore the old behaviour, declare
wenzelm@7215
  1497
wenzelm@7215
  1498
    Delcongs [if_weak_cong];
paulson@6922
  1499
wenzelm@6269
  1500
* HOL: Removed the obsolete syntax "Compl A"; use -A for set
wenzelm@6269
  1501
complement;
paulson@5931
  1502
wenzelm@6269
  1503
* HOL: the predicate "inj" is now defined by translation to "inj_on";
paulson@6174
  1504
berghofe@7847
  1505
* HOL/datatype: mutual_induct_tac no longer exists --
berghofe@7847
  1506
  use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
berghofe@7847
  1507
wenzelm@6386
  1508
* HOL/typedef: fixed type inference for representing set; type
wenzelm@6386
  1509
arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386
  1510
wenzelm@6269
  1511
* ZF: The con_defs part of an inductive definition may no longer refer
wenzelm@6269
  1512
to constants declared in the same theory;
nipkow@6057
  1513
wenzelm@6269
  1514
* HOL, ZF: the function mk_cases, generated by the inductive
wenzelm@6269
  1515
definition package, has lost an argument.  To simplify its result, it
wenzelm@6269
  1516
uses the default simpset instead of a supplied list of theorems.
paulson@6141
  1517
wenzelm@7215
  1518
* HOL/List: the constructors of type list are now Nil and Cons;
wenzelm@7215
  1519
nipkow@7619
  1520
* Simplifier: the type of the infix ML functions
wenzelm@8729
  1521
        setSSolver addSSolver setSolver addSolver
nipkow@7619
  1522
is now  simpset * solver -> simpset  where `solver' is a new abstract type
nipkow@7619
  1523
for packaging solvers. A solver is created via
wenzelm@8729
  1524
        mk_solver: string -> (thm list -> int -> tactic) -> solver
nipkow@7619
  1525
where the string argument is only a comment.
nipkow@6057
  1526
wenzelm@7647
  1527
paulson@6069
  1528
*** Proof tools ***
paulson@6069
  1529
wenzelm@6343
  1530
* Provers/Arith/fast_lin_arith.ML contains a functor for creating a
wenzelm@6343
  1531
decision procedure for linear arithmetic. Currently it is used for
wenzelm@7593
  1532
types `nat', `int', and `real' in HOL (see below); it can, should and
wenzelm@7593
  1533
will be instantiated for other types and logics as well.
paulson@6069
  1534
nipkow@7324
  1535
* The simplifier now accepts rewrite rules with flexible heads, eg
nipkow@7324
  1536
     hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
nipkow@7324
  1537
  They are applied like any rule with a non-pattern lhs, i.e. by first-order
nipkow@7324
  1538
  matching.
paulson@6069
  1539
wenzelm@7593
  1540
paulson@6014
  1541
*** General ***
paulson@6014
  1542
wenzelm@7986
  1543
* New Isabelle/Isar subsystem provides an alternative to traditional
wenzelm@7215
  1544
tactical theorem proving; together with the ProofGeneral/isar user
wenzelm@7215
  1545
interface it offers an interactive environment for developing human
wenzelm@7215
  1546
readable proof documents (Isar == Intelligible semi-automated
wenzelm@7886
  1547
reasoning); for further information see isatool doc isar-ref,
wenzelm@7986
  1548
src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
wenzelm@7886
  1549
wenzelm@9612
  1550
* improved and simplified presentation of theories: better HTML markup
wenzelm@9612
  1551
(including colors), graph views in several sizes; isatool usedir now
wenzelm@9612
  1552
provides a proper interface for user theories (via -P option); actual
wenzelm@9612
  1553
document preparation based on (PDF)LaTeX is available as well (for
wenzelm@9612
  1554
new-style theories only); see isatool doc system for more information;
wenzelm@7215
  1555
wenzelm@7252
  1556
* native support for Proof General, both for classic Isabelle and
wenzelm@7986
  1557
Isabelle/Isar;
wenzelm@7215
  1558
wenzelm@7791
  1559
* ML function thm_deps visualizes dependencies of theorems and lemmas,
wenzelm@7791
  1560
using the graph browser tool;
wenzelm@7791
  1561
wenzelm@6751
  1562
* Isabelle manuals now also available as PDF;
wenzelm@6751
  1563
wenzelm@6449
  1564
* theory loader rewritten from scratch (may not be fully
wenzelm@6449
  1565
bug-compatible); old loadpath variable has been replaced by show_path,
wenzelm@6671
  1566
add_path, del_path, reset_path functions; new operations such as
wenzelm@7593
  1567
update_thy, touch_thy, remove_thy, use/update_thy_only (see also
wenzelm@7593
  1568
isatool doc ref);
wenzelm@6449
  1569
wenzelm@7215
  1570
* improved isatool install: option -k creates KDE application icon,
wenzelm@7215
  1571
option -p DIR installs standalone binaries;
wenzelm@7215
  1572
wenzelm@7215
  1573
* added ML_PLATFORM setting (useful for cross-platform installations);
wenzelm@7215
  1574
more robust handling of platform specific ML images for SML/NJ;
wenzelm@7215
  1575
wenzelm@7886
  1576
* the settings environment is now statically scoped, i.e. it is never
wenzelm@7986
  1577
created again in sub-processes invoked from isabelle, isatool, or
wenzelm@7886
  1578
Isabelle;
wenzelm@7886
  1579
wenzelm@7215
  1580
* path element specification '~~' refers to '$ISABELLE_HOME';
wenzelm@7215
  1581
wenzelm@6343
  1582
* in locales, the "assumes" and "defines" parts may be omitted if
wenzelm@6343
  1583
empty;
wenzelm@5973
  1584
wenzelm@6269
  1585
* new print_mode "xsymbols" for extended symbol support (e.g. genuine
wenzelm@6269
  1586
long arrows);
wenzelm@6259
  1587
wenzelm@6343
  1588
* new print_mode "HTML";
wenzelm@6343
  1589
wenzelm@6343
  1590
* new flag show_tags controls display of tags of theorems (which are
wenzelm@6343
  1591
basically just comments that may be attached by some tools);
wenzelm@6343
  1592
wenzelm@6461
  1593
* Isamode 2.6 requires patch to accomodate change of Isabelle font
wenzelm@6461
  1594
mode and goal output format:
wenzelm@6461
  1595
wenzelm@6461
  1596
diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
wenzelm@6461
  1597
244c244
wenzelm@6461
  1598
<       (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
wenzelm@6461
  1599
---
wenzelm@6533
  1600
>       (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
wenzelm@6461
  1601
diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
wenzelm@6461
  1602
181c181
wenzelm@6461
  1603
< (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
wenzelm@6461
  1604
---
wenzelm@6461
  1605
> (defconst proofstate-proofstart-regexp "^Level [0-9]+"
wenzelm@6461
  1606
wenzelm@7450
  1607
* function bind_thms stores lists of theorems (cf. bind_thm);
wenzelm@7450
  1608
wenzelm@7593
  1609
* new shorthand tactics ftac, eatac, datac, fatac;
wenzelm@7593
  1610
wenzelm@7593
  1611
* qed (and friends) now accept "" as result name; in that case the
wenzelm@7986
  1612
theorem is not stored, but proper checks and presentation of the
wenzelm@7986
  1613
result still apply;
wenzelm@7593
  1614
wenzelm@7805
  1615
* theorem database now also indexes constants "Trueprop", "all",
wenzelm@7805
  1616
"==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
wenzelm@7805
  1617
oheimb@6028
  1618
nipkow@6057
  1619
*** HOL ***
nipkow@6057
  1620
wenzelm@7215
  1621
** HOL arithmetic **
wenzelm@7215
  1622
wenzelm@6343
  1623
* There are now decision procedures for linear arithmetic over nat and
wenzelm@6343
  1624
int:
nipkow@6131
  1625
wenzelm@6343
  1626
1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
wenzelm@6343
  1627
`+', `-', `Suc', `min', `max' and numerical constants; other subterms
wenzelm@6343
  1628
are treated as atomic; subformulae not involving type `nat' or `int'
wenzelm@6343
  1629
are ignored; quantified subformulae are ignored unless they are
wenzelm@6343
  1630
positive universal or negative existential. The tactic has to be
wenzelm@6343
  1631
invoked by hand and can be a little bit slow. In particular, the
wenzelm@6343
  1632
running time is exponential in the number of occurrences of `min' and
wenzelm@6343
  1633
`max', and `-' on `nat'.
nipkow@6131
  1634
wenzelm@6343
  1635
2. fast_arith_tac is a cut-down version of arith_tac: it only takes
wenzelm@6343
  1636
(negated) (in)equalities among the premises and the conclusion into
wenzelm@6343
  1637
account (i.e. no compound formulae) and does not know about `min' and
wenzelm@6343
  1638
`max', and `-' on `nat'. It is fast and is used automatically by the
wenzelm@6343
  1639
simplifier.
nipkow@6131
  1640
wenzelm@6343
  1641
NB: At the moment, these decision procedures do not cope with mixed
wenzelm@6343
  1642
nat/int formulae where the two parts interact, such as `m < n ==>
wenzelm@6343
  1643
int(m) < int(n)'.
oheimb@6028
  1644
wenzelm@7215
  1645
* HOL/Numeral provides a generic theory of numerals (encoded
wenzelm@7313
  1646
efficiently as bit strings); setup for types nat/int/real is in place;
wenzelm@7215
  1647
INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
wenzelm@7215
  1648
int, existing theories and proof scripts may require a few additional
wenzelm@7215
  1649
type constraints;
wenzelm@7215
  1650
wenzelm@7215
  1651
* integer division and remainder can now be performed on constant
wenzelm@7215
  1652
arguments;
paulson@7157
  1653
wenzelm@7215
  1654
* many properties of integer multiplication, division and remainder
wenzelm@7215
  1655
are now available;
paulson@6922
  1656
paulson@7287
  1657
* An interface to the Stanford Validity Checker (SVC) is available through the
paulson@7287
  1658
tactic svc_tac.  Propositional tautologies and theorems of linear arithmetic
paulson@7287
  1659
are proved automatically.  SVC must be installed separately, and its results
paulson@7287
  1660
must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
paulson@7287
  1661
invocation of the underlying oracle).  For SVC see
paulson@7444
  1662
  http://verify.stanford.edu/SVC
paulson@6922
  1663
wenzelm@7125
  1664
* IsaMakefile: the HOL-Real target now builds an actual image;
wenzelm@7125
  1665
wenzelm@7215
  1666
wenzelm@7215
  1667
** HOL misc **
wenzelm@7215
  1668
wenzelm@7595
  1669
* HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
wenzelm@7595
  1670
(in Isabelle/Isar) -- by Gertrud Bauer;
wenzelm@7595
  1671
wenzelm@7691
  1672
* HOL/BCV: generic model of bytecode verification, i.e. data-flow
wenzelm@7691
  1673
analysis for assembly languages with subtypes;
wenzelm@7691
  1674
wenzelm@6278
  1675
* HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
wenzelm@6278
  1676
-- avoids syntactic ambiguities and treats state, transition, and
wenzelm@6278
  1677
temporal levels more uniformly; introduces INCOMPATIBILITIES due to
wenzelm@6278
  1678
changed syntax and (many) tactics;
wenzelm@6278
  1679
wenzelm@7791
  1680
* HOL/inductive: Now also handles more general introduction rules such
wenzelm@7791
  1681
  as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
wenzelm@7791
  1682
  theorems are now maintained within the theory (maintained via the
wenzelm@7791
  1683
  "mono" attribute);
berghofe@7780
  1684
wenzelm@7238
  1685
* HOL/datatype: Now also handles arbitrarily branching datatypes
wenzelm@7238
  1686
  (using function types) such as
wenzelm@7238
  1687
wenzelm@7238
  1688
  datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
berghofe@7047
  1689
wenzelm@7326
  1690
* HOL/record: record_simproc (part of the default simpset) takes care
wenzelm@7326
  1691
of selectors applied to updated records; record_split_tac is no longer
wenzelm@7327
  1692
part of the default claset; update_defs may now be removed from the
wenzelm@7327
  1693
simpset in many cases; COMPATIBILITY: old behavior achieved by
wenzelm@7326
  1694
wenzelm@7326
  1695
  claset_ref () := claset() addSWrapper record_split_wrapper;
wenzelm@7326
  1696
  Delsimprocs [record_simproc]
wenzelm@7326
  1697
wenzelm@6386
  1698
* HOL/typedef: fixed type inference for representing set; type
wenzelm@6386
  1699
arguments now have to occur explicitly on the rhs as type constraints;
wenzelm@6386
  1700
paulson@7287
  1701
* HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
paulson@7287
  1702
names rather than an ML expression;
paulson@7287
  1703
paulson@7287
  1704
* HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
paulson@7287
  1705
supplied later.  Program schemes can be defined, such as
paulson@7287
  1706
    "While B C s = (if B s then While B C (C s) else s)"
paulson@7287
  1707
where the well-founded relation can be chosen after B and C have been given.
wenzelm@6563
  1708
wenzelm@7215
  1709
* HOL/List: the constructors of type list are now Nil and Cons;
wenzelm@7215
  1710
INCOMPATIBILITY: while [] and infix # syntax is still there, of
wenzelm@7215
  1711
course, ML tools referring to List.list.op # etc. have to be adapted;
wenzelm@7215
  1712
wenzelm@7238
  1713
* HOL_quantifiers flag superseded by "HOL" print mode, which is
wenzelm@7238
  1714
disabled by default; run isabelle with option -m HOL to get back to
wenzelm@7238
  1715
the original Gordon/HOL-style output;
wenzelm@7238
  1716
wenzelm@7238
  1717
* HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
wenzelm@7238
  1718
ALL x<=y. P, EX x<y. P, EX x<=y. P;
wenzelm@7238
  1719
wenzelm@7238
  1720
* HOL basic syntax simplified (more orthogonal): all variants of
wenzelm@7238
  1721
All/Ex now support plain / symbolic / HOL notation; plain syntax for
wenzelm@7238
  1722
Eps operator is provided as well: "SOME x. P[x]";
wenzelm@7238
  1723
berghofe@7320
  1724
* HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
wenzelm@7261
  1725
wenzelm@7280
  1726
* HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
wenzelm@7280
  1727
thus available for user theories;
wenzelm@7280
  1728
wenzelm@7300
  1729
* HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
wenzelm@7300
  1730
HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
wenzelm@7300
  1731
time;
wenzelm@7300
  1732
wenzelm@7986
  1733
* HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
wenzelm@7986
  1734
several times and then mp;
oheimb@7492
  1735
wenzelm@7215
  1736
paulson@7113
  1737
*** LK ***
paulson@7113
  1738
wenzelm@7215
  1739
* the notation <<...>> is now available as a notation for sequences of
wenzelm@7215
  1740
formulas;
paulson@7113
  1741
paulson@7113
  1742
* the simplifier is now installed
paulson@7113
  1743
wenzelm@8729
  1744
* the axiom system has been generalized (thanks to Soren Heilmann)
paulson@7113
  1745
paulson@7113
  1746
* the classical reasoner now has a default rule database
paulson@7113
  1747
paulson@7113
  1748
paulson@6064
  1749
*** ZF ***
paulson@6064
  1750
paulson@6064
  1751
* new primrec section allows primitive recursive functions to be given
wenzelm@6269
  1752
directly (as in HOL) over datatypes and the natural numbers;
paulson@6064
  1753
wenzelm@6269
  1754
* new tactics induct_tac and exhaust_tac for induction (or case
wenzelm@6269
  1755
analysis) over datatypes and the natural numbers;
paulson@6064
  1756
paulson@6064
  1757
* the datatype declaration of type T now defines the recursor T_rec;
paulson@6064
  1758
paulson@6141
  1759
* simplification automatically does freeness reasoning for datatype
wenzelm@6269
  1760
constructors;
paulson@6141
  1761
wenzelm@6269
  1762
* automatic type-inference, with AddTCs command to insert new
wenzelm@6269
  1763
type-checking rules;
paulson@6155
  1764
wenzelm@6269
  1765
* datatype introduction rules are now added as Safe Introduction rules
wenzelm@6269
  1766
to the claset;
paulson@6155
  1767
wenzelm@6269
  1768
* the syntax "if P then x else y" is now available in addition to
wenzelm@6269
  1769
if(P,x,y);
wenzelm@6269
  1770
paulson@6069
  1771
wenzelm@6343
  1772
*** Internal programming interfaces ***
wenzelm@6343
  1773
wenzelm@7919
  1774
* tuned simplifier trace output; new flag debug_simp;
wenzelm@7919
  1775
wenzelm@7420
  1776
* structures Vartab / Termtab (instances of TableFun) offer efficient
wenzelm@7420
  1777
tables indexed by indexname_ord / term_ord (compatible with aconv);
wenzelm@7420
  1778
wenzelm@6386
  1779
* AxClass.axclass_tac lost the theory argument;
wenzelm@6386
  1780
wenzelm@6343
  1781
* tuned current_goals_markers semantics: begin / end goal avoids
wenzelm@6343
  1782
printing empty lines;
wenzelm@6343
  1783
wenzelm@6343
  1784
* removed prs and prs_fn hook, which was broken because it did not
wenzelm@6343
  1785
include \n in its semantics, forcing writeln to add one
wenzelm@6343
  1786
uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
wenzelm@6343
  1787
string -> unit if you really want to output text without newline;
wenzelm@6343
  1788
wenzelm@6343
  1789
* Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
wenzelm@6343
  1790
plain output, interface builders may have to enable 'isabelle_font'
wenzelm@6343
  1791
mode to get Isabelle font glyphs as before;
wenzelm@6343
  1792
wenzelm@6343
  1793
* refined token_translation interface; INCOMPATIBILITY: output length
wenzelm@6343
  1794
now of type real instead of int;
wenzelm@6343
  1795
wenzelm@7196
  1796
* theory loader actions may be traced via new ThyInfo.add_hook
wenzelm@7196
  1797
interface (see src/Pure/Thy/thy_info.ML); example application: keep
wenzelm@7196
  1798
your own database of information attached to *whole* theories -- as
wenzelm@7196
  1799
opposed to intra-theory data slots offered via TheoryDataFun;
wenzelm@7196
  1800
wenzelm@7647
  1801
* proper handling of dangling sort hypotheses (at last!);
wenzelm@7647
  1802
Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
wenzelm@7647
  1803
extra sort hypotheses that can be witnessed from the type signature;
wenzelm@7986
  1804
the force_strip_shyps flag is gone, any remaining shyps are simply
wenzelm@7986
  1805
left in the theorem (with a warning issued by strip_shyps_warning);
wenzelm@7647
  1806
wenzelm@6343
  1807
paulson@6064
  1808
wenzelm@5781
  1809
New in Isabelle98-1 (October 1998)
wenzelm@5781
  1810
----------------------------------
wenzelm@5781
  1811
wenzelm@5127
  1812
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4842
  1813
wenzelm@5726
  1814
* several changes of automated proof tools;
wenzelm@5373
  1815
wenzelm@5726
  1816
* HOL: major changes to the inductive and datatype packages, including
wenzelm@5726
  1817
some minor incompatibilities of theory syntax;
berghofe@5214
  1818
wenzelm@5726
  1819
* HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
wenzelm@5217
  1820
called `inj_on';
paulson@5160
  1821
nipkow@5275
  1822
* HOL: removed duplicate thms in Arith:
nipkow@5275
  1823
  less_imp_add_less  should be replaced by  trans_less_add1
nipkow@5275
  1824
  le_imp_add_le      should be replaced by  trans_le_add1
paulson@5160
  1825
wenzelm@5726
  1826
* HOL: unary minus is now overloaded (new type constraints may be
wenzelm@5726
  1827
required);
paulson@5490
  1828
wenzelm@5726
  1829
* HOL and ZF: unary minus for integers is now #- instead of #~.  In
wenzelm@5726
  1830
ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
wenzelm@5726
  1831
now taken as an integer constant.
paulson@5541
  1832
wenzelm@5726
  1833
* Pure: ML function 'theory_of' renamed to 'theory';
wenzelm@5397
  1834
wenzelm@5363
  1835
wenzelm@5127
  1836
*** Proof tools ***
nipkow@4880
  1837
nipkow@5657
  1838
* Simplifier:
nipkow@5657
  1839
  1. Asm_full_simp_tac is now more aggressive.
nipkow@5657
  1840
     1. It will sometimes reorient premises if that increases their power to
nipkow@5657
  1841
        simplify.
nipkow@5657
  1842
     2. It does no longer proceed strictly from left to right but may also
nipkow@5657
  1843
        rotate premises to achieve further simplification.
nipkow@5657
  1844
     For compatibility reasons there is now Asm_lr_simp_tac which is like the
nipkow@5657
  1845
     old Asm_full_simp_tac in that it does not rotate premises.
nipkow@5657
  1846
  2. The simplifier now knows a little bit about nat-arithmetic.
nipkow@4880
  1847
wenzelm@5127
  1848
* Classical reasoner: wrapper mechanism for the classical reasoner now
wenzelm@5127
  1849
allows for selected deletion of wrappers, by introduction of names for
wenzelm@5127
  1850
wrapper functionals.  This implies that addbefore, addSbefore,
wenzelm@5127
  1851
addaltern, and addSaltern now take a pair (name, tactic) as argument,
wenzelm@5127
  1852
and that adding two tactics with the same name overwrites the first
wenzelm@5127
  1853
one (emitting a warning).
oheimb@4824
  1854
  type wrapper = (int -> tactic) -> (int -> tactic)
oheimb@4649
  1855
  setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
oheimb@4824
  1856
  addWrapper, addSWrapper: claset * (string * wrapper) -> claset
oheimb@4824
  1857
  delWrapper, delSWrapper: claset *  string            -> claset
oheimb@4649
  1858
  getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
oheimb@4649
  1859
wenzelm@5705
  1860
* Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
wenzelm@5726
  1861
semantics; addbefore now affects only the unsafe part of step_tac
wenzelm@5726
  1862
etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
wenzelm@5726
  1863
FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
wenzelm@5726
  1864
by Force_tac;
oheimb@5524
  1865
wenzelm@5726
  1866
* Classical reasoner: setwrapper to setWrapper and compwrapper to
wenzelm@5726
  1867
compWrapper; added safe wrapper (and access functions for it);
oheimb@5524
  1868
wenzelm@5127
  1869
* HOL/split_all_tac is now much faster and fails if there is nothing
wenzelm@5726
  1870
to split.  Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
wenzelm@5726
  1871
and the names of the automatically generated variables have changed.
wenzelm@5726
  1872
split_all_tac has moved within claset() from unsafe wrappers to safe
wenzelm@5726
  1873
wrappers, which means that !!-bound variables are split much more
wenzelm@5726
  1874
aggressively, and safe_tac and clarify_tac now split such variables.
wenzelm@5726
  1875
If this splitting is not appropriate, use delSWrapper "split_all_tac".
wenzelm@5726
  1876
Note: the same holds for record_split_tac, which does the job of
wenzelm@5726
  1877
split_all_tac for record fields.
wenzelm@5127
  1878
wenzelm@5726
  1879
* HOL/Simplifier: Rewrite rules for case distinctions can now be added
wenzelm@5726
  1880
permanently to the default simpset using Addsplits just like
wenzelm@5726
  1881
Addsimps. They can be removed via Delsplits just like
wenzelm@5726
  1882
Delsimps. Lower-case versions are also available.
wenzelm@5127
  1883
wenzelm@5726
  1884
* HOL/Simplifier: The rule split_if is now part of the default
wenzelm@5726
  1885
simpset. This means that the simplifier will eliminate all occurrences
wenzelm@5726
  1886
of if-then-else in the conclusion of a goal. To prevent this, you can
wenzelm@5726
  1887
either remove split_if completely from the default simpset by
wenzelm@5726
  1888
`Delsplits [split_if]' or remove it in a specific call of the
wenzelm@5726
  1889
simplifier using `... delsplits [split_if]'.  You can also add/delete
wenzelm@5726
  1890
other case splitting rules to/from the default simpset: every datatype
wenzelm@5726
  1891
generates suitable rules `split_t_case' and `split_t_case_asm' (where
wenzelm@5726
  1892
t is the name of the datatype).
wenzelm@5127
  1893
wenzelm@5726
  1894
* Classical reasoner / Simplifier combination: new force_tac (and
wenzelm@5127
  1895
derivatives Force_tac, force) combines rewriting and classical
wenzelm@5127
  1896
reasoning (and whatever other tools) similarly to auto_tac, but is
wenzelm@5726
  1897
aimed to solve the given subgoal completely.
wenzelm@5127
  1898
wenzelm@5127
  1899
wenzelm@5127
  1900
*** General ***
wenzelm@5127
  1901
wenzelm@5217
  1902
* new top-level commands `Goal' and `Goalw' that improve upon `goal'
wenzelm@5127
  1903
and `goalw': the theory is no longer needed as an explicit argument -
wenzelm@5127
  1904
the current theory context is used; assumptions are no longer returned
wenzelm@5127
  1905
at the ML-level unless one of them starts with ==> or !!; it is
wenzelm@5217
  1906
recommended to convert to these new commands using isatool fixgoal
wenzelm@5217
  1907
(backup your sources first!);
wenzelm@4842
  1908
wenzelm@5217
  1909
* new top-level commands 'thm' and 'thms' for retrieving theorems from
wenzelm@5207
  1910
the current theory context, and 'theory' to lookup stored theories;
paulson@4806
  1911
paulson@5722
  1912
* new theory section 'locale' for declaring constants, assumptions and
paulson@5722
  1913
definitions that have local scope;
paulson@5722
  1914
wenzelm@5127
  1915
* new theory section 'nonterminals' for purely syntactic types;
wenzelm@4858
  1916
wenzelm@5127
  1917
* new theory section 'setup' for generic ML setup functions
wenzelm@5127
  1918
(e.g. package initialization);
wenzelm@4869
  1919
wenzelm@5131
  1920
* the distribution now includes Isabelle icons: see
wenzelm@5131
  1921
lib/logo/isabelle-{small,tiny}.xpm;
wenzelm@5131
  1922
wenzelm@5363
  1923
* isatool install - install binaries with absolute references to
wenzelm@5363
  1924
ISABELLE_HOME/bin;
wenzelm@5363
  1925
wenzelm@5572
  1926
* isatool logo -- create instances of the Isabelle logo (as EPS);
wenzelm@5572
  1927
wenzelm@5407
  1928
* print mode 'emacs' reserved for Isamode;
wenzelm@5407
  1929
wenzelm@5726
  1930
* support multiple print (ast) translations per constant name;
wenzelm@5726
  1931
wenzelm@6925
  1932
* theorems involving oracles are now printed with a suffixed [!];
wenzelm@6925
  1933
wenzelm@4711
  1934
paulson@4661
  1935
*** HOL ***
paulson@4661
  1936
wenzelm@5710
  1937
* there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
nipkow@5709
  1938
wenzelm@5217
  1939
* HOL/inductive package reorganized and improved: now supports mutual
paulson@5267
  1940
definitions such as
wenzelm@5217
  1941
wenzelm@5217
  1942
  inductive EVEN ODD
wenzelm@5217
  1943
    intrs
wenzelm@5217
  1944
      null "0 : EVEN"
wenzelm@5217
  1945
      oddI "n : EVEN ==> Suc n : ODD"
wenzelm@5217
  1946
      evenI "n : ODD ==> Suc n : EVEN"
wenzelm@5217
  1947
wenzelm@5217
  1948
new theorem list "elims" contains an elimination rule for each of the
wenzelm@5217
  1949
recursive sets; inductive definitions now handle disjunctive premises
wenzelm@5217
  1950
correctly (also ZF);
berghofe@5214
  1951
wenzelm@5217
  1952
INCOMPATIBILITIES: requires Inductive as an ancestor; component
wenzelm@5217
  1953
"mutual_induct" no longer exists - the induction rule is always
wenzelm@5217
  1954
contained in "induct";
wenzelm@5217
  1955
wenzelm@5217
  1956
wenzelm@5217
  1957
* HOL/datatype package re-implemented and greatly improved: now
paulson@5267
  1958
supports mutually recursive datatypes such as
wenzelm@5217
  1959
wenzelm@5217
  1960
  datatype
wenzelm@5217
  1961
    'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
wenzelm@5217
  1962
            | SUM ('a aexp) ('a aexp)
wenzelm@5217
  1963
            | DIFF ('a aexp) ('a aexp)
wenzelm@5217
  1964
            | NUM 'a
wenzelm@5217
  1965
  and
wenzelm@5217
  1966
    'a bexp = LESS ('a aexp) ('a aexp)
wenzelm@5217
  1967
            | AND ('a bexp) ('a bexp)
wenzelm@5217
  1968
            | OR ('a bexp) ('a bexp)
wenzelm@5217
  1969
paulson@5267
  1970
as well as indirectly recursive datatypes such as
berghofe@5214
  1971
wenzelm@5217
  1972
  datatype
wenzelm@5217
  1973
    ('a, 'b) term = Var 'a
wenzelm@5217
  1974
                  | App 'b ((('a, 'b) term) list)
berghofe@5214
  1975
wenzelm@5217
  1976
The new tactic  mutual_induct_tac [<var_1>, ..., <var_n>] i  performs
wenzelm@5217
  1977
induction on mutually / indirectly recursive datatypes.
wenzelm@5217
  1978
wenzelm@5217
  1979
Primrec equations are now stored in theory and can be accessed via
wenzelm@5217
  1980
<function_name>.simps.
wenzelm@5217
  1981
wenzelm@5217
  1982
INCOMPATIBILITIES:
berghofe@5214
  1983
wenzelm@5217
  1984
  - Theories using datatypes must now have theory Datatype as an
wenzelm@5217
  1985
    ancestor.
wenzelm@5217
  1986
  - The specific <typename>.induct_tac no longer exists - use the
wenzelm@5217
  1987
    generic induct_tac instead.
berghofe@5226
  1988
  - natE has been renamed to nat.exhaust - use exhaust_tac
wenzelm@5217
  1989
    instead of res_inst_tac ... natE. Note that the variable
berghofe@5226
  1990
    names in nat.exhaust differ from the names in natE, this
wenzelm@5217
  1991
    may cause some "fragile" proofs to fail.
wenzelm@5217
  1992
  - The theorems split_<typename>_case and split_<typename>_case_asm
wenzelm@5217
  1993
    have been renamed to <typename>.split and <typename>.split_asm.
wenzelm@5217
  1994
  - Since default sorts of type variables are now handled correctly,
wenzelm@5217
  1995
    some datatype definitions may have to be annotated with explicit
wenzelm@5217
  1996
    sort constraints.
wenzelm@5217
  1997
  - Primrec definitions no longer require function name and type
wenzelm@5217
  1998
    of recursive argument.
berghofe@5214
  1999
wenzelm@5217
  2000
Consider using isatool fixdatatype to adapt your theories and proof
wenzelm@5217
  2001
scripts to the new package (backup your sources first!).
wenzelm@5217
  2002
wenzelm@5217
  2003
wenzelm@5726
  2004
* HOL/record package: considerably improved implementation; now
wenzelm@5726
  2005
includes concrete syntax for record types, terms, updates; theorems
wenzelm@5726
  2006
for surjective pairing and splitting !!-bound record variables; proof
wenzelm@5726
  2007
support is as follows:
wenzelm@5726
  2008
wenzelm@5726
  2009
  1) standard conversions (selectors or updates applied to record
wenzelm@5726
  2010
constructor terms) are part of the standard simpset;
wenzelm@5726
  2011
wenzelm@5726
  2012
  2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
wenzelm@5726
  2013
made part of standard simpset and claset via addIffs;
wenzelm@5726
  2014
wenzelm@5726
  2015
  3) a tactic for record field splitting (record_split_tac) is part of
wenzelm@5726
  2016
the standard claset (addSWrapper);
wenzelm@5726
  2017
wenzelm@5726
  2018
To get a better idea about these rules you may retrieve them via
wenzelm@5726
  2019
something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
wenzelm@5726
  2020
the name of your record type.
wenzelm@5726
  2021
wenzelm@5726
  2022
The split tactic 3) conceptually simplifies by the following rule:
wenzelm@5726
  2023
wenzelm@5726
  2024
  "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
wenzelm@5726
  2025
wenzelm@5726
  2026
Thus any record variable that is bound by meta-all will automatically
wenzelm@5726
  2027
blow up into some record constructor term, consequently the
wenzelm@5726
  2028
simplifications of 1), 2) apply.  Thus force_tac, auto_tac etc. shall
wenzelm@5726
  2029
solve record problems automatically.
wenzelm@5726
  2030
berghofe@5214
  2031
wenzelm@5125
  2032
* reorganized the main HOL image: HOL/Integ and String loaded by
wenzelm@5125
  2033
default; theory Main includes everything;
wenzelm@5125
  2034
paulson@5650
  2035
* automatic simplification of integer sums and comparisons, using cancellation;
paulson@5650
  2036
oheimb@5526
  2037
* added option_map_eq_Some and not_Some_eq to the default simpset and claset;
wenzelm@5127
  2038
wenzelm@5127
  2039
* added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
wenzelm@5127
  2040
wenzelm@5127
  2041
* many new identities for unions, intersections, set difference, etc.;
wenzelm@5127
  2042
wenzelm@5127
  2043
* expand_if, expand_split, expand_sum_case and expand_nat_case are now
wenzelm@5127
  2044
called split_if, split_split, split_sum_case and split_nat_case (to go
wenzelm@5127
  2045
with add/delsplits);
wenzelm@5125
  2046
wenzelm@5127
  2047
* HOL/Prod introduces simplification procedure unit_eq_proc rewriting
wenzelm@5127
  2048
(?x::unit) = (); this is made part of the default simpset, which COULD
wenzelm@5127
  2049
MAKE EXISTING PROOFS FAIL under rare circumstances (consider
wenzelm@5207
  2050
'Delsimprocs [unit_eq_proc];' as last resort); also note that
wenzelm@5207
  2051
unit_abs_eta_conv is added in order to counter the effect of
wenzelm@5207
  2052
unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
wenzelm@5207
  2053
%u.f();
wenzelm@5125
  2054
wenzelm@5217
  2055
* HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
wenzelm@5217
  2056
makes more sense);
berghofe@5109
  2057
paulson@5475
  2058
* HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
  2059
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
  2060
  disjointness reasoning but breaking a few old proofs.
paulson@5267
  2061
wenzelm@5217
  2062
* HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
wenzelm@5217
  2063
to 'converse' from 'inverse' (for compatibility with ZF and some
wenzelm@5217
  2064
literature);
wenzelm@5085
  2065
wenzelm@5127
  2066
* HOL/recdef can now declare non-recursive functions, with {} supplied as
wenzelm@5127
  2067
the well-founded relation;
oheimb@4838
  2068
paulson@5490
  2069
* HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
paulson@5490
  2070
    Compl A.  The "Compl" syntax remains available as input syntax for this
paulson@5490
  2071
    release ONLY.
paulson@5490
  2072
wenzelm@5127
  2073
* HOL/Update: new theory of function updates:
wenzelm@5127
  2074
    f(a:=b) == %x. if x=a then b else f x
wenzelm@5127
  2075
may also be iterated as in f(a:=b,c:=d,...);
nipkow@5077
  2076
wenzelm@5127
  2077
* HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
paulson@4899
  2078
nipkow@5282
  2079
* HOL/List:
nipkow@5282
  2080
  - new function list_update written xs[i:=v] that updates the i-th
nipkow@5282
  2081
    list position. May also be iterated as in xs[i:=a,j:=b,...].
nipkow@5428
  2082
  - new function `upt' written [i..j(] which generates the list
nipkow@5428
  2083
    [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
nipkow@5428
  2084
    bound write [i..j], which is a shorthand for [i..j+1(].
nipkow@5282
  2085
  - new lexicographic orderings and corresponding wellfoundedness theorems.
paulson@4779
  2086
wenzelm@5127
  2087
* HOL/Arith:
wenzelm@5127
  2088
  - removed 'pred' (predecessor) function;
wenzelm@5127
  2089
  - generalized some theorems about n-1;
wenzelm@5127
  2090
  - many new laws about "div" and "mod";
wenzelm@5127
  2091
  - new laws about greatest common divisors (see theory ex/Primes);
oheimb@4766
  2092
wenzelm@5127
  2093
* HOL/Relation: renamed the relational operator r^-1 "converse"
wenzelm@4842
  2094
instead of "inverse";
wenzelm@4711
  2095
nipkow@5651
  2096
* HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
nipkow@5651
  2097
  of the multiset ordering;
nipkow@5651
  2098
wenzelm@5127
  2099
* directory HOL/Real: a construction of the reals using Dedekind cuts
nipkow@5651
  2100
  (not included by default);
nipkow@4835
  2101
wenzelm@5127
  2102
* directory HOL/UNITY: Chandy and Misra's UNITY formalism;
wenzelm@4711
  2103
nipkow@5651
  2104
* directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
nipkow@5651
  2105
  programs, i.e. different program variables may have different types.
nipkow@5651
  2106
paulson@5142
  2107
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
  2108
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
  2109
  Now rew can involve either definitions or equalities (either == or =).
wenzelm@5002
  2110
wenzelm@5363
  2111
paulson@4879
  2112
*** ZF ***
paulson@4879
  2113
paulson@5332
  2114
* theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
paulson@5332
  2115
  only the theorems proved on ZF.ML;
paulson@5160
  2116
paulson@5475
  2117
* ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
paulson@5475
  2118
  It and 'sym RS equals0D' are now in the default  claset, giving automatic
paulson@5475
  2119
  disjointness reasoning but breaking a few old proofs.
paulson@5267
  2120
paulson@5160
  2121
* ZF/Update: new theory of function updates
paulson@5160
  2122
    with default rewrite rule  f(x:=y) ` z = if(z=x, y, f`z)
paulson@5160
  2123
  may also be iterated as in f(a:=b,c:=d,...);
paulson@5160
  2124
paulson@4879
  2125
* in  let x=t in u(x), neither t nor u(x) has to be an FOL term.
oheimb@4649
  2126
paulson@5142
  2127
* calling (stac rew i) now fails if "rew" has no effect on the goal
paulson@5142
  2128
  [previously, this check worked only if the rewrite rule was unconditional]
paulson@5308
  2129
  Now rew can involve either definitions or equalities (either == or =).
paulson@5142
  2130
paulson@5160
  2131
* case_tac provided for compatibility with HOL
paulson@5160
  2132
    (like the old excluded_middle_tac, but with subgoals swapped)
paulson@5160
  2133
wenzelm@4842
  2134
wenzelm@5127
  2135
*** Internal programming interfaces ***
wenzelm@5002
  2136
wenzelm@5251
  2137
* Pure: several new basic modules made available for general use, see
wenzelm@5251
  2138
also src/Pure/README;
wenzelm@5207
  2139
wenzelm@5008
  2140
* improved the theory data mechanism to support encapsulation (data
wenzelm@5008
  2141
kind name replaced by private Object.kind, acting as authorization
wenzelm@5373
  2142
key); new type-safe user interface via functor TheoryDataFun; generic
wenzelm@5373
  2143
print_data function becomes basically useless;
wenzelm@5002
  2144
wenzelm@5251
  2145
* removed global_names compatibility flag -- all theory declarations
wenzelm@5251
  2146
are qualified by default;
wenzelm@5251
  2147
wenzelm@5085
  2148
* module Pure/Syntax now offers quote / antiquote translation
wenzelm@5085
  2149
functions (useful for Hoare logic etc. with implicit dependencies);
wenzelm@5373
  2150
see HOL/ex/Antiquote for an example use;
wenzelm@5085
  2151
wenzelm@5127
  2152
* Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
wenzelm@5127
  2153
cterm -> thm;
wenzelm@5127
  2154
wenzelm@5207
  2155
* new tactical CHANGED_GOAL for checking that a tactic modifies a
wenzelm@5207
  2156
subgoal;
paulson@5142
  2157
wenzelm@5251
  2158
* Display.print_goals function moved to Locale.print_goals;
wenzelm@5251
  2159
wenzelm@5731
  2160
* standard print function for goals supports current_goals_markers
wenzelm@5731
  2161
variable for marking begin of proof, end of proof, start of goal; the
wenzelm@5731
  2162
default is ("", "", ""); setting current_goals_markers := ("<proof>",
wenzelm@5731
  2163
"</proof>", "<goal>") causes SGML like tagged proof state printing,
wenzelm@5731
  2164
for example;
wenzelm@5731
  2165
wenzelm@5002
  2166
wenzelm@5002
  2167
wenzelm@4410
  2168
New in Isabelle98 (January 1998)
wenzelm@4410
  2169
--------------------------------
wenzelm@4410
  2170
wenzelm@4410
  2171
*** Overview of INCOMPATIBILITIES (see below for more details) ***
wenzelm@4410
  2172
wenzelm@4410
  2173
* changed lexical syntax of terms / types: dots made part of long
wenzelm@4410
  2174
identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
wenzelm@4410
  2175
wenzelm@4410
  2176
* simpset (and claset) reference variable replaced by functions
wenzelm@4410
  2177
simpset / simpset_ref;
wenzelm@4410
  2178
wenzelm@4410
  2179
* no longer supports theory aliases (via merge) and non-trivial
wenzelm@4410
  2180
implicit merge of thms' signatures;
wenzelm@4410
  2181
wenzelm@4410
  2182
* most internal names of constants changed due to qualified names;
wenzelm@4410
  2183
wenzelm@4410
  2184
* changed Pure/Sequence interface (see Pure/seq.ML);
wenzelm@4410
  2185
wenzelm@3454
  2186
paulson@3715
  2187
*** General Changes ***
paulson@3715
  2188
wenzelm@4174
  2189
* hierachically structured name spaces (for consts, types, axms, thms
wenzelm@3943
  2190
etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
wenzelm@4108
  2191
old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
wenzelm@4108
  2192
isatool fixdots ensures space after dots (e.g. "%x. x"); set
wenzelm@4174
  2193
long_names for fully qualified output names; NOTE: ML programs
wenzelm@4174
  2194
(special tactics, packages etc.) referring to internal names may have
wenzelm@4174
  2195
to be adapted to cope with fully qualified names; in case of severe
wenzelm@4174
  2196
backward campatibility problems try setting 'global_names' at compile
wenzelm@4174
  2197
time to have enrything declared within a flat name space; one may also
wenzelm@4174
  2198
fine tune name declarations in theories via the 'global' and 'local'
wenzelm@4174
  2199
section;
wenzelm@4108
  2200
wenzelm@4108
  2201
* reimplemented the implicit simpset and claset using the new anytype
wenzelm@4108
  2202
data filed in signatures; references simpset:simpset ref etc. are
wenzelm@4108
  2203
replaced by functions simpset:unit->simpset and
wenzelm@4108
  2204
simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
wenzelm@4108
  2205
to patch your ML files accordingly;
paulson@3856
  2206
wenzelm@3857
  2207
* HTML output now includes theory graph data for display with Java
wenzelm@3857
  2208
applet or isatool browser; data generated automatically via isatool
wenzelm@3901
  2209
usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
wenzelm@3857
  2210
paulson@3856
  2211
* defs may now be conditional; improved rewrite_goals_tac to handle
paulson@3856
  2212
conditional equations;
paulson@3856
  2213
wenzelm@4174
  2214
* defs now admits additional type arguments, using TYPE('a) syntax;
wenzelm@4174
  2215
wenzelm@3901
  2216
* theory aliases via merge (e.g. M=A+B+C) no longer supported, always
wenzelm@3901
  2217
creates a new theory node; implicit merge of thms' signatures is
wenzelm@4112
  2218
restricted to 'trivial' ones; COMPATIBILITY: one may have to use
wenzelm@3901
  2219
transfer:theory->thm->thm in (rare) cases;
wenzelm@3901
  2220
wenzelm@3968
  2221
* improved handling of draft signatures / theories; draft thms (and
wenzelm@3968
  2222
ctyps, cterms) are automatically promoted to real ones;
wenzelm@3968
  2223
wenzelm@3901
  2224
* slightly changed interfaces for oracles: admit many per theory, named
wenzelm@3901
  2225
(e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
wenzelm@3901
  2226
wenzelm@3901
  2227
* print_goals: optional output of const types (set show_consts and
wenzelm@3901
  2228
show_types);
wenzelm@3851
  2229
wenzelm@4388
  2230
* improved output of warnings (###) and errors (***);
wenzelm@3697
  2231
paulson@4178
  2232
* subgoal_tac displays a warning if the new subgoal has type variables;
paulson@4178
  2233
paulson@3715
  2234
* removed old README and Makefiles;
wenzelm@3697
  2235
paulson@3856
  2236
* replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
wenzelm@3670
  2237
paulson@3715
  2238
* removed obsolete init_pps and init_database;
paulson@3715
  2239
paulson@3715
  2240
* deleted the obsolete tactical STATE, which was declared by
paulson@3715
  2241
    fun STATE tacfun st = tacfun st st;
paulson@3715
  2242
wenzelm@4388
  2243
* cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
wenzelm@4388
  2244
(which abbreviates $HOME);
wenzelm@4269
  2245
wenzelm@4269
  2246
* changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
wenzelm@4269
  2247
use isatool fixseq to adapt your ML programs (this works for fully
wenzelm@4269
  2248
qualified references to the Sequence structure only!);
wenzelm@4269
  2249
wenzelm@4381
  2250
* use_thy no longer requires writable current directory; it always
wenzelm@4381
  2251
reloads .ML *and* .thy file, if either one is out of date;
wenzelm@4269
  2252
paulson@3715
  2253
paulson@3715
  2254
*** Classical Reasoner ***
paulson@3715
  2255
wenzelm@3744
  2256
* Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
wenzelm@3744
  2257
tactics that use classical reasoning to simplify a subgoal without
wenzelm@3744
  2258
splitting it into several subgoals;
paulson@3715
  2259
paulson@3719
  2260
* Safe_tac: like safe_tac but uses the default claset;
paulson@3719
  2261
paulson@3715
  2262
paulson@3715
  2263
*** Simplifier ***
paulson@3715
  2264
paulson@3715
  2265
* added simplification meta rules:
paulson@3715
  2266
    (asm_)(full_)simplify: simpset -> thm -> thm;
paulson@3715
  2267
paulson@3715
  2268
* simplifier.ML no longer part of Pure -- has to be loaded by object
paulson@3715
  2269
logics (again);
paulson@3715
  2270
paulson@3715
  2271
* added prems argument to simplification procedures;
paulson@3715
  2272
paulson@4325
  2273
* HOL, FOL, ZF: added infix function `addsplits':
paulson@4325
  2274
  instead of `<simpset> setloop (split_tac <thms>)'
paulson@4325
  2275
  you can simply write `<simpset> addsplits <thms>'
paulson@4325
  2276
paulson@3715
  2277
paulson@3715
  2278
*** Syntax ***
paulson@3715
  2279
wenzelm@4174
  2280
* TYPE('a) syntax for type reflection terms;
wenzelm@4174
  2281
wenzelm@3985
  2282
* no longer handles consts with name "" -- declare as 'syntax' instead;
paulson@3856
  2283
paulson@3856
  2284
* pretty printer: changed order of mixfix annotation preference (again!);
wenzelm@3846
  2285
paulson@3715
  2286
* Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
paulson@3715
  2287
paulson@3715
  2288
paulson@3715
  2289
*** HOL ***
paulson@3715
  2290
wenzelm@5726
  2291
* HOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
  2292
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
  2293
nipkow@4035
  2294
* HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
wenzelm@3985
  2295
wenzelm@3985
  2296
* HOL/Auth: new protocol proofs including some for the Internet
nipkow@4035
  2297
  protocol TLS;
wenzelm@3985
  2298
wenzelm@4125
  2299
* HOL/Map: new theory of `maps' a la VDM;
nipkow@3982
  2300
wenzelm@4335
  2301
* HOL/simplifier: simplification procedures nat_cancel_sums for
wenzelm@4335
  2302
cancelling out common nat summands from =, <, <= (in)equalities, or
wenzelm@4335
  2303
differences; simplification procedures nat_cancel_factor for
wenzelm@4335
  2304
cancelling common factor from =, <, <= (in)equalities over natural
wenzelm@4373
  2305
sums; nat_cancel contains both kinds of procedures, it is installed by
wenzelm@4373
  2306
default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
wenzelm@4335
  2307
nipkow@3580
  2308
* HOL/simplifier: terms of the form
paulson@4325
  2309
  `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)'  (or t=x)
nipkow@3580
  2310
  are rewritten to
nipkow@4035
  2311
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
nipkow@4035
  2312
  and those of the form
paulson@4325
  2313
  `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)'  (or t=x)
nipkow@4035
  2314
  are rewritten to
nipkow@4035
  2315
  `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
nipkow@4035
  2316
nipkow@4035
  2317
* HOL/datatype
nipkow@4035
  2318
  Each datatype `t' now comes with a theorem `split_t_case' of the form
nipkow@3580
  2319
nipkow@4035
  2320
  P(t_case f1 ... fn x) =
nipkow@4035
  2321
     ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
nipkow@4035
  2322
        ...
oheimb@4189
  2323
       (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
nipkow@4035
  2324
     )
nipkow@4035
  2325
oheimb@4930
  2326
  and a theorem `split_t_case_asm' of the form
oheimb@4189
  2327
oheimb@4189
  2328
  P(t_case f1 ... fn x) =
oheimb@4189
  2329
    ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
oheimb@4189
  2330
        ...
oheimb@4189
  2331
       (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
oheimb@4189
  2332
     )
oheimb@4930
  2333
  which can be added to a simpset via `addsplits'. The existing theorems
oheimb@4930
  2334
  expand_list_case and expand_option_case have been renamed to
oheimb@4930
  2335
  split_list_case and split_option_case.
oheimb@4189
  2336
nipkow@4361
  2337
* HOL/Arithmetic:
nipkow@4361
  2338
  - `pred n' is automatically converted to `n-1'.
nipkow@4361
  2339
    Users are strongly encouraged not to use `pred' any longer,
nipkow@4361
  2340
    because it will disappear altogether at some point.
nipkow@4361
  2341
  - Users are strongly encouraged to write "0 < n" rather than
nipkow@4361
  2342
    "n ~= 0". Theorems and proof tools have been modified towards this
nipkow@4361
  2343
    `standard'.
nipkow@4357
  2344
nipkow@4502
  2345
* HOL/Lists:
nipkow@4502
  2346
  the function "set_of_list" has been renamed "set" (and its theorems too);
nipkow@4502
  2347
  the function "nth" now takes its arguments in the reverse order and
nipkow@4502
  2348
  has acquired the infix notation "!" as in "xs!n".
paulson@3570
  2349
paulson@4154
  2350
* HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
paulson@4154
  2351
paulson@4154
  2352
* HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
paulson@4154
  2353
  specialist theorems (like UN1_I) are gone.  Similarly for (INT x.B x);
paulson@4154
  2354
wenzelm@4575
  2355
* HOL/record: extensible records with schematic structural subtyping
wenzelm@4575
  2356
(single inheritance); EXPERIMENTAL version demonstrating the encoding,
wenzelm@4575
  2357
still lacks various theorems and concrete record syntax;
wenzelm@4575
  2358
wenzelm@4125
  2359
paulson@3715
  2360
*** HOLCF ***
wenzelm@3535
  2361
wenzelm@4125
  2362
* removed "axioms" and "generated by" sections;
wenzelm@4125
  2363
oheimb@4123
  2364
* replaced "ops" section by extended "consts" section, which is capable of
wenzelm@4125
  2365
  handling the continuous function space "->" directly;
wenzelm@4125
  2366
wenzelm@4125
  2367
* domain package:
wenzelm@4125
  2368
  . proves theorems immediately and stores them in the theory,
wenzelm@4125
  2369
  . creates hierachical name space,
wenzelm@4125
  2370
  . now uses normal mixfix annotations (instead of cinfix...),
wenzelm@4125
  2371
  . minor changes to some names and values (for consistency),
wenzelm@4125
  2372
  . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
wenzelm@4125
  2373
  . separator between mutual domain defs: changed "," to "and",
wenzelm@4125
  2374
  . improved handling of sort constraints;  now they have to
wenzelm@4125
  2375
    appear on the left-hand side of the equations only;
oheimb@4123
  2376
oheimb@4123
  2377
* fixed LAM <x,y,zs>.b syntax;
wenzelm@3567
  2378
wenzelm@3744
  2379
* added extended adm_tac to simplifier in HOLCF -- can now discharge
wenzelm@3744
  2380
adm (%x. P (t x)), where P is chainfinite and t continuous;
wenzelm@3579
  2381
wenzelm@3579
  2382
paulson@3719
  2383
*** FOL and ZF ***
paulson@3719
  2384
wenzelm@5726
  2385
* FOL: there is a new splitter `split_asm_tac' that can be used e.g.
oheimb@4189
  2386
  with `addloop' of the simplifier to faciliate case splitting in premises.
oheimb@4189
  2387
wenzelm@3744
  2388
* qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
wenzelm@3744
  2389
in HOL, they strip ALL and --> from proved theorems;
wenzelm@3744
  2390
paulson@3719
  2391
wenzelm@3579
  2392
wenzelm@3006
  2393
New in Isabelle94-8 (May 1997)
wenzelm@3006
  2394
------------------------------
wenzelm@2654
  2395
paulson@3002
  2396
*** General Changes ***
paulson@3002
  2397
paulson@3002
  2398
* new utilities to build / run / maintain Isabelle etc. (in parts
paulson@3002
  2399
still somewhat experimental); old Makefiles etc. still functional;
wenzelm@2971
  2400
wenzelm@3205
  2401
* new 'Isabelle System Manual';
wenzelm@3205
  2402
wenzelm@2825
  2403
* INSTALL text, together with ./configure and ./build scripts;
wenzelm@2773
  2404
wenzelm@3006
  2405
* reimplemented type inference for greater efficiency, better error
wenzelm@3006
  2406
messages and clean internal interface;
paulson@3002
  2407
paulson@3002
  2408
* prlim command for dealing with lots of subgoals (an easier way of
paulson@3002
  2409
setting goals_limit);
paulson@3002
  2410
wenzelm@3006
  2411
wenzelm@3006
  2412
*** Syntax ***
paulson@3002
  2413
wenzelm@3116
  2414
* supports alternative (named) syntax tables (parser and pretty
wenzelm@3116
  2415
printer); internal interface is provided by add_modesyntax(_i);
wenzelm@3116
  2416
paulson@3002
  2417
* Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
paulson@3002
  2418
be used in conjunction with the Isabelle symbol font; uses the
paulson@3002
  2419
"symbols" syntax table;
paulson@3002
  2420
wenzelm@2705
  2421
* added token_translation interface (may translate name tokens in
wenzelm@2756
  2422
arbitrary ways, dependent on their type (free, bound, tfree, ...) and
wenzelm@3116
  2423
the current print_mode); IMPORTANT: user print translation functions
wenzelm@3116
  2424
are responsible for marking newly introduced bounds
wenzelm@3116
  2425
(Syntax.mark_boundT);
wenzelm@2705
  2426
wenzelm@2730
  2427
* token translations for modes "xterm" and "xterm_color" that display
wenzelm@3006
  2428
names in bold, underline etc. or colors (which requires a color
wenzelm@3006
  2429
version of xterm);
wenzelm@2730
  2430
paulson@3002
  2431
* infixes may now be declared with names independent of their syntax;
paulson@3002
  2432
paulson@3002
  2433
* added typed_print_translation (like print_translation, but may
paulson@3002
  2434
access type of constant);
paulson@3002
  2435
wenzelm@3006
  2436
paulson@3002
  2437
*** Classical Reasoner ***
paulson@3002
  2438
paulson@3002
  2439
Blast_tac: a new tactic!  It is often more powerful than fast_tac, but has
paulson@3002
  2440
some limitations.  Blast_tac...
paulson@3002
  2441
  + ignores addss, addbefore, addafter; this restriction is intrinsic
paulson@3002
  2442
  + ignores elimination rules that don't have the correct format
wenzelm@5726
  2443
        (the conclusion MUST be a formula variable)
paulson@3002
  2444
  + ignores types, which can make HOL proofs fail
paulson@3002
  2445
  + rules must not require higher-order unification, e.g. apply_type in ZF
paulson@3002
  2446
    [message "Function Var's argument not a bound variable" relates to this]
paulson@3002
  2447
  + its proof strategy is more general but can actually be slower
paulson@3002
  2448
wenzelm@3107
  2449
* substitution with equality assumptions no longer permutes other
wenzelm@3107
  2450
assumptions;
paulson@3002
  2451
paulson@3002
  2452
* minor changes in semantics of addafter (now called addaltern); renamed
paulson@3002
  2453
setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
wenzelm@3107
  2454
(and access functions for it);
paulson@3002
  2455
wenzelm@5726
  2456
* improved combination of classical reasoner and simplifier:
oheimb@3317
  2457
  + functions for handling clasimpsets
oheimb@3317
  2458
  + improvement of addss: now the simplifier is called _after_ the
oheimb@3317
  2459
    safe steps.
oheimb@3317
  2460
  + safe variant of addss called addSss: uses safe simplifications
wenzelm@5726
  2461
    _during_ the safe steps. It is more complete as it allows multiple
oheimb@3317
  2462
    instantiations of unknowns (e.g. with slow_tac).
wenzelm@3006
  2463
paulson@3002
  2464
*** Simplifier ***
paulson@3002
  2465
wenzelm@3006
  2466
* added interface for simplification procedures (functions that
wenzelm@3006
  2467
produce *proven* rewrite rules on the fly, depending on current
wenzelm@3006
  2468
redex);
wenzelm@3006
  2469
wenzelm@3006
  2470
* ordering on terms as parameter (used for ordered rewriting);
wenzelm@3006
  2471
wenzelm@3107
  2472
* new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
paulson@3002
  2473
paulson@3002
  2474
* the solver is now split into a safe and an unsafe part.
paulson@3002
  2475
This should be invisible for the normal user, except that the
paulson@3002
  2476
functions setsolver and addsolver have been renamed to setSolver and
wenzelm@3107
  2477
addSolver; added safe_asm_full_simp_tac;
paulson@3002
  2478
paulson@3002
  2479
paulson@3002
  2480
*** HOL ***
paulson@3002
  2481
nipkow@3042
  2482
* a generic induction tactic `induct_tac' which works for all datatypes and
wenzelm@3107
  2483
also for type `nat';
nipkow@3042
  2484
nipkow@3316
  2485
* a generic case distinction tactic `exhaust_tac' which works for all
nipkow@3316
  2486
datatypes and also for type `nat';
nipkow@3316
  2487
nipkow@3316
  2488
* each datatype comes with a function `size';
nipkow@3316
  2489
paulson@3002
  2490
* patterns in case expressions allow tuple patterns as arguments to
wenzelm@3107
  2491
constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
paulson@3002
  2492
paulson@3002
  2493
* primrec now also works with type nat;
paulson@3002
  2494
paulson@3338
  2495
* recdef: a new declaration form, allows general recursive functions to be
paulson@3338
  2496
defined in theory files.  See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
paulson@3338
  2497
paulson@3002
  2498
* the constant for negation has been renamed from "not" to "Not" to
wenzelm@3107
  2499
harmonize with FOL, ZF, LK, etc.;
paulson@3002
  2500
wenzelm@3107
  2501
* HOL/ex/LFilter theory of a corecursive "filter" functional for
wenzelm@3107
  2502
infinite lists;
paulson@3002
  2503
wenzelm@3227
  2504
* HOL/Modelcheck demonstrates invocation of model checker oracle;
wenzelm@3227
  2505
paulson@3002
  2506
* HOL/ex/Ring.thy declares cring_simp, which solves equational
paulson@3002
  2507
problems in commutative rings, using axiomatic type classes for + and *;
paulson@3002
  2508
paulson@3002
  2509
* more examples in HOL/MiniML and HOL/Auth;
paulson@3002
  2510
paulson@3002
  2511
* more default rewrite rules for quantifiers, union/intersection;
paulson@3002
  2512
nipkow@3321
  2513
* a new constant `arbitrary == @x.False';
nipkow@3321
  2514
wenzelm@3107
  2515
* HOLCF/IOA replaces old HOL/IOA;
wenzelm@3107
  2516
wenzelm@5726
  2517
* HOLCF changes: derived all rules and arities
wenzelm@5726
  2518
  + axiomatic type classes instead of classes
slotosch@2653
  2519
  + typedef instead of faking type definitions
paulson@2747
  2520
  + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
wenzelm@2730
  2521
  + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
slotosch@2653
  2522
  + eliminated the types void, one, tr
slotosch@2653
  2523
  + use unit lift and bool lift (with translations) instead of one and tr
slotosch@2653
  2524
  + eliminated blift from Lift3.thy (use Def instead of blift)
wenzelm@3107
  2525
  all eliminated rules are derived as theorems --> no visible changes ;
oheimb@2649
  2526
wenzelm@3006
  2527
paulson@3002
  2528
*** ZF ***
wenzelm@2553
  2529
paulson@2865
  2530
* ZF now has Fast_tac, Simp_tac and Auto_tac.  Union_iff is a now a default
paulson@2865
  2531
rewrite rule; this may affect some proofs.  eq_cs is gone but can be put back
paulson@2865
  2532
as ZF_cs addSIs [equalityI];
wenzelm@2553
  2533
wenzelm@2554
  2534
wenzelm@2732
  2535
wenzelm@2553
  2536
New in Isabelle94-7 (November 96)
wenzelm@2553
  2537
---------------------------------
wenzelm@2553
  2538
wenzelm@2553
  2539
* allowing negative levels (as offsets) in prlev and choplev;
wenzelm@2553
  2540
wenzelm@2554
  2541
* super-linear speedup for large simplifications;
wenzelm@2554
  2542
wenzelm@2554
  2543
* FOL, ZF and HOL now use miniscoping: rewriting pushes
wenzelm@2554
  2544
quantifications in as far as possible (COULD MAKE EXISTING PROOFS
wenzelm@2554
  2545
FAIL); can suppress it using the command Delsimps (ex_simps @
wenzelm@2554
  2546
all_simps); De Morgan laws are also now included, by default;
wenzelm@2554
  2547
wenzelm@2554
  2548
* improved printing of ==>  :  ~:
wenzelm@2554
  2549
wenzelm@2554
  2550
* new object-logic "Sequents" adds linear logic, while replacing LK
wenzelm@2554
  2551
and Modal (thanks to Sara Kalvala);
wenzelm@2554
  2552
wenzelm@2554
  2553
* HOL/Auth: correctness proofs for authentication protocols;
wenzelm@2554
  2554
wenzelm@2554
  2555
* HOL: new auto_tac combines rewriting and classical reasoning (many
wenzelm@2554
  2556
examples on HOL/Auth);
wenzelm@2554
  2557
wenzelm@2554
  2558
* HOL: new command AddIffs for declaring theorems of the form P=Q to
wenzelm@2554
  2559
the rewriter and classical reasoner simultaneously;
wenzelm@2554
  2560
wenzelm@2554
  2561
* function uresult no longer returns theorems in "standard" format;
wenzelm@2554
  2562
regain previous version by: val uresult = standard o uresult;
wenzelm@2554
  2563
wenzelm@2554
  2564
wenzelm@2554
  2565
wenzelm@2554
  2566
New in Isabelle94-6
wenzelm@2554
  2567
-------------------
wenzelm@2554
  2568
wenzelm@2554
  2569
* oracles -- these establish an interface between Isabelle and trusted
wenzelm@2554
  2570
external reasoners, which may deliver results as theorems;
wenzelm@2554
  2571
wenzelm@2554
  2572
* proof objects (in particular record all uses of oracles);
wenzelm@2554
  2573
wenzelm@2554
  2574
* Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
wenzelm@2554
  2575
wenzelm@2554
  2576
* "constdefs" section in theory files;
wenzelm@2554
  2577
wenzelm@2554
  2578
* "primrec" section (HOL) no longer requires names;
wenzelm@2554
  2579
wenzelm@2554
  2580
* internal type "tactic" now simply "thm -> thm Sequence.seq";
wenzelm@2554
  2581
wenzelm@2554
  2582
wenzelm@2554
  2583
wenzelm@2554
  2584
New in Isabelle94-5
wenzelm@2554
  2585
-------------------
wenzelm@2554
  2586
wenzelm@2554
  2587
* reduced space requirements;
wenzelm@2554
  2588
wenzelm@2554
  2589
* automatic HTML generation from theories;
wenzelm@2554
  2590
wenzelm@2554
  2591
* theory files no longer require "..." (quotes) around most types;
wenzelm@2554
  2592
wenzelm@2554
  2593
* new examples, including two proofs of the Church-Rosser theorem;
wenzelm@2554
  2594
wenzelm@2554
  2595
* non-curried (1994) version of HOL is no longer distributed;
wenzelm@2554
  2596
wenzelm@2553
  2597
paulson@2557
  2598
paulson@2557
  2599
New in Isabelle94-4
paulson@2557
  2600
-------------------
paulson@2557
  2601
paulson@2747
  2602
* greatly reduced space requirements;
paulson@2557
  2603
paulson@2557
  2604
* theory files (.thy) no longer require \...\ escapes at line breaks;
paulson@2557
  2605
wenzelm@5726
  2606
* searchable theorem database (see the section "Retrieving theorems" on
paulson@2557
  2607
page 8 of the Reference Manual);
paulson@2557
  2608
paulson@2557
  2609
* new examples, including Grabczewski's monumental case study of the
paulson@2557
  2610
Axiom of Choice;
paulson@2557
  2611
paulson@2557
  2612
* The previous version of HOL renamed to Old_HOL;
paulson@2557
  2613
wenzelm@5726
  2614
* The new version of HOL (previously called CHOL) uses a curried syntax
paulson@2557
  2615
for functions.  Application looks like f a b instead of f(a,b);
paulson@2557
  2616
paulson@2557
  2617
* Mutually recursive inductive definitions finally work in HOL;
paulson@2557
  2618
paulson@2557
  2619
* In ZF, pattern-matching on tuples is now available in all abstractions and
paulson@2557
  2620
translates to the operator "split";
paulson@2557
  2621
paulson@2557
  2622
paulson@2557
  2623
paulson@2557
  2624
New in Isabelle94-3
paulson@2557
  2625
-------------------
paulson@2557
  2626
wenzelm@5726
  2627
* new infix operator, addss, allowing the classical reasoner to
paulson@2557
  2628
perform simplification at each step of its search.  Example:
wenzelm@5726
  2629
        fast_tac (cs addss ss)
paulson@2557
  2630
wenzelm@5726
  2631
* a new logic, CHOL, the same as HOL, but with a curried syntax
wenzelm@5726
  2632
for functions.  Application looks like f a b instead of f(a,b).  Also pairs
paulson@2557
  2633
look like (a,b) instead of <a,b>;
paulson@2557
  2634
paulson@2557
  2635
* PLEASE NOTE: CHOL will eventually replace HOL!
paulson@2557
  2636
paulson@2557
  2637
* In CHOL, pattern-matching on tuples is now available in all abstractions.
paulson@2557
  2638
It translates to the operator "split".  A new theory of integers is available;
paulson@2557
  2639
paulson@2557
  2640
* In ZF, integer numerals now denote two's-complement binary integers.
paulson@2557
  2641
Arithmetic operations can be performed by rewriting.  See ZF/ex/Bin.ML;
paulson@2557
  2642
wenzelm@5726
  2643
* Many new examples: I/O automata, Church-Rosser theorem, equivalents
paulson@2557
  2644
of the Axiom of Choice;
paulson@2557
  2645
paulson@2557
  2646
paulson@25