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