Hey guys,
I'm trying to install yi using cabal but I got this error. Any ideas
how to solve it?!
I'm using ghc-6.10.1 and cabal-install version 0.6.2 using version
1.6.0.2 of the Cabal library.
Thanks,
Marcelo
-- Code --
$ cabal install yi
Resolving dependencies...
Configuring yi-0.6.1...
Excerpts from Marcelo Sousa's message of Sun Sep 27 14:13:43 +0200 2009:
Hey guys,
I'm trying to install yi using cabal but I got this error. Any ideas
how to solve it?!
I'm using ghc-6.10.1 and cabal-install version 0.6.2 using version
1.6.0.2 of the Cabal library.
This means that you
and now I'll really have to figure out Iteratee / Enumerator to solve it.
Can I call myself a Haskeller now?
Günther.
PS: The problem domain is crawling over a website.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
I'm writing web software for a photograph gallery. I want to be able
to display selective fields from the EXIF data. I thought I would be
able to use the GD and exif libraries from Hackage to do
this. However:
Calling Graphics.GD.loadJpegByteString followed by
Graphics.GD.saveJpegFile does not
Tom Tobin korp...@korpios.com writes:
On Tue, Sep 1, 2009 at 3:14 AM, Christian
Maederchristian.mae...@dfki.de wrote:
It seems, bootstrapping cabal went wrong. Does
http://hackage.haskell.org/platform/2009.2.0.2/haskell-platform-2009.2.0.2-i386.dmg
work?
Installing the Haskell Platform
В сообщении от 27 сентября 2009 18:59:57 Günther Schmidt написал:
and now I'll really have to figure out Iteratee / Enumerator to solve it.
Can I call myself a Haskeller now?
If you wish so.
But in fact you only need to overcome laziness. Not the first time in the life
I suppose.
Am Sonntag 27 September 2009 16:59:57 schrieb Günther Schmidt:
PS: The problem domain is crawling over a website.
E. Quick, swat it!
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
gue.schmidt:
and now I'll really have to figure out Iteratee / Enumerator to solve it.
Can I call myself a Haskeller now?
Günther.
PS: The problem domain is crawling over a website.
Can you just use strict IO?
-- Don
___
Haskell-Cafe mailing
colin:
I'm writing web software for a photograph gallery. I want to be able
to display selective fields from the EXIF data. I thought I would be
able to use the GD and exif libraries from Hackage to do
this. However:
Calling Graphics.GD.loadJpegByteString followed by
Dan Rosén wrote:
What complexity does these functions have?
I argue that the shuffleArr function should be O(n), since it only contains
one loop of n, where each loop does actions that are O(1): generating a random
number and swapping two elements in an array.
However, they both have the
No, it's not quite what it sounds like. :-)
Stuart Halloway recently posted a series of blog entries entitled
Java.next[1], discussing the benefits of four other languages that
compile to JVM bytecode and interoperate with Java: Clojure, Groovy,
JRuby, and Scala. I thought I'd put my oar in and
Nicolas Pouillard wrote:
Excerpts from Marcelo Sousa's message of Sun Sep 27 14:13:43 +0200 2009:
Hey guys,
I'm trying to install yi using cabal but I got this error. Any ideas
how to solve it?!
I'm using ghc-6.10.1 and cabal-install version 0.6.2 using version
1.6.0.2 of the Cabal library.
I'm not sure what the point of your series is. No one who is using
Java now commercially can move to Haskell because Haskell doesn't run
on the JVM.
It makes sense to discuss Clojure, Groovy, JRuby, Scala, Fan, etc., as
next Java's, because they all run on the JVM and have seamless
Don == Don Stewart d...@galois.com writes:
Don colin:
I'm writing web software for a photograph gallery. I want to be
able to display selective fields from the EXIF data. I thought
I would be able to use the GD and exif libraries from Hackage
to do this. However:
Hi,
I am pleased to announce the release of ListTree.
ListTree is a package for combinatorial search and pruning of trees,
and should be useful for problems such as those in Google Code Jam
(where I, and possibly others* could make use of it), but possibly
could even be useful for real
Hi guys,
Do we have anything like half precision floats in Haskell? Maybe in some non
standard libraries? Or I have to use FFI + OpenEXR library to achieve this?
Cheers,
Oleksandr.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hello, I recently worked with QuickCheck for a while, But I still
can't handle it well, And a few questions come to my mind.
1. How to find properties
In QuickCheck examples on the codes or the papers, they find good
properties easily. How did they find these properties? What property
can make
yair...@gmail.com wrote:
Hi,
I am pleased to announce the release of ListTree.
ListTree is a package for combinatorial search and pruning of trees,
and should be useful for problems such as those in Google Code Jam
(where I, and possibly others* could make use of it), but possibly
could even be
On Sun, Sep 27, 2009 at 3:19 PM, Yusaku Hashimoto nonow...@gmail.com wrote:
...
Do you think I wasted times? Have you ever tried PDD? And has it
worked? If you have experience with TDD, how do you think about PDD?
If you have any answers in any questions above, please tell me them.
Thanks in
What about the built-in Float type?
Prelude Foreign.Storable sizeOf (undefined :: Float)
4
Prelude Foreign.Storable sizeOf (undefined :: Double)
8
Or maybe you mean something that can be used with FFI calls to C, in
which case Foreign.C.Types (CFloat).
Both instance the Floating, RealFloat,
I'm still playing round with my random dieroll generation program. In
doing so, I just hit a segmentation fault (I didn't think Haskell
could *cause* a segfault!) I'm sure it's my code - I got this to
compile by fiddling with types until the errors (which I didn't
understand) went away. Certainly
2009/9/27 Paul Moore p.f.mo...@gmail.com:
I'm still playing round with my random dieroll generation program. In
doing so, I just hit a segmentation fault (I didn't think Haskell
could *cause* a segfault!) I'm sure it's my code - I got this to
compile by fiddling with types until the errors
According to http://www.haskell.org/haskellwiki/Literate_programming,
the following should compile properly because the second block of code
will be ignored by GHC:
\begin{code}
main = putStrLn Hello world!
\end{code}
\begin{code}%
main = -- TODO
\end{code}%
However, Hackage's automatic build
2009/9/27 andy morris a...@adradh.org.uk:
mersenne-random uses the FFI, so it's probably that. I just ran your
code with mersenne-random-1.0 and didn't get a segfault. What version
are you using?
Not entirely sure, I just did a cabal install a short while back.
cabal list mersenne
Warning:
He meant 16-bit floats, which have sizeOf 2
On GPUs this is common and implemented in hardware (at least on the old
GPUs).
On DPSs you commonly had 24-bit floats too.
But these days I guess 32-bit is the minimum one would want to use? Most of
the time I just use double anyway :)
On Sun, Sep 27,
Am Sonntag 27 September 2009 22:02:45 schrieb andy morris:
mersenne-random uses the FFI, so it's probably that. I just ran your
code with mersenne-random-1.0 and didn't get a segfault.
Yup, works here, too. And everything but mersenne-random should be fool-proof.
What version are you using?
Oh sorry, I misread the original question. I take it all back!
-Ross
On Sep 27, 2009, at 4:19 PM, Peter Verswyvelen wrote:
He meant 16-bit floats, which have sizeOf 2
On GPUs this is common and implemented in hardware (at least on the
old GPUs).
On DPSs you commonly had 24-bit floats
Hi,
Yes, I mean sizeOf 2. It's useful not only on GPUs but also in normal
software. Think of huge data sets in computer graphics (particle clouds,
volumetric data, images etc.) Some data (normals, density, temperature and
so on) can be easily represented as float 16 making files 200 GB instead of
Hi,
Yes, I mean sizeOf 2. It's useful not only on GPUs but also in normal
software. Think of huge data sets in computer graphics (particle clouds,
volumetric data, images etc.) Some data (normals, density, temperature and
so on) can be easily represented as float 16 making files 200 GB instead of
I think a 16-bit float type would require compiler revisions as
opposed to doing something within the present type classes.
This is similar to how Java would benefit from an unsigned byte
primitive type for processing images, etc., whereas Haskell already
has Word8.
--
Regards,
Casey
Olex P wrote:
Hi,
Yes, I mean sizeOf 2. It's useful not only on GPUs but also in normal
software. Think of huge data sets in computer graphics (particle clouds,
volumetric data, images etc.) Some data (normals, density, temperature and
so on) can be easily represented as float 16 making files
On Mon, Sep 28, 2009 at 4:42 AM, Gwern Branwen gwe...@gmail.com wrote:
On Sun, Sep 27, 2009 at 3:19 PM, Yusaku Hashimoto nonow...@gmail.com
wrote:
...
Do you think I wasted times? Have you ever tried PDD? And has it
worked? If you have experience with TDD, how do you think about PDD?
If
Okay looks like FFI is the only way to go, Thanks.
Cheers,
Oleksandr.
On Sun, Sep 27, 2009 at 9:50 PM, wren ng thornton w...@freegeek.org wrote:
Olex P wrote:
Hi,
Yes, I mean sizeOf 2. It's useful not only on GPUs but also in normal
software. Think of huge data sets in computer graphics
Neil Mitchell wrote:
I am pleased to announce CmdArgs v0.1. CmdArgs is a library for easy
command line argument processing - taking the arguments passed into
your program from getArgs and converting them into a structured value
for use in your program. Compared to the System.Console.GetOpts
I'd like to see something resembling as-patterns in type signatures.
Specifically, there are cases where I'm inclined to use
(m ~ pat) in a type context when m isn't otherwise constrained, just so I
can use m as an abbreviation for pat. To reduce these cases, I'd like to
see the syntax m...@pat
On Sun, Sep 27, 2009 at 5:29 PM, Louis Wasserman
wasserman.lo...@gmail.com wrote:
I'd like to see something resembling as-patterns in type signatures.
Specifically, there are cases where I'm inclined to use
(m ~ pat) in a type context when m isn't otherwise constrained, just so I
can use m as
That's not really true. Just use CAL from the Open Quark framework... It's
almost Haskell 98, with some extras, and compiles to fast JVM code.
http://openquark.org/Open_Quark/Welcome.html
http://openquark.org/Open_Quark/Welcome.htmlThey even seem to do all kinds
of advanced optimizations - like
Whoops, bugfixes:
Release notes for 0.4.2, 2009-09-27:
- fix a bug where every --max-items-th announcement was skipped
Release notes for 0.4.1, 2009-09-26:
- fix release notes
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Fibonacci numbers are always surprising.
Try this on a terminal that's 159 characters wide (using a properly
sized xterm(1) may be a good idea):
let f = 1 : 1 : zipWith (+) f (tail f) in take 780 f
Ciao,
Kili
--
There are two ways of constructing a software design: One way is
to make
Now see if you can tell us why this pattern is similar:
[ replicate n '-' | n - [140..171] ]
Hint: Look at the closed form as n gets big:
http://en.wikipedia.org/wiki/Fibonacci_number#Closed_form_expression
After that, you can tell us why it's a parabola.
Matthias Kilian wrote:
Fibonacci
On Sep 28, 2009, at 9:40 AM, Olex P wrote:
Hi,
Yes, I mean sizeOf 2. It's useful not only on GPUs but also in
normal software. Think of huge data sets in computer graphics
(particle clouds, volumetric data, images etc.) Some data (normals,
density, temperature and so on) can be easily
It's been nearly a month now since the Edinburgh Hackathon (29 30
August), organised to coincide with the convergence of Haskellers
arriving for the ICFP. My apologies for this very late summary!
Eric Kow was the driving force behind this Hackathon, though I agreed
to help out locally because I
On Mon, 28 Sep 2009 12:06:47 +1300, you wrote:
On Sep 28, 2009, at 9:40 AM, Olex P wrote:
Hi,
Yes, I mean sizeOf 2. It's useful not only on GPUs but also in
normal software. Think of huge data sets in computer graphics
(particle clouds, volumetric data, images etc.) Some data (normals,
Hi there,
when I try to install frag,I get this error:
.cabal/bin/cabal install frag
Resolving dependencies...
Downloading frag-1.1.2...
Configuring frag-1.1.2...
Preprocessing executables for frag-1.1.2...
Building frag-1.1.2...
[ 1 of 39] Compiling IdentityList ( src/IdentityList.hs,
On Saturday 27 June 2009 18:31:25 Günther Schmidt wrote:
Hi guys,
is there a mailing list for haskellers that defected to F#?
Here's the F# mailing list on Google Groups:
http://groups.google.com/group/fsharp?hl=en
--
Dr Jon Harrop, Flying Frog Consultancy Ltd.
I think this is an opengl version problem. I came across this error in
vacuum-opengl after I had upgraded my opengl. I patched it up using a
fromnumeric type call.
On Mon, Sep 28, 2009 at 8:00 AM, selahaddin gerdan
selahattin.ger...@gmail.com wrote:
Hi there,
when I try to install frag,I get
Louis Wasserman wrote:
I'd like to see something resembling as-patterns in type signatures.
Specifically, there are cases where I'm inclined to use
(m ~ pat) in a type context when m isn't otherwise constrained, just so I
can use m as an abbreviation for pat. To reduce these cases, I'd like to
On 2009-09-27 10:36 -0600 (Sun), John A. De Goes wrote:
I'm not sure what the point of your series is. No one who is using Java
now commercially can move to Haskell because Haskell doesn't run on the
JVM.
That's a rather strong statement, and I don't accept it. I can not only
think of many
Andy Gimblett wrote:
Is there a way to make it automatically update a single contents page
with links to the documentation of all installed packages?
See:
http://thread.gmane.org/gmane.comp.lang.haskell.cafe/53531/focus=53560
49 matches
Mail list logo
