Author： Bunder M.W.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.169, Iss.1, 1996-11, pp. : 3-21
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
A notation for lambda terms A generalization of environments
Theoretical Computer Science, Vol. 198, Iss. 1, 1998-05 ,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. :
On principal types of combinators
Theoretical Computer Science, Vol. 247, Iss. 1, 2000-09 ,pp. :
Contraint-Based Combinators for Local Search
By Hentenryck Pascal Michel Laurent Liu Liyuan
Constraints, Vol. 10, Iss. 4, 2005-10 ,pp. :