diff options
| author | herbelin | 2001-11-20 14:38:21 +0000 |
|---|---|---|
| committer | herbelin | 2001-11-20 14:38:21 +0000 |
| commit | 52c0bf0da05bcfce49ce5c8321e8b9ed7b3a1cb5 (patch) | |
| tree | 8222d00a63e6ab08d8f5eac3d8fce7a29083a43c /kernel/sign.mli | |
| parent | 2ba5fc92551cfe9632ad01a5ae52aa7c7d0241f6 (diff) | |
types vs constr
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@2210 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'kernel/sign.mli')
| -rw-r--r-- | kernel/sign.mli | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/kernel/sign.mli b/kernel/sign.mli index 61e97d9eb7..fbc682e35f 100644 --- a/kernel/sign.mli +++ b/kernel/sign.mli @@ -59,22 +59,22 @@ val fold_rel_context_reverse : (*s Term constructors *) val it_mkNamedLambda_or_LetIn : constr -> named_context -> constr -val it_mkNamedProd_or_LetIn : constr -> named_context -> constr +val it_mkNamedProd_or_LetIn : types -> named_context -> types val it_mkLambda_or_LetIn : constr -> rel_context -> constr -val it_mkProd_or_LetIn : constr -> rel_context -> constr +val it_mkProd_or_LetIn : types -> rel_context -> types (*s Term destructors *) (* Destructs a term of the form $(x_1:T_1)..(x_n:T_n)s$ into the pair *) type arity = rel_context * sorts -val destArity : constr -> arity -val isArity : constr -> bool +val destArity : types -> arity +val isArity : types -> bool (* Transforms a product term $(x_1:T_1)..(x_n:T_n)T$ including letins into the pair $([(x_n,T_n);...;(x_1,T_1)],T)$, where $T$ is not a product nor a let. *) -val decompose_prod_assum : constr -> rel_context * constr +val decompose_prod_assum : types -> rel_context * types (* Transforms a lambda term $[x_1:T_1]..[x_n:T_n]T$ including letins into the pair $([(x_n,T_n);...;(x_1,T_1)],T)$, where $T$ is not a @@ -84,7 +84,7 @@ val decompose_lam_assum : constr -> rel_context * constr (* Given a positive integer n, transforms a product term $(x_1:T_1)..(x_n:T_n)T$ into the pair $([(xn,Tn);...;(x1,T1)],T)$. *) -val decompose_prod_n_assum : int -> constr -> rel_context * constr +val decompose_prod_n_assum : int -> types -> rel_context * types (* Given a positive integer $n$, transforms a lambda term $[x_1:T_1]..[x_n:T_n]T$ into the pair $([(x_n,T_n);...;(x_1,T_1)],T)$ *) |