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