2 Aug
2012
2 Aug
'12
6:18 p.m.
I.e., tail recursion. If bar is a function of one variable, wrapping a lambda(x) around it is useless & wastes stack space. In Common Lisp: #'(lambda (x) (bar x)) <=> #'bar At 04:58 PM 8/2/2012, Mike Stay wrote:
On Thu, Aug 2, 2012 at 4:44 PM, Henry Baker <hbaker1@pipeline.com> wrote:
Eta (I think this is the name?). Tail recursion. You can replace recursion by iteration in certain contexts.
Eta is extensionality, i.e. any term T of type X is eta-equivalent to (lambda x.T(x)) when x is not free in T and x has type X. -- Mike Stay - metaweta@gmail.com http://www.cs.auckland.ac.nz/~mike http://reperiendi.wordpress.com