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