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