19

1 
(* Title: Pure/sign.ML

0

2 
ID: $Id$

19

3 
Author: Lawrence C Paulson, Cambridge University Computer Laboratory

0

4 
Copyright 1992 University of Cambridge


5 

143

6 
The abstract types "sg" (signatures) and "cterm" / "ctyp" (certified terms /


7 
typs under a signature).

0

8 
*)


9 

19

10 
signature SIGN =

0

11 
sig


12 
structure Type: TYPE


13 
structure Symtab: SYMTAB


14 
structure Syntax: SYNTAX

143

15 
sharing Symtab = Type.Symtab

0

16 
type sg


17 
type cterm


18 
type ctyp


19 
val cfun: (term > term) > (cterm > cterm)


20 
val cterm_of: sg > term > cterm


21 
val ctyp_of: sg > typ > ctyp


22 
val extend: sg > string >

19

23 
(class * class list) list * class list *


24 
(string list * int) list *


25 
(string list * (sort list * class)) list *


26 
(string list * string)list * Syntax.sext option > sg

0

27 
val merge: sg * sg > sg


28 
val pure: sg


29 
val read_cterm: sg > string * typ > cterm


30 
val read_ctyp: sg > string > ctyp


31 
val read_insts: sg > (indexname > typ option) * (indexname > sort option)

19

32 
> (indexname > typ option) * (indexname > sort option)


33 
> (string*string)list


34 
> (indexname*ctyp)list * (cterm*cterm)list

0

35 
val read_typ: sg * (indexname > sort option) > string > typ


36 
val rep_cterm: cterm > {T: typ, t: term, sign: sg, maxidx: int}


37 
val rep_ctyp: ctyp > {T: typ, sign: sg}


38 
val rep_sg: sg > {tsig: Type.type_sig,

19

39 
const_tab: typ Symtab.table,


40 
syn: Syntax.syntax,


41 
stamps: string ref list}

0

42 
val string_of_cterm: cterm > string


43 
val string_of_ctyp: ctyp > string


44 
val pprint_cterm: cterm > pprint_args > unit


45 
val pprint_ctyp: ctyp > pprint_args > unit


46 
val string_of_term: sg > term > string


47 
val string_of_typ: sg > typ > string


48 
val pprint_term: sg > term > pprint_args > unit


49 
val pprint_typ: sg > typ > pprint_args > unit


50 
val term_of: cterm > term


51 
val typ_of: ctyp > typ


52 
val pretty_term: sg > term > Syntax.Pretty.T


53 
end;


54 

143

55 
functor SignFun(structure Type: TYPE and Syntax: SYNTAX): SIGN =


56 
struct

0

57 


58 
structure Type = Type;


59 
structure Symtab = Type.Symtab;


60 
structure Syntax = Syntax;


61 
structure Pretty = Syntax.Pretty


62 

143

63 


64 
(* Signatures of theories. *)


65 

19

66 
datatype sg =

143

67 
Sg of {


68 
tsig: Type.type_sig, (*ordersorted signature of types*)


69 
const_tab: typ Symtab.table, (*types of constants*)


70 
syn: Syntax.syntax, (*syntax for parsing and printing*)


71 
stamps: string ref list}; (*unique theory indentifier*)

0

72 


73 


74 
fun rep_sg (Sg args) = args;


75 


76 
fun string_of_typ(Sg{tsig,syn,...}) = Syntax.string_of_typ syn;


77 


78 
fun pprint_typ(Sg{syn,...}) = Pretty.pprint o Pretty.quote o (Syntax.pretty_typ syn);


79 


80 
(*Is constant present in table with more generic type?*)


81 
fun valid_const tsig ctab (a,T) = case Symtab.lookup(ctab, a) of

19

82 
Some U => Type.typ_instance(tsig,T,U)  _ => false;

0

83 


84 


85 
(*Check a term for errors. Are all constants and types valid in signature?


86 
Does not check that term is welltyped!*)

19

87 
fun term_errors (sign as Sg{tsig,const_tab,...}) =

0

88 
let val showtyp = string_of_typ sign;


89 
fun terrs (Const (a,T), errs) =

19

90 
if valid_const tsig const_tab (a,T)


91 
then Type.type_errors (tsig,showtyp) (T,errs)


92 
else ("Illegal type for constant: " ^ a ^ ": " ^ showtyp T) :: errs

0

93 
 terrs (Free (_,T), errs) = Type.type_errors (tsig,showtyp) (T,errs)


94 
 terrs (Var ((a,i),T), errs) =

19

95 
if i>=0 then Type.type_errors (tsig,showtyp) (T,errs)


96 
else ("Negative index for Var: " ^ a) :: errs

0

97 
 terrs (Bound _, errs) = errs (*loose bvars detected by type_of*)

19

98 
 terrs (Abs (_,T,t), errs) =


99 
Type.type_errors(tsig,showtyp)(T,terrs(t,errs))

0

100 
 terrs (f$t, errs) = terrs(f, terrs (t,errs))


101 
in terrs end;


102 


103 


104 
(** The Extend operation **)


105 


106 
(*Reset TVar indices to zero, renaming to preserve distinctness*)

19

107 
fun zero_tvar_indices tsig T =

0

108 
let val inxSs = typ_tvars T;


109 
val nms' = variantlist(map (#1 o #1) inxSs,[]);


110 
val tye = map (fn ((v,S),a) => (v, TVar((a,0),S))) (inxSs ~~ nms')


111 
in typ_subst_TVars tye T end


112 

143

113 

0

114 
(*Check that all types mentioned in the list of declarations are valid.


115 
If errors found then raise exception.


116 
Zero type var indices because type inference requires it.


117 
*)


118 
fun read_consts(tsig,syn) =


119 
let val showtyp = Syntax.string_of_typ syn;


120 
fun read [] = []


121 
 read((cs,s)::pairs) =

19

122 
let val t = Syntax.read syn Syntax.typeT s handle ERROR =>


123 
error("The error above occurred in type " ^ quote s);


124 
val S = Type.defaultS tsig;


125 
val T = Type.varifyT(Syntax.typ_of_term (K S) t)


126 
val T0 = zero_tvar_indices tsig T;


127 
in (case Type.type_errors (tsig,showtyp) (T0,[]) of


128 
[] => (cs,T0) :: read pairs


129 
 errs => error (cat_lines


130 
(("Error in type of constants " ^ space_implode " " cs) :: errs)))


131 
end

0

132 
in read end;


133 


134 


135 
(*Extend a signature: may add classes, types and constants.


136 
Replaces syntax with "syn".


137 
The "ref" in stamps ensures that no two signatures are identical 

143

138 
it is impossible to forge a signature. *)


139 


140 
fun extend (Sg {tsig, const_tab, syn, stamps}) signame

155

141 
(classes, default, types, arities, const_decs, osext) =

143

142 
let


143 
(* FIXME abbr *)

155

144 
val tsig' = Type.extend (tsig, classes, default, types, arities);

143

145 


146 
(* FIXME expand_typ, check typ *)


147 
val read_ty = Syntax.read_typ syn (K (Type.defaultS tsig'));


148 

155

149 
val roots = filter (Type.logical_type tsig') (distinct (flat (map #1 arities)));


150 
val xconsts = map #1 classes @ flat (map #1 types) @ flat (map #1 const_decs);

0

151 
val syn' =

143

152 
(case osext of


153 
Some sext => Syntax.extend syn read_ty (roots, xconsts, sext)


154 
 None =>


155 
if null roots andalso null xconsts then syn


156 
else Syntax.extend syn read_ty (roots, xconsts, Syntax.empty_sext));


157 
val sconsts =


158 
(case osext of


159 
Some sext => Syntax.constants sext


160 
 None => []);


161 
val const_decs' = read_consts (tsig', syn') (sconsts @ const_decs);


162 
in


163 
Sg {


164 
tsig = tsig',


165 
const_tab = Symtab.st_of_declist (const_decs', const_tab)


166 
handle Symtab.DUPLICATE a => error ("Constant " ^ quote a ^ " declared twice"),


167 
syn = syn',


168 
stamps = ref signame :: stamps}


169 
end;

0

170 


171 


172 
(* The empty signature *)

143

173 


174 
val sg0 = Sg {tsig = Type.tsig0,


175 
const_tab = Symtab.null, syn = Syntax.type_syn, stamps= []};

0

176 

143

177 


178 
(* The pure signature *)


179 


180 
val pure = extend sg0 "Pure"

0

181 
([("logic", [])],


182 
["logic"],

143

183 
[(["fun"], 2),


184 
(["prop"], 0),


185 
(Syntax.syntax_types, 0)],

0

186 
[(["fun"], ([["logic"], ["logic"]], "logic")),


187 
(["prop"], ([], "logic"))],

155

188 
[([Syntax.constrainC], "'a::logic => 'a")], (* MMW FIXME replace logic by {} (?) *)

143

189 
Some Syntax.pure_sext);


190 

0

191 


192 


193 
(** The Merge operation **)


194 


195 
(*Update table with (a,x) providing any existing asgt to "a" equals x. *)


196 
fun update_eq ((a,x),tab) =


197 
case Symtab.lookup(tab,a) of

19

198 
None => Symtab.update((a,x), tab)


199 
 Some y => if x=y then tab


200 
else raise TERM ("Incompatible types for constant: "^a, []);

0

201 


202 
(*Combine tables, updating tab2 by tab1 and checking.*)

19

203 
fun merge_tabs (tab1,tab2) =

0

204 
Symtab.balance (foldr update_eq (Symtab.alist_of tab1, tab2));


205 


206 
(*Combine tables, overwriting tab2 with tab1.*)

19

207 
fun smash_tabs (tab1,tab2) =

0

208 
Symtab.balance (foldr Symtab.update (Symtab.alist_of tab1, tab2));


209 


210 
(*Combine stamps, checking that theory names are disjoint. *)

19

211 
fun merge_stamps (stamps1,stamps2) =

0

212 
let val stamps = stamps1 union stamps2 in


213 
case findrep (map ! stamps) of


214 
a::_ => error ("Attempt to merge different versions of theory: " ^ a)


215 
 [] => stamps


216 
end;


217 


218 
(*Merge two signatures. Forms unions of tables. Prefers sign1. *)


219 
fun merge (sign1 as Sg{tsig=tsig1,const_tab=ctab1,stamps=stamps1,syn=syn1},

19

220 
sign2 as Sg{tsig=tsig2,const_tab=ctab2,stamps=stamps2,syn=syn2}) =

0

221 
if stamps2 subset stamps1 then sign1


222 
else if stamps1 subset stamps2 then sign2


223 
else (*neither is union already; must form union*)

19

224 
Sg{tsig= Type.merge(tsig1,tsig2),


225 
const_tab= merge_tabs (ctab1, ctab2),


226 
stamps= merge_stamps (stamps1,stamps2),


227 
syn = Syntax.merge(syn1,syn2)};

0

228 


229 


230 
(**** CERTIFIED TYPES ****)


231 


232 


233 
(*Certified typs under a signature*)


234 
datatype ctyp = Ctyp of {sign: sg, T: typ};


235 


236 
fun rep_ctyp(Ctyp ctyp) = ctyp;


237 


238 
fun typ_of (Ctyp{sign,T}) = T;


239 


240 
fun ctyp_of (sign as Sg{tsig,...}) T =

19

241 
case Type.type_errors (tsig,string_of_typ sign) (T,[]) of


242 
[] => Ctyp{sign= sign,T= T}


243 
 errs => error (cat_lines ("Error in type:" :: errs));

0

244 


245 
(*The only use is a horrible hack in the simplifier!*)


246 
fun read_typ(Sg{tsig,syn,...}, defS) s =


247 
let val term = Syntax.read syn Syntax.typeT s;

19

248 
val S0 = Type.defaultS tsig;


249 
fun defS0 s = case defS s of Some S => S  None => S0;

0

250 
in Syntax.typ_of_term defS0 term end;


251 


252 
fun read_ctyp sign = ctyp_of sign o read_typ(sign, K None);


253 


254 
fun string_of_ctyp (Ctyp{sign,T}) = string_of_typ sign T;


255 


256 
fun pprint_ctyp (Ctyp{sign,T}) = pprint_typ sign T;


257 


258 


259 
(**** CERTIFIED TERMS ****)


260 


261 
(*Certified terms under a signature, with checked typ and maxidx of Vars*)


262 
datatype cterm = Cterm of {sign: sg, t: term, T: typ, maxidx: int};


263 


264 
fun rep_cterm (Cterm args) = args;


265 


266 
(*Return the underlying term*)


267 
fun term_of (Cterm{sign,t,T,maxidx}) = t;


268 


269 
(** pretty printing of terms **)


270 


271 
fun pretty_term (Sg{tsig,syn,...}) = Syntax.pretty_term syn;


272 


273 
fun string_of_term sign t = Pretty.string_of (pretty_term sign t);


274 


275 
fun pprint_term sign = Pretty.pprint o Pretty.quote o (pretty_term sign);


276 


277 
fun string_of_cterm (Cterm{sign,t,...}) = string_of_term sign t;


278 


279 
fun pprint_cterm (Cterm{sign,t,...}) = pprint_term sign t;


280 


281 
(*Create a cterm by checking a "raw" term with respect to a signature*)


282 
fun cterm_of sign t =


283 
case term_errors sign (t,[]) of


284 
[] => Cterm{sign=sign, t=t, T= type_of t, maxidx= maxidx_of_term t}


285 
 errs => raise TERM(cat_lines("Term not in signature"::errs), [t]);


286 


287 
fun cfun f = fn Cterm{sign,t,...} => cterm_of sign (f t);


288 


289 
(*Lexing, parsing, polymorphic typechecking of a term.*)


290 
fun read_def_cterm (sign as Sg{tsig, const_tab, syn,...}, types, sorts)

19

291 
(a,T) =

0

292 
let val showtyp = string_of_typ sign


293 
and showterm = string_of_term sign


294 
fun termerr [] = ""

19

295 
 termerr [t] = "\nInvolving this term:\n" ^ showterm t ^ "\n"


296 
 termerr ts = "\nInvolving these terms:\n" ^


297 
cat_lines (map showterm ts)

0

298 
val t = Syntax.read syn T a;


299 
val (t',tye) = Type.infer_types (tsig, const_tab, types,

19

300 
sorts, showtyp, T, t)


301 
handle TYPE (msg, Ts, ts) =>


302 
error ("Type checking error: " ^ msg ^ "\n" ^


303 
cat_lines (map showtyp Ts) ^ termerr ts)

0

304 
in (cterm_of sign t', tye)


305 
end


306 
handle TERM (msg, _) => error ("Error: " ^ msg);


307 


308 


309 
fun read_cterm sign = #1 o (read_def_cterm (sign, K None, K None));


310 


311 
(** reading of instantiations **)


312 


313 
fun indexname cs = case Syntax.scan_varname cs of (v,[]) => v

19

314 
 _ => error("Lexical error in variable name " ^ quote (implode cs));

0

315 


316 
fun absent ixn =


317 
error("No such variable in term: " ^ Syntax.string_of_vname ixn);


318 


319 
fun inst_failure ixn =


320 
error("Instantiation of " ^ Syntax.string_of_vname ixn ^ " fails");


321 


322 
fun read_insts (sign as Sg{tsig,...}) (rtypes,rsorts) (types,sorts) insts =


323 
let fun split([],tvs,vs) = (tvs,vs)


324 
 split((sv,st)::l,tvs,vs) = (case explode sv of

19

325 
"'"::cs => split(l,(indexname cs,st)::tvs,vs)


326 
 cs => split(l,tvs,(indexname cs,st)::vs));

0

327 
val (tvs,vs) = split(insts,[],[]);


328 
fun readT((a,i),st) =

19

329 
let val ixn = ("'" ^ a,i);


330 
val S = case rsorts ixn of Some S => S  None => absent ixn;


331 
val T = read_typ (sign,sorts) st;


332 
in if Type.typ_instance(tsig,T,TVar(ixn,S)) then (ixn,T)


333 
else inst_failure ixn


334 
end

0

335 
val tye = map readT tvs;


336 
fun add_cterm ((cts,tye), (ixn,st)) =

19

337 
let val T = case rtypes ixn of


338 
Some T => typ_subst_TVars tye T


339 
 None => absent ixn;


340 
val (ct,tye2) = read_def_cterm (sign,types,sorts) (st,T);


341 
val cv = cterm_of sign (Var(ixn,typ_subst_TVars tye2 T))


342 
in ((cv,ct)::cts,tye2 @ tye) end

0

343 
val (cterms,tye') = foldl add_cterm (([],tye), vs);


344 
in (map (fn (ixn,T) => (ixn,ctyp_of sign T)) tye', cterms) end;


345 


346 
end;

143

347 
