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