Evan Laforge wrote:
I used to get annoyed about all the java boilerplate and awkwardness.
But then I learned that if I relax and stop thinking so much about the
aesthetics of what I'm writing, I can just let my fingers go on typing
without having to think too much.
:-) A good Java IDE will
Ketil Malde wrote:
There was a deliberate change in strictness in 0.5 making binary strict,
which apparently speeds up GHC.
Ah okay. I suppose that passes the buck to network-dns. Presumably it
could be fixed fairly simply by requiring binary 0.5 (as you
suggested). Ideally, though, the
I've been trying to get in touch with the maintainers of the Binary
package, to report an issue. When I emailed the addresses given on
Hackage, I got an automated response saying I had used an address that
was no longer current.
I don't want to put pressure on anyone to fix my bug -- I
Ivan Lazar Miljenovic wrote:
Pete Chown 1...@234.cx writes:
Is there a way of making Cabal install dependencies using the system
package manager, then?
If you mean cabal-install, then no, there's no integration on either
side.
That's what I thought. As a result of this, you may find
Ivan Miljenovic wrote:
Pete Chown 1...@234.cx wrote:
... This causes Cabal to install 'foo' (because it
is a dependency) and it won't use the distribution's package manager.
Why won't it? This, of course, depends on how the distribution ships
`foo' in regards to static/shared libraries
Dominic Steintiz wrote:
I seem to be in some sort package dependency hell (which I thought the
Haskell Platform did away with).
I install ghc using my package manager (I'm on opensuse).
I was just thinking, interactions between Cabal and the distribution
package manager could get worse, as
Mujtaba Boori wrote:
sure I did enjoy the discussion here Yitzchak Gale. I have already
submitted several questions ,and you guys were very helpful. However , I
am not sure how I will use Haskell other than my Haskell course that has
just finished.
I would very much recommend the Real World
Mujtaba Boori wrote:
Define a higher order function that tests whether two functions , both
defined on integers , coincide for all integers between 1 and 100
If this really is a homework question, I dare you to submit this
solution. Try it for yourself, it works fine. :-)
module Main
Neil Mitchell wrote:
The indentation rules are quite complex, but just type your code
sensibly indented and it will probably just work.
My biggest problem in this area was following haskell-mode's defaults
too strictly. I found that things ended up indented more than was
necessary for clear
Arnaud Bailly wrote:
I am on the verge of starting a new sofware development project for a
customer and I wonder whether or not Haskell would be the right tool
to do the job.
One snag is that I doubt you could ring up an agency and ask for half a
dozen Haskell programmers. You could
Simon Marlow wrote:
GHC 6.6 will allow this, because we added the -x flag (works just like
gcc's -x flag). eg. ghc -x hs foo.wibble will interpret foo.wibble as
a .hs file. I have an uncommitted patch for runghc that uses -x, I need
to test commit it.
Ah, that will be very useful,
Neil Rutland wrote:
stops :: int-int-int
I think that says that the function stops takes two integers and returns
an integer.
This is correct (though as someone else pointed out, Haskell types start
with a capital letter).
What i'm not entirely sure of is how i'd then write the function
Donald Bruce Stewart wrote:
a) Compile your code with GHC instead of interpreting it. GHC is blazing fast.
That's one answer I suppose! I quite liked using Hugs for that
particular program because it's a script that I didn't want to spend
time compiling. Oh well, it's not that important.
I've got another n00b question, thanks for all the help you have been
giving me!
I want to read a text file. As an example, let's use
/usr/share/dict/words and try to print out the last line of the file.
First of all I came up with this program:
import System.IO
main = readFile
Shannon -jj Behrens wrote:
I'm only using | as a replacement
for $ because I find it more readable to read left to right than right
to left.
You can see this in two different ways, I think. Imagine the following:
(+1) (*2) 3
This is not legal Haskell because it gets parsed as:
((+1) (*2))
I've been trying to get to the point with Haskell where I can write
useful programs, and I've come across something I don't understand with
the type system. I hope this is the right place to ask.
I came up with the following list of declarations:
a = ()
b x = (x )
c x y = (x y)
It turns
John Meacham wrote:
I'm jumping into this discussion half way through, so my apologies if I
mention something that's already been talked about!
of course, [mmap] can only be done on a limited type of file on some
architectures, so it should be an optimization under the hood rather
than an
17 matches
Mail list logo
