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