Author： Ishihara
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.272, Iss.1, 2002-02, pp. : 197-221
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
Completeness of type assignment systems with intersection, union, and type quantifiers
By Yokouchi H.
Theoretical Computer Science, Vol. 272, Iss. 1, 2002-02 ,pp. :
Access to resources
Recommend
Intersection type assignment systems
By van Bakel S.
Theoretical Computer Science, Vol. 151, Iss. 2, 1995-11 ,pp. :
Axioms for Recursion in Call-by-Value
By Hasegawa M.
LISP and Symbolic Computation, Vol. 15, Iss. 2-3, 2002-09 ,pp. :
Intersection type assignment systems with higher-order algebraic rewriting
Theoretical Computer Science, Vol. 170, Iss. 1, 1996-12 ,pp. :
Call-by-push-value: Decomposing call-by-value and call-by-name
By Levy Paul
LISP and Symbolic Computation, Vol. 19, Iss. 4, 2006-12 ,pp. :