src/Pure/sign.ML
author wenzelm
Fri Nov 10 19:11:51 2000 +0100 (2000-11-10)
changeset 10443 0a68dc9edba5
parent 10404 93efbb62667c
child 10932 ad13abb0a264
permissions -rw-r--r--
added certify_tycon, certify_tyabbr, certify_const;
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@3956
     8
(*base names*)
wenzelm@3956
     9
type bstring = string;
wenzelm@3956
    10
type bclass = class;
wenzelm@3956
    11
(*external forms -- partially qualified names*)
wenzelm@3805
    12
type xstring = string;
wenzelm@3805
    13
type xclass = class;
wenzelm@3805
    14
type xsort = sort;
wenzelm@3805
    15
type xtyp = typ;
wenzelm@3805
    16
type xterm = term;
wenzelm@3805
    17
wenzelm@19
    18
signature SIGN =
wenzelm@3791
    19
sig
paulson@1501
    20
  type sg
wenzelm@3967
    21
  type sg_ref
wenzelm@4256
    22
  type data
wenzelm@2197
    23
  val rep_sg: sg ->
wenzelm@3975
    24
   {self: sg_ref,
wenzelm@3967
    25
    tsig: Type.type_sig,
wenzelm@2197
    26
    const_tab: typ Symtab.table,
wenzelm@2197
    27
    syn: Syntax.syntax,
wenzelm@3791
    28
    path: string list,
wenzelm@3791
    29
    spaces: (string * NameSpace.T) list,
wenzelm@4256
    30
    data: data}
wenzelm@3975
    31
  val name_of: sg -> string
wenzelm@3975
    32
  val stamp_names_of: sg -> string list
wenzelm@3967
    33
  val tsig_of: sg -> Type.type_sig
wenzelm@3967
    34
  val deref: sg_ref -> sg
wenzelm@3967
    35
  val self_ref: sg -> sg_ref
paulson@1501
    36
  val subsig: sg * sg -> bool
wenzelm@9031
    37
  val joinable: sg * sg -> bool
paulson@1501
    38
  val eq_sg: sg * sg -> bool
paulson@1501
    39
  val same_sg: sg * sg -> bool
paulson@1501
    40
  val is_draft: sg -> bool
wenzelm@4951
    41
  val is_stale: sg -> bool
paulson@1501
    42
  val const_type: sg -> string -> typ option
paulson@1501
    43
  val classes: sg -> class list
wenzelm@4844
    44
  val defaultS: sg -> sort
paulson@1501
    45
  val subsort: sg -> sort * sort -> bool
wenzelm@8290
    46
  val nodup_vars: term -> term
paulson@1501
    47
  val norm_sort: sg -> sort -> sort
wenzelm@4568
    48
  val of_sort: sg -> typ * sort -> bool
wenzelm@7640
    49
  val witness_sorts: sg -> sort list -> sort list -> (typ * sort) list
wenzelm@7640
    50
  val univ_witness: sg -> (typ * sort) option
wenzelm@10443
    51
  val typ_instance: sg -> typ * typ -> bool
wenzelm@3810
    52
  val classK: string
wenzelm@3810
    53
  val typeK: string
wenzelm@3810
    54
  val constK: string
wenzelm@3956
    55
  val full_name: sg -> bstring -> string
wenzelm@4844
    56
  val full_name_path: sg -> string -> bstring -> string
wenzelm@3956
    57
  val base_name: string -> bstring
wenzelm@3810
    58
  val intern: sg -> string -> xstring -> string
wenzelm@3810
    59
  val extern: sg -> string -> string -> xstring
wenzelm@3937
    60
  val cond_extern: sg -> string -> string -> xstring
wenzelm@6845
    61
  val cond_extern_table: sg -> string -> 'a Symtab.table -> (xstring * 'a) list
wenzelm@3805
    62
  val intern_class: sg -> xclass -> class
wenzelm@3805
    63
  val intern_tycon: sg -> xstring -> string
wenzelm@3805
    64
  val intern_const: sg -> xstring -> string
wenzelm@3937
    65
  val intern_sort: sg -> xsort -> sort
wenzelm@3937
    66
  val intern_typ: sg -> xtyp -> typ
wenzelm@3937
    67
  val intern_term: sg -> xterm -> term
wenzelm@3937
    68
  val intern_tycons: sg -> xtyp -> typ
paulson@1501
    69
  val pretty_sg: sg -> Pretty.T
wenzelm@4051
    70
  val str_of_sg: sg -> string
paulson@1501
    71
  val pprint_sg: sg -> pprint_args -> unit
paulson@1501
    72
  val pretty_term: sg -> term -> Pretty.T
paulson@1501
    73
  val pretty_typ: sg -> typ -> Pretty.T
wenzelm@3791
    74
  val pretty_sort: sg -> sort -> Pretty.T
wenzelm@4249
    75
  val pretty_classrel: sg -> class * class -> Pretty.T
wenzelm@4249
    76
  val pretty_arity: sg -> string * sort list * sort -> Pretty.T
paulson@1501
    77
  val string_of_term: sg -> term -> string
paulson@1501
    78
  val string_of_typ: sg -> typ -> string
wenzelm@3791
    79
  val string_of_sort: sg -> sort -> string
wenzelm@3855
    80
  val str_of_sort: sg -> sort -> string
wenzelm@3855
    81
  val str_of_classrel: sg -> class * class -> string
wenzelm@3855
    82
  val str_of_arity: sg -> string * sort list * sort -> string
paulson@1501
    83
  val pprint_term: sg -> term -> pprint_args -> unit
paulson@1501
    84
  val pprint_typ: sg -> typ -> pprint_args -> unit
wenzelm@8898
    85
  val certify_class: sg -> class -> class
wenzelm@8898
    86
  val certify_sort: sg -> sort -> sort
paulson@1501
    87
  val certify_typ: sg -> typ -> typ
wenzelm@9504
    88
  val certify_typ_no_norm: sg -> typ -> typ
wenzelm@10443
    89
  val certify_tycon: sg -> string -> string
wenzelm@10443
    90
  val certify_tyabbr: sg -> string -> string
wenzelm@10443
    91
  val certify_const: sg -> string -> string
paulson@1501
    92
  val certify_term: sg -> term -> term * typ * int
wenzelm@8898
    93
  val read_sort: sg -> string -> sort
wenzelm@4227
    94
  val read_raw_typ: sg * (indexname -> sort option) -> string -> typ
paulson@1501
    95
  val read_typ: sg * (indexname -> sort option) -> string -> typ
wenzelm@9504
    96
  val read_typ_no_norm: sg * (indexname -> sort option) -> string -> typ
paulson@1501
    97
  val infer_types: sg -> (indexname -> typ option) ->
paulson@1501
    98
    (indexname -> sort option) -> string list -> bool
wenzelm@4249
    99
    -> xterm list * typ -> term * (indexname * typ) list
wenzelm@4249
   100
  val infer_types_simult: sg -> (indexname -> typ option) ->
wenzelm@4249
   101
    (indexname -> sort option) -> string list -> bool
wenzelm@4249
   102
    -> (xterm list * typ) list -> term list * (indexname * typ) list
wenzelm@8607
   103
  val read_def_terms:
wenzelm@8607
   104
    sg * (indexname -> typ option) * (indexname -> sort option) ->
wenzelm@8607
   105
    string list -> bool -> (string * typ) list -> term list * (indexname * typ) list
wenzelm@8802
   106
  val simple_read_term: sg -> typ -> string -> term
wenzelm@3956
   107
  val add_classes: (bclass * xclass list) list -> sg -> sg
wenzelm@3956
   108
  val add_classes_i: (bclass * class list) list -> sg -> sg
wenzelm@3805
   109
  val add_classrel: (xclass * xclass) list -> sg -> sg
wenzelm@3791
   110
  val add_classrel_i: (class * class) list -> sg -> sg
wenzelm@8898
   111
  val add_defsort: string -> sg -> sg
wenzelm@3791
   112
  val add_defsort_i: sort -> sg -> sg
wenzelm@3956
   113
  val add_types: (bstring * int * mixfix) list -> sg -> sg
wenzelm@4844
   114
  val add_nonterminals: bstring list -> sg -> sg
wenzelm@3956
   115
  val add_tyabbrs: (bstring * string list * string * mixfix) list -> sg -> sg
wenzelm@3956
   116
  val add_tyabbrs_i: (bstring * string list * typ * mixfix) list -> sg -> sg
wenzelm@8898
   117
  val add_arities: (xstring * string list * string) list -> sg -> sg
wenzelm@3791
   118
  val add_arities_i: (string * sort list * sort) list -> sg -> sg
wenzelm@3956
   119
  val add_consts: (bstring * string * mixfix) list -> sg -> sg
wenzelm@3956
   120
  val add_consts_i: (bstring * typ * mixfix) list -> sg -> sg
wenzelm@3956
   121
  val add_syntax: (bstring * string * mixfix) list -> sg -> sg
wenzelm@3956
   122
  val add_syntax_i: (bstring * typ * mixfix) list -> sg -> sg
wenzelm@3956
   123
  val add_modesyntax: (string * bool) * (bstring * string * mixfix) list -> sg -> sg
wenzelm@3956
   124
  val add_modesyntax_i: (string * bool) * (bstring * typ * mixfix) list -> sg -> sg
paulson@1501
   125
  val add_trfuns:
wenzelm@4344
   126
    (string * (ast list -> ast)) list *
wenzelm@4344
   127
    (string * (term list -> term)) list *
wenzelm@4344
   128
    (string * (term list -> term)) list *
wenzelm@4344
   129
    (string * (ast list -> ast)) list -> sg -> sg
wenzelm@2385
   130
  val add_trfunsT:
wenzelm@4344
   131
    (string * (bool -> typ -> term list -> term)) list -> sg -> sg
wenzelm@2693
   132
  val add_tokentrfuns:
wenzelm@6311
   133
    (string * string * (string -> string * real)) list -> sg -> sg
wenzelm@4619
   134
  val add_trrules: (xstring * string) Syntax.trrule list -> sg -> sg
paulson@1810
   135
  val add_trrules_i: ast Syntax.trrule list -> sg -> sg
wenzelm@3791
   136
  val add_path: string -> sg -> sg
wenzelm@3810
   137
  val add_space: string * string list -> sg -> sg
wenzelm@8725
   138
  val hide_space: string * string list -> sg -> sg
wenzelm@8725
   139
  val hide_space_i: string * string list -> sg -> sg
paulson@1501
   140
  val add_name: string -> sg -> sg
wenzelm@4256
   141
  val data_kinds: data -> string list
wenzelm@3967
   142
  val merge_refs: sg_ref * sg_ref -> sg_ref
wenzelm@4627
   143
  val merge: sg * sg -> sg
wenzelm@3975
   144
  val prep_ext: sg -> sg
wenzelm@6546
   145
  val copy: sg -> sg
wenzelm@4627
   146
  val nontriv_merge: sg * sg -> sg
wenzelm@3995
   147
  val pre_pure: sg
paulson@1501
   148
  val const_of_class: class -> string
paulson@1501
   149
  val class_of_const: string -> class
wenzelm@3791
   150
end;
clasohm@0
   151
wenzelm@6191
   152
signature PRIVATE_SIGN =
wenzelm@5642
   153
sig
wenzelm@5642
   154
  include SIGN
wenzelm@6546
   155
  val init_data: Object.kind * (Object.T * (Object.T -> Object.T) * (Object.T -> Object.T) *
wenzelm@5642
   156
    (Object.T * Object.T -> Object.T) * (sg -> Object.T -> unit)) -> sg -> sg
wenzelm@5642
   157
  val get_data: Object.kind -> (Object.T -> 'a) -> sg -> 'a
wenzelm@5642
   158
  val put_data: Object.kind -> ('a -> Object.T) -> 'a -> sg -> sg
wenzelm@5642
   159
  val print_data: Object.kind -> sg -> unit
wenzelm@5642
   160
end;
wenzelm@5642
   161
wenzelm@6191
   162
structure Sign: PRIVATE_SIGN =
wenzelm@143
   163
struct
clasohm@0
   164
wenzelm@3967
   165
wenzelm@251
   166
(** datatype sg **)
wenzelm@251
   167
wenzelm@4256
   168
(* types sg, data, sg_ref *)
wenzelm@4256
   169
wenzelm@19
   170
datatype sg =
wenzelm@3975
   171
  Sg of
wenzelm@3975
   172
   {id: string ref,                             (*id*)
wenzelm@3975
   173
    stamps: string ref list} *                  (*unique theory indentifier*)
wenzelm@3975
   174
   {self: sg_ref,                               (*mutable self reference*)
wenzelm@3791
   175
    tsig: Type.type_sig,                        (*order-sorted signature of types*)
wenzelm@3805
   176
    const_tab: typ Symtab.table,                (*type schemes of constants*)
wenzelm@3791
   177
    syn: Syntax.syntax,                         (*syntax for parsing and printing*)
wenzelm@3975
   178
    path: string list,                          (*current name space entry prefix*)
wenzelm@3975
   179
    spaces: (string * NameSpace.T) list,        (*name spaces for consts, types etc.*)
wenzelm@4256
   180
    data: data}                                 (*anytype data*)
wenzelm@4256
   181
and data =
wenzelm@4256
   182
  Data of
wenzelm@10404
   183
    (Object.kind *                              (*kind (for authorization)*)
wenzelm@10404
   184
      (Object.T *                               (*value*)
wenzelm@4998
   185
        ((Object.T -> Object.T) *               (*prepare extend method*)
wenzelm@6546
   186
          (Object.T -> Object.T) *              (*copy method*)
wenzelm@4998
   187
          (Object.T * Object.T -> Object.T) *   (*merge and prepare extend method*)
wenzelm@4998
   188
          (sg -> Object.T -> unit))))           (*print method*)
wenzelm@4256
   189
    Symtab.table
wenzelm@3967
   190
and sg_ref =
wenzelm@4998
   191
  SgRef of sg ref option;
clasohm@0
   192
wenzelm@3967
   193
(*make signature*)
wenzelm@3967
   194
fun make_sign (id, self, tsig, const_tab, syn, path, spaces, data, stamps) =
wenzelm@3975
   195
  Sg ({id = id, stamps = stamps}, {self = self, tsig = tsig, const_tab = const_tab,
wenzelm@3975
   196
    syn = syn, path = path, spaces = spaces, data = data});
wenzelm@3975
   197
wenzelm@3975
   198
wenzelm@4256
   199
(* basic operations *)
wenzelm@3975
   200
wenzelm@3975
   201
fun rep_sg (Sg (_, args)) = args;
wenzelm@3967
   202
wenzelm@3975
   203
(*show stamps*)
wenzelm@3975
   204
fun stamp_names_of (Sg ({stamps, ...}, _)) = rev (map ! stamps);
wenzelm@3975
   205
fun pretty_sg sg = Pretty.str_list "{" "}" (stamp_names_of sg);
wenzelm@3975
   206
val str_of_sg = Pretty.str_of o pretty_sg;
wenzelm@3975
   207
val pprint_sg = Pretty.pprint o pretty_sg;
wenzelm@3975
   208
wenzelm@402
   209
val tsig_of = #tsig o rep_sg;
wenzelm@3967
   210
wenzelm@3975
   211
fun const_type (Sg (_, {const_tab, ...})) c = Symtab.lookup (const_tab, c);
wenzelm@3967
   212
wenzelm@3967
   213
wenzelm@3995
   214
(* id and self *)
wenzelm@3967
   215
wenzelm@3975
   216
fun check_stale (sg as Sg ({id, ...},
wenzelm@3975
   217
        {self = SgRef (Some (ref (Sg ({id = id', ...}, _)))), ...})) =
wenzelm@3967
   218
      if id = id' then sg
wenzelm@3975
   219
      else raise TERM ("Stale signature: " ^ str_of_sg sg, [])
wenzelm@3967
   220
  | check_stale _ = sys_error "Sign.check_stale";
clasohm@0
   221
wenzelm@4951
   222
fun is_stale sg = (check_stale sg; false) handle TERM _ => true;
wenzelm@4951
   223
wenzelm@3995
   224
fun self_ref (sg as Sg (_, {self, ...})) = (check_stale sg; self);
wenzelm@3995
   225
wenzelm@3995
   226
fun deref (SgRef (Some (ref sg))) = sg
wenzelm@3995
   227
  | deref (SgRef None) = sys_error "Sign.deref";
wenzelm@3995
   228
wenzelm@3975
   229
fun name_of (sg as Sg ({id = ref name, ...}, _)) =
wenzelm@4844
   230
  if name = "" orelse ord name = ord "#" then
wenzelm@3975
   231
    raise TERM ("Nameless signature " ^ str_of_sg sg, [])
wenzelm@3975
   232
  else name;
wenzelm@3975
   233
nipkow@206
   234
wenzelm@2979
   235
(* inclusion and equality *)
paulson@2180
   236
wenzelm@2185
   237
local
wenzelm@2185
   238
  (*avoiding polymorphic equality: factor 10 speedup*)
wenzelm@2185
   239
  fun mem_stamp (_:string ref, []) = false
wenzelm@2185
   240
    | mem_stamp (x, y :: ys) = x = y orelse mem_stamp (x, ys);
wenzelm@2185
   241
wenzelm@2185
   242
  fun subset_stamp ([], ys) = true
wenzelm@2185
   243
    | subset_stamp (x :: xs, ys) =
wenzelm@2185
   244
        mem_stamp (x, ys) andalso subset_stamp (xs, ys);
paulson@2180
   245
wenzelm@2185
   246
  (*fast partial test*)
wenzelm@2185
   247
  fun fast_sub ([]: string ref list, _) = true
wenzelm@2185
   248
    | fast_sub (_, []) = false
wenzelm@2185
   249
    | fast_sub (x :: xs, y :: ys) =
wenzelm@2185
   250
        if x = y then fast_sub (xs, ys)
wenzelm@2185
   251
        else fast_sub (x :: xs, ys);
wenzelm@2185
   252
in
wenzelm@3975
   253
  fun eq_sg (sg1 as Sg ({id = id1, ...}, _), sg2 as Sg ({id = id2, ...}, _)) =
wenzelm@3967
   254
    (check_stale sg1; check_stale sg2; id1 = id2);
wenzelm@2185
   255
wenzelm@3975
   256
  fun subsig (sg1 as Sg ({stamps = s1, ...}, _), sg2 as Sg ({stamps = s2, ...}, _)) =
wenzelm@3967
   257
    eq_sg (sg1, sg2) orelse subset_stamp (s1, s2);
paulson@2180
   258
wenzelm@3975
   259
  fun fast_subsig (sg1 as Sg ({stamps = s1, ...}, _), sg2 as Sg ({stamps = s2, ...}, _)) =
wenzelm@3967
   260
    eq_sg (sg1, sg2) orelse fast_sub (s1, s2);
wenzelm@2185
   261
end;
wenzelm@2185
   262
wenzelm@402
   263
wenzelm@9031
   264
fun joinable (sg1, sg2) = subsig (sg1, sg2) orelse subsig (sg2, sg1);
wenzelm@9031
   265
wenzelm@2185
   266
(*test if same theory names are contained in signatures' stamps,
wenzelm@2185
   267
  i.e. if signatures belong to same theory but not necessarily to the
wenzelm@2185
   268
  same version of it*)
wenzelm@3975
   269
fun same_sg (sg1 as Sg ({stamps = s1, ...}, _), sg2 as Sg ({stamps = s2, ...}, _)) =
wenzelm@3967
   270
  eq_sg (sg1, sg2) orelse eq_set_string (pairself (map (op !)) (s1, s2));
wenzelm@2185
   271
wenzelm@2185
   272
(*test for drafts*)
wenzelm@4844
   273
fun is_draft (Sg ({stamps = ref name :: _, ...}, _)) = name = "" orelse ord name = ord "#";
wenzelm@386
   274
clasohm@0
   275
wenzelm@4568
   276
(* classes and sorts *)
wenzelm@4568
   277
wenzelm@7640
   278
val classes = Type.classes o tsig_of;
wenzelm@4844
   279
val defaultS = Type.defaultS o tsig_of;
wenzelm@4568
   280
val subsort = Type.subsort o tsig_of;
wenzelm@4568
   281
val norm_sort = Type.norm_sort o tsig_of;
wenzelm@7640
   282
val of_sort = Type.of_sort o tsig_of;
wenzelm@7640
   283
val witness_sorts = Type.witness_sorts o tsig_of;
wenzelm@7640
   284
val univ_witness = Type.univ_witness o tsig_of;
wenzelm@10443
   285
fun typ_instance sg (T, U) = Type.typ_instance (tsig_of sg, T, U);
wenzelm@4568
   286
wenzelm@4256
   287
wenzelm@4256
   288
(** signature data **)
wenzelm@4256
   289
wenzelm@4256
   290
(* errors *)
wenzelm@4256
   291
wenzelm@4261
   292
fun of_theory sg = "\nof theory " ^ str_of_sg sg;
wenzelm@4256
   293
wenzelm@4998
   294
fun err_inconsistent kinds =
wenzelm@4998
   295
  error ("Attempt to merge different versions of " ^ commas_quote kinds ^ " data");
wenzelm@4998
   296
wenzelm@6961
   297
fun err_method name kind e =
wenzelm@6961
   298
  (writeln ("Error while invoking " ^ quote kind ^ " " ^ name ^ " method"); raise e);
wenzelm@4256
   299
wenzelm@4256
   300
fun err_dup_init sg kind =
wenzelm@4256
   301
  error ("Duplicate initialization of " ^ quote kind ^ " data" ^ of_theory sg);
wenzelm@4256
   302
wenzelm@4256
   303
fun err_uninit sg kind =
wenzelm@10404
   304
  error ("Tried to access uninitialized " ^ quote kind ^ " data" ^
wenzelm@10404
   305
         of_theory sg);
wenzelm@4256
   306
paulson@6040
   307
(*Trying to access theory data using get / put operations from a different
paulson@6040
   308
  instance of the TheoryDataFun result.  Typical cure: re-load all files*)
wenzelm@4998
   309
fun err_access sg kind =
wenzelm@4998
   310
  error ("Unauthorized access to " ^ quote kind ^ " data" ^ of_theory sg);
wenzelm@4998
   311
wenzelm@4256
   312
wenzelm@4256
   313
(* prepare data *)
wenzelm@4256
   314
wenzelm@4489
   315
val empty_data = Data Symtab.empty;
wenzelm@4256
   316
wenzelm@4256
   317
fun merge_data (Data tab1, Data tab2) =
wenzelm@4256
   318
  let
wenzelm@4998
   319
    val data1 = map snd (Symtab.dest tab1);
wenzelm@4998
   320
    val data2 = map snd (Symtab.dest tab2);
wenzelm@4256
   321
    val all_data = data1 @ data2;
wenzelm@4998
   322
    val kinds = gen_distinct Object.eq_kind (map fst all_data);
wenzelm@4256
   323
wenzelm@4256
   324
   fun entry data kind =
wenzelm@4998
   325
     (case gen_assoc Object.eq_kind (data, kind) of
wenzelm@4256
   326
       None => []
wenzelm@4256
   327
     | Some x => [(kind, x)]);
wenzelm@4256
   328
wenzelm@6546
   329
    fun merge_entries [(kind, (e, mths as (_, ext, _, _)))] =
wenzelm@6961
   330
          (kind, (ext e handle exn => err_method "prep_ext" (Object.name_of_kind kind) exn, mths))
wenzelm@6546
   331
      | merge_entries [(kind, (e1, mths as (_, _, mrg, _))), (_, (e2, _))] =
wenzelm@6961
   332
          (kind, (mrg (e1, e2)
wenzelm@6961
   333
            handle exn => err_method "merge" (Object.name_of_kind kind) exn, mths))
wenzelm@4256
   334
      | merge_entries _ = sys_error "merge_entries";
wenzelm@4256
   335
wenzelm@4256
   336
    val data = map (fn k => merge_entries (entry data1 k @ entry data2 k)) kinds;
wenzelm@4998
   337
    val data_idx = map (fn (k, x) => (Object.name_of_kind k, (k, x))) data;
wenzelm@4998
   338
  in
wenzelm@4998
   339
    Data (Symtab.make data_idx)
wenzelm@4998
   340
      handle Symtab.DUPS dups => err_inconsistent dups
wenzelm@4998
   341
  end;
wenzelm@4256
   342
wenzelm@4256
   343
fun prep_ext_data data = merge_data (data, empty_data);
wenzelm@4256
   344
wenzelm@6546
   345
fun init_data_sg sg (Data tab) kind e cp ext mrg prt =
wenzelm@4998
   346
  let val name = Object.name_of_kind kind in
wenzelm@6546
   347
    Data (Symtab.update_new ((name, (kind, (e, (cp, ext, mrg, prt)))), tab))
wenzelm@4998
   348
      handle Symtab.DUP _ => err_dup_init sg name
wenzelm@4998
   349
  end;
wenzelm@4256
   350
wenzelm@4256
   351
wenzelm@4256
   352
(* access data *)
wenzelm@4256
   353
wenzelm@4256
   354
fun data_kinds (Data tab) = map fst (Symtab.dest tab);
wenzelm@4256
   355
wenzelm@4256
   356
fun lookup_data sg tab kind =
wenzelm@4998
   357
  let val name = Object.name_of_kind kind in
wenzelm@4998
   358
    (case Symtab.lookup (tab, name) of
wenzelm@4998
   359
      Some (k, x) =>
wenzelm@4998
   360
        if Object.eq_kind (kind, k) then x
wenzelm@4998
   361
        else err_access sg name
wenzelm@4998
   362
    | None => err_uninit sg name)
wenzelm@4998
   363
  end;
wenzelm@4256
   364
wenzelm@4998
   365
fun get_data kind f (sg as Sg (_, {data = Data tab, ...})) =
wenzelm@4998
   366
  let val x = fst (lookup_data sg tab kind)
wenzelm@4998
   367
  in f x handle Match => Object.kind_error kind end;
wenzelm@4998
   368
wenzelm@4998
   369
fun print_data kind (sg as Sg (_, {data = Data tab, ...})) =
wenzelm@6546
   370
  let val (e, (_, _, _, prt)) = lookup_data sg tab kind
wenzelm@6961
   371
  in prt sg e handle exn => err_method ("print" ^ of_theory sg) (Object.name_of_kind kind) exn end;
wenzelm@4256
   372
wenzelm@4998
   373
fun put_data_sg sg (Data tab) kind f x =
wenzelm@4998
   374
  Data (Symtab.update ((Object.name_of_kind kind,
wenzelm@4998
   375
    (kind, (f x, snd (lookup_data sg tab kind)))), tab));
wenzelm@4256
   376
wenzelm@4256
   377
wenzelm@4256
   378
wenzelm@4256
   379
(** build signatures **)
wenzelm@3967
   380
wenzelm@3967
   381
fun ext_stamps stamps (id as ref name) =
wenzelm@3967
   382
  let val stmps = (case stamps of ref "#" :: ss => ss | ss => ss) in
wenzelm@3967
   383
    if exists (equal name o !) stmps then
wenzelm@3967
   384
      error ("Theory already contains a " ^ quote name ^ " component")
wenzelm@3967
   385
    else id :: stmps
wenzelm@3967
   386
  end;
wenzelm@3967
   387
wenzelm@3967
   388
fun create_sign self stamps name (syn, tsig, ctab, (path, spaces), data) =
wenzelm@3967
   389
  let
wenzelm@3967
   390
    val id = ref name;
wenzelm@3967
   391
    val sign =
wenzelm@3967
   392
      make_sign (id, self, tsig, ctab, syn, path, spaces, data, ext_stamps stamps id);
wenzelm@3967
   393
  in
wenzelm@3967
   394
    (case self of
wenzelm@3967
   395
      SgRef (Some r) => r := sign
wenzelm@3967
   396
    | _ => sys_error "Sign.create_sign");
wenzelm@3967
   397
    sign
wenzelm@3967
   398
  end;
wenzelm@3967
   399
wenzelm@3975
   400
fun extend_sign keep extfun name decls
wenzelm@3975
   401
    (sg as Sg ({id = _, stamps}, {self, tsig, const_tab, syn, path, spaces, data})) =
wenzelm@3967
   402
  let
wenzelm@3967
   403
    val _ = check_stale sg;
wenzelm@3967
   404
    val (self', data') =
wenzelm@3975
   405
      if is_draft sg andalso keep then (self, data)
wenzelm@4256
   406
      else (SgRef (Some (ref sg)), prep_ext_data data);
wenzelm@3967
   407
  in
wenzelm@3967
   408
    create_sign self' stamps name
wenzelm@3967
   409
      (extfun (syn, tsig, const_tab, (path, spaces), data') decls)
wenzelm@3967
   410
  end;
wenzelm@3967
   411
wenzelm@3967
   412
wenzelm@3791
   413
wenzelm@3791
   414
(** name spaces **)
wenzelm@3791
   415
wenzelm@3791
   416
(* kinds *)
wenzelm@3791
   417
wenzelm@3791
   418
val classK = "class";
wenzelm@3791
   419
val typeK = "type";
wenzelm@3791
   420
val constK = "const";
wenzelm@3791
   421
wenzelm@3791
   422
wenzelm@8725
   423
(* declare and retrieve names *)
wenzelm@3791
   424
wenzelm@3791
   425
fun space_of spaces kind =
wenzelm@3791
   426
  if_none (assoc (spaces, kind)) NameSpace.empty;
wenzelm@3791
   427
wenzelm@3791
   428
(*input and output of qualified names*)
wenzelm@3995
   429
fun intrn spaces kind = NameSpace.intern (space_of spaces kind);
wenzelm@3995
   430
fun extrn spaces kind = NameSpace.extern (space_of spaces kind);
wenzelm@5175
   431
fun cond_extrn spaces kind = NameSpace.cond_extern (space_of spaces kind);
wenzelm@6845
   432
fun cond_extrn_table spaces kind tab = NameSpace.cond_extern_table (space_of spaces kind) tab;
wenzelm@3791
   433
wenzelm@8725
   434
(*add / hide names*)
wenzelm@8725
   435
fun change_space f spaces kind x = overwrite (spaces, (kind, f (space_of spaces kind, x)));
wenzelm@8730
   436
fun add_names x = change_space NameSpace.extend x;
wenzelm@8730
   437
fun hide_names x = change_space NameSpace.hide x;
wenzelm@3791
   438
wenzelm@3810
   439
(*make full names*)
wenzelm@3937
   440
fun full path name =
wenzelm@4489
   441
  if name = "" then error "Attempt to declare empty name \"\""
wenzelm@8725
   442
  else if NameSpace.is_qualified name then
wenzelm@3937
   443
    error ("Attempt to declare qualified name " ^ quote name)
wenzelm@3937
   444
  else NameSpace.pack (path @ [name]);
wenzelm@3937
   445
wenzelm@3937
   446
(*base name*)
wenzelm@3937
   447
val base_name = NameSpace.base;
wenzelm@3791
   448
wenzelm@3791
   449
wenzelm@3791
   450
(* intern / extern names *)
wenzelm@3791
   451
wenzelm@3791
   452
local
wenzelm@3791
   453
  (*prepare mapping of names*)
wenzelm@3791
   454
  fun mapping f add_xs t =
wenzelm@3791
   455
    let
wenzelm@3791
   456
      fun f' x = let val y = f x in if x = y then None else Some (x, y) end;
wenzelm@3791
   457
      val table = mapfilter f' (add_xs (t, []));
wenzelm@3791
   458
      fun lookup x = if_none (assoc (table, x)) x;
wenzelm@3791
   459
    in lookup end;
wenzelm@3791
   460
wenzelm@3791
   461
  (*intern / extern typ*)
wenzelm@3791
   462
  fun trn_typ trn T =
wenzelm@3791
   463
    T |> map_typ
wenzelm@3791
   464
      (mapping (trn classK) add_typ_classes T)
wenzelm@3791
   465
      (mapping (trn typeK) add_typ_tycons T);
wenzelm@3791
   466
wenzelm@3791
   467
  (*intern / extern term*)
wenzelm@3791
   468
  fun trn_term trn t =
wenzelm@3791
   469
    t |> map_term
wenzelm@3791
   470
      (mapping (trn classK) add_term_classes t)
wenzelm@3791
   471
      (mapping (trn typeK) add_term_tycons t)
wenzelm@3791
   472
      (mapping (trn constK) add_term_consts t);
wenzelm@3791
   473
wenzelm@3975
   474
  val spaces_of = #spaces o rep_sg;
wenzelm@3791
   475
in
wenzelm@3791
   476
  fun intrn_class spaces = intrn spaces classK;
wenzelm@3791
   477
  fun extrn_class spaces = extrn spaces classK;
wenzelm@3937
   478
wenzelm@3791
   479
  val intrn_sort = map o intrn_class;
wenzelm@3791
   480
  val intrn_typ = trn_typ o intrn;
wenzelm@3937
   481
  val intrn_term = trn_term o intrn;
wenzelm@3937
   482
wenzelm@3937
   483
  val extrn_sort = map o extrn_class;
wenzelm@3791
   484
  val extrn_typ = trn_typ o extrn;
wenzelm@3791
   485
  val extrn_term = trn_term o extrn;
wenzelm@3791
   486
wenzelm@3805
   487
  fun intrn_tycons spaces T =
wenzelm@3805
   488
    map_typ I (mapping (intrn spaces typeK) add_typ_tycons T) T;
wenzelm@3805
   489
wenzelm@3810
   490
  val intern = intrn o spaces_of;
wenzelm@3855
   491
  val extern = extrn o spaces_of;
wenzelm@5175
   492
  val cond_extern = cond_extrn o spaces_of;
wenzelm@6845
   493
  fun cond_extern_table sg = cond_extrn_table (spaces_of sg);
wenzelm@3937
   494
wenzelm@3791
   495
  val intern_class = intrn_class o spaces_of;
wenzelm@3791
   496
  val intern_sort = intrn_sort o spaces_of;
wenzelm@3791
   497
  val intern_typ = intrn_typ o spaces_of;
wenzelm@3791
   498
  val intern_term = intrn_term o spaces_of;
wenzelm@3791
   499
wenzelm@3791
   500
  fun intern_tycon sg = intrn (spaces_of sg) typeK;
wenzelm@3791
   501
  fun intern_const sg = intrn (spaces_of sg) constK;
wenzelm@3937
   502
wenzelm@3791
   503
  val intern_tycons = intrn_tycons o spaces_of;
wenzelm@3791
   504
wenzelm@3975
   505
  val full_name = full o #path o rep_sg;
wenzelm@4908
   506
  fun full_name_path sg elems name =
wenzelm@4844
   507
    full (#path (rep_sg sg) @ NameSpace.unpack elems) name;
wenzelm@3791
   508
end;
wenzelm@620
   509
wenzelm@402
   510
clasohm@0
   511
wenzelm@4249
   512
(** pretty printing of terms, types etc. **)
wenzelm@3937
   513
wenzelm@4249
   514
fun pretty_term (sg as Sg ({stamps, ...}, {syn, spaces, ...})) t =
wenzelm@3937
   515
  Syntax.pretty_term syn
wenzelm@4249
   516
    (exists (equal "CPure" o !) stamps)
wenzelm@5175
   517
    (if ! NameSpace.long_names then t else extrn_term spaces t);
wenzelm@3937
   518
wenzelm@3975
   519
fun pretty_typ (Sg (_, {syn, spaces, ...})) T =
wenzelm@3937
   520
  Syntax.pretty_typ syn
wenzelm@5175
   521
    (if ! NameSpace.long_names then T else extrn_typ spaces T);
wenzelm@3937
   522
wenzelm@3975
   523
fun pretty_sort (Sg (_, {syn, spaces, ...})) S =
wenzelm@3937
   524
  Syntax.pretty_sort syn
wenzelm@5175
   525
    (if ! NameSpace.long_names then S else extrn_sort spaces S);
wenzelm@3937
   526
wenzelm@3937
   527
fun pretty_classrel sg (c1, c2) = Pretty.block
wenzelm@3937
   528
  [pretty_sort sg [c1], Pretty.str " <", Pretty.brk 1, pretty_sort sg [c2]];
wenzelm@3937
   529
wenzelm@3937
   530
fun pretty_arity sg (t, Ss, S) =
wenzelm@3937
   531
  let
wenzelm@3937
   532
    val t' = cond_extern sg typeK t;
wenzelm@3937
   533
    val dom =
wenzelm@3937
   534
      if null Ss then []
wenzelm@3937
   535
      else [Pretty.list "(" ")" (map (pretty_sort sg) Ss), Pretty.brk 1];
wenzelm@3937
   536
  in
wenzelm@3937
   537
    Pretty.block
wenzelm@3937
   538
      ([Pretty.str (t' ^ " ::"), Pretty.brk 1] @ dom @ [pretty_sort sg S])
wenzelm@3937
   539
  end;
wenzelm@3937
   540
wenzelm@3937
   541
fun string_of_term sg t = Pretty.string_of (pretty_term sg t);
wenzelm@3937
   542
fun string_of_typ sg T = Pretty.string_of (pretty_typ sg T);
wenzelm@3937
   543
fun string_of_sort sg S = Pretty.string_of (pretty_sort sg S);
wenzelm@3937
   544
wenzelm@3937
   545
fun str_of_sort sg S = Pretty.str_of (pretty_sort sg S);
wenzelm@3937
   546
fun str_of_classrel sg c1_c2 = Pretty.str_of (pretty_classrel sg c1_c2);
wenzelm@3937
   547
fun str_of_arity sg ar = Pretty.str_of (pretty_arity sg ar);
wenzelm@3937
   548
wenzelm@3937
   549
fun pprint_term sg = Pretty.pprint o Pretty.quote o (pretty_term sg);
wenzelm@3937
   550
fun pprint_typ sg = Pretty.pprint o Pretty.quote o (pretty_typ sg);
wenzelm@3937
   551
wenzelm@3937
   552
wenzelm@3937
   553
wenzelm@8898
   554
(** read sorts **)  (*exception ERROR*)
wenzelm@8898
   555
wenzelm@8898
   556
fun err_in_sort s =
wenzelm@8898
   557
  error ("The error(s) above occurred in sort " ^ quote s);
wenzelm@8898
   558
wenzelm@8898
   559
fun rd_sort syn tsig spaces str =
wenzelm@8898
   560
  let val S = intrn_sort spaces (Syntax.read_sort syn str handle ERROR => err_in_sort str)
wenzelm@8898
   561
  in Type.cert_sort tsig S handle TYPE (msg, _, _) => (error_msg msg; err_in_sort str) end;
wenzelm@8898
   562
wenzelm@8898
   563
(*read and certify sort wrt a signature*)
wenzelm@8898
   564
fun read_sort (sg as Sg (_, {tsig, syn, spaces, ...})) str =
wenzelm@8898
   565
  (check_stale sg; rd_sort syn tsig spaces str);
wenzelm@8898
   566
wenzelm@8898
   567
fun cert_sort _ tsig _ = Type.cert_sort tsig;
wenzelm@8898
   568
wenzelm@8898
   569
wenzelm@8898
   570
wenzelm@562
   571
(** read types **)  (*exception ERROR*)
wenzelm@562
   572
wenzelm@562
   573
fun err_in_type s =
wenzelm@562
   574
  error ("The error(s) above occurred in type " ^ quote s);
wenzelm@562
   575
wenzelm@4227
   576
fun rd_raw_typ syn tsig spaces def_sort str =
wenzelm@3791
   577
  intrn_tycons spaces
wenzelm@3791
   578
    (Syntax.read_typ syn (Type.get_sort tsig def_sort (intrn_sort spaces)) str
wenzelm@3791
   579
      handle ERROR => err_in_type str);
wenzelm@4227
   580
wenzelm@4227
   581
fun read_raw_typ (sg as Sg (_, {tsig, syn, spaces, ...}), def_sort) str =
wenzelm@4227
   582
  (check_stale sg; rd_raw_typ syn tsig spaces def_sort str);
wenzelm@4227
   583
wenzelm@562
   584
(*read and certify typ wrt a signature*)
wenzelm@9504
   585
local
wenzelm@9504
   586
  fun read_typ_aux cert (sg, def_sort) str =
wenzelm@9504
   587
    (cert (tsig_of sg) (read_raw_typ (sg, def_sort) str)
wenzelm@9504
   588
        handle TYPE (msg, _, _) => (error_msg msg; err_in_type str));
wenzelm@9504
   589
in
wenzelm@9504
   590
  val read_typ = read_typ_aux Type.cert_typ;
wenzelm@9504
   591
  val read_typ_no_norm = read_typ_aux Type.cert_typ_no_norm;
wenzelm@9504
   592
end;
wenzelm@562
   593
wenzelm@562
   594
wenzelm@562
   595
wenzelm@8898
   596
(** certify classes, sorts, types and terms **)   (*exception TYPE*)
wenzelm@251
   597
wenzelm@8898
   598
val certify_class = Type.cert_class o tsig_of;
wenzelm@8898
   599
val certify_sort = Type.cert_sort o tsig_of;
wenzelm@3975
   600
val certify_typ = Type.cert_typ o tsig_of;
wenzelm@9504
   601
val certify_typ_no_norm = Type.cert_typ_no_norm o tsig_of;
wenzelm@10443
   602
wenzelm@10443
   603
fun certify_tycon sg c =
wenzelm@10443
   604
  if is_some (Symtab.lookup (#tycons (Type.rep_tsig (tsig_of sg)), c)) then c
wenzelm@10443
   605
  else raise TYPE ("Undeclared type constructor " ^ quote c, [], []);
wenzelm@10443
   606
wenzelm@10443
   607
fun certify_tyabbr sg c =
wenzelm@10443
   608
  if is_some (Symtab.lookup (#abbrs (Type.rep_tsig (tsig_of sg)), c)) then c
wenzelm@10443
   609
  else raise TYPE ("Unknown type abbreviation " ^ quote c, [], []);
wenzelm@10443
   610
wenzelm@10443
   611
fun certify_const sg c =
wenzelm@10443
   612
  if is_some (const_type sg c) then c else raise TYPE ("Undeclared constant " ^ quote c, [], []);
wenzelm@251
   613
wenzelm@4961
   614
wenzelm@4961
   615
(* certify_term *)
wenzelm@4961
   616
wenzelm@8290
   617
(*check for duplicate occurrences of TFree/TVar with distinct sorts*)
wenzelm@8290
   618
fun nodup_tvars (env, Type (_, Ts)) = nodup_tvars_list (env, Ts)
wenzelm@8290
   619
  | nodup_tvars (env as (tfrees, tvars), T as TFree (v as (a, S))) =
wenzelm@8290
   620
      (case assoc_string (tfrees, a) of
wenzelm@8290
   621
        Some S' =>
wenzelm@8290
   622
          if S = S' then env
wenzelm@8290
   623
          else raise TYPE ("Type variable " ^ quote a ^
wenzelm@8290
   624
            " has two distinct sorts", [TFree (a, S'), T], [])
wenzelm@8290
   625
      | None => (v :: tfrees, tvars))
wenzelm@8290
   626
  | nodup_tvars (env as (tfrees, tvars), T as TVar (v as (a, S))) =
wenzelm@2979
   627
      (case assoc_string_int (tvars, a) of
wenzelm@2979
   628
        Some S' =>
wenzelm@8290
   629
          if S = S' then env
wenzelm@8290
   630
          else raise TYPE ("Type variable " ^ quote (Syntax.string_of_vname a) ^
wenzelm@3791
   631
            " has two distinct sorts", [TVar (a, S'), T], [])
wenzelm@8290
   632
      | None => (tfrees, v :: tvars))
wenzelm@8290
   633
(*equivalent to foldl nodup_tvars_list, but 3X faster under Poly/ML*)
wenzelm@8290
   634
and nodup_tvars_list (env, []) = env
wenzelm@8290
   635
  | nodup_tvars_list (env, T :: Ts) = nodup_tvars_list (nodup_tvars (env, T), Ts);
nipkow@1494
   636
wenzelm@8290
   637
(*check for duplicate occurrences of Free/Var with distinct types*)
wenzelm@8290
   638
fun nodup_vars tm =
wenzelm@2979
   639
  let
wenzelm@8290
   640
    fun nodups (envs as (env as (frees, vars), envT)) tm =
wenzelm@2979
   641
      (case tm of
wenzelm@8290
   642
        Const (c, T) => (env, nodup_tvars (envT, T))
wenzelm@8290
   643
      | Free (v as (a, T)) =>
wenzelm@8290
   644
          (case assoc_string (frees, a) of
wenzelm@8290
   645
            Some T' =>
wenzelm@8290
   646
              if T = T' then (env, nodup_tvars (envT, T))
wenzelm@8290
   647
              else raise TYPE ("Variable " ^ quote a ^
wenzelm@8290
   648
                " has two distinct types", [T', T], [])
wenzelm@8290
   649
          | None => ((v :: frees, vars), nodup_tvars (envT, T)))
wenzelm@2979
   650
      | Var (v as (ixn, T)) =>
wenzelm@2979
   651
          (case assoc_string_int (vars, ixn) of
wenzelm@2979
   652
            Some T' =>
wenzelm@8290
   653
              if T = T' then (env, nodup_tvars (envT, T))
wenzelm@8290
   654
              else raise TYPE ("Variable " ^ quote (Syntax.string_of_vname ixn) ^
wenzelm@3791
   655
                " has two distinct types", [T', T], [])
wenzelm@8290
   656
          | None => ((frees, v :: vars), nodup_tvars (envT, T)))
wenzelm@8290
   657
      | Bound _ => envs
wenzelm@8290
   658
      | Abs (_, T, t) => nodups (env, nodup_tvars (envT, T)) t
wenzelm@8290
   659
      | s $ t => nodups (nodups envs s) t)
wenzelm@8290
   660
  in nodups (([], []), ([], [])) tm; tm end;
wenzelm@2979
   661
wenzelm@4961
   662
(*compute and check type of the term*)
wenzelm@4961
   663
fun type_check sg tm =
wenzelm@4961
   664
  let
wenzelm@8725
   665
    val prt = setmp Syntax.show_brackets true (pretty_term sg);
wenzelm@8725
   666
    val prT = pretty_typ sg;
wenzelm@251
   667
wenzelm@4961
   668
    fun err_appl why bs t T u U =
wenzelm@4961
   669
      let
wenzelm@10404
   670
        val xs = map Free bs;           (*we do not rename here*)
wenzelm@4961
   671
        val t' = subst_bounds (xs, t);
wenzelm@4961
   672
        val u' = subst_bounds (xs, u);
wenzelm@10404
   673
        val text = cat_lines (TypeInfer.appl_error prt prT why t' T u' U);
wenzelm@4961
   674
      in raise TYPE (text, [T, U], [t', u']) end;
wenzelm@4961
   675
wenzelm@4961
   676
    fun typ_of (_, Const (_, T)) = T
wenzelm@4961
   677
      | typ_of (_, Free  (_, T)) = T
wenzelm@4961
   678
      | typ_of (_, Var (_, T)) = T
wenzelm@4961
   679
      | typ_of (bs, Bound i) = snd (nth_elem (i, bs) handle LIST _ =>
wenzelm@4961
   680
          raise TYPE ("Loose bound variable: B." ^ string_of_int i, [], [Bound i]))
wenzelm@4961
   681
      | typ_of (bs, Abs (x, T, body)) = T --> typ_of ((x, T) :: bs, body)
wenzelm@4961
   682
      | typ_of (bs, t $ u) =
wenzelm@4961
   683
          let val T = typ_of (bs, t) and U = typ_of (bs, u) in
wenzelm@4961
   684
            (case T of
wenzelm@4961
   685
              Type ("fun", [T1, T2]) =>
wenzelm@4961
   686
                if T1 = U then T2 else err_appl "Incompatible operand type." bs t T u U
wenzelm@4961
   687
            | _ => err_appl "Operator not of function type." bs t T u U)
wenzelm@4961
   688
          end;
wenzelm@4961
   689
wenzelm@4961
   690
  in typ_of ([], tm) end;
clasohm@0
   691
wenzelm@2979
   692
wenzelm@3975
   693
fun certify_term sg tm =
wenzelm@251
   694
  let
wenzelm@3969
   695
    val _ = check_stale sg;
wenzelm@3975
   696
    val tsig = tsig_of sg;
wenzelm@3969
   697
wenzelm@3975
   698
    fun show_const a T = quote a ^ " :: " ^ quote (string_of_typ sg T);
wenzelm@169
   699
wenzelm@4961
   700
    fun atom_err (errs, Const (a, T)) =
wenzelm@3975
   701
        (case const_type sg a of
wenzelm@4961
   702
          None => ("Undeclared constant " ^ show_const a T) :: errs
wenzelm@3975
   703
        | Some U =>
wenzelm@10404
   704
            if typ_instance sg (T, U) then errs
wenzelm@4961
   705
            else ("Illegal type for constant " ^ show_const a T) :: errs)
wenzelm@4961
   706
      | atom_err (errs, Var ((x, i), _)) =
wenzelm@4961
   707
          if i < 0 then ("Negative index for Var " ^ quote x) :: errs else errs
wenzelm@4961
   708
      | atom_err (errs, _) = errs;
wenzelm@251
   709
wenzelm@251
   710
    val norm_tm =
wenzelm@2185
   711
      (case it_term_types (Type.typ_errors tsig) (tm, []) of
wenzelm@7068
   712
        [] => Type.norm_term tsig tm
wenzelm@3791
   713
      | errs => raise TYPE (cat_lines errs, [], [tm]));
wenzelm@8290
   714
    val _ = nodup_vars norm_tm;
wenzelm@251
   715
  in
wenzelm@4961
   716
    (case foldl_aterms atom_err ([], norm_tm) of
wenzelm@4961
   717
      [] => (norm_tm, type_check sg norm_tm, maxidx_of_term norm_tm)
wenzelm@3791
   718
    | errs => raise TYPE (cat_lines errs, [], [norm_tm]))
wenzelm@251
   719
  end;
wenzelm@251
   720
wenzelm@251
   721
wenzelm@583
   722
(** infer_types **)         (*exception ERROR*)
wenzelm@251
   723
wenzelm@2979
   724
(*
wenzelm@2979
   725
  def_type: partial map from indexnames to types (constrains Frees, Vars)
wenzelm@2979
   726
  def_sort: partial map from indexnames to sorts (constrains TFrees, TVars)
wenzelm@2979
   727
  used: list of already used type variables
wenzelm@2979
   728
  freeze: if true then generated parameters are turned into TFrees, else TVars
wenzelm@4249
   729
wenzelm@4249
   730
  termss: lists of alternative parses (only one combination should be type-correct)
wenzelm@4249
   731
  typs: expected types
wenzelm@2979
   732
*)
wenzelm@2979
   733
wenzelm@4249
   734
fun infer_types_simult sg def_type def_sort used freeze args =
wenzelm@251
   735
  let
wenzelm@3975
   736
    val tsig = tsig_of sg;
wenzelm@8725
   737
    val prt = setmp Syntax.show_brackets true (pretty_term sg);
wenzelm@8725
   738
    val prT = pretty_typ sg;
wenzelm@4249
   739
wenzelm@4249
   740
    val termss = foldr multiply (map fst args, [[]]);
wenzelm@4249
   741
    val typs =
wenzelm@4249
   742
      map (fn (_, T) => certify_typ sg T handle TYPE (msg, _, _) => error msg) args;
wenzelm@169
   743
wenzelm@4249
   744
    fun infer ts = OK
wenzelm@4249
   745
      (Type.infer_types prt prT tsig (const_type sg) def_type def_sort
wenzelm@4249
   746
        (intern_const sg) (intern_tycons sg) (intern_sort sg) used freeze typs ts)
wenzelm@4249
   747
      handle TYPE (msg, _, _) => Error msg;
clasohm@623
   748
wenzelm@4249
   749
    val err_results = map infer termss;
wenzelm@4249
   750
    val errs = mapfilter get_error err_results;
wenzelm@4249
   751
    val results = mapfilter get_ok err_results;
wenzelm@4249
   752
wenzelm@10404
   753
    val ambiguity = length termss;      (* FIXME !? *)
wenzelm@4249
   754
    (* FIXME to syntax.ML!? *)
wenzelm@4249
   755
    fun ambig_msg () =
wenzelm@4249
   756
      if ambiguity > 1 andalso ambiguity <= ! Syntax.ambiguity_level
wenzelm@4249
   757
      then
wenzelm@4249
   758
        error_msg "Got more than one parse tree.\n\
wenzelm@3805
   759
          \Retry with smaller Syntax.ambiguity_level for more information."
nipkow@952
   760
      else ();
wenzelm@4249
   761
  in
wenzelm@4249
   762
    if null results then (ambig_msg (); error (cat_lines errs))
wenzelm@4249
   763
    else if length results = 1 then
wenzelm@4249
   764
      (if ambiguity > ! Syntax.ambiguity_level then
wenzelm@4249
   765
        warning "Fortunately, only one parse tree is type correct.\n\
wenzelm@4249
   766
          \You may still want to disambiguate your grammar or your input."
wenzelm@4249
   767
      else (); hd results)
wenzelm@4249
   768
    else (ambig_msg (); error ("More than one term is type correct:\n" ^
wenzelm@4249
   769
      (cat_lines (map (Pretty.string_of o prt) (flat (map fst results))))))
wenzelm@4249
   770
  end;
clasohm@623
   771
wenzelm@4249
   772
wenzelm@4249
   773
fun infer_types sg def_type def_sort used freeze tsT =
wenzelm@4249
   774
  apfst hd (infer_types_simult sg def_type def_sort used freeze [tsT]);
wenzelm@251
   775
wenzelm@251
   776
wenzelm@8607
   777
(** read_def_terms **)
wenzelm@8607
   778
wenzelm@8607
   779
(*read terms, infer types*)
wenzelm@8607
   780
fun read_def_terms (sign, types, sorts) used freeze sTs =
wenzelm@8607
   781
  let
wenzelm@8607
   782
    val syn = #syn (rep_sg sign);
wenzelm@8607
   783
    fun read (s, T) =
wenzelm@8607
   784
      let val T' = certify_typ sign T handle TYPE (msg, _, _) => error msg
wenzelm@8607
   785
      in (Syntax.read syn T' s, T') end;
wenzelm@8607
   786
    val tsTs = map read sTs;
wenzelm@8607
   787
  in infer_types_simult sign types sorts used freeze tsTs end;
wenzelm@8607
   788
wenzelm@8802
   789
fun simple_read_term sign T s =
wenzelm@8802
   790
  (read_def_terms (sign, K None, K None) [] true [(s, T)]
wenzelm@8802
   791
    handle ERROR => error ("The error(s) above occurred for " ^ s)) |> #1 |> hd;
wenzelm@8802
   792
wenzelm@8607
   793
wenzelm@2979
   794
clasohm@623
   795
(** extend signature **)    (*exception ERROR*)
clasohm@623
   796
wenzelm@620
   797
(** signature extension functions **)  (*exception ERROR*)
wenzelm@386
   798
wenzelm@3791
   799
fun decls_of path name_of mfixs =
wenzelm@3810
   800
  map (fn (x, y, mx) => (full path (name_of x mx), y)) mfixs;
wenzelm@3791
   801
wenzelm@3791
   802
fun no_read _ _ _ decl = decl;
wenzelm@386
   803
wenzelm@386
   804
wenzelm@386
   805
(* add default sort *)
wenzelm@386
   806
wenzelm@8898
   807
fun ext_defS prep_sort (syn, tsig, ctab, (path, spaces), data) S =
wenzelm@8898
   808
  (syn, Type.ext_tsig_defsort tsig (prep_sort syn tsig spaces S), ctab, (path, spaces), data);
wenzelm@8898
   809
paulson@8927
   810
fun ext_defsort arg   = ext_defS rd_sort arg;
paulson@8927
   811
fun ext_defsort_i arg = ext_defS cert_sort arg;
wenzelm@386
   812
wenzelm@386
   813
wenzelm@386
   814
(* add type constructors *)
wenzelm@386
   815
wenzelm@3967
   816
fun ext_types (syn, tsig, ctab, (path, spaces), data) types =
wenzelm@3791
   817
  let val decls = decls_of path Syntax.type_name types in
wenzelm@3791
   818
    (Syntax.extend_type_gram syn types,
wenzelm@3791
   819
      Type.ext_tsig_types tsig decls, ctab,
wenzelm@3967
   820
      (path, add_names spaces typeK (map fst decls)), data)
wenzelm@3791
   821
  end;
wenzelm@386
   822
wenzelm@4844
   823
fun ext_nonterminals sg nonterms =
wenzelm@4844
   824
  ext_types sg (map (fn n => (n, 0, Syntax.NoSyn)) nonterms);
wenzelm@4844
   825
wenzelm@386
   826
wenzelm@386
   827
(* add type abbreviations *)
wenzelm@386
   828
wenzelm@3791
   829
fun read_abbr syn tsig spaces (t, vs, rhs_src) =
wenzelm@4227
   830
  (t, vs, rd_raw_typ syn tsig spaces (K None) rhs_src)
wenzelm@386
   831
    handle ERROR => error ("in type abbreviation " ^ t);
wenzelm@386
   832
wenzelm@3967
   833
fun ext_abbrs rd_abbr (syn, tsig, ctab, (path, spaces), data) abbrs =
wenzelm@386
   834
  let
wenzelm@386
   835
    fun mfix_of (t, vs, _, mx) = (t, length vs, mx);
wenzelm@3791
   836
    val syn' = Syntax.extend_type_gram syn (map mfix_of abbrs);
wenzelm@386
   837
wenzelm@3791
   838
    val abbrs' =
wenzelm@3791
   839
      map (fn (t, vs, rhs, mx) =>
wenzelm@3810
   840
        (full path (Syntax.type_name t mx), vs, rhs)) abbrs;
wenzelm@3805
   841
    val spaces' = add_names spaces typeK (map #1 abbrs');
wenzelm@3805
   842
    val decls = map (rd_abbr syn' tsig spaces') abbrs';
wenzelm@386
   843
  in
wenzelm@3967
   844
    (syn', Type.ext_tsig_abbrs tsig decls, ctab, (path, spaces'), data)
wenzelm@386
   845
  end;
wenzelm@386
   846
wenzelm@3791
   847
fun ext_tyabbrs abbrs = ext_abbrs read_abbr abbrs;
wenzelm@3791
   848
fun ext_tyabbrs_i abbrs = ext_abbrs no_read abbrs;
wenzelm@386
   849
wenzelm@386
   850
wenzelm@386
   851
(* add type arities *)
wenzelm@386
   852
wenzelm@8898
   853
fun ext_ars int prep_sort (syn, tsig, ctab, (path, spaces), data) arities =
wenzelm@386
   854
  let
wenzelm@8898
   855
    val prepS = prep_sort syn tsig spaces;
wenzelm@8898
   856
    fun prep_arity (c, Ss, S) =
wenzelm@8898
   857
      (if int then intrn spaces typeK c else c, map prepS Ss, prepS S);
wenzelm@8898
   858
    val tsig' = Type.ext_tsig_arities tsig (map prep_arity arities);
wenzelm@3791
   859
    val log_types = Type.logical_types tsig';
wenzelm@386
   860
  in
wenzelm@3967
   861
    (Syntax.extend_log_types syn log_types, tsig', ctab, (path, spaces), data)
wenzelm@386
   862
  end;
wenzelm@386
   863
paulson@8927
   864
fun ext_arities arg   = ext_ars true rd_sort arg;
paulson@8927
   865
fun ext_arities_i arg = ext_ars false cert_sort arg;
wenzelm@8898
   866
wenzelm@386
   867
wenzelm@386
   868
(* add term constants and syntax *)
wenzelm@386
   869
wenzelm@3805
   870
fun const_name path c mx =
wenzelm@3810
   871
  full path (Syntax.const_name c mx);
wenzelm@3805
   872
wenzelm@386
   873
fun err_in_const c =
wenzelm@386
   874
  error ("in declaration of constant " ^ quote c);
wenzelm@386
   875
wenzelm@386
   876
fun err_dup_consts cs =
wenzelm@386
   877
  error ("Duplicate declaration of constant(s) " ^ commas_quote cs);
wenzelm@386
   878
wenzelm@251
   879
wenzelm@3805
   880
fun read_const syn tsig (path, spaces) (c, ty_src, mx) =
wenzelm@4227
   881
  (c, rd_raw_typ syn tsig spaces (K None) ty_src, mx)
wenzelm@3805
   882
    handle ERROR => err_in_const (const_name path c mx);
wenzelm@386
   883
wenzelm@3967
   884
fun ext_cnsts rd_const syn_only prmode (syn, tsig, ctab, (path, spaces), data) raw_consts =
wenzelm@386
   885
  let
wenzelm@2979
   886
    fun prep_const (c, ty, mx) =
wenzelm@3791
   887
      (c, compress_type (Type.varifyT (Type.cert_typ tsig (Type.no_tvars ty))), mx)
wenzelm@3791
   888
        handle TYPE (msg, _, _) =>
wenzelm@3805
   889
          (error_msg msg; err_in_const (const_name path c mx));
wenzelm@386
   890
wenzelm@3805
   891
    val consts = map (prep_const o rd_const syn tsig (path, spaces)) raw_consts;
wenzelm@386
   892
    val decls =
wenzelm@386
   893
      if syn_only then []
wenzelm@3791
   894
      else decls_of path Syntax.const_name consts;
wenzelm@386
   895
  in
wenzelm@2197
   896
    (Syntax.extend_const_gram syn prmode consts, tsig,
wenzelm@4489
   897
      Symtab.extend (ctab, decls)
wenzelm@3791
   898
        handle Symtab.DUPS cs => err_dup_consts cs,
wenzelm@3967
   899
      (path, add_names spaces constK (map fst decls)), data)
wenzelm@386
   900
  end;
wenzelm@386
   901
wenzelm@4007
   902
fun ext_consts_i sg = ext_cnsts no_read false ("", true) sg;
wenzelm@4007
   903
fun ext_consts sg = ext_cnsts read_const false ("", true) sg;
wenzelm@4007
   904
fun ext_syntax_i sg = ext_cnsts no_read true ("", true) sg;
wenzelm@4007
   905
fun ext_syntax sg = ext_cnsts read_const true ("", true) sg;
wenzelm@3791
   906
fun ext_modesyntax_i sg (prmode, consts) = ext_cnsts no_read true prmode sg consts;
wenzelm@2197
   907
fun ext_modesyntax sg (prmode, consts) = ext_cnsts read_const true prmode sg consts;
wenzelm@386
   908
wenzelm@386
   909
wenzelm@386
   910
(* add type classes *)
wenzelm@386
   911
wenzelm@386
   912
fun const_of_class c = c ^ "_class";
wenzelm@386
   913
wenzelm@386
   914
fun class_of_const c_class =
wenzelm@386
   915
  let
wenzelm@3791
   916
    val c = implode (take (size c_class - size "_class", explode c_class));
wenzelm@386
   917
  in
wenzelm@386
   918
    if const_of_class c = c_class then c
wenzelm@3791
   919
    else raise TERM ("class_of_const: bad name " ^ quote c_class, [])
wenzelm@386
   920
  end;
wenzelm@386
   921
wenzelm@386
   922
wenzelm@3967
   923
fun ext_classes int (syn, tsig, ctab, (path, spaces), data) classes =
wenzelm@386
   924
  let
wenzelm@562
   925
    val names = map fst classes;
wenzelm@386
   926
    val consts =
wenzelm@386
   927
      map (fn c => (const_of_class c, a_itselfT --> propT, NoSyn)) names;
wenzelm@3791
   928
wenzelm@3810
   929
    val full_names = map (full path) names;
wenzelm@3791
   930
    val spaces' = add_names spaces classK full_names;
wenzelm@3791
   931
    val intrn = if int then map (intrn_class spaces') else I;
wenzelm@3791
   932
    val classes' =
wenzelm@3791
   933
      ListPair.map (fn (c, (_, cs)) => (c, intrn cs)) (full_names, classes);
wenzelm@386
   934
  in
wenzelm@386
   935
    ext_consts_i
wenzelm@3791
   936
      (Syntax.extend_consts syn names,
wenzelm@3967
   937
        Type.ext_tsig_classes tsig classes', ctab, (path, spaces'), data)
wenzelm@3791
   938
    consts
wenzelm@386
   939
  end;
wenzelm@386
   940
wenzelm@386
   941
wenzelm@2963
   942
(* add to classrel *)
wenzelm@421
   943
wenzelm@3967
   944
fun ext_classrel int (syn, tsig, ctab, (path, spaces), data) pairs =
wenzelm@3791
   945
  let val intrn = if int then map (pairself (intrn_class spaces)) else I in
wenzelm@3967
   946
    (syn, Type.ext_tsig_classrel tsig (intrn pairs), ctab, (path, spaces), data)
wenzelm@3791
   947
  end;
wenzelm@421
   948
wenzelm@421
   949
wenzelm@4619
   950
(* add translation rules *)
wenzelm@4619
   951
wenzelm@4619
   952
fun ext_trrules (syn, tsig, ctab, (path, spaces), data) args =
wenzelm@4619
   953
  (Syntax.extend_trrules syn
wenzelm@4619
   954
    (map (Syntax.map_trrule (fn (root, str) => (intrn spaces typeK root, str))) args),
wenzelm@4619
   955
      tsig, ctab, (path, spaces), data);
wenzelm@4619
   956
wenzelm@4619
   957
wenzelm@1159
   958
(* add to syntax *)
wenzelm@386
   959
wenzelm@3967
   960
fun ext_syn extfun (syn, tsig, ctab, names, data) args =
wenzelm@3967
   961
  (extfun syn args, tsig, ctab, names, data);
wenzelm@3791
   962
wenzelm@3791
   963
wenzelm@3791
   964
(* add to path *)
wenzelm@3791
   965
wenzelm@4844
   966
fun ext_path (syn, tsig, ctab, (path, spaces), data) elems =
wenzelm@3791
   967
  let
wenzelm@3791
   968
    val path' =
wenzelm@4844
   969
      if elems = ".." andalso not (null path) then fst (split_last path)
wenzelm@4844
   970
      else if elems = "/" then []
wenzelm@4844
   971
      else path @ NameSpace.unpack elems;
wenzelm@3791
   972
  in
wenzelm@3967
   973
    (syn, tsig, ctab, (path', spaces), data)
wenzelm@10404
   974
  end;
wenzelm@3791
   975
wenzelm@3791
   976
wenzelm@8725
   977
(* change name space *)
wenzelm@8725
   978
wenzelm@8725
   979
fun ext_add_space (syn, tsig, ctab, (path, spaces), data) (kind, names) =
wenzelm@8725
   980
  (syn, tsig, ctab, (path, add_names spaces kind names), data);
wenzelm@3791
   981
wenzelm@8725
   982
fun ext_hide_space (syn, tsig, ctab, (path, spaces), data) (kind, xnames) =
wenzelm@8725
   983
  (syn, tsig, ctab, (path, hide_names spaces kind (map (intrn spaces kind) xnames)), data);
wenzelm@8725
   984
wenzelm@8725
   985
fun ext_hide_space_i (syn, tsig, ctab, (path, spaces), data) (kind, names) =
wenzelm@8725
   986
  (syn, tsig, ctab, (path, hide_names spaces kind names), data);
wenzelm@386
   987
wenzelm@386
   988
wenzelm@3967
   989
(* signature data *)
wenzelm@386
   990
wenzelm@6546
   991
fun ext_init_data sg (syn, tsig, ctab, names, data) (kind, (e, cp, ext, mrg, prt)) =
wenzelm@6546
   992
  (syn, tsig, ctab, names, init_data_sg sg data kind e cp ext mrg prt);
wenzelm@386
   993
wenzelm@4998
   994
fun ext_put_data sg (syn, tsig, ctab, names, data) (kind, f, x) =
wenzelm@4998
   995
  (syn, tsig, ctab, names, put_data_sg sg data kind f x);
wenzelm@386
   996
wenzelm@386
   997
wenzelm@6546
   998
fun copy_data (k, (e, mths as (cp, _, _, _))) =
wenzelm@6961
   999
  (k, (cp e handle exn => err_method "copy" (Object.name_of_kind k) exn, mths));
wenzelm@6546
  1000
wenzelm@6546
  1001
fun copy (sg as Sg ({id = _, stamps}, {self, tsig, const_tab, syn, path, spaces, data})) =
wenzelm@6546
  1002
  let
wenzelm@6546
  1003
    val _ = check_stale sg;
wenzelm@6546
  1004
    val self' = SgRef (Some (ref sg));
wenzelm@6546
  1005
    val Data tab = data;
wenzelm@6546
  1006
    val data' = Data (Symtab.map copy_data tab);
wenzelm@6546
  1007
  in create_sign self' stamps "#" (syn, tsig, const_tab, (path, spaces), data') end;
wenzelm@6546
  1008
wenzelm@6546
  1009
wenzelm@386
  1010
(* the external interfaces *)
wenzelm@386
  1011
wenzelm@4998
  1012
val add_classes       = extend_sign true (ext_classes true) "#";
wenzelm@4998
  1013
val add_classes_i     = extend_sign true (ext_classes false) "#";
wenzelm@4998
  1014
val add_classrel      = extend_sign true (ext_classrel true) "#";
wenzelm@4998
  1015
val add_classrel_i    = extend_sign true (ext_classrel false) "#";
wenzelm@8898
  1016
val add_defsort       = extend_sign true ext_defsort "#";
wenzelm@8898
  1017
val add_defsort_i     = extend_sign true ext_defsort_i "#";
wenzelm@4998
  1018
val add_types         = extend_sign true ext_types "#";
wenzelm@4998
  1019
val add_nonterminals  = extend_sign true ext_nonterminals "#";
wenzelm@4998
  1020
val add_tyabbrs       = extend_sign true ext_tyabbrs "#";
wenzelm@4998
  1021
val add_tyabbrs_i     = extend_sign true ext_tyabbrs_i "#";
wenzelm@8898
  1022
val add_arities       = extend_sign true ext_arities "#";
wenzelm@8898
  1023
val add_arities_i     = extend_sign true ext_arities_i "#";
wenzelm@4998
  1024
val add_consts        = extend_sign true ext_consts "#";
wenzelm@4998
  1025
val add_consts_i      = extend_sign true ext_consts_i "#";
wenzelm@4998
  1026
val add_syntax        = extend_sign true ext_syntax "#";
wenzelm@4998
  1027
val add_syntax_i      = extend_sign true ext_syntax_i "#";
wenzelm@4998
  1028
val add_modesyntax    = extend_sign true ext_modesyntax "#";
wenzelm@4998
  1029
val add_modesyntax_i  = extend_sign true ext_modesyntax_i "#";
wenzelm@4998
  1030
val add_trfuns        = extend_sign true (ext_syn Syntax.extend_trfuns) "#";
wenzelm@4998
  1031
val add_trfunsT       = extend_sign true (ext_syn Syntax.extend_trfunsT) "#";
wenzelm@4998
  1032
val add_tokentrfuns   = extend_sign true (ext_syn Syntax.extend_tokentrfuns) "#";
wenzelm@4998
  1033
val add_trrules       = extend_sign true ext_trrules "#";
wenzelm@4998
  1034
val add_trrules_i     = extend_sign true (ext_syn Syntax.extend_trrules_i) "#";
wenzelm@4998
  1035
val add_path          = extend_sign true ext_path "#";
wenzelm@8725
  1036
val add_space         = extend_sign true ext_add_space "#";
wenzelm@8725
  1037
val hide_space        = extend_sign true ext_hide_space "#";
wenzelm@8725
  1038
val hide_space_i      = extend_sign true ext_hide_space_i "#";
wenzelm@4998
  1039
fun init_data arg sg  = extend_sign true (ext_init_data sg) "#" arg sg;
wenzelm@4998
  1040
fun put_data k f x sg = extend_sign true (ext_put_data sg) "#" (k, f, x) sg;
wenzelm@4998
  1041
fun add_name name sg  = extend_sign true K name () sg;
wenzelm@4998
  1042
fun prep_ext sg       = extend_sign false K "#" () sg;
wenzelm@386
  1043
wenzelm@386
  1044
wenzelm@3867
  1045
wenzelm@10404
  1046
(** merge signatures **)        (*exception TERM*)
wenzelm@3867
  1047
wenzelm@4228
  1048
(* merge_stamps *)
wenzelm@4228
  1049
wenzelm@4228
  1050
fun merge_stamps stamps1 stamps2 =
wenzelm@4228
  1051
  let val stamps = merge_rev_lists stamps1 stamps2 in
wenzelm@4228
  1052
    (case duplicates (map ! stamps) of
wenzelm@4228
  1053
      [] => stamps
wenzelm@4228
  1054
    | dups => raise TERM ("Attempt to merge different versions of theories "
wenzelm@4228
  1055
        ^ commas_quote dups, []))
wenzelm@4228
  1056
  end;
wenzelm@4228
  1057
wenzelm@4228
  1058
wenzelm@4627
  1059
(* implicit merge -- trivial only *)
wenzelm@3877
  1060
wenzelm@4228
  1061
fun merge_refs (sgr1 as SgRef (Some (ref (sg1 as Sg ({stamps = s1, ...}, _)))),
wenzelm@4228
  1062
        sgr2 as SgRef (Some (ref (sg2 as Sg ({stamps = s2, ...}, _))))) =
wenzelm@3967
  1063
      if fast_subsig (sg2, sg1) then sgr1
wenzelm@3967
  1064
      else if fast_subsig (sg1, sg2) then sgr2
wenzelm@3967
  1065
      else if subsig (sg2, sg1) then sgr1
wenzelm@3967
  1066
      else if subsig (sg1, sg2) then sgr2
wenzelm@4228
  1067
      else (merge_stamps s1 s2; (*check for different versions*)
wenzelm@4228
  1068
        raise TERM ("Attempt to do non-trivial merge of signatures", []))
wenzelm@3967
  1069
  | merge_refs _ = sys_error "Sign.merge_refs";
wenzelm@3867
  1070
wenzelm@4627
  1071
val merge = deref o merge_refs o pairself self_ref;
wenzelm@4627
  1072
wenzelm@3867
  1073
wenzelm@10404
  1074
(* proper merge *)              (*exception TERM/ERROR*)
wenzelm@143
  1075
wenzelm@6961
  1076
fun nontriv_merge (sg1, sg2) =
wenzelm@3967
  1077
  if subsig (sg2, sg1) then sg1
wenzelm@251
  1078
  else if subsig (sg1, sg2) then sg2
wenzelm@386
  1079
  else if is_draft sg1 orelse is_draft sg2 then
wenzelm@3967
  1080
    raise TERM ("Attempt to merge draft signatures", [])
wenzelm@251
  1081
  else
wenzelm@251
  1082
    (*neither is union already; must form union*)
wenzelm@251
  1083
    let
wenzelm@3975
  1084
      val Sg ({id = _, stamps = stamps1}, {self = _, tsig = tsig1, const_tab = const_tab1,
wenzelm@3975
  1085
        syn = syn1, path = _, spaces = spaces1, data = data1}) = sg1;
wenzelm@3975
  1086
      val Sg ({id = _, stamps = stamps2}, {self = _, tsig = tsig2, const_tab = const_tab2,
wenzelm@3975
  1087
        syn = syn2, path = _, spaces = spaces2, data = data2}) = sg2;
wenzelm@386
  1088
wenzelm@3967
  1089
      val id = ref "";
wenzelm@3975
  1090
      val self_ref = ref sg1;                   (*dummy value*)
wenzelm@3967
  1091
      val self = SgRef (Some self_ref);
wenzelm@402
  1092
wenzelm@4228
  1093
      val stamps = merge_stamps stamps1 stamps2;
wenzelm@2185
  1094
      val tsig = Type.merge_tsigs (tsig1, tsig2);
wenzelm@251
  1095
      val const_tab = Symtab.merge (op =) (const_tab1, const_tab2)
wenzelm@386
  1096
        handle Symtab.DUPS cs =>
wenzelm@3791
  1097
          raise TERM ("Incompatible types for constant(s) " ^ commas_quote cs, []);
wenzelm@386
  1098
      val syn = Syntax.merge_syntaxes syn1 syn2;
wenzelm@3791
  1099
wenzelm@3967
  1100
      val path = [];
wenzelm@3791
  1101
      val kinds = distinct (map fst (spaces1 @ spaces2));
wenzelm@3791
  1102
      val spaces =
wenzelm@3791
  1103
        kinds ~~
wenzelm@3791
  1104
          ListPair.map NameSpace.merge
wenzelm@3791
  1105
            (map (space_of spaces1) kinds, map (space_of spaces2) kinds);
wenzelm@3867
  1106
wenzelm@4256
  1107
      val data = merge_data (data1, data2);
wenzelm@3967
  1108
wenzelm@3967
  1109
      val sign = make_sign (id, self, tsig, const_tab, syn, path, spaces, data, stamps);
wenzelm@251
  1110
    in
wenzelm@3967
  1111
      self_ref := sign; sign
wenzelm@251
  1112
    end;
wenzelm@143
  1113
clasohm@0
  1114
clasohm@0
  1115
wenzelm@3995
  1116
(** partial Pure signature **)
clasohm@0
  1117
wenzelm@3967
  1118
val dummy_sg = make_sign (ref "", SgRef None, Type.tsig0,
wenzelm@4489
  1119
  Symtab.empty, Syntax.pure_syn, [], [], empty_data, []);
wenzelm@3967
  1120
wenzelm@3995
  1121
val pre_pure =
wenzelm@3967
  1122
  create_sign (SgRef (Some (ref dummy_sg))) [] "#"
wenzelm@4489
  1123
    (Syntax.pure_syn, Type.tsig0, Symtab.empty, ([], []), empty_data);
clasohm@0
  1124
wenzelm@3791
  1125
clasohm@0
  1126
end;