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