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