src/Pure/sign.ML
author wenzelm
Wed Nov 13 10:59:53 1996 +0100 (1996-11-13)
changeset 2184 99805d7652a9
parent 2180 934572a94139
child 2185 f9686e7e6d4d
permissions -rw-r--r--
tuned subsig;
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@19
     8
signature SIGN =
paulson@1501
     9
  sig
paulson@1501
    10
  type sg
paulson@1501
    11
  val rep_sg: sg -> {tsig: Type.type_sig,
paulson@1501
    12
		     const_tab: typ Symtab.table,
paulson@1501
    13
		     syn: Syntax.syntax,
paulson@1501
    14
		     stamps: string ref list}
paulson@1501
    15
  val subsig: sg * sg -> bool
paulson@1501
    16
  val eq_sg: sg * sg -> bool
paulson@1501
    17
  val same_sg: sg * sg -> bool
paulson@1501
    18
  val is_draft: sg -> bool
paulson@1501
    19
  val const_type: sg -> string -> typ option
paulson@1501
    20
  val classes: sg -> class list
paulson@1501
    21
  val subsort: sg -> sort * sort -> bool
paulson@1501
    22
  val nodup_Vars: term -> unit
paulson@1501
    23
  val norm_sort: sg -> sort -> sort
paulson@1501
    24
  val nonempty_sort: sg -> sort list -> sort -> bool
paulson@1501
    25
  val print_sg: sg -> unit
paulson@1501
    26
  val pretty_sg: sg -> Pretty.T
paulson@1501
    27
  val pprint_sg: sg -> pprint_args -> unit
paulson@1501
    28
  val pretty_term: sg -> term -> Pretty.T
paulson@1501
    29
  val pretty_typ: sg -> typ -> Pretty.T
paulson@1501
    30
  val pretty_sort: sort -> Pretty.T
paulson@1501
    31
  val string_of_term: sg -> term -> string
paulson@1501
    32
  val string_of_typ: sg -> typ -> string
paulson@1501
    33
  val pprint_term: sg -> term -> pprint_args -> unit
paulson@1501
    34
  val pprint_typ: sg -> typ -> pprint_args -> unit
paulson@1501
    35
  val certify_typ: sg -> typ -> typ
paulson@1501
    36
  val certify_term: sg -> term -> term * typ * int
paulson@1501
    37
  val read_typ: sg * (indexname -> sort option) -> string -> typ
paulson@1501
    38
  val exn_type_msg: sg -> string * typ list * term list -> string
paulson@1501
    39
  val infer_types: sg -> (indexname -> typ option) ->
paulson@1501
    40
    (indexname -> sort option) -> string list -> bool
paulson@1501
    41
    -> term list * typ -> int * term * (indexname * typ) list
paulson@1501
    42
  val add_classes: (class * class list) list -> sg -> sg
paulson@1501
    43
  val add_classrel: (class * class) list -> sg -> sg
paulson@1501
    44
  val add_defsort: sort -> sg -> sg
paulson@1501
    45
  val add_types: (string * int * mixfix) list -> sg -> sg
paulson@1501
    46
  val add_tyabbrs: (string * string list * string * mixfix) list -> sg -> sg
paulson@1501
    47
  val add_tyabbrs_i: (string * string list * typ * mixfix) list -> sg -> sg
paulson@1501
    48
  val add_arities: (string * sort list * sort) list -> sg -> sg
paulson@1501
    49
  val add_consts: (string * string * mixfix) list -> sg -> sg
paulson@1501
    50
  val add_consts_i: (string * typ * mixfix) list -> sg -> sg
paulson@1501
    51
  val add_syntax: (string * string * mixfix) list -> sg -> sg
paulson@1501
    52
  val add_syntax_i: (string * typ * mixfix) list -> sg -> sg
paulson@1501
    53
  val add_trfuns:
paulson@1501
    54
    (string * (ast list -> ast)) list *
paulson@1501
    55
    (string * (term list -> term)) list *
paulson@1501
    56
    (string * (term list -> term)) list *
paulson@1501
    57
    (string * (ast list -> ast)) list -> sg -> sg
paulson@1810
    58
  val add_trrules: (string * string) Syntax.trrule list -> sg -> sg
paulson@1810
    59
  val add_trrules_i: ast Syntax.trrule list -> sg -> sg
paulson@1501
    60
  val add_name: string -> sg -> sg
paulson@1501
    61
  val make_draft: sg -> sg
paulson@1501
    62
  val merge: sg * sg -> sg
paulson@1501
    63
  val proto_pure: sg
paulson@1501
    64
  val pure: sg
paulson@1501
    65
  val cpure: sg
paulson@1501
    66
  val const_of_class: class -> string
paulson@1501
    67
  val class_of_const: string -> class
paulson@1501
    68
  end;
clasohm@0
    69
paulson@1501
    70
structure Sign : SIGN =
wenzelm@143
    71
struct
clasohm@0
    72
paulson@1501
    73
local open Type Syntax in
wenzelm@143
    74
wenzelm@251
    75
(** datatype sg **)
wenzelm@251
    76
wenzelm@251
    77
(*the "ref" in stamps ensures that no two signatures are identical -- it is
wenzelm@251
    78
  impossible to forge a signature*)
wenzelm@143
    79
wenzelm@19
    80
datatype sg =
wenzelm@143
    81
  Sg of {
paulson@1501
    82
    tsig: Type.type_sig,                 (*order-sorted signature of types*)
wenzelm@143
    83
    const_tab: typ Symtab.table,    (*types of constants*)
wenzelm@143
    84
    syn: Syntax.syntax,             (*syntax for parsing and printing*)
wenzelm@143
    85
    stamps: string ref list};       (*unique theory indentifier*)
clasohm@0
    86
clasohm@0
    87
fun rep_sg (Sg args) = args;
wenzelm@402
    88
val tsig_of = #tsig o rep_sg;
clasohm@0
    89
nipkow@206
    90
paulson@2180
    91
(*** Stamps ***)
paulson@2180
    92
paulson@2180
    93
(*Avoiding polymorphic equality: 10* speedup*)
paulson@2180
    94
fun mem_stamp (_:string ref, []) = false
paulson@2180
    95
  | mem_stamp (x, y::xs) = x=y orelse mem_stamp(x,xs);
paulson@2180
    96
paulson@2180
    97
fun subset_stamp ([], ys) = true
paulson@2180
    98
  | subset_stamp (x :: xs, ys) = mem_stamp(x, ys) andalso subset_stamp(xs, ys);
paulson@2180
    99
paulson@2180
   100
fun eq_set_stamp (xs, ys) =
paulson@2180
   101
    xs = ys orelse (subset_stamp (xs, ys) andalso subset_stamp (ys, xs));
wenzelm@402
   102
wenzelm@386
   103
fun is_draft (Sg {stamps = ref "#" :: _, ...}) = true
wenzelm@386
   104
  | is_draft _ = false;
wenzelm@386
   105
wenzelm@2184
   106
fun subsig (Sg{stamps=s1,...}, Sg{stamps=s2,...}) =
wenzelm@2184
   107
  s1 = s2 orelse subset_stamp (s1, s2);
clasohm@0
   108
paulson@2180
   109
fun eq_sg (Sg{stamps=s1,...}, Sg{stamps=s2,...}) = eq_set_stamp(s1,s2);
clasohm@0
   110
clasohm@1241
   111
(* test if same theory names are contained in signatures' stamps,
clasohm@1241
   112
   i.e. if signatures belong to same theory but not necessarily to the same
clasohm@1241
   113
   version of it*)
clasohm@1241
   114
fun same_sg (Sg {stamps = s1, ...}, Sg {stamps = s2, ...}) =
paulson@2180
   115
  eq_set_string (pairself (map (op !)) (s1, s2));
clasohm@1241
   116
clasohm@0
   117
wenzelm@402
   118
(* consts *)
wenzelm@402
   119
wenzelm@386
   120
fun const_type (Sg {const_tab, ...}) c =
wenzelm@386
   121
  Symtab.lookup (const_tab, c);
wenzelm@386
   122
wenzelm@386
   123
wenzelm@620
   124
(* classes and sorts *)
wenzelm@402
   125
wenzelm@402
   126
val classes = #classes o Type.rep_tsig o tsig_of;
wenzelm@402
   127
wenzelm@402
   128
val subsort = Type.subsort o tsig_of;
wenzelm@402
   129
val norm_sort = Type.norm_sort o tsig_of;
wenzelm@1216
   130
val nonempty_sort = Type.nonempty_sort o tsig_of;
wenzelm@402
   131
wenzelm@620
   132
fun pretty_sort [c] = Pretty.str c
wenzelm@620
   133
  | pretty_sort cs = Pretty.str_list "{" "}" cs;
wenzelm@620
   134
wenzelm@402
   135
clasohm@0
   136
wenzelm@251
   137
(** print signature **)
wenzelm@251
   138
wenzelm@386
   139
val stamp_names = rev o map !;
wenzelm@386
   140
wenzelm@251
   141
fun print_sg sg =
wenzelm@251
   142
  let
wenzelm@251
   143
    fun prt_typ syn ty = Pretty.quote (Syntax.pretty_typ syn ty);
wenzelm@251
   144
wenzelm@251
   145
    fun pretty_subclass (cl, cls) = Pretty.block
wenzelm@1216
   146
      (Pretty.str (cl ^ " <") :: Pretty.brk 1 ::
wenzelm@1216
   147
        Pretty.commas (map Pretty.str cls));
wenzelm@251
   148
wenzelm@251
   149
    fun pretty_default cls = Pretty.block
wenzelm@251
   150
      [Pretty.str "default:", Pretty.brk 1, pretty_sort cls];
wenzelm@251
   151
nipkow@963
   152
    fun pretty_ty (ty, n) = Pretty.str (ty ^ " " ^ string_of_int n);
wenzelm@251
   153
wenzelm@251
   154
    fun pretty_abbr syn (ty, (vs, rhs)) = Pretty.block
wenzelm@620
   155
      [prt_typ syn (Type (ty, map (fn v => TVar ((v, 0), [])) vs)),
wenzelm@251
   156
        Pretty.str " =", Pretty.brk 1, prt_typ syn rhs];
wenzelm@251
   157
wenzelm@251
   158
    fun pretty_arity ty (cl, []) = Pretty.block
wenzelm@251
   159
          [Pretty.str (ty ^ " ::"), Pretty.brk 1, Pretty.str cl]
wenzelm@251
   160
      | pretty_arity ty (cl, srts) = Pretty.block
wenzelm@251
   161
          [Pretty.str (ty ^ " ::"), Pretty.brk 1,
wenzelm@251
   162
            Pretty.list "(" ")" (map pretty_sort srts),
wenzelm@251
   163
            Pretty.brk 1, Pretty.str cl];
wenzelm@251
   164
nipkow@963
   165
    fun pretty_arities (ty, ars) = map (pretty_arity ty) ars;
wenzelm@251
   166
wenzelm@251
   167
    fun pretty_const syn (c, ty) = Pretty.block
wenzelm@266
   168
      [Pretty.str (quote c ^ " ::"), Pretty.brk 1, prt_typ syn ty];
wenzelm@251
   169
wenzelm@251
   170
wenzelm@251
   171
    val Sg {tsig, const_tab, syn, stamps} = sg;
nipkow@963
   172
    val {classes, subclass, default, tycons, abbrs, arities} = rep_tsig tsig;
wenzelm@251
   173
  in
wenzelm@386
   174
    Pretty.writeln (Pretty.strs ("stamps:" :: stamp_names stamps));
wenzelm@251
   175
    Pretty.writeln (Pretty.strs ("classes:" :: classes));
nipkow@963
   176
    Pretty.writeln (Pretty.big_list "subclass:"
nipkow@963
   177
                      (map pretty_subclass subclass));
wenzelm@251
   178
    Pretty.writeln (pretty_default default);
nipkow@963
   179
    Pretty.writeln (Pretty.big_list "types:" (map pretty_ty tycons));
wenzelm@251
   180
    Pretty.writeln (Pretty.big_list "abbrs:" (map (pretty_abbr syn) abbrs));
nipkow@963
   181
    Pretty.writeln (Pretty.big_list "arities:"
nipkow@963
   182
                      (flat (map pretty_arities arities)));
wenzelm@251
   183
    Pretty.writeln (Pretty.big_list "consts:"
nipkow@963
   184
                      (map (pretty_const syn) (Symtab.dest const_tab)))
wenzelm@251
   185
  end;
wenzelm@251
   186
wenzelm@251
   187
wenzelm@562
   188
fun pretty_sg (Sg {stamps, ...}) =
wenzelm@562
   189
  Pretty.str_list "{" "}" (stamp_names stamps);
wenzelm@562
   190
wenzelm@562
   191
val pprint_sg = Pretty.pprint o pretty_sg;
wenzelm@251
   192
wenzelm@251
   193
wenzelm@251
   194
wenzelm@251
   195
(** pretty printing of terms and types **)
wenzelm@251
   196
clasohm@922
   197
fun pretty_term (Sg {syn, stamps, ...}) =
paulson@2138
   198
  let val curried = "CPure" mem_string (map ! stamps);
clasohm@922
   199
  in Syntax.pretty_term curried syn end;
clasohm@922
   200
wenzelm@251
   201
fun pretty_typ (Sg {syn, ...}) = Syntax.pretty_typ syn;
wenzelm@251
   202
wenzelm@1239
   203
fun string_of_term (Sg {syn, stamps, ...}) =
paulson@2138
   204
  let val curried = "CPure" mem_string (map ! stamps);
clasohm@922
   205
  in Syntax.string_of_term curried syn end;
clasohm@922
   206
wenzelm@251
   207
fun string_of_typ (Sg {syn, ...}) = Syntax.string_of_typ syn;
wenzelm@251
   208
wenzelm@251
   209
fun pprint_term sg = Pretty.pprint o Pretty.quote o (pretty_term sg);
wenzelm@251
   210
fun pprint_typ sg = Pretty.pprint o Pretty.quote o (pretty_typ sg);
clasohm@0
   211
clasohm@0
   212
wenzelm@169
   213
wenzelm@562
   214
(** read types **)  (*exception ERROR*)
wenzelm@562
   215
wenzelm@562
   216
fun err_in_type s =
wenzelm@562
   217
  error ("The error(s) above occurred in type " ^ quote s);
wenzelm@562
   218
wenzelm@562
   219
fun read_raw_typ syn tsig sort_of str =
wenzelm@562
   220
  Syntax.read_typ syn (fn x => if_none (sort_of x) (defaultS tsig)) str
wenzelm@562
   221
    handle ERROR => err_in_type str;
wenzelm@562
   222
wenzelm@562
   223
(*read and certify typ wrt a signature*)
wenzelm@562
   224
fun read_typ (Sg {tsig, syn, ...}, sort_of) str =
wenzelm@562
   225
  cert_typ tsig (read_raw_typ syn tsig sort_of str)
wenzelm@562
   226
    handle TYPE (msg, _, _) => (writeln msg; err_in_type str);
wenzelm@562
   227
wenzelm@562
   228
wenzelm@562
   229
wenzelm@386
   230
(** certify types and terms **)   (*exception TYPE*)
wenzelm@251
   231
wenzelm@251
   232
fun certify_typ (Sg {tsig, ...}) ty = cert_typ tsig ty;
wenzelm@251
   233
nipkow@1494
   234
(* check for duplicate TVars with distinct sorts *)
nipkow@1494
   235
fun nodup_TVars(tvars,T) = (case T of
paulson@2144
   236
      Type(_,Ts) => nodup_TVars_list (tvars,Ts)
nipkow@1494
   237
    | TFree _ => tvars
nipkow@1494
   238
    | TVar(v as (a,S)) =>
berghofe@1576
   239
        (case assoc_string_int(tvars,a) of
nipkow@1494
   240
           Some(S') => if S=S' then tvars
nipkow@1494
   241
                       else raise_type
nipkow@1494
   242
                            ("Type variable "^Syntax.string_of_vname a^
paulson@1890
   243
                             " has two distinct sorts") [TVar(a,S'),T] []
paulson@2144
   244
         | None => v::tvars))
paulson@2144
   245
and (*equivalent to foldl nodup_TVars_list, but 3X faster under Poly/ML*)
paulson@2144
   246
    nodup_TVars_list (tvars,[]) = tvars
paulson@2144
   247
  | nodup_TVars_list (tvars,T::Ts) = nodup_TVars_list(nodup_TVars(tvars,T), 
paulson@2144
   248
						      Ts);
nipkow@1494
   249
nipkow@1494
   250
(* check for duplicate Vars with distinct types *)
nipkow@1494
   251
fun nodup_Vars tm =
nipkow@1494
   252
let fun nodups vars tvars tm = (case tm of
nipkow@1494
   253
          Const(c,T) => (vars, nodup_TVars(tvars,T))
nipkow@1494
   254
        | Free(a,T) => (vars, nodup_TVars(tvars,T))
nipkow@1494
   255
        | Var(v as (ixn,T)) =>
berghofe@1576
   256
            (case assoc_string_int(vars,ixn) of
nipkow@1494
   257
               Some(T') => if T=T' then (vars,nodup_TVars(tvars,T))
nipkow@1494
   258
                           else raise_type
nipkow@1494
   259
                             ("Variable "^Syntax.string_of_vname ixn^
paulson@1890
   260
                              " has two distinct types") [T',T] []
nipkow@1494
   261
             | None => (v::vars,tvars))
nipkow@1494
   262
        | Bound _ => (vars,tvars)
nipkow@1494
   263
        | Abs(_,T,t) => nodups vars (nodup_TVars(tvars,T)) t
nipkow@1494
   264
        | s$t => let val (vars',tvars') = nodups vars tvars s
nipkow@1494
   265
                 in nodups vars' tvars' t end);
nipkow@1494
   266
in nodups [] [] tm; () end;
wenzelm@251
   267
wenzelm@386
   268
fun mapfilt_atoms f (Abs (_, _, t)) = mapfilt_atoms f t
wenzelm@386
   269
  | mapfilt_atoms f (t $ u) = mapfilt_atoms f t @ mapfilt_atoms f u
wenzelm@386
   270
  | mapfilt_atoms f a = (case f a of Some y => [y] | None => []);
clasohm@0
   271
wenzelm@386
   272
fun certify_term (sg as Sg {tsig, ...}) tm =
wenzelm@251
   273
  let
wenzelm@251
   274
    fun valid_const a T =
wenzelm@386
   275
      (case const_type sg a of
wenzelm@251
   276
        Some U => typ_instance (tsig, T, U)
wenzelm@251
   277
      | _ => false);
wenzelm@169
   278
wenzelm@251
   279
    fun atom_err (Const (a, T)) =
wenzelm@251
   280
          if valid_const a T then None
wenzelm@251
   281
          else Some ("Illegal type for constant " ^ quote a ^ " :: " ^
wenzelm@251
   282
            quote (string_of_typ sg T))
wenzelm@251
   283
      | atom_err (Var ((x, i), _)) =
wenzelm@251
   284
          if i < 0 then Some ("Negative index for Var " ^ quote x) else None
wenzelm@251
   285
      | atom_err _ = None;
wenzelm@251
   286
wenzelm@251
   287
    val norm_tm =
wenzelm@251
   288
      (case it_term_types (typ_errors tsig) (tm, []) of
wenzelm@251
   289
        [] => map_term_types (norm_typ tsig) tm
wenzelm@251
   290
      | errs => raise_type (cat_lines errs) [] [tm]);
nipkow@1494
   291
    val _ = nodup_Vars norm_tm;
wenzelm@251
   292
  in
wenzelm@386
   293
    (case mapfilt_atoms atom_err norm_tm of
wenzelm@251
   294
      [] => (norm_tm, type_of norm_tm, maxidx_of_term norm_tm)
wenzelm@251
   295
    | errs => raise_type (cat_lines errs) [] [norm_tm])
wenzelm@251
   296
  end;
wenzelm@251
   297
wenzelm@251
   298
paulson@1393
   299
(*Package error messages from type checking*)
paulson@1393
   300
fun exn_type_msg sg (msg, Ts, ts) =
paulson@1393
   301
    let val show_typ = string_of_typ sg
clasohm@1460
   302
	val show_term = string_of_term sg
clasohm@1460
   303
	fun term_err [] = ""
clasohm@1460
   304
	  | term_err [t] = "\nInvolving this term:\n" ^ show_term t
clasohm@1460
   305
	  | term_err ts =
clasohm@1460
   306
	    "\nInvolving these terms:\n" ^ cat_lines (map show_term ts);
paulson@1393
   307
    in  "\nType checking error: " ^ msg ^ "\n" ^
clasohm@1460
   308
	cat_lines (map show_typ Ts) ^ term_err ts ^ "\n"
paulson@1393
   309
    end; 
paulson@1393
   310
paulson@1393
   311
wenzelm@251
   312
wenzelm@583
   313
(** infer_types **)         (*exception ERROR*)
wenzelm@251
   314
paulson@1393
   315
(*ts is the list of alternative parses; only one is hoped to be type-correct.
paulson@1393
   316
  T is the expected type for the correct term.
paulson@1393
   317
  Other standard arguments:
paulson@1393
   318
    types is a partial map from indexnames to types (constrains Free, Var).
paulson@1393
   319
    sorts is a partial map from indexnames to sorts (constrains TFree, TVar).
paulson@1393
   320
    used is the list of already used type variables.
paulson@1393
   321
    If freeze then internal TVars are turned into TFrees, else TVars.*)
clasohm@959
   322
fun infer_types sg types sorts used freeze (ts, T) =
wenzelm@251
   323
  let
wenzelm@562
   324
    val Sg {tsig, ...} = sg;
wenzelm@169
   325
paulson@1393
   326
    val T' = certify_typ sg T handle TYPE arg => error (exn_type_msg sg arg);
clasohm@623
   327
clasohm@623
   328
    val ct = const_type sg;
clasohm@623
   329
nipkow@952
   330
    fun warn() =
nipkow@952
   331
      if length ts > 1 andalso length ts <= !Syntax.ambiguity_level
nipkow@952
   332
      then (*no warning shown yet*)
berghofe@1580
   333
           warning "Currently parsed input \
nipkow@952
   334
                   \produces more than one parse tree.\n\
nipkow@952
   335
                   \For more information lower Syntax.ambiguity_level."
nipkow@952
   336
      else ();
clasohm@623
   337
nipkow@952
   338
    datatype result = One of int * term * (indexname * typ) list
nipkow@952
   339
                    | Errs of (string * typ list * term list)list
nipkow@952
   340
                    | Ambigs of term list;
clasohm@623
   341
nipkow@952
   342
    fun process_term(res,(t,i)) =
paulson@1393
   343
       let val ([u],tye) = 
clasohm@1460
   344
	       Type.infer_types(tsig,ct,types,sorts,used,freeze,[T'],[t])
nipkow@952
   345
       in case res of
nipkow@952
   346
            One(_,t0,_) => Ambigs([u,t0])
nipkow@952
   347
          | Errs _ => One(i,u,tye)
nipkow@952
   348
          | Ambigs(us) => Ambigs(u::us)
nipkow@952
   349
       end
nipkow@952
   350
       handle TYPE arg => (case res of Errs(errs) => Errs(arg::errs)
nipkow@952
   351
                                     | _ => res);
clasohm@623
   352
nipkow@952
   353
  in case foldl process_term (Errs[], ts ~~ (0 upto (length ts - 1))) of
nipkow@952
   354
       One(res) =>
nipkow@952
   355
         (if length ts > !Syntax.ambiguity_level
nipkow@952
   356
          then writeln "Fortunately, only one parse tree is type correct.\n\
nipkow@952
   357
            \It helps (speed!) if you disambiguate your grammar or your input."
nipkow@952
   358
          else ();
nipkow@952
   359
          res)
paulson@1393
   360
     | Errs(errs) => (warn(); error(cat_lines(map (exn_type_msg sg) errs)))
nipkow@952
   361
     | Ambigs(us) =>
nipkow@952
   362
         (warn();
nipkow@952
   363
          let val old_show_brackets = !show_brackets
clasohm@1178
   364
              val dummy = show_brackets := true;
paulson@1393
   365
              val errs = cat_lines(map (string_of_term sg) us)
nipkow@952
   366
          in show_brackets := old_show_brackets;
nipkow@952
   367
             error("Error: More than one term is type correct:\n" ^ errs)
nipkow@952
   368
          end)
clasohm@623
   369
  end;
wenzelm@251
   370
wenzelm@251
   371
clasohm@623
   372
(** extend signature **)    (*exception ERROR*)
clasohm@623
   373
wenzelm@620
   374
(** signature extension functions **)  (*exception ERROR*)
wenzelm@386
   375
wenzelm@386
   376
fun decls_of name_of mfixs =
wenzelm@386
   377
  map (fn (x, y, mx) => (name_of x mx, y)) mfixs;
wenzelm@386
   378
wenzelm@386
   379
wenzelm@386
   380
(* add default sort *)
wenzelm@386
   381
wenzelm@386
   382
fun ext_defsort (syn, tsig, ctab) defsort =
wenzelm@386
   383
  (syn, ext_tsig_defsort tsig defsort, ctab);
wenzelm@386
   384
wenzelm@386
   385
wenzelm@386
   386
(* add type constructors *)
wenzelm@386
   387
wenzelm@386
   388
fun ext_types (syn, tsig, ctab) types =
wenzelm@386
   389
  (Syntax.extend_type_gram syn types,
wenzelm@562
   390
    ext_tsig_types tsig (decls_of Syntax.type_name types),
wenzelm@386
   391
    ctab);
wenzelm@386
   392
wenzelm@386
   393
wenzelm@386
   394
(* add type abbreviations *)
wenzelm@386
   395
wenzelm@386
   396
fun read_abbr syn tsig (t, vs, rhs_src) =
wenzelm@386
   397
  (t, vs, read_raw_typ syn tsig (K None) rhs_src)
wenzelm@386
   398
    handle ERROR => error ("in type abbreviation " ^ t);
wenzelm@386
   399
wenzelm@386
   400
fun ext_abbrs rd_abbr (syn, tsig, ctab) abbrs =
wenzelm@386
   401
  let
wenzelm@386
   402
    fun mfix_of (t, vs, _, mx) = (t, length vs, mx);
wenzelm@386
   403
    val syn1 = Syntax.extend_type_gram syn (map mfix_of abbrs);
wenzelm@386
   404
wenzelm@386
   405
    fun decl_of (t, vs, rhs, mx) =
wenzelm@562
   406
      rd_abbr syn1 tsig (Syntax.type_name t mx, vs, rhs);
wenzelm@386
   407
  in
wenzelm@386
   408
    (syn1, ext_tsig_abbrs tsig (map decl_of abbrs), ctab)
wenzelm@386
   409
  end;
wenzelm@386
   410
wenzelm@386
   411
val ext_tyabbrs_i = ext_abbrs (K (K I));
wenzelm@386
   412
val ext_tyabbrs = ext_abbrs read_abbr;
wenzelm@386
   413
wenzelm@386
   414
wenzelm@386
   415
(* add type arities *)
wenzelm@386
   416
wenzelm@386
   417
fun ext_arities (syn, tsig, ctab) arities =
wenzelm@386
   418
  let
wenzelm@386
   419
    val tsig1 = ext_tsig_arities tsig arities;
wenzelm@386
   420
    val log_types = logical_types tsig1;
wenzelm@386
   421
  in
wenzelm@386
   422
    (Syntax.extend_log_types syn log_types, tsig1, ctab)
wenzelm@386
   423
  end;
wenzelm@386
   424
wenzelm@386
   425
wenzelm@386
   426
(* add term constants and syntax *)
wenzelm@386
   427
wenzelm@386
   428
fun err_in_const c =
wenzelm@386
   429
  error ("in declaration of constant " ^ quote c);
wenzelm@386
   430
wenzelm@386
   431
fun err_dup_consts cs =
wenzelm@386
   432
  error ("Duplicate declaration of constant(s) " ^ commas_quote cs);
wenzelm@386
   433
wenzelm@251
   434
wenzelm@386
   435
fun read_const syn tsig (c, ty_src, mx) =
wenzelm@386
   436
  (c, read_raw_typ syn tsig (K None) ty_src, mx)
wenzelm@562
   437
    handle ERROR => err_in_const (Syntax.const_name c mx);
wenzelm@386
   438
wenzelm@386
   439
fun ext_cnsts rd_const syn_only (syn, tsig, ctab) raw_consts =
wenzelm@386
   440
  let
paulson@1414
   441
    fun prep_const (c, ty, mx) = 
clasohm@1460
   442
	  (c, 
clasohm@1460
   443
	   compress_type (varifyT (cert_typ tsig (no_tvars ty))), 
clasohm@1460
   444
	   mx)
wenzelm@562
   445
      handle TYPE (msg, _, _) => (writeln msg; err_in_const (Syntax.const_name c mx));
wenzelm@386
   446
wenzelm@386
   447
    val consts = map (prep_const o rd_const syn tsig) raw_consts;
wenzelm@386
   448
    val decls =
wenzelm@386
   449
      if syn_only then []
wenzelm@562
   450
      else filter_out (equal "" o fst) (decls_of Syntax.const_name consts);
wenzelm@386
   451
  in
wenzelm@386
   452
    (Syntax.extend_const_gram syn consts, tsig,
wenzelm@386
   453
      Symtab.extend_new (ctab, decls)
wenzelm@386
   454
        handle Symtab.DUPS cs => err_dup_consts cs)
wenzelm@386
   455
  end;
wenzelm@386
   456
wenzelm@386
   457
val ext_consts_i = ext_cnsts (K (K I)) false;
wenzelm@386
   458
val ext_consts = ext_cnsts read_const false;
wenzelm@386
   459
val ext_syntax_i = ext_cnsts (K (K I)) true;
wenzelm@386
   460
val ext_syntax = ext_cnsts read_const true;
wenzelm@386
   461
wenzelm@386
   462
wenzelm@386
   463
(* add type classes *)
wenzelm@386
   464
wenzelm@386
   465
fun const_of_class c = c ^ "_class";
wenzelm@386
   466
wenzelm@386
   467
fun class_of_const c_class =
wenzelm@386
   468
  let
wenzelm@386
   469
    val c = implode (take (size c_class - 6, explode c_class));
wenzelm@386
   470
  in
wenzelm@386
   471
    if const_of_class c = c_class then c
wenzelm@386
   472
    else raise_term ("class_of_const: bad name " ^ quote c_class) []
wenzelm@386
   473
  end;
wenzelm@386
   474
wenzelm@386
   475
wenzelm@386
   476
fun ext_classes (syn, tsig, ctab) classes =
wenzelm@386
   477
  let
wenzelm@562
   478
    val names = map fst classes;
wenzelm@386
   479
    val consts =
wenzelm@386
   480
      map (fn c => (const_of_class c, a_itselfT --> propT, NoSyn)) names;
wenzelm@386
   481
  in
wenzelm@386
   482
    ext_consts_i
wenzelm@386
   483
      (Syntax.extend_consts syn names, ext_tsig_classes tsig classes, ctab)
wenzelm@386
   484
      consts
wenzelm@386
   485
  end;
wenzelm@386
   486
wenzelm@386
   487
wenzelm@421
   488
(* add to subclass relation *)
wenzelm@421
   489
wenzelm@421
   490
fun ext_classrel (syn, tsig, ctab) pairs =
wenzelm@421
   491
  (syn, ext_tsig_subclass tsig pairs, ctab);
wenzelm@421
   492
wenzelm@421
   493
wenzelm@1159
   494
(* add to syntax *)
wenzelm@386
   495
wenzelm@1159
   496
fun ext_syn extfun (syn, tsig, ctab) args =
wenzelm@1159
   497
  (extfun syn args, tsig, ctab);
wenzelm@386
   498
wenzelm@386
   499
wenzelm@386
   500
(* build signature *)
wenzelm@386
   501
wenzelm@386
   502
fun ext_stamps stamps name =
wenzelm@386
   503
  let
wenzelm@386
   504
    val stmps = (case stamps of ref "#" :: ss => ss | ss => ss);
wenzelm@386
   505
  in
wenzelm@386
   506
    if exists (equal name o !) stmps then
wenzelm@386
   507
      error ("Theory already contains a " ^ quote name ^ " component")
wenzelm@402
   508
    else ref name :: stmps
wenzelm@386
   509
  end;
wenzelm@386
   510
wenzelm@386
   511
fun make_sign (syn, tsig, ctab) stamps name =
wenzelm@386
   512
  Sg {tsig = tsig, const_tab = ctab, syn = syn,
wenzelm@386
   513
    stamps = ext_stamps stamps name};
wenzelm@386
   514
wenzelm@386
   515
fun extend_sign extfun name decls (Sg {tsig, const_tab, syn, stamps}) =
wenzelm@386
   516
  make_sign (extfun (syn, tsig, const_tab) decls) stamps name;
wenzelm@386
   517
wenzelm@386
   518
wenzelm@386
   519
(* the external interfaces *)
wenzelm@386
   520
wenzelm@386
   521
val add_classes   = extend_sign ext_classes "#";
wenzelm@421
   522
val add_classrel  = extend_sign ext_classrel "#";
wenzelm@386
   523
val add_defsort   = extend_sign ext_defsort "#";
wenzelm@386
   524
val add_types     = extend_sign ext_types "#";
wenzelm@386
   525
val add_tyabbrs   = extend_sign ext_tyabbrs "#";
wenzelm@386
   526
val add_tyabbrs_i = extend_sign ext_tyabbrs_i "#";
wenzelm@386
   527
val add_arities   = extend_sign ext_arities "#";
wenzelm@386
   528
val add_consts    = extend_sign ext_consts "#";
wenzelm@386
   529
val add_consts_i  = extend_sign ext_consts_i "#";
wenzelm@386
   530
val add_syntax    = extend_sign ext_syntax "#";
wenzelm@386
   531
val add_syntax_i  = extend_sign ext_syntax_i "#";
wenzelm@1159
   532
val add_trfuns    = extend_sign (ext_syn Syntax.extend_trfuns) "#";
wenzelm@1159
   533
val add_trrules   = extend_sign (ext_syn Syntax.extend_trrules) "#";
wenzelm@1159
   534
val add_trrules_i = extend_sign (ext_syn Syntax.extend_trrules_i) "#";
wenzelm@386
   535
wenzelm@386
   536
fun add_name name sg = extend_sign K name () sg;
wenzelm@386
   537
val make_draft = add_name "#";
wenzelm@386
   538
wenzelm@386
   539
wenzelm@386
   540
wenzelm@620
   541
(** merge signatures **)    (*exception TERM*) (*exception ERROR (* FIXME *)*)
wenzelm@143
   542
wenzelm@251
   543
fun merge (sg1, sg2) =
wenzelm@251
   544
  if subsig (sg2, sg1) then sg1
wenzelm@251
   545
  else if subsig (sg1, sg2) then sg2
wenzelm@386
   546
  else if is_draft sg1 orelse is_draft sg2 then
wenzelm@386
   547
    raise_term "Illegal merge of draft signatures" []
wenzelm@251
   548
  else
wenzelm@251
   549
    (*neither is union already; must form union*)
wenzelm@251
   550
    let
wenzelm@251
   551
      val Sg {tsig = tsig1, const_tab = const_tab1, syn = syn1,
wenzelm@251
   552
        stamps = stamps1} = sg1;
wenzelm@251
   553
      val Sg {tsig = tsig2, const_tab = const_tab2, syn = syn2,
wenzelm@251
   554
        stamps = stamps2} = sg2;
wenzelm@251
   555
wenzelm@386
   556
wenzelm@402
   557
      val stamps = merge_rev_lists stamps1 stamps2;
wenzelm@402
   558
      val _ =
wenzelm@402
   559
        (case duplicates (stamp_names stamps) of
wenzelm@402
   560
          [] => ()
wenzelm@402
   561
        | dups => raise_term ("Attempt to merge different versions of theories "
wenzelm@402
   562
            ^ commas_quote dups) []);
wenzelm@402
   563
wenzelm@251
   564
      val tsig = merge_tsigs (tsig1, tsig2);
wenzelm@251
   565
wenzelm@251
   566
      val const_tab = Symtab.merge (op =) (const_tab1, const_tab2)
wenzelm@386
   567
        handle Symtab.DUPS cs =>
wenzelm@386
   568
          raise_term ("Incompatible types for constant(s) " ^ commas_quote cs) [];
wenzelm@386
   569
wenzelm@386
   570
      val syn = Syntax.merge_syntaxes syn1 syn2;
wenzelm@251
   571
    in
wenzelm@251
   572
      Sg {tsig = tsig, const_tab = const_tab, syn = syn, stamps = stamps}
wenzelm@251
   573
    end;
wenzelm@143
   574
clasohm@0
   575
clasohm@0
   576
wenzelm@251
   577
(** the Pure signature **)
clasohm@0
   578
clasohm@922
   579
val proto_pure =
clasohm@763
   580
  make_sign (Syntax.pure_syn, tsig0, Symtab.null) [] "#"
wenzelm@410
   581
  |> add_types
wenzelm@386
   582
   (("fun", 2, NoSyn) ::
wenzelm@386
   583
    ("prop", 0, NoSyn) ::
wenzelm@386
   584
    ("itself", 1, NoSyn) ::
wenzelm@562
   585
    Syntax.pure_types)
wenzelm@562
   586
  |> add_classes [(logicC, [])]
wenzelm@410
   587
  |> add_defsort logicS
wenzelm@410
   588
  |> add_arities
wenzelm@386
   589
   [("fun", [logicS, logicS], logicS),
wenzelm@386
   590
    ("prop", [], logicS),
wenzelm@386
   591
    ("itself", [logicS], logicS)]
wenzelm@562
   592
  |> add_syntax Syntax.pure_syntax
wenzelm@410
   593
  |> add_trfuns Syntax.pure_trfuns
wenzelm@410
   594
  |> add_consts
wenzelm@386
   595
   [("==", "['a::{}, 'a] => prop", Mixfix ("(_ ==/ _)", [3, 2], 2)),
wenzelm@386
   596
    ("=?=", "['a::{}, 'a] => prop", Mixfix ("(_ =?=/ _)", [3, 2], 2)),
paulson@2095
   597
    ("==>", "[prop, prop] => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)),
clasohm@865
   598
    ("all", "('a => prop) => prop", Binder ("!!", 0, 0)),
wenzelm@573
   599
    ("TYPE", "'a itself", NoSyn)]
clasohm@922
   600
  |> add_name "ProtoPure";
clasohm@922
   601
clasohm@922
   602
val pure = proto_pure
clasohm@1180
   603
  |> add_syntax Syntax.pure_appl_syntax
wenzelm@410
   604
  |> add_name "Pure";
clasohm@0
   605
clasohm@922
   606
val cpure = proto_pure
clasohm@1180
   607
  |> add_syntax Syntax.pure_applC_syntax
clasohm@922
   608
  |> add_name "CPure";
clasohm@0
   609
paulson@1501
   610
end
clasohm@0
   611
end;