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