![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Aspinall D. Compagnoni
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.266, Iss.1, 2001-09, pp. : 273-309
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Optimal Representations of Polymorphic Types with Subtyping
By Aiken A.
LISP and Symbolic Computation, Vol. 12, Iss. 3, 1999-10 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Dependent Types for Program Termination Verification
By Xi H.
LISP and Symbolic Computation, Vol. 15, Iss. 1, 2002-03 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Polymorphic lambda calculus and subtyping
By Fiech
Theoretical Computer Science, Vol. 278, Iss. 1, 2002-05 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Theoretical Computer Science, Vol. 176, Iss. 1, 1997-04 ,pp. :