Author: Liang Chuck Nadathur Gopalan Qi Xiaochu
Publisher: Springer Publishing Company
ISSN: 0168-7433
Source: Journal of Automated Reasoning, Vol.33, Iss.2, 2004-09, pp. : 89-132
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. :
A notation for lambda terms A generalization of environments
Theoretical Computer Science, Vol. 198, Iss. 1, 1998-05 ,pp. :
The self-reduction in lambda calculus
Theoretical Computer Science, Vol. 235, Iss. 1, 2000-03 ,pp. :
Lambda abstraction algebras: representation theorems
Theoretical Computer Science, Vol. 140, Iss. 1, 1995-03 ,pp. :
Combinatory weak reduction in lambda calculus
Theoretical Computer Science, Vol. 198, Iss. 1, 1998-05 ,pp. :