Kevin S. Millikin wrote:
> It sure looks like the example contradicts the assertion, but I happen
> to know that there is a set! (or some other assignment) in the macro
> expansion of define. I'm just using call/cc to get at that, rather
> than getting at the one in the expansion of letrec.
I
Title: RE: foldr
It's not too difficult to do: think 'fold map' and put it in the form that foldr needs.
cheers
-Original Message-
From: James Ealing [mailto:[EMAIL PROTECTED]]
Sent: Friday, 02 January, 2004 1:54 PM
To: [EMAIL PROTECTED]
Subject: foldr
Hi all,
If I have a fun
Hi all,
If I have a function:
it f [a0, a1, a2, ...] = [a0, f a1, f (f a2), ...]
Is there any way of expressing
it f
as an instance of foldr?
Many thanks,
Jim
Yahoo! Messenger - Communicate instantly..."Ping"
your fri
J & M van Berchem wrote:
> New to Haskell, I got a version, through Fink, for my Mac OS X. I like
> the interpreter very much, but I do not see how I may get out of "Prelude"
> in order to write a program.
Use a text editor, then load the file with ":load Foo.hs".
You can't type definitions
G'day all.
Quoting Graham Klyne <[EMAIL PROTECTED]>:
> (2) I find that I spend a far greater portion of my time *thinking* about
> what I'm trying to do than actually coding it. There used to be an adage
> in the software industry that programmer productivity in lines-of-code per
> day was indep
On Tuesday, December 30, 2003 5:04 PM, Kevin S. Millikin
[SMTP:[EMAIL PROTECTED] wrote:
> Oh, sure. I didn't mean to quibble with the idea that continuations
> are computational effects. Just wanted to point out that (I think)
> you can't macro express mutation with call/cc, unless you've alread
New to Haskell, I got a version, through Fink, for my Mac OS X. I like
the interpreter very much, but I do not see how I may get out of "Prelude"
in order to write a program.
Could you advise me ? Thanks in advanceJacques van Berchem
___
Haske
At 17:44 23/12/03 -0500, Derek Elkins wrote:
On Tue, 23 Dec 2003 17:26:20 +
Graham Klyne <[EMAIL PROTECTED]> wrote:
(moved to Haskell-Cafe as this reply might generate several more)
> I've spent part of the past few months learning Haskell and developing
> a moderately sized application. I ca
I'm trying to make use of the combinatorial parsing
library to process strings. However, I can't figure
out the correct syntax for the (|||) (^^^) (>>>) (<^^)
and (^^>) functions. Can anyone see how to do it? If
so it'd be really useful if you could put down a
couple of examples of how each is used
Thanks to Tom for his interesting points. I am still developing an
inuition for how the error reporting goes. (-:
On Thu, 1 Jan 2004, Derek Elkins wrote:
(snip)
> > > testOr3 = do{ try (string "(a"); char ')'; return "(a)" }
(snip)
> example both issues come up. If we successfully parse the
>
On Wed, Dec 31, 2003 at 07:21:54PM -0500, Mark Carroll wrote:
> I tried posting this before but, from my point of view, it vanished. My
> apologies if it's a duplicate.
>
> In http://www.cs.uu.nl/~daan/download/parsec/parsec.html we read,
>
> > testOr2 = try (string "(a)")
> > <|> strin
On Wed, 31 Dec 2003 19:21:54 -0500 (EST)
Mark Carroll <[EMAIL PROTECTED]> wrote:
> I tried posting this before but, from my point of view, it vanished.
> My apologies if it's a duplicate.
>
> In http://www.cs.uu.nl/~daan/download/parsec/parsec.html we read,
>
> > testOr2 = try (string "(a)")
>
12 matches
Mail list logo
