On Tue, 2007-09-25 at 17:19 -0700, Dan Weston wrote:
One suggestion:
Section 3.6 defines a function fix:
fix :: Eq x = (x - x) - x - x
fix f x = if x == x' then x else fix f x'
where x' = f x
This confusingly differs in both type and meaning from the traditional
function
It seems no one liked idea #2. I still think fix is the wrong name for
this, maybe limit would be better.
Dan Weston wrote:
One suggestion:
Section 3.6 defines a function fix:
fix :: Eq x = (x - x) - x - x
fix f x = if x == x' then x else fix f x'
where x' = f x
This confusingly
On Wed, 2007-09-26 at 11:43 -0700, Dan Weston wrote:
It seems no one liked idea #2. I still think fix is the wrong name for
this, maybe limit would be better.
It calculates least fixed points. `fix' is as good a name as any.
`limit' is terrible; the argument to fix, a - a, is neither a
On Wed, 2007-09-26 at 17:09 -0500, Derek Elkins wrote:
On Wed, 2007-09-26 at 14:12 -0700, Jonathan Cast wrote:
On Wed, 2007-09-26 at 11:43 -0700, Dan Weston wrote:
It seems no one liked idea #2. I still think fix is the wrong name for
this, maybe limit would be better.
It calculates
Not to beat a dead horse, but I wasn't suggesting to rename the fix
function that everyone knows and loves:
fix :: (a - a) - a
fix f = let f' = f f' in f'
I was merely trying to suggest that it would be wise to rename the
function in http://haskell.org/haskellwiki/Reference_card that
On Wed, Sep 26, 2007 at 05:23:58PM -0700, Dan Weston wrote:
It is this latter function which I suggested to be renamed limit, since
it returns the limit (converged value) of f^n x, where n - inf, and
doesn't even have the same type or arity as the standard fix function.
Somehow this
On Wed, 2007-09-26 at 17:23 -0700, Dan Weston wrote:
Not to beat a dead horse, but I wasn't suggesting to rename the fix
function that everyone knows and loves:
fix :: (a - a) - a
fix f = let f' = f f' in f'
I was merely trying to suggest that it would be wise to rename the
function in
Has anybody made (or have a link to) a Haskell reference cheat sheet?
I'm thinking of a nice LaTeXed PDF in the 1-10 page range (e.g.
something like this http://www.tug.org/texshowcase/cheat.pdf) with the
basics of the language syntax, the type declarations for the common type
classes, the type
+1
Message: 9
Date: Tue, 25 Sep 2007 13:04:56 -0700
From: Evan Klitzke [EMAIL PROTECTED]
Subject: [Haskell-cafe] Haskell Cheat Sheet?
To: haskell-cafe@haskell.org
Message-ID: [EMAIL PROTECTED]
Content-Type: text/plain
Has anybody made (or have a link to) a Haskell reference cheat sheet
On Tue, Sep 25, 2007 at 01:04:56PM -0700, Evan Klitzke wrote:
Has anybody made (or have a link to) a Haskell reference cheat
sheet?
the zvon ref is pretty close:
http://www.zvon.org/other/haskell/Outputglobal/index.html
in that it includes an overview of operators and common apis
nice that
brad clawsie wrote:
nice that it is in html. the pdf thing seems a bit contrived to me.
Clearly you've never tried printing hard copies of HTML. ;-)
Personally, I think having *both* is a nice idea. You can browse around
the HTML, or you can print out hard copies to sit next to your
On 9/25/07, brad clawsie [EMAIL PROTECTED] wrote:
On Tue, Sep 25, 2007 at 01:04:56PM -0700, Evan Klitzke wrote:
Has anybody made (or have a link to) a Haskell reference cheat
sheet?
the zvon ref is pretty close:
http://www.zvon.org/other/haskell/Outputglobal/index.html
in that it
evan:
Has anybody made (or have a link to) a Haskell reference cheat sheet?
I'm thinking of a nice LaTeXed PDF in the 1-10 page range (e.g.
something like this http://www.tug.org/texshowcase/cheat.pdf) with the
basics of the language syntax, the type declarations for the common type
classes,
One suggestion:
Section 3.6 defines a function fix:
fix :: Eq x = (x - x) - x - x
fix f x = if x == x' then x else fix f x'
where x' = f x
This confusingly differs in both type and meaning from the traditional
function Control.Monad.Fix.fix and is not even used elsewhere in the
On Tue, Sep 25, 2007 at 05:19:20PM -0700, Dan Weston wrote:
which is undefined (and seems to be missing an argument), when
invariably its type is in practice restricted to:
fix :: ((a - b) - (a - b)) - (a - b)
Oh, come on! I use
fibs = fix $ (0:) . (1:) . uncurry ($) . (zipWith (+) tail)
15 matches
Mail list logo
