Author： Nadathur G. Wilson D.S.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.198, Iss.1, 1998-05, pp. : 49-98
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
Lambda terms definable as combinators
By Bunder M.W.
Theoretical Computer Science, Vol. 169, Iss. 1, 1996-11 ,pp. :
Access to resources
Recommend
Two beta-equal lambda-I-terms with no types in common
Theoretical Computer Science, Vol. 155, Iss. 1, 1996-02 ,pp. :
By Kamareddine F. Nederpelt R.
Theoretical Computer Science, Vol. 155, Iss. 1, 1996-02 ,pp. :
On the Significance of Digits in Interval Notation
Reliable Computing, Vol. 10, Iss. 1, 2004-02 ,pp. :