src/Pure/sign.ML
author nipkow
Tue Aug 01 12:36:05 1995 +0200 (1995-08-01)
changeset 1214 3f3888213ceb
parent 1180 9b2efb601898
child 1216 a2f2360ce1c8
permissions -rw-r--r--
Added nonempty_sort.
wenzelm@19
     1
(*  Title:      Pure/sign.ML
clasohm@0
     2
    ID:         $Id$
wenzelm@251
     3
    Author:     Lawrence C Paulson and Markus Wenzel
clasohm@0
     4
wenzelm@251
     5
The abstract type "sg" of signatures.
clasohm@0
     6
*)
clasohm@0
     7
wenzelm@19
     8
signature SIGN =
clasohm@0
     9
sig
clasohm@0
    10
  structure Symtab: SYMTAB
clasohm@0
    11
  structure Syntax: SYNTAX
wenzelm@251
    12
  structure Type: TYPE
wenzelm@143
    13
  sharing Symtab = Type.Symtab
wenzelm@562
    14
  local open Type Syntax in
wenzelm@251
    15
    type sg
wenzelm@251
    16
    val rep_sg: sg ->
wenzelm@251
    17
      {tsig: type_sig,
wenzelm@251
    18
       const_tab: typ Symtab.table,
wenzelm@386
    19
       syn: syntax,
wenzelm@251
    20
       stamps: string ref list}
wenzelm@251
    21
    val subsig: sg * sg -> bool
wenzelm@251
    22
    val eq_sg: sg * sg -> bool
wenzelm@386
    23
    val is_draft: sg -> bool
wenzelm@386
    24
    val const_type: sg -> string -> typ option
wenzelm@402
    25
    val classes: sg -> class list
wenzelm@583
    26
    val subsort: sg -> sort * sort -> bool
wenzelm@583
    27
    val norm_sort: sg -> sort -> sort
wenzelm@251
    28
    val print_sg: sg -> unit
wenzelm@562
    29
    val pretty_sg: sg -> Pretty.T
wenzelm@251
    30
    val pprint_sg: sg -> pprint_args -> unit
wenzelm@386
    31
    val pretty_term: sg -> term -> Pretty.T
wenzelm@386
    32
    val pretty_typ: sg -> typ -> Pretty.T
wenzelm@620
    33
    val pretty_sort: sort -> Pretty.T
wenzelm@251
    34
    val string_of_term: sg -> term -> string
wenzelm@251
    35
    val string_of_typ: sg -> typ -> string
wenzelm@251
    36
    val pprint_term: sg -> term -> pprint_args -> unit
wenzelm@251
    37
    val pprint_typ: sg -> typ -> pprint_args -> unit
wenzelm@251
    38
    val certify_typ: sg -> typ -> typ
wenzelm@251
    39
    val certify_term: sg -> term -> term * typ * int
wenzelm@251
    40
    val read_typ: sg * (indexname -> sort option) -> string -> typ
wenzelm@562
    41
    val infer_types: sg -> (indexname -> typ option) ->
clasohm@959
    42
      (indexname -> sort option) -> string list -> bool
nipkow@949
    43
      -> term list * typ -> int * term * (indexname * typ) list
wenzelm@562
    44
    val add_classes: (class * class list) list -> sg -> sg
wenzelm@421
    45
    val add_classrel: (class * class) list -> sg -> sg
wenzelm@386
    46
    val add_defsort: sort -> sg -> sg
wenzelm@386
    47
    val add_types: (string * int * mixfix) list -> sg -> sg
wenzelm@386
    48
    val add_tyabbrs: (string * string list * string * mixfix) list -> sg -> sg
wenzelm@386
    49
    val add_tyabbrs_i: (string * string list * typ * mixfix) list -> sg -> sg
wenzelm@386
    50
    val add_arities: (string * sort list * sort) list -> sg -> sg
wenzelm@386
    51
    val add_consts: (string * string * mixfix) list -> sg -> sg
wenzelm@386
    52
    val add_consts_i: (string * typ * mixfix) list -> sg -> sg
wenzelm@386
    53
    val add_syntax: (string * string * mixfix) list -> sg -> sg
wenzelm@386
    54
    val add_syntax_i: (string * typ * mixfix) list -> sg -> sg
wenzelm@386
    55
    val add_trfuns:
wenzelm@386
    56
      (string * (ast list -> ast)) list *
wenzelm@386
    57
      (string * (term list -> term)) list *
wenzelm@386
    58
      (string * (term list -> term)) list *
wenzelm@386
    59
      (string * (ast list -> ast)) list -> sg -> sg
wenzelm@1159
    60
    val add_trrules: (string * string) trrule list -> sg -> sg
wenzelm@1159
    61
    val add_trrules_i: ast trrule list -> sg -> sg
wenzelm@386
    62
    val add_name: string -> sg -> sg
wenzelm@386
    63
    val make_draft: sg -> sg
wenzelm@251
    64
    val merge: sg * sg -> sg
nipkow@1214
    65
    val nonempty_sort: sg * sort list * sort -> bool
clasohm@922
    66
    val proto_pure: sg
wenzelm@251
    67
    val pure: sg
clasohm@922
    68
    val cpure: sg
wenzelm@386
    69
    val const_of_class: class -> string
wenzelm@386
    70
    val class_of_const: string -> class
wenzelm@251
    71
  end
clasohm@0
    72
end;
clasohm@0
    73
wenzelm@251
    74
functor SignFun(structure Syntax: SYNTAX and Type: TYPE): SIGN =
wenzelm@143
    75
struct
clasohm@0
    76
clasohm@0
    77
structure Symtab = Type.Symtab;
clasohm@0
    78
structure Syntax = Syntax;
wenzelm@386
    79
structure BasicSyntax: BASIC_SYNTAX = Syntax;
wenzelm@251
    80
structure Pretty = Syntax.Pretty;
wenzelm@251
    81
structure Type = Type;
wenzelm@562
    82
open BasicSyntax Type;
clasohm@0
    83
wenzelm@143
    84
wenzelm@251
    85
(** datatype sg **)
wenzelm@251
    86
wenzelm@251
    87
(*the "ref" in stamps ensures that no two signatures are identical -- it is
wenzelm@251
    88
  impossible to forge a signature*)
wenzelm@143
    89
wenzelm@19
    90
datatype sg =
wenzelm@143
    91
  Sg of {
wenzelm@251
    92
    tsig: type_sig,                 (*order-sorted signature of types*)
wenzelm@143
    93
    const_tab: typ Symtab.table,    (*types of constants*)
wenzelm@143
    94
    syn: Syntax.syntax,             (*syntax for parsing and printing*)
wenzelm@143
    95
    stamps: string ref list};       (*unique theory indentifier*)
clasohm@0
    96
clasohm@0
    97
fun rep_sg (Sg args) = args;
wenzelm@402
    98
val tsig_of = #tsig o rep_sg;
clasohm@0
    99
nipkow@206
   100
wenzelm@402
   101
(* stamps *)
wenzelm@402
   102
wenzelm@386
   103
fun is_draft (Sg {stamps = ref "#" :: _, ...}) = true
wenzelm@386
   104
  | is_draft _ = false;
wenzelm@386
   105
wenzelm@251
   106
fun subsig (Sg {stamps = s1, ...}, Sg {stamps = s2, ...}) = s1 subset s2;
clasohm@0
   107
wenzelm@266
   108
fun eq_sg (Sg {stamps = s1, ...}, Sg {stamps = s2, ...}) = eq_set (s1, s2);
clasohm@0
   109
clasohm@0
   110
wenzelm@402
   111
(* consts *)
wenzelm@402
   112
wenzelm@386
   113
fun const_type (Sg {const_tab, ...}) c =
wenzelm@386
   114
  Symtab.lookup (const_tab, c);
wenzelm@386
   115
wenzelm@386
   116
wenzelm@620
   117
(* classes and sorts *)
wenzelm@402
   118
wenzelm@402
   119
val classes = #classes o Type.rep_tsig o tsig_of;
wenzelm@402
   120
wenzelm@402
   121
val subsort = Type.subsort o tsig_of;
wenzelm@402
   122
val norm_sort = Type.norm_sort o tsig_of;
wenzelm@402
   123
wenzelm@620
   124
fun pretty_sort [c] = Pretty.str c
wenzelm@620
   125
  | pretty_sort cs = Pretty.str_list "{" "}" cs;
wenzelm@620
   126
wenzelm@402
   127
clasohm@0
   128
wenzelm@251
   129
(** print signature **)
wenzelm@251
   130
wenzelm@386
   131
val stamp_names = rev o map !;
wenzelm@386
   132
wenzelm@251
   133
fun print_sg sg =
wenzelm@251
   134
  let
wenzelm@251
   135
    fun prt_typ syn ty = Pretty.quote (Syntax.pretty_typ syn ty);
wenzelm@251
   136
wenzelm@251
   137
    fun pretty_subclass (cl, cls) = Pretty.block
wenzelm@251
   138
      [Pretty.str (cl ^ " <"), Pretty.brk 1, pretty_sort cls];
wenzelm@251
   139
wenzelm@251
   140
    fun pretty_default cls = Pretty.block
wenzelm@251
   141
      [Pretty.str "default:", Pretty.brk 1, pretty_sort cls];
wenzelm@251
   142
nipkow@963
   143
    fun pretty_ty (ty, n) = Pretty.str (ty ^ " " ^ string_of_int n);
wenzelm@251
   144
wenzelm@251
   145
    fun pretty_abbr syn (ty, (vs, rhs)) = Pretty.block
wenzelm@620
   146
      [prt_typ syn (Type (ty, map (fn v => TVar ((v, 0), [])) vs)),
wenzelm@251
   147
        Pretty.str " =", Pretty.brk 1, prt_typ syn rhs];
wenzelm@251
   148
wenzelm@251
   149
    fun pretty_arity ty (cl, []) = Pretty.block
wenzelm@251
   150
          [Pretty.str (ty ^ " ::"), Pretty.brk 1, Pretty.str cl]
wenzelm@251
   151
      | pretty_arity ty (cl, srts) = Pretty.block
wenzelm@251
   152
          [Pretty.str (ty ^ " ::"), Pretty.brk 1,
wenzelm@251
   153
            Pretty.list "(" ")" (map pretty_sort srts),
wenzelm@251
   154
            Pretty.brk 1, Pretty.str cl];
wenzelm@251
   155
nipkow@963
   156
    fun pretty_arities (ty, ars) = map (pretty_arity ty) ars;
wenzelm@251
   157
wenzelm@251
   158
    fun pretty_const syn (c, ty) = Pretty.block
wenzelm@266
   159
      [Pretty.str (quote c ^ " ::"), Pretty.brk 1, prt_typ syn ty];
wenzelm@251
   160
wenzelm@251
   161
wenzelm@251
   162
    val Sg {tsig, const_tab, syn, stamps} = sg;
nipkow@963
   163
    val {classes, subclass, default, tycons, abbrs, arities} = rep_tsig tsig;
wenzelm@251
   164
  in
wenzelm@386
   165
    Pretty.writeln (Pretty.strs ("stamps:" :: stamp_names stamps));
wenzelm@251
   166
    Pretty.writeln (Pretty.strs ("classes:" :: classes));
nipkow@963
   167
    Pretty.writeln (Pretty.big_list "subclass:"
nipkow@963
   168
                      (map pretty_subclass subclass));
wenzelm@251
   169
    Pretty.writeln (pretty_default default);
nipkow@963
   170
    Pretty.writeln (Pretty.big_list "types:" (map pretty_ty tycons));
wenzelm@251
   171
    Pretty.writeln (Pretty.big_list "abbrs:" (map (pretty_abbr syn) abbrs));
nipkow@963
   172
    Pretty.writeln (Pretty.big_list "arities:"
nipkow@963
   173
                      (flat (map pretty_arities arities)));
wenzelm@251
   174
    Pretty.writeln (Pretty.big_list "consts:"
nipkow@963
   175
                      (map (pretty_const syn) (Symtab.dest const_tab)))
wenzelm@251
   176
  end;
wenzelm@251
   177
wenzelm@251
   178
wenzelm@562
   179
fun pretty_sg (Sg {stamps, ...}) =
wenzelm@562
   180
  Pretty.str_list "{" "}" (stamp_names stamps);
wenzelm@562
   181
wenzelm@562
   182
val pprint_sg = Pretty.pprint o pretty_sg;
wenzelm@251
   183
wenzelm@251
   184
wenzelm@251
   185
wenzelm@251
   186
(** pretty printing of terms and types **)
wenzelm@251
   187
clasohm@922
   188
fun pretty_term (Sg {syn, stamps, ...}) =
clasohm@922
   189
  let val curried = "CPure" mem (map ! stamps);
clasohm@922
   190
  in Syntax.pretty_term curried syn end;
clasohm@922
   191
wenzelm@251
   192
fun pretty_typ (Sg {syn, ...}) = Syntax.pretty_typ syn;
wenzelm@251
   193
clasohm@922
   194
fun string_of_term (Sg {syn, stamps, ...}) = 
clasohm@922
   195
  let val curried = "CPure" mem (map ! stamps);
clasohm@922
   196
  in Syntax.string_of_term curried syn end;
clasohm@922
   197
wenzelm@251
   198
fun string_of_typ (Sg {syn, ...}) = Syntax.string_of_typ syn;
wenzelm@251
   199
wenzelm@251
   200
fun pprint_term sg = Pretty.pprint o Pretty.quote o (pretty_term sg);
wenzelm@251
   201
fun pprint_typ sg = Pretty.pprint o Pretty.quote o (pretty_typ sg);
clasohm@0
   202
clasohm@0
   203
wenzelm@169
   204
wenzelm@562
   205
(** read types **)  (*exception ERROR*)
wenzelm@562
   206
wenzelm@562
   207
fun err_in_type s =
wenzelm@562
   208
  error ("The error(s) above occurred in type " ^ quote s);
wenzelm@562
   209
wenzelm@562
   210
fun read_raw_typ syn tsig sort_of str =
wenzelm@562
   211
  Syntax.read_typ syn (fn x => if_none (sort_of x) (defaultS tsig)) str
wenzelm@562
   212
    handle ERROR => err_in_type str;
wenzelm@562
   213
wenzelm@562
   214
(*read and certify typ wrt a signature*)
wenzelm@562
   215
fun read_typ (Sg {tsig, syn, ...}, sort_of) str =
wenzelm@562
   216
  cert_typ tsig (read_raw_typ syn tsig sort_of str)
wenzelm@562
   217
    handle TYPE (msg, _, _) => (writeln msg; err_in_type str);
wenzelm@562
   218
wenzelm@562
   219
wenzelm@562
   220
wenzelm@386
   221
(** certify types and terms **)   (*exception TYPE*)
wenzelm@251
   222
wenzelm@251
   223
fun certify_typ (Sg {tsig, ...}) ty = cert_typ tsig ty;
wenzelm@251
   224
wenzelm@251
   225
wenzelm@386
   226
fun mapfilt_atoms f (Abs (_, _, t)) = mapfilt_atoms f t
wenzelm@386
   227
  | mapfilt_atoms f (t $ u) = mapfilt_atoms f t @ mapfilt_atoms f u
wenzelm@386
   228
  | mapfilt_atoms f a = (case f a of Some y => [y] | None => []);
clasohm@0
   229
wenzelm@386
   230
fun certify_term (sg as Sg {tsig, ...}) tm =
wenzelm@251
   231
  let
wenzelm@251
   232
    fun valid_const a T =
wenzelm@386
   233
      (case const_type sg a of
wenzelm@251
   234
        Some U => typ_instance (tsig, T, U)
wenzelm@251
   235
      | _ => false);
wenzelm@169
   236
wenzelm@251
   237
    fun atom_err (Const (a, T)) =
wenzelm@251
   238
          if valid_const a T then None
wenzelm@251
   239
          else Some ("Illegal type for constant " ^ quote a ^ " :: " ^
wenzelm@251
   240
            quote (string_of_typ sg T))
wenzelm@251
   241
      | atom_err (Var ((x, i), _)) =
wenzelm@251
   242
          if i < 0 then Some ("Negative index for Var " ^ quote x) else None
wenzelm@251
   243
      | atom_err _ = None;
wenzelm@251
   244
wenzelm@251
   245
    val norm_tm =
wenzelm@251
   246
      (case it_term_types (typ_errors tsig) (tm, []) of
wenzelm@251
   247
        [] => map_term_types (norm_typ tsig) tm
wenzelm@251
   248
      | errs => raise_type (cat_lines errs) [] [tm]);
wenzelm@251
   249
  in
wenzelm@386
   250
    (case mapfilt_atoms atom_err norm_tm of
wenzelm@251
   251
      [] => (norm_tm, type_of norm_tm, maxidx_of_term norm_tm)
wenzelm@251
   252
    | errs => raise_type (cat_lines errs) [] [norm_tm])
wenzelm@251
   253
  end;
wenzelm@251
   254
wenzelm@251
   255
wenzelm@251
   256
wenzelm@583
   257
(** infer_types **)         (*exception ERROR*)
wenzelm@251
   258
clasohm@959
   259
fun infer_types sg types sorts used freeze (ts, T) =
wenzelm@251
   260
  let
wenzelm@562
   261
    val Sg {tsig, ...} = sg;
wenzelm@562
   262
    val show_typ = string_of_typ sg;
wenzelm@562
   263
    val show_term = string_of_term sg;
wenzelm@169
   264
wenzelm@562
   265
    fun term_err [] = ""
wenzelm@562
   266
      | term_err [t] = "\nInvolving this term:\n" ^ show_term t
clasohm@623
   267
      | term_err ts = 
clasohm@623
   268
          "\nInvolving these terms:\n" ^ cat_lines (map show_term ts);
wenzelm@562
   269
lcp@679
   270
    fun exn_type_msg (msg, Ts, ts) =
clasohm@926
   271
	"\nType checking error: " ^ msg ^ "\n" ^
lcp@679
   272
	cat_lines (map show_typ Ts) ^ term_err ts ^ "\n";
lcp@679
   273
wenzelm@562
   274
    val T' = certify_typ sg T
nipkow@949
   275
             handle TYPE arg => error (exn_type_msg arg);
clasohm@623
   276
clasohm@623
   277
    val ct = const_type sg;
clasohm@623
   278
nipkow@952
   279
    fun warn() =
nipkow@952
   280
      if length ts > 1 andalso length ts <= !Syntax.ambiguity_level
nipkow@952
   281
      then (*no warning shown yet*)
nipkow@952
   282
           writeln "Warning: Currently parsed input \
nipkow@952
   283
                   \produces more than one parse tree.\n\
nipkow@952
   284
                   \For more information lower Syntax.ambiguity_level."
nipkow@952
   285
      else ();
clasohm@623
   286
nipkow@952
   287
    datatype result = One of int * term * (indexname * typ) list
nipkow@952
   288
                    | Errs of (string * typ list * term list)list
nipkow@952
   289
                    | Ambigs of term list;
clasohm@623
   290
nipkow@952
   291
    fun process_term(res,(t,i)) =
nipkow@952
   292
       let val (u,tye) = Type.infer_types(tsig,ct,types,sorts,used,freeze,T',t)
nipkow@952
   293
       in case res of
nipkow@952
   294
            One(_,t0,_) => Ambigs([u,t0])
nipkow@952
   295
          | Errs _ => One(i,u,tye)
nipkow@952
   296
          | Ambigs(us) => Ambigs(u::us)
nipkow@952
   297
       end
nipkow@952
   298
       handle TYPE arg => (case res of Errs(errs) => Errs(arg::errs)
nipkow@952
   299
                                     | _ => res);
clasohm@623
   300
nipkow@952
   301
  in case foldl process_term (Errs[], ts ~~ (0 upto (length ts - 1))) of
nipkow@952
   302
       One(res) =>
nipkow@952
   303
         (if length ts > !Syntax.ambiguity_level
nipkow@952
   304
          then writeln "Fortunately, only one parse tree is type correct.\n\
nipkow@952
   305
            \It helps (speed!) if you disambiguate your grammar or your input."
nipkow@952
   306
          else ();
nipkow@952
   307
          res)
nipkow@952
   308
     | Errs(errs) => (warn(); error(cat_lines(map exn_type_msg errs)))
nipkow@952
   309
     | Ambigs(us) =>
nipkow@952
   310
         (warn();
nipkow@952
   311
          let val old_show_brackets = !show_brackets
clasohm@1178
   312
              val dummy = show_brackets := true;
nipkow@952
   313
              val errs = cat_lines(map show_term us)
nipkow@952
   314
          in show_brackets := old_show_brackets;
nipkow@952
   315
             error("Error: More than one term is type correct:\n" ^ errs)
nipkow@952
   316
          end)
clasohm@623
   317
  end;
wenzelm@251
   318
wenzelm@251
   319
clasohm@623
   320
(** extend signature **)    (*exception ERROR*)
clasohm@623
   321
wenzelm@620
   322
(** signature extension functions **)  (*exception ERROR*)
wenzelm@386
   323
wenzelm@386
   324
fun decls_of name_of mfixs =
wenzelm@386
   325
  map (fn (x, y, mx) => (name_of x mx, y)) mfixs;
wenzelm@386
   326
wenzelm@386
   327
wenzelm@386
   328
(* add default sort *)
wenzelm@386
   329
wenzelm@386
   330
fun ext_defsort (syn, tsig, ctab) defsort =
wenzelm@386
   331
  (syn, ext_tsig_defsort tsig defsort, ctab);
wenzelm@386
   332
wenzelm@386
   333
wenzelm@386
   334
(* add type constructors *)
wenzelm@386
   335
wenzelm@386
   336
fun ext_types (syn, tsig, ctab) types =
wenzelm@386
   337
  (Syntax.extend_type_gram syn types,
wenzelm@562
   338
    ext_tsig_types tsig (decls_of Syntax.type_name types),
wenzelm@386
   339
    ctab);
wenzelm@386
   340
wenzelm@386
   341
wenzelm@386
   342
(* add type abbreviations *)
wenzelm@386
   343
wenzelm@386
   344
fun read_abbr syn tsig (t, vs, rhs_src) =
wenzelm@386
   345
  (t, vs, read_raw_typ syn tsig (K None) rhs_src)
wenzelm@386
   346
    handle ERROR => error ("in type abbreviation " ^ t);
wenzelm@386
   347
wenzelm@386
   348
fun ext_abbrs rd_abbr (syn, tsig, ctab) abbrs =
wenzelm@386
   349
  let
wenzelm@386
   350
    fun mfix_of (t, vs, _, mx) = (t, length vs, mx);
wenzelm@386
   351
    val syn1 = Syntax.extend_type_gram syn (map mfix_of abbrs);
wenzelm@386
   352
wenzelm@386
   353
    fun decl_of (t, vs, rhs, mx) =
wenzelm@562
   354
      rd_abbr syn1 tsig (Syntax.type_name t mx, vs, rhs);
wenzelm@386
   355
  in
wenzelm@386
   356
    (syn1, ext_tsig_abbrs tsig (map decl_of abbrs), ctab)
wenzelm@386
   357
  end;
wenzelm@386
   358
wenzelm@386
   359
val ext_tyabbrs_i = ext_abbrs (K (K I));
wenzelm@386
   360
val ext_tyabbrs = ext_abbrs read_abbr;
wenzelm@386
   361
wenzelm@386
   362
wenzelm@386
   363
(* add type arities *)
wenzelm@386
   364
wenzelm@386
   365
fun ext_arities (syn, tsig, ctab) arities =
wenzelm@386
   366
  let
wenzelm@386
   367
    val tsig1 = ext_tsig_arities tsig arities;
wenzelm@386
   368
    val log_types = logical_types tsig1;
wenzelm@386
   369
  in
wenzelm@386
   370
    (Syntax.extend_log_types syn log_types, tsig1, ctab)
wenzelm@386
   371
  end;
wenzelm@386
   372
wenzelm@386
   373
wenzelm@386
   374
(* add term constants and syntax *)
wenzelm@386
   375
wenzelm@386
   376
fun err_in_const c =
wenzelm@386
   377
  error ("in declaration of constant " ^ quote c);
wenzelm@386
   378
wenzelm@386
   379
fun err_dup_consts cs =
wenzelm@386
   380
  error ("Duplicate declaration of constant(s) " ^ commas_quote cs);
wenzelm@386
   381
wenzelm@251
   382
wenzelm@386
   383
fun read_const syn tsig (c, ty_src, mx) =
wenzelm@386
   384
  (c, read_raw_typ syn tsig (K None) ty_src, mx)
wenzelm@562
   385
    handle ERROR => err_in_const (Syntax.const_name c mx);
wenzelm@386
   386
wenzelm@386
   387
fun ext_cnsts rd_const syn_only (syn, tsig, ctab) raw_consts =
wenzelm@386
   388
  let
wenzelm@620
   389
    fun prep_const (c, ty, mx) = (c, varifyT (cert_typ tsig (no_tvars ty)), mx)
wenzelm@562
   390
      handle TYPE (msg, _, _) => (writeln msg; err_in_const (Syntax.const_name c mx));
wenzelm@386
   391
wenzelm@386
   392
    val consts = map (prep_const o rd_const syn tsig) raw_consts;
wenzelm@386
   393
    val decls =
wenzelm@386
   394
      if syn_only then []
wenzelm@562
   395
      else filter_out (equal "" o fst) (decls_of Syntax.const_name consts);
wenzelm@386
   396
  in
wenzelm@386
   397
    (Syntax.extend_const_gram syn consts, tsig,
wenzelm@386
   398
      Symtab.extend_new (ctab, decls)
wenzelm@386
   399
        handle Symtab.DUPS cs => err_dup_consts cs)
wenzelm@386
   400
  end;
wenzelm@386
   401
wenzelm@386
   402
val ext_consts_i = ext_cnsts (K (K I)) false;
wenzelm@386
   403
val ext_consts = ext_cnsts read_const false;
wenzelm@386
   404
val ext_syntax_i = ext_cnsts (K (K I)) true;
wenzelm@386
   405
val ext_syntax = ext_cnsts read_const true;
wenzelm@386
   406
wenzelm@386
   407
wenzelm@386
   408
(* add type classes *)
wenzelm@386
   409
wenzelm@386
   410
fun const_of_class c = c ^ "_class";
wenzelm@386
   411
wenzelm@386
   412
fun class_of_const c_class =
wenzelm@386
   413
  let
wenzelm@386
   414
    val c = implode (take (size c_class - 6, explode c_class));
wenzelm@386
   415
  in
wenzelm@386
   416
    if const_of_class c = c_class then c
wenzelm@386
   417
    else raise_term ("class_of_const: bad name " ^ quote c_class) []
wenzelm@386
   418
  end;
wenzelm@386
   419
wenzelm@386
   420
wenzelm@386
   421
fun ext_classes (syn, tsig, ctab) classes =
wenzelm@386
   422
  let
wenzelm@562
   423
    val names = map fst classes;
wenzelm@386
   424
    val consts =
wenzelm@386
   425
      map (fn c => (const_of_class c, a_itselfT --> propT, NoSyn)) names;
wenzelm@386
   426
  in
wenzelm@386
   427
    ext_consts_i
wenzelm@386
   428
      (Syntax.extend_consts syn names, ext_tsig_classes tsig classes, ctab)
wenzelm@386
   429
      consts
wenzelm@386
   430
  end;
wenzelm@386
   431
wenzelm@386
   432
wenzelm@421
   433
(* add to subclass relation *)
wenzelm@421
   434
wenzelm@421
   435
fun ext_classrel (syn, tsig, ctab) pairs =
wenzelm@421
   436
  (syn, ext_tsig_subclass tsig pairs, ctab);
wenzelm@421
   437
wenzelm@421
   438
wenzelm@1159
   439
(* add to syntax *)
wenzelm@386
   440
wenzelm@1159
   441
fun ext_syn extfun (syn, tsig, ctab) args =
wenzelm@1159
   442
  (extfun syn args, tsig, ctab);
wenzelm@386
   443
wenzelm@386
   444
wenzelm@386
   445
(* build signature *)
wenzelm@386
   446
wenzelm@386
   447
fun ext_stamps stamps name =
wenzelm@386
   448
  let
wenzelm@386
   449
    val stmps = (case stamps of ref "#" :: ss => ss | ss => ss);
wenzelm@386
   450
  in
wenzelm@386
   451
    if exists (equal name o !) stmps then
wenzelm@386
   452
      error ("Theory already contains a " ^ quote name ^ " component")
wenzelm@402
   453
    else ref name :: stmps
wenzelm@386
   454
  end;
wenzelm@386
   455
wenzelm@386
   456
fun make_sign (syn, tsig, ctab) stamps name =
wenzelm@386
   457
  Sg {tsig = tsig, const_tab = ctab, syn = syn,
wenzelm@386
   458
    stamps = ext_stamps stamps name};
wenzelm@386
   459
wenzelm@386
   460
fun extend_sign extfun name decls (Sg {tsig, const_tab, syn, stamps}) =
wenzelm@386
   461
  make_sign (extfun (syn, tsig, const_tab) decls) stamps name;
wenzelm@386
   462
wenzelm@386
   463
wenzelm@386
   464
(* the external interfaces *)
wenzelm@386
   465
wenzelm@386
   466
val add_classes   = extend_sign ext_classes "#";
wenzelm@421
   467
val add_classrel  = extend_sign ext_classrel "#";
wenzelm@386
   468
val add_defsort   = extend_sign ext_defsort "#";
wenzelm@386
   469
val add_types     = extend_sign ext_types "#";
wenzelm@386
   470
val add_tyabbrs   = extend_sign ext_tyabbrs "#";
wenzelm@386
   471
val add_tyabbrs_i = extend_sign ext_tyabbrs_i "#";
wenzelm@386
   472
val add_arities   = extend_sign ext_arities "#";
wenzelm@386
   473
val add_consts    = extend_sign ext_consts "#";
wenzelm@386
   474
val add_consts_i  = extend_sign ext_consts_i "#";
wenzelm@386
   475
val add_syntax    = extend_sign ext_syntax "#";
wenzelm@386
   476
val add_syntax_i  = extend_sign ext_syntax_i "#";
wenzelm@1159
   477
val add_trfuns    = extend_sign (ext_syn Syntax.extend_trfuns) "#";
wenzelm@1159
   478
val add_trrules   = extend_sign (ext_syn Syntax.extend_trrules) "#";
wenzelm@1159
   479
val add_trrules_i = extend_sign (ext_syn Syntax.extend_trrules_i) "#";
wenzelm@386
   480
wenzelm@386
   481
fun add_name name sg = extend_sign K name () sg;
wenzelm@386
   482
val make_draft = add_name "#";
wenzelm@386
   483
wenzelm@386
   484
wenzelm@386
   485
wenzelm@620
   486
(** merge signatures **)    (*exception TERM*) (*exception ERROR (* FIXME *)*)
wenzelm@143
   487
wenzelm@251
   488
fun merge (sg1, sg2) =
wenzelm@251
   489
  if subsig (sg2, sg1) then sg1
wenzelm@251
   490
  else if subsig (sg1, sg2) then sg2
wenzelm@386
   491
  else if is_draft sg1 orelse is_draft sg2 then
wenzelm@386
   492
    raise_term "Illegal merge of draft signatures" []
wenzelm@251
   493
  else
wenzelm@251
   494
    (*neither is union already; must form union*)
wenzelm@251
   495
    let
wenzelm@251
   496
      val Sg {tsig = tsig1, const_tab = const_tab1, syn = syn1,
wenzelm@251
   497
        stamps = stamps1} = sg1;
wenzelm@251
   498
      val Sg {tsig = tsig2, const_tab = const_tab2, syn = syn2,
wenzelm@251
   499
        stamps = stamps2} = sg2;
wenzelm@251
   500
wenzelm@386
   501
wenzelm@402
   502
      val stamps = merge_rev_lists stamps1 stamps2;
wenzelm@402
   503
      val _ =
wenzelm@402
   504
        (case duplicates (stamp_names stamps) of
wenzelm@402
   505
          [] => ()
wenzelm@402
   506
        | dups => raise_term ("Attempt to merge different versions of theories "
wenzelm@402
   507
            ^ commas_quote dups) []);
wenzelm@402
   508
wenzelm@251
   509
      val tsig = merge_tsigs (tsig1, tsig2);
wenzelm@251
   510
wenzelm@251
   511
      val const_tab = Symtab.merge (op =) (const_tab1, const_tab2)
wenzelm@386
   512
        handle Symtab.DUPS cs =>
wenzelm@386
   513
          raise_term ("Incompatible types for constant(s) " ^ commas_quote cs) [];
wenzelm@386
   514
wenzelm@386
   515
      val syn = Syntax.merge_syntaxes syn1 syn2;
wenzelm@251
   516
    in
wenzelm@251
   517
      Sg {tsig = tsig, const_tab = const_tab, syn = syn, stamps = stamps}
wenzelm@251
   518
    end;
wenzelm@143
   519
clasohm@0
   520
clasohm@0
   521
wenzelm@251
   522
(** the Pure signature **)
clasohm@0
   523
clasohm@922
   524
val proto_pure =
clasohm@763
   525
  make_sign (Syntax.pure_syn, tsig0, Symtab.null) [] "#"
wenzelm@410
   526
  |> add_types
wenzelm@386
   527
   (("fun", 2, NoSyn) ::
wenzelm@386
   528
    ("prop", 0, NoSyn) ::
wenzelm@386
   529
    ("itself", 1, NoSyn) ::
wenzelm@562
   530
    Syntax.pure_types)
wenzelm@562
   531
  |> add_classes [(logicC, [])]
wenzelm@410
   532
  |> add_defsort logicS
wenzelm@410
   533
  |> add_arities
wenzelm@386
   534
   [("fun", [logicS, logicS], logicS),
wenzelm@386
   535
    ("prop", [], logicS),
wenzelm@386
   536
    ("itself", [logicS], logicS)]
wenzelm@562
   537
  |> add_syntax Syntax.pure_syntax
wenzelm@410
   538
  |> add_trfuns Syntax.pure_trfuns
wenzelm@410
   539
  |> add_consts
wenzelm@386
   540
   [("==", "['a::{}, 'a] => prop", Mixfix ("(_ ==/ _)", [3, 2], 2)),
wenzelm@386
   541
    ("=?=", "['a::{}, 'a] => prop", Mixfix ("(_ =?=/ _)", [3, 2], 2)),
wenzelm@386
   542
    ("==>", "[prop, prop] => prop", Mixfix ("(_ ==>/ _)", [2, 1], 1)),
clasohm@865
   543
    ("all", "('a => prop) => prop", Binder ("!!", 0, 0)),
wenzelm@573
   544
    ("TYPE", "'a itself", NoSyn)]
clasohm@922
   545
  |> add_name "ProtoPure";
clasohm@922
   546
clasohm@922
   547
val pure = proto_pure
clasohm@1180
   548
  |> add_syntax Syntax.pure_appl_syntax
wenzelm@410
   549
  |> add_name "Pure";
clasohm@0
   550
clasohm@922
   551
val cpure = proto_pure
clasohm@1180
   552
  |> add_syntax Syntax.pure_applC_syntax
clasohm@922
   553
  |> add_name "CPure";
clasohm@0
   554
nipkow@1214
   555
(**
nipkow@1214
   556
Emptiness-test for sorts: does there exist a type of sort 'sort' whose
nipkow@1214
   557
vars have sorts contained in 'sorts'?
nipkow@1214
   558
Trivial approximation at the moment.
nipkow@1214
   559
**)
nipkow@1214
   560
fun nonempty_sort(_,sorts,sort) = exists (fn s => sort subset s) sorts;
nipkow@1214
   561
clasohm@0
   562
end;