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