Author： Barbanera F. Fernandez M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.170, Iss.1, 1996-12, pp. : 173-207
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Intersection type assignment systems
By van Bakel S.
Theoretical Computer Science, Vol. 151, Iss. 2, 1995-11 ,pp. :
Access to resources
Recommend
Order-sorted algebraic specifications with higher-order functions
Theoretical Computer Science, Vol. 183, Iss. 2, 1997-09 ,pp. :
Completeness of type assignment systems with intersection, union, and type quantifiers
By Yokouchi H.
Theoretical Computer Science, Vol. 272, Iss. 1, 2002-02 ,pp. :
Higher-order rewrite systems and their confluence
Theoretical Computer Science, Vol. 192, Iss. 1, 1998-02 ,pp. :
Completeness of intersection and union type assignment systems for call-by-value -models
By Ishihara
Theoretical Computer Science, Vol. 272, Iss. 1, 2002-02 ,pp. :