Newsgroups: comp.lang.scheme
Path: cantaloupe.srv.cs.cmu.edu!das-news.harvard.edu!news2.near.net!MathWorks.Com!europa.eng.gtefsd.com!howland.reston.ans.net!news.sprintlink.net!openwx!eskimo!miles
From: miles@eskimo.com (Miles Bader)
Subject: Re: Tcl/Lisp/Python: A "User" point of view
Message-ID: <Cx6HG6.Mvp@eskimo.com>
Organization: Eskimo North (206) For-Ever
References: <9409232314.AA29957@mole.gnu.ai.mit.edu> <36jl5v$6dc@news.cs.tu-berlin.de> <BLUME.94Oct1153023@beth.cs.princeton.edu> <BEVAN.94Oct4170833@lemur.cs.man.ac.uk>
Date: Wed, 5 Oct 1994 02:28:18 GMT
Lines: 27

In article <BEVAN.94Oct4170833@lemur.cs.man.ac.uk>, Stephen J Bevan <bevan@cs.man.ac.uk> wrote:
[a bunch of scheme loop types deleted]
> >  My guess is that to the untrained eye the first (`do'-based) version
> >  is the most compact one.
>The most compact one I can come up with is :-
>	(hol->list (hol:nat:to 10000))

Here's the dylan version (given that the original examples all returned a
descending list):

  as(<list>, range(from: 10000, to: 0, by: -1))

or if you want a loop:

  for (i from 0 to 10000, list = #() then add!(list, i))
  finally list
  end;

[Dylan's pretty nice in general.  Though I've long loved lisp, I found that
 when I converted (common) lisp code to dylan, pretty much exactly, a lot of
 it became much more readable to my eye....]

-Miles
-- 
-- 
Miles Bader / miles@eskimo.com / (206) 842-7219
`Life is a boundless sea of bitterness'
