(* Copyright (c) 1998 YALE FLINT PROJECT *)
(* ltydef.sig *)

(*
 * This interface hides the implementation details of FLINT tkind, tyc, and 
 * lty defined inside LtyKernel. For each entity, we provide a series of 
 * constructor funtions, deconstructor functions, predicate functions, and
 * functions that test equivalence and do pretty-printing. This interface 
 * should only refer to DebIndex, LtyKernel, PrimTyc, and Symbol. 
 *)

signature LTYDEF = 
sig

(** basic entities *)
type tkind = LtyKernel.tkind
type index = DebIndex.index
type depth = DebIndex.depth
type primtyc = PrimTyc.primtyc
type tvar = LtyKernel.tvar
type tyc = LtyKernel.tyc
type lty = LtyKernel.lty
type rawflag = bool * bool  (* should be equivalent to LtyKernel.rawflag *)

(* 
 * FLINT tkind is roughly equivalent to the following ML datatype 
 *
 *    datatype tkind 
 *      = TK_MONO 
 *      | TK_BOX
 *      | TK_SEQ of tkind list
 *      | TK_FUN of tkind * tkind
 *
 * We treat tkind as an abstract type so we can no longer use 
 * pattern matching. 
 *
 *)

(** tkind constructors *)
val tkc_mono   : tkind
val tkc_box    : tkind
val tkc_seq    : tkind list -> tkind
val tkc_fun    : tkind * tkind -> tkind

(** tkind deconstructors *)
val tkd_mono   : tkind -> unit
val tkd_box    : tkind -> unit
val tkd_seq    : tkind -> tkind list
val tkd_fun    : tkind -> tkind * tkind

(** tkind predicates *)
val tkp_mono   : tkind -> bool
val tkp_box    : tkind -> bool
val tkp_seq    : tkind -> bool
val tkp_fun    : tkind -> bool

(** tkind one-arm switch *)
val tkw_mono   : tkind * (unit -> 'a) * (tkind -> 'a) -> 'a
val tkw_box    : tkind * (unit -> 'a) * (tkind -> 'a) -> 'a
val tkw_seq    : tkind * (tkind list -> 'a) * (tkind -> 'a) -> 'a
val tkw_fun    : tkind * (tkind * tkind -> 'a) * (tkind -> 'a) -> 'a


(* 
 * FLINT tyc is roughly equivalent to the following ML datatype 
 *
 *    datatype tyc
 *      = TC_VAR of index * int
 *      | TC_NVAR of tvar * depth * int    (* currently not used *)
 *      | TC_PRIM of primtyc
 *      | TC_FN of tkind list * tyc
 *      | TC_APP of tyc * tyc list
 *      | TC_SEQ of tyc list
 *      | TC_PROJ of tyc * int
 *      | TC_SUM of tyc list
 *      | TC_FIX of tyc * int
 *      | TC_ABS of tyc                    (* currently not used *)
 *      | TC_BOX of tyc                    (* used by rep analysis only *)
 *      | TC_TUPLE of tyc list
 *      | TC_ARROW of rawflag * tyc list * tyc list 
 *
 * We treat tyc as an abstract type so we can no longer use 
 * pattern matching. Type applications (TC_APP) and projections 
 * (TC_PROJ) are automatically reduced as needed, that is, the
 * client does not need to worry about whether a tyc is in the
 * normal form or not, all functions defined here automatically 
 * take care of this.
 *)

(** tyc constructors *)
val tcc_var    : index * int -> tyc
val tcc_nvar   : tvar * depth * int -> tyc
val tcc_prim   : primtyc -> tyc
val tcc_fn     : tkind list * tyc -> tyc
val tcc_app    : tyc * tyc list -> tyc
val tcc_seq    : tyc list -> tyc
val tcc_proj   : tyc * int -> tyc
val tcc_sum    : tyc list -> tyc
val tcc_fix    : (int * tyc * tyc list) * int -> tyc 
val tcc_abs    : tyc -> tyc
val tcc_box    : tyc -> tyc
val tcc_tuple  : tyc list -> tyc
val tcc_arrow  : rawflag * tyc list * tyc list -> tyc

(** tyc deconstructors *)
val tcd_var    : tyc -> index * int 
val tcd_nvar   : tyc -> tvar * depth * int 
val tcd_prim   : tyc -> primtyc 
val tcd_fn     : tyc -> tkind list * tyc 
val tcd_app    : tyc -> tyc * tyc list 
val tcd_seq    : tyc -> tyc list 
val tcd_proj   : tyc -> tyc * int 
val tcd_sum    : tyc -> tyc list 
val tcd_fix    : tyc -> (int * tyc * tyc list) * int 
val tcd_abs    : tyc -> tyc 
val tcd_box    : tyc -> tyc 
val tcd_tuple  : tyc -> tyc list 
val tcd_arrow  : tyc -> rawflag * tyc list * tyc list 

(** tyc predicates *)
val tcp_var    : tyc -> bool
val tcp_nvar   : tyc -> bool
val tcp_prim   : tyc -> bool
val tcp_fn     : tyc -> bool
val tcp_app    : tyc -> bool
val tcp_seq    : tyc -> bool
val tcp_proj   : tyc -> bool
val tcp_sum    : tyc -> bool
val tcp_fix    : tyc -> bool
val tcp_abs    : tyc -> bool
val tcp_box    : tyc -> bool
val tcp_tuple  : tyc -> bool
val tcp_arrow  : tyc -> bool

(** tyc one-arm switch *)
val tcw_var    : tyc * (index * int -> 'a) * (tyc -> 'a) -> 'a
val tcw_nvar   : tyc * (tvar * depth * int -> 'a) * (tyc -> 'a) -> 'a
val tcw_prim   : tyc * (primtyc -> 'a) * (tyc -> 'a) -> 'a
val tcw_fn     : tyc * (tkind list * tyc -> 'a) * (tyc -> 'a) -> 'a
val tcw_app    : tyc * (tyc * tyc list -> 'a) * (tyc -> 'a) -> 'a
val tcw_seq    : tyc * (tyc list -> 'a) * (tyc -> 'a) -> 'a
val tcw_proj   : tyc * (tyc * int -> 'a) * (tyc -> 'a) -> 'a
val tcw_sum    : tyc * (tyc list -> 'a) * (tyc -> 'a) -> 'a
val tcw_fix    : tyc * ((int * tyc * tyc list) * int -> 'a) * (tyc -> 'a) -> 'a
val tcw_abs    : tyc * (tyc -> 'a) * (tyc -> 'a) -> 'a
val tcw_box    : tyc * (tyc -> 'a) * (tyc -> 'a) -> 'a
val tcw_tuple  : tyc * (tyc list -> 'a) * (tyc -> 'a) -> 'a
val tcw_arrow  : tyc * (rawflag * tyc list * tyc list -> 'a) 
                     * (tyc -> 'a) -> 'a
                                      

(* 
 * FLINT lty is roughly equivalent to the following ML datatype 
 *
 *    datatype lty
 *      = LT_TYC of tyc
 *      | LT_STR of lty list
 *      | LT_FCT of lty list * lty list
 *      | LT_POLY of tkind list * lty list
 *      | LT_PST of (int * lty) list         (* soon obsolete *)
 *
 * We treat lty as an abstract type so we can no longer use pattern
 * matching. The client does not need to worry about whether an lty
 * is in normal form or not. 
 *)

(** lty constructors *)
val ltc_tyc    : tyc -> lty
val ltc_str    : lty list -> lty
val ltc_fct    : lty list * lty list -> lty
val ltc_poly   : tkind list * lty list -> lty    
val ltc_pst    : (int * lty) list -> lty        

(** lty deconstructors *)
val ltd_tyc    : lty -> tyc
val ltd_str    : lty -> lty list
val ltd_fct    : lty -> lty list * lty list
val ltd_poly   : lty -> tkind list * lty list
val ltd_pst    : lty -> (int * lty) list

(** lty predicates *)
val ltp_tyc    : lty -> bool
val ltp_str    : lty -> bool
val ltp_fct    : lty -> bool
val ltp_poly   : lty -> bool
val ltp_pst    : lty -> bool

(** lty one arm switches *)
val ltw_tyc    : lty * (tyc -> 'a) * (lty -> 'a) -> 'a
val ltw_str    : lty * (lty list -> 'a) * (lty -> 'a) -> 'a
val ltw_fct    : lty * (lty list * lty list -> 'a) * (lty -> 'a) -> 'a
val ltw_poly   : lty * (tkind list * lty list -> 'a) * (lty -> 'a) -> 'a
val ltw_pst    : lty * ((int * lty) list -> 'a) * (lty -> 'a) -> 'a
                                        

(* 
 * Because FLINT tyc is embedded inside FLINT lty, we supply the
 * the following utility functions on building ltys that are based
 * on simple mono tycs.
 *)

(** tyc-lty constructors *)
val ltc_var    : index * int -> lty
val ltc_prim   : primtyc -> lty
val ltc_tuple  : lty list -> lty
val ltc_arrow  : rawflag * lty list * lty list -> lty

(** tyc-lty deconstructors *)
val ltd_var    : lty -> index * int
val ltd_prim   : lty -> primtyc
val ltd_tuple  : lty -> lty list
val ltd_arrow  : lty -> rawflag * lty list * lty list

(** tyc-lty predicates *)
val ltp_var    : lty -> bool
val ltp_prim   : lty -> bool
val ltp_tuple  : lty -> bool
val ltp_arrow  : lty -> bool

(** tyc-lty one-arm switches *)
val ltw_var    : lty * (index * int -> 'a) * (lty -> 'a) -> 'a
val ltw_prim   : lty * (primtyc -> 'a) * (lty -> 'a) -> 'a
val ltw_tuple  : lty * (tyc list -> 'a) * (lty -> 'a) -> 'a
val ltw_arrow  : lty * (rawflag * tyc list * tyc list -> 'a) 
                     * (lty -> 'a) -> 'a


(* 
 * The following functions are written for CPS only. If you are writing
 * writing code for FLINT, you should not use any of these functions. 
 * The continuation referred here is the internal continuation introduced
 * via CPS conversion; it is different from the source-level continuation 
 * ('a cont) or control continuation ('a control-cont) where are represented 
 * as PT.ptc_cont and PT.ptc_ccont respectively. 
 *
 *)

(** cont-tyc-lty constructors *)
val tcc_cont   : tyc list -> tyc      
val ltc_cont   : lty list -> lty                

(** cont-tyc-lty deconstructors *)
val tcd_cont   : tyc -> tyc list      
val ltd_cont   : lty -> lty list        

(** cont-tyc-lty predicates *)
val tcp_cont   : tyc -> bool          
val ltp_cont   : lty -> bool            

(** cont-tyc-lty one-arm switches *)
val tcw_cont   : tyc * (tyc list -> 'a) * (tyc -> 'a) -> 'a
val ltw_cont   : lty * (lty list -> 'a) * (lty -> 'a) -> 'a


(* 
 * The following functions are written for PLambdaType only. If you
 * are writing code for FLINT only, don't use any of these functions. 
 * The idea is that in PLambda, all (value or type) functions have single
 * argument and single return-result. Ideally, we should define 
 * another sets of datatypes for tycs and ltys. But we want to avoid
 * the translation from PLambdaType to FLINT types, so we let them
 * share the same representations as much as possible. 
 *
 * Ultimately, LtyDef should be separated into two files: one for 
 * FLINT, another for PLambda, but we will see if this is necessary.
 *
 *)

(** plambda tyc-lty constructors *)
val tcc_parrow : tyc * tyc -> tyc     
val ltc_parrow : lty * lty -> lty
val ltc_ppoly  : tkind list * lty -> lty  
val ltc_pfct   : lty * lty -> lty         

(** plambda tyc-lty deconstructors *)
val tcd_parrow : tyc -> tyc * tyc
val ltd_parrow : lty -> lty * lty    
val ltd_ppoly  : lty -> tkind list * lty
val ltd_pfct   : lty -> lty * lty       

(** plambda tyc-lty predicates *)
val tcp_parrow : tyc -> bool          
val ltp_parrow : lty -> bool
val ltp_ppoly  : lty -> bool
val ltp_pfct   : lty -> bool            

(** plambda tyc-lty one-arm switches *)
val tcw_parrow : tyc * (tyc * tyc -> 'a) * (tyc -> 'a) -> 'a
val ltw_parrow : lty * (tyc * tyc -> 'a) * (lty -> 'a) -> 'a
val ltw_ppoly  : lty * (tkind list * lty -> 'a) * (lty -> 'a) -> 'a
val ltw_pfct   : lty * (lty * lty -> 'a) * (lty -> 'a) -> 'a

end (* signature LTYDEF *)