[r6rs-discuss] [Formal] Requirement to detect circular lists

[Shiro Kawai]

From: "Dan Muresan" <dan-r6rs at omnigia.com>
Subject: Re: [r6rs-discuss] [Formal] Requirement to detect circular lists
Date: Tue, 3 Oct 2006 11:10:05 +0300 (EEST)

> > I personally view some of the examples presented as contraptions rather
> > than "elegant constructs".  So yes, the answer to your question is very
> > very obvious.
> 
> So the answer is obvious to me, to you (and perhaps to Shiro), only it's
> not the same answer...

I wouldn't say my example is an elegant solution (Haskell
programmers may say it is a poor man's lazy infinite lists :-)

I just want to know the benefit of the current way---does
"plausible lists of length n" requirement help, for example,
compilers to produce better code?  

--shiro