Author： Coquand C.
Publisher： Springer Publishing Company
ISSN： 1388-3690
Source： LISP and Symbolic Computation, Vol.15, Iss.1, 2002-03, pp. : 57-90
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
Towards a proof theory of rewriting: the simply typed 2 -calculus
By Hilken B.P.
Theoretical Computer Science, Vol. 170, Iss. 1, 1996-12 ,pp. :
Access to resources
Recommend
A -calculus with explicit substitutions
By Ferrari G.-L. Montanari U. Quaglia P.
Theoretical Computer Science, Vol. 168, Iss. 1, 1996-11 ,pp. :
The differential lambda-calculus
Theoretical Computer Science, Vol. 309, Iss. 1, 2003-12 ,pp. :
A lambda-calculus for dynamic binding
By Dami L.
Theoretical Computer Science, Vol. 192, Iss. 2, 1998-02 ,pp. :
Direct Models for the Computational Lambda-calculus
By Fuhrmann C.
Electronic Notes in Theoretical Computer Science, Vol. 20, Iss. 1, 2004-01 ,pp. :