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