[racket] [plt-edu-talk] Does a Scheme procedure "return" a value?

From: Joe Marshall (jmarshall at alum.mit.edu)
Date: Sat Sep 8 11:33:05 EDT 2012

On Sep 8, 2012 8:19 AM, "Richard Cleis" <rcleis at me.com> wrote:
> I am writing documentation. What are acceptable words for the following
> The function f [what verbs are ok?]

Takes, accepts,

> a name, then [what about here?] a phone number.

Computes, evaluates to, reduces to,
(Or even "returns", if you don't mind if Ellen and I cringe. We'll know
what you mean.)

> rac
> On Sep 8, 2012, at 9:07 AM, Joe Marshall wrote:
>> A Scheme procedure might return a value, or it might delegate to another
procedure (via tail recursion).  This is a key point: languages without
tail recursion cannot delegate to another procedure. They can do a limited
simulation of delegation by chaining the returns, but this adds an O(n)
space overhead to the computation and consumes stack space, which is a
finite resource (hence the limit).
>> ____________________
>>  Racket Users list:
>>  http://lists.racket-lang.org/users
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/users/archive/attachments/20120908/c530de1e/attachment.html>

Posted on the users mailing list.