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