tail-recursive string-any string-every

Show/hide message thread

Deadline shivers@xxxxxx (18 Dec 2000 20:18 UTC)

tail-recursive string-any string-every Per Bothner (19 Dec 2000 04:07 UTC)

Re: tail-recursive string-any string-every shivers@xxxxxx (19 Dec 2000 05:37 UTC)

license of reference implementations Per Bothner (19 Dec 2000 04:21 UTC)

Re: license of reference implementations shivers@xxxxxx (19 Dec 2000 06:10 UTC)

tail-recursive string-any string-every Per Bothner 19 Dec 2000 04:08 UTC

The functions string-any and string-every are defined such that the
last predicate application on the final element is a tail call.  Is
there any point to this?  I.e. can we realiztically imagine an
application that will really benefit?  I can imagine applications
being *hurt* by this requirement:
(1) This precludes string-any string-every being implemented in a
low-level language that does not support tail calls, such as C.
(2) If a Scheme implementation provides two modes:  One that is
support proper tail calls and one that doesn't (because that is faster),
it requires compiling string-any string-every using the slower
compilation mode.

Could we remove this requirement?  (I know it is late ...)
--
	--Per Bothner
xxxxxx@bothner.com   http://www.bothner.com/~per/