Quoting Brian Hulley [EMAIL PROTECTED]:
It is defnitely *a* haskell. There is actually no word in English
with a silent 'h', though this statement is unfortunately
controversial and news to whoever wrote the spell checker used in
many printed publications.
There is no English word with a
Hello Brian,
Tuesday, June 27, 2006, 2:43:15 AM, you wrote:
achieve a goal. One other thing to bear in mind is that foreign calls are
extremely slow, so for example it is much faster to use the
Foreign.Marshal.Array and Foreign.C.String functions to allocate and
populate a temporary array
Hello Jason,
Tuesday, June 27, 2006, 8:48:53 AM, you wrote:
but it turned out to be a real pain. I'm using visual haskell so that
I have COM support (I need the version of H/Direct that ships with
VisualHaskell and VisuallHaskell only ships with ghc 6.5) and that
means I have to compile the
On 6/26/06, Bulat Ziganshin [EMAIL PROTECTED] wrote:
Hello Jason,
[snip]
can't you ask library maintainers to compile their libs for ghc 6.5. it
should come out in several months and i think it's the time when
library maintainers can start to check whether new ghc version can
work with their
Hi Jason,
As far as I am aware, the Win32 bindings are not that well maintained
currently, and programming against the Win32 API is quite painful
since it is a very low level, and very C like API.
Gtk2Hs does require additional dependancies, but seems to be the most
actively developed version.
hankgong:
Hi, all
I'm just a newbie for Haskell and functional programming
world. The idea I currently read is quite different and
interesting.
I have one general question about the recursively looping
style. For example:
myMax [ ] = error empty list
myMax
Hi,
mymax [] = undefined
mymax (x:xs) = f x xs
where
f x [] = x
f x (y:ys) | y x = f y ys
| otherwise = f x ys
Or if you don't want to go for a fold next, in a style more similar to
the original:
maximum [] = undefined
maximum [x] = x
[EMAIL PROTECTED] wrote:
Anyone can help me? I did some changes in the .mk and makefile files in
order to integrate it with the Haskell.NET code generator but when I try to
compile the following error appears:
.../../ghc/compiler/ghc-inplace -H32m -O -W -fno-warn-unused-matches
-fwarn-unuse
Neil Mitchell wrote:
Or if you don't want to go for a fold next, in a style more similar to
the original:
maximum [] = undefined
maximum [x] = x
maximum (a:b:xs) = maximum (max a b : xs)
It even reproduces the stack overflow, though for a different reason.
Better write it this way:
Simon Marlow [EMAIL PROTECTED] writes:
No idea, I'm afraid. ghc -v might help you. Try cut-and-pasting the
linker command line and play around with ordering of -l options.
I noticed the linker is incredibly picky about the sequence of
options. Anyway, I suspected that, but I couldn't seem
Thank you very much for introducing tail recursion.
It's my first time to hear this. :)
However, I'm wondering whether every loop structure from C like language can
be translated to this kind of tail recursion?
Yours, Hank
-Original Message-
From: Chris Kuklewicz [mailto:[EMAIL
Brian, Bulat, thank you,
thu
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Brian, mmm, no you wasn't missing the point : actually, i asked if we
bind against c or c++. But that way, you answer the general
guidelines part of the question.
thx
thu
2006/6/27, minh thu [EMAIL PROTECTED]:
Brian, Bulat, thank you,
thu
___
--- Huazhi (Hank) Gong [EMAIL PROTECTED] wrote:
Thank you very much
for introducing tail recursion.
It's my first time to hear this. :)
However, I'm wondering whether every loop structure from C like language can
be translated to this kind of tail recursion?
Yes, as discovered by
John
Hi Jason.
My $0.02
On 27/06/06, [EMAIL PROTECTED]
[EMAIL PROTECTED] wrote:
-- Forwarded message --
From: Jason Dagit [EMAIL PROTECTED]
Requirements:
Okay, so now that you know why I'm here, let me give you an idea of
what my *ideal* GUI library would be for this project
[EMAIL PROTECTED] wrote:
Quoting Brian Hulley [EMAIL PROTECTED]:
It is defnitely *a* haskell. There is actually no word in English
with a silent 'h', though this statement is unfortunately
controversial and news to whoever wrote the spell checker used in
many printed publications.
There is
Bulat Ziganshin wrote:
Hello Brian,
Tuesday, June 27, 2006, 2:43:15 AM, you wrote:
achieve a goal. One other thing to bear in mind is that foreign
calls are extremely slow, so for example it is much faster to use the
Foreign.Marshal.Array and Foreign.C.String functions to allocate and
Aaron Denney wrote:
On 2006-06-27, Brian Hulley [EMAIL PROTECTED] wrote:
[EMAIL PROTECTED] wrote:
Quoting Brian Hulley [EMAIL PROTECTED]:
It is defnitely *a* haskell. There is actually no word in English
with a silent 'h', though this statement is unfortunately
controversial and news to
At Tue, 27 Jun 2006 20:36:30 +0100,
Brian Hulley wrote:
What about words like 'hour' and 'honest'?
Don't forget honor.
So I'd say these two words are closely related, so the search is still on
for another word with silent 'h' not related to time or integrity.
How about heir? Also, until
Jeremy Shaw wrote:
At Tue, 27 Jun 2006 20:36:30 +0100,
Brian Hulley wrote:
What about words like 'hour' and 'honest'?
Don't forget honor.
So I'd say these two words are closely related, so the search is
still on for another word with silent 'h' not related to time or
integrity.
How
On Tue, 2006-06-27 at 13:35 -0700, Jeremy Shaw wrote:
. . .
How about heir? Also, until recently, herb and humble?
I grew up in the southern US, and I was taught 'herb' with silent 'h'
but 'humble' with aspirated 'h'. With the 'h' silent 'humble' sounds
very Dickensian to my ear.
-- Bill
On Tue, Jun 27, 2006 at 08:29:21AM -0700, Jared Updike wrote:
Am I the only one whose first instinct upon reading this is EW!?
You are not the only one, judging from my own experience. I made my
own sort of algebraic datatypes / abstract datatypes in C# by using
Enums and Objects and runtime
22 matches
Mail list logo
