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