Author： Maraist J. Odersky M. Turner D.N. Wadler P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.152, Iss.2, 1995-12, pp. : 330-330
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
Call-by-name, call-by-value, call-by-need and the linear lambda calculus
By Maraist J. Odersky M. Turner D.N. Wadler P.
Theoretical Computer Science, Vol. 228, Iss. 1, 1999-10 ,pp. :
Access to resources
Recommend
Call-by-push-value: Decomposing call-by-value and call-by-name
By Levy Paul
LISP and Symbolic Computation, Vol. 19, Iss. 4, 2006-12 ,pp. :
Confluency and strong normalizability of call-by-value -calculus
By Nakazawa K.
Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. :
Axioms for Recursion in Call-by-Value
By Hasegawa M.
LISP and Symbolic Computation, Vol. 15, Iss. 2-3, 2002-09 ,pp. :
System T, call-by-value and the minimum problem
Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. :