[plt-scheme] Re: plt-scheme Digest, Vol 2, Issue 45

Sorry, the error is:

module: identifier already imported (from a different
source) in: string-upcase

I believe that mzscheme already has a string-upcase
defined in it but then how does the SRFI 13 work?

Dan


--- plt-scheme-request at list.cs.brown.edu wrote:

> Send plt-scheme mailing list submissions to
> 	plt-scheme at list.cs.brown.edu
> 
> To subscribe or unsubscribe via the World Wide Web,
> visit
> 
> http://list.cs.brown.edu/mailman/listinfo/plt-scheme
> or, via email, send a message with subject or body
> 'help' to
> 	plt-scheme-request at list.cs.brown.edu
> 
> You can reach the person managing the list at
> 	plt-scheme-owner at list.cs.brown.edu
> 
> When replying, please edit your Subject line so it
> is more specific
> than "Re: Contents of plt-scheme digest..."
> 
> 
> [Please handle PLT Scheme list administrative tasks
> through the Web:
>   
>
http://list.cs.brown.edu/mailman/listinfo/plt-scheme]
> 
> 
> Today's Topics:
> 
>    1. Re: Help!! (Pupeno)
>    2. Re: graphs / shared / memory!! (Yoav Goldberg)
>    3. Re: graphs / shared / memory!! (Matthias
> Felleisen)
>    4. parser-tools basics (Dave Herman)
>    5. Re: graphs / shared / memory!! (Yoav Goldberg)
>    6. Re: graphs / shared / memory!! (Robby Findler)
>    7. Re: graphs / shared / memory!! (Robby Findler)
>    8. Re: collects (Robby Findler)
>    9. Re: graphs / shared / memory!! (Eli Barzilay)
> 
> 
>
----------------------------------------------------------------------
> 
> Message: 1
> Date: Thu, 20 Oct 2005 20:57:54 -0300
> From: Pupeno <pupeno at pupeno.com>
> Subject: Re: [plt-scheme] Help!!
> To: plt-scheme at list.cs.brown.edu
> Message-ID: <200510202057.57658.pupeno at pupeno.com>
> Content-Type: text/plain; charset="iso-8859-1"
> 
> On Thursday 20 October 2005 20:41, geb a wrote:
> > Can someone tell me why this code yields an error
> when
> > executed in module language?
> >
> > (module my13 mzscheme
> >   (require (lib "13.ss" "srfi"))
> > )
> >
> > Thank you for your time!
> If you post the error, then someone might be able to
> help you. It is very 
> different to get an error like "module doesn't
> exist" to "no space on the 
> device".
> -- 
> Pupeno <pupeno at pupeno.com> (http://pupeno.com)
> -------------- next part --------------
> A non-text attachment was scrubbed...
> Name: not available
> Type: application/pgp-signature
> Size: 189 bytes
> Desc: not available
> Url :
>
http://list.cs.brown.edu/pipermail/plt-scheme/attachments/20051020/a7959c27/attachment-0001.pgp
> 
> ------------------------------
> 
> Message: 2
> Date: Thu, 20 Oct 2005 17:24:58 -0700
> From: Yoav Goldberg <yoav.goldberg at gmail.com>
> Subject: Re: [plt-scheme] graphs / shared / memory!!
> To: Matthias Felleisen <matthias at ccs.neu.edu>
> Cc: PLT-list <plt-scheme at list.cs.brown.edu>
> Message-ID:
> 
>
<d720170c0510201724k73db614lf975f1aa347a286e at mail.gmail.com>
> Content-Type: text/plain; charset=ISO-8859-1
> 
> > >> Have you actually measured the memory
> consumption disadvantaged before
> > >> you jump to this conclusion?
> Ok. I stand corrected.
> 
> My little benchmark[*] proved without a doubt that
> lists are far more
> efficient -- about 9mb mem usage for mzscheme using
> lists, while the
> streams version got to about 150mb mem usage (and
> run for quite a
> while!) when I killed the proccess.
> 
> (I wonder how Python's generators will match up.. I
> might write a
> python version tomorrow..)
> 
> Yoav
> 
> [*] streams-version (list version is the same but
> with list
> operations, list-repeat-n uses recursive calls to
> append):
> 
> (define s1
>   (stream-append
>      (stream-repeat-n 1000 (stream 0 1 2 3 4 5 6 7 8
> 9))
>      (stream 9 9 9 9)
>      (stream-repeat-n 1000 (stream 0 1 2 3 4 5 6 7 8
> 9))))
> (define s2
>   (stream-repeat-n 10011 (stream -1 1)))
> (define s3 (stream-map * s1 s2))
> (stream->list s3)
> 
> 
> ------------------------------
> 
> Message: 3
> Date: Thu, 20 Oct 2005 20:56:26 -0400
> From: Matthias Felleisen <matthias at ccs.neu.edu>
> Subject: Re: [plt-scheme] graphs / shared / memory!!
> To: Yoav Goldberg <yoav.goldberg at gmail.com>
> Cc: PLT-list <plt-scheme at list.cs.brown.edu>
> Message-ID:
> <4291cd32141b3490baf1d630c702b1f9 at ccs.neu.edu>
> Content-Type: text/plain; charset=US-ASCII;
> format=flowed
> 
> 
> On Oct 20, 2005, at 8:24 PM, Yoav Goldberg wrote:
> 
> >>>> Have you actually measured the memory
> consumption disadvantaged 
> >>>> before
> >>>> you jump to this conclusion?
> > Ok. I stand corrected.
> 
> Good. Now sit down and let's think.
> 
> > My little benchmark[*] proved without a doubt that
> lists are far more
> > efficient -- about 9mb mem usage for mzscheme
> using lists, while the
> > streams version got to about 150mb mem usage (and
> run for quite a
> > while!) when I killed the proccess.
> 
> It is difficult to make lazy programs run reasonably
> efficiently.
> The Miranda(tm)/Haskell community needed two
> decades. (And that
> means you're within a factor of 2 of average C
> programs and worse
> when compared to Fortran.)
> 
> > (I wonder how Python's generators will match up..
> I might write a
> > python version tomorrow..)
> 
> Python uses reference counting. I'd say you start
> with
> the circular graph version. Last time I talked to
> Guido
> he didn't understand the value of garbage
> collection.
> 
> -- Matthias
> 
> 
> > Yoav
> >
> > [*] streams-version (list version is the same but
> with list
> > operations, list-repeat-n uses recursive calls to
> append):
> >
> > (define s1
> >   (stream-append
> >      (stream-repeat-n 1000 (stream 0 1 2 3 4 5 6 7
> 8 9))
> >      (stream 9 9 9 9)
> >      (stream-repeat-n 1000 (stream 0 1 2 3 4 5 6 7
> 8 9))))
> > (define s2
> >   (stream-repeat-n 10011 (stream -1 1)))
> > (define s3 (stream-map * s1 s2))
> > (stream->list s3)
> > _________________________________________________
> >   For list-related administrative tasks:
> >  
> http://list.cs.brown.edu/mailman/listinfo/plt-scheme
> 
=== message truncated ===



		
__________________________________ 
Yahoo! FareChase: Search multiple travel sites in one click.
http://farechase.yahoo.com