From mboxrd@z Thu Jan 1 00:00:00 1970 MIME-Version: 1.0 In-Reply-To: References: <542783.92348.qm@web83904.mail.sp1.yahoo.com> <55D72913-15FB-415F-BE43-7D173E0AC449@storytotell.org> <7AAFE4127E1DB57785BB273A@192.168.1.2> Date: Sun, 6 Sep 2009 11:40:44 -0700 Message-ID: <3e1162e60909061140q63c45f1bsfd4fe92c79564f66@mail.gmail.com> From: David Leimbach To: Fans of the OS Plan 9 from Bell Labs <9fans@9fans.net> Content-Type: multipart/alternative; boundary=000e0cd5cad02f5ada0472ed12b9 Subject: Re: [9fans] nice quote Topicbox-Message-UUID: 66d6e702-ead5-11e9-9d60-3106f5b1d025 --000e0cd5cad02f5ada0472ed12b9 Content-Type: text/plain; charset=ISO-8859-1 On Sun, Sep 6, 2009 at 11:26 AM, Tim Newsham wrote: > I would like to see Haskell fill C's niche: it's close to C's >> execution speed now, and pure functions and a terse style gives real >> advantages in coding speed (higher-order functions abstract common >> "patterns" without tedious framework implementations), maintainability >> (typeclasses of parameters in utility functions means you don't write >> different implementations of the same function for different types, >> yet preserve type compatibility and checking), and reliability (pure >> functions don't depend on state, so have fewer moving parts to go >> wrong). >> > > Do you know of any garbage collectors written in Haskell? Do > you know of any thread/process schedulers written in Haskell > that can schedule arbitrary code (ie. not just code that is > written in a continuation monad)? > > I would like to see a language that lets you write low level code > (like memcpy) efficiently, in a style that makes reasoning about > the code easy, and which doesnt require (but can coexist and support) > garbage collection. > > Hmmm, pre-scheme perhaps? http://en.wikipedia.org/wiki/PreScheme It doesn't do garbage collection, and is meant for low level code, but provides scheme's macros. Scheme48 is written in it. > "while(n--) *p++ = *q++;" > is still quite elegant compared to many other expressive langauges. > setjmp and longjmp are still quite powerful. > > Jason Catena >> > > Tim Newsham > http://www.thenewsh.com/~newsham/ > > --000e0cd5cad02f5ada0472ed12b9 Content-Type: text/html; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable

On Sun, Sep 6, 2009 at 11:26 AM, Tim New= sham <newsham@lava= .net> wrote:
I would like to see Haskell fill C's niche: it's close to C's execution speed now, and pure functions and a terse style gives real
advantages in coding speed (higher-order functions abstract common
"patterns" without tedious framework implementations), maintainab= ility
(typeclasses of parameters in utility functions means you don't write different implementations of the same function for different types,
yet preserve type compatibility and checking), and reliability (pure
functions don't depend on state, so have fewer moving parts to go
wrong).

Do you know of any garbage collectors written in Haskell? =A0Do
you know of any thread/process schedulers written in Haskell
that can schedule arbitrary code (ie. not just code that is
written in a continuation monad)?

I would like to see a language that lets you write low level code
(like memcpy) efficiently, in a style that makes reasoning about
the code easy, and which doesnt require (but can coexist and support)
garbage collection.


Hmmm, pre-scheme perhaps? =A0http://en.wikipedia.org/wiki/Pr= eScheme

It doesn't do garbage collection, = and is meant for low level code, but provides scheme's macros. =A0Schem= e48 is written in it.
=A0
"while(n--) *p++ =3D *q++;"
is still quite elegant compared to many other expressive langauges.
setjmp and longjmp are still quite powerful.

Jason Catena

Tim Newsham
http://www.= thenewsh.com/~newsham/


--000e0cd5cad02f5ada0472ed12b9--