Author： Salibra A.
Publisher： Elsevier
ISSN： 1571-0661
Source： Electronic Notes in Theoretical Computer Science, Vol.50, Iss.2, 2004-01, pp. : 1-14
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Previous Menu Next
Abstract
Related content
Order-incompleteness and finite lambda reduction models
By Selinger P.
Theoretical Computer Science, Vol. 309, Iss. 1, 2003-12 ,pp. :
Access to resources
Recommend
Polymorphic lambda calculus and subtyping
By Fiech
Theoretical Computer Science, Vol. 278, Iss. 1, 2002-05 ,pp. :
The differential lambda-calculus
Theoretical Computer Science, Vol. 309, Iss. 1, 2003-12 ,pp. :
Matching for the lambda calculus of objects
Theoretical Computer Science, Vol. 212, Iss. 1, 1999-02 ,pp. :
The self-reduction in lambda calculus
Theoretical Computer Science, Vol. 235, Iss. 1, 2000-03 ,pp. :