I can replicate this err with 6.8.3 on my macbook (os 10.5.4.) It also
appears to fail with a copy of the GHC HEAD as well:
$ uname -a
Darwin existential.local 9.4.0 Darwin Kernel Version 9.4.0: Mon Jun 9
19:30:53 PDT 2008; root:xnu-1228.5.20~1/RELEASE_I386 i386
$ ghc --version
The Glorious
From the looks of the User Accounts page on hackage, Ross Patterson
seems to be responsible, you can contact him here:
[EMAIL PROTECTED]
Austin
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Status update: after checking out the latest HEAD and building it, the
above error does not occur:
$ ~/ghc-head/bin/ghc --version
The Glorious Glasgow Haskell Compilation System, version 6.9.20080720
$ ~/ghc-head/bin/ghc --make DerivingError.hs
no location info:
Warning:
I had similar experiences as you when attempting to write high
performance Haskell; the language makes you want to use high-level
abstracted functions but the optimizer (while amazing, to be honest)
seems to miss a few cases that it seems like it should hit.
The problem seems to be that the
Hi,
After my last issue with GHC's HEAD, I tried checking it out again and
getting the patches for the libraries and lo and behold, it worked. So
now I'm up to date with the latest libraries and the compiler, but it
appears that building NDP itself is proving to be troublesome.
(This is on GHC
Hi,
I defiend the following function to get the last element of a list:
final [a] = a
final (_:t) = final t
and it works as expected. Since I didn't want to have a non exhaustive pattern,
I added the following case:
final [] = [] - I consider that the end of an empty list is the empty
Fernando Rodriguez wrote:
Hi,
I defiend the following function to get the last element of a list:
final [a] = a
final (_:t) = final t
and it works as expected. Since I didn't want to have a non exhaustive
pattern, I added the following case:
final [] = [] - I consider that the end of an
Hi Fernando,
I hope you don't mind, but I've moved this over to the Haskell-beginners
mailing list, where I think this kind of question will be more
appropriate.
In Haskell, it helps to think of functions in terms of an input and an
output, that is, what is the thing that is going into the
2008/7/21 Fernando Rodriguez [EMAIL PROTECTED]:
Suddenly, the function stoped working with a rather cryptic (for a newbie at
least) error message:
*Temp final [4,5]
interactive:1:9:
No instance for (Num [a])
arising from the literal `5' at interactive:1:9
Possible fix: add an
Hi Fernando,
final [] = [] - I consider that the end of an empty list is the empty list
final [a] = a
final (_:t) = final t
Suddenly, the function stoped working with a rather cryptic (for a newbie
at least) error message:
*Temp final [4,5]
interactive:1:9:
No instance for
2008/7/19 Jim Burton [EMAIL PROTECTED]:
opts = [CurlEncoding text/xml
, CurlHttpHeaders [X-EBAY-API-COMPATIBILITY-LEVEL=++compatLevel
, X-EBAY-API-DEV-NAME=++devName
, X-EBAY-API-APP-NAME=++appName
,
At Mon, 21 Jul 2008 13:21:06 +0100,
=?ISO-8859-1?Q?Chadda=EF_Fouch=E9?= wrote:
2008/7/19 Jim Burton [EMAIL PROTECTED]:
opts = [CurlEncoding text/xml
, CurlHttpHeaders [X-EBAY-API-COMPATIBILITY-LEVEL=++compatLevel
, X-EBAY-API-DEV-NAME=++devName
Hi!
-- Background: --
I have some foreign objects that are mapped to ForeignPtr's, say
newtype Obj = O (ForeignPtr Obj)
and a foreign collection where those objects are added. The adding
is something on the lines of
addObj, removeObj :: Collection - Obj - IO ()
id est, the C code of the
http://www.go-hero.net/jam/lang
Haskell as the highest ranked FP language in the Google Code Jam,
with more submissions than Lisp, Scheme, SML and OCaml put together :)
# C++ (used by 2875 people)
# Java (used by 1747 people)
# Python (used by 691 people)
# C# (used by 609
Hello,
I am working on POSIX stuff. I have used Linux as my POSIX OS and have
read source when I could find it. Does anybody in this
group of Linux newsgroup where one can ask Linux-related implementation
questions?
Regards, Vasili
___
Just to avoid any misunderstanding...
I am certain that C.M. Brown meant to say CC'ed the Haskell-beginners
mailing list instead of moved, but I think it's worth emphasizing
that the new beginners list was ostensibly created for various discussed
reasons, but all to provide a more tailored
Hi all,
On the other day I noticed that we could optimize 'sequence' more.
I needed it for my monadic parser. Below is my small experiment.
Sequence from standard library needs 2.3s to finish (and additional
stack space), my version uses only 0.65s and default stack.
Is my version better or am
Hi Vasili,
try one of Linux groups at http://www.nabble.com/Linux-f252.html or maybe
Linux kernel group http://www.nabble.com/linux-kernel-f49.html . But I don't
know if there are people working with Haskell in Linux as well. But if you
would like to ask something only about POSIX, I think they
On Mon, Jul 21, 2008 at 1:54 PM, Gracjan Polak [EMAIL PROTECTED] wrote:
Hi all,
On the other day I noticed that we could optimize 'sequence' more.
I needed it for my monadic parser. Below is my small experiment.
Sequence from standard library needs 2.3s to finish (and additional
stack
Hi Vasili,
Please have a look at http://vger.kernel.org/vger-lists.html
The main list is linux-kernel. Depending on the level of your questions,
you may also check
linux-newbiehttp://vger.kernel.org/vger-lists.html#linux-newbie.
If it concerns a defined subsystem/architecture, there is often a
On Mon, Jul 21, 2008 at 01:05:48PM +1200, Richard A. O'Keefe wrote:
I think it may be time for a little clarity about aoicb's.
From the Single Unix Specification:
The aio.h header shall define the aiocb structure
which shall include AT LEAST the following members:
int
Hi
Suggested by Andrew Wager on libraries@, moving to haskell-cafe@ since
its a really interesting idea and libraries is probably not the best
place for it.
Not sure if this is the best place to suggest this, but I was
wondering about the possibility of extending the model that we
If you can demonstrate the required laziness/strictness properties
are identical, looks like a nice idea.
gracjanpolak:
Hi all,
On the other day I noticed that we could optimize 'sequence' more.
I needed it for my monadic parser. Below is my small experiment.
Sequence from standard
hi
I was curious as to whether my implementation of a Rose Tree and a sumTree
function was correct. The aumTree adds up the elements of a tree.
data Tree a = Leaf a | Node [Tree a]
sumTree :: Tree Int - Int
sumTree (Node []) = 0
sumTree (Node xs) = sum (map sumTree xs)
The problem with
There are a few different kinds of trees, but if you only need to
store data on the leaves, that representation will work. As for your
sumTree function, you are indeed missing a case...consider sumTree
(Leaf 3)! Once you deal with that case, the other two can actually be
combined (since sum [] =
25 matches
Mail list logo
