On 12/11/06, Paul Moore [EMAIL PROTECTED] wrote:
F:\cabal-1.1.6.1runhaskell Setup.lhs install
Installing: C:\Program Files\Haskell\Cabal-1.1.6.1\ghc-6.6
C:\Program Files\Haskell\bin Cabal-1.1.6.1...
Setup.lhs: Error: Could not find module: Distribution.Compiler with any suffix:
[hi]
The magic
Paul Moore on 2006-12-11 22:46:44 +:
What I *can* do, is to attempt to install one of the libraries that
looks closest to what I want (probably HDBC, because I'm familiar with
the Python DB-API). But I honestly have little or no idea how to start
- following the HDBC link on the Haskell
On Mon, Dec 11, 2006 at 11:25:59PM +, Paul Moore wrote:
On 12/11/06, Kirsten Chevalier [EMAIL PROTECTED] wrote:
Don't apologize; you're not being dumb. But, you have to realize that
if you're using Haskell at all, you *are* the Haskell community.
OK, thanks for the gentle push. After a
Hi,
I wonder if a similar theme is apropriate for proposed book.
Graphics and sounds give a very direct feedback to the programmer, and
I expect that helps with the motivation.
Perhaps a single largish application could be the end product of the
book. Like a game or something. You'd start off
the typical good solution to this problem in c or c++ is to use a
string reverse function on the entire buffer, then re-reverse each
word. this leaves multiple spaces correctly embedded in the larger
string.
that approach, of course, won't work in haskell, since it relies on
updates. but if the
Hi Nicolas,
On 12/11/06, Nicolas Frisby [EMAIL PROTECTED] wrote:
The interpreter infers that m = (e -) because of the types of snd and fst.
When snd and fst are considered as monadic computations in the (e -)
monad, there types are:
Prelude :t fst
fst :: (a, b) - a
Prelude :t snd
snd :: (a,
On Dec 11, 2006, at 18:48 , Steve Downey wrote:
the typical good solution to this problem in c or c++ is to use a
string reverse function on the entire buffer, then re-reverse each
word. this leaves multiple spaces correctly embedded in the larger
string.
that approach, of course, won't work
Lyle Kopnicky wrote:
The code below is using way more RAM than it should. It seems to only
take so long when I build the 'programs' list - the actual
reading/parsing is fast. For a 5MB input file, it's using 50MB of RAM!
Any idea how to combat this?
1) I strongly recommend to work through at
Joachim Durchholz wrote:
These activities are among the major reasons why I'm finally prepared to
get my feet wet with Haskell after years of interested watching.
I'll probably fire off a set of newbie questions for my project, though
it might still take a few days to get them organized well
Hi Steve,
On 12/11/06, Steve Downey [EMAIL PROTECTED] wrote:
transforming one two three four into four three two
one, how could this be done?
This is a good problem for
Parsechttp://www.cs.uu.nl/%7Edaan/download/parsec/parsec.html
:
import Text.ParserCombinators.Parsec
if you're using Haskell at all, you *are* the Haskell community.
[..lots of I searched, I found, I tried, I got this error, I thought,
I tried this workaround, I got to this point, now I'm stuck here..]
I just wanted to comment that I find this kind of experience report
very helpful,
Hello,
1. Simple documentation of how to install the library (starting from a
vanilla GHC installation on Windows, plus Oracle software, to the
point where I can use the library in my code). All I need is Oracle
access, so other database client libraries can be ignored. I'd rather
not use ODBC,
Hi all,
I'm considering the use of Haskell to manipulate large data
structures for Computer Graphics (large geometric datasets). I'm
wondering what's the best way to do it. As objects (not in the OO
sense) in Haskell are immutable, how can I add a vertex to a large
mesh without using obscene
Sebastian Sylvan wrote:
Perhaps a single largish application could be the end product of the
book. Like a game or something. You'd start off with some examples
early on, and then as quickly as possible start working on the low
level utility functions for the game, moving on to more and more
On Mon, Dec 11, 2006 at 10:27:44PM -0300, Alex Queiroz wrote:
Hi all,
I'm considering the use of Haskell to manipulate large data
structures for Computer Graphics (large geometric datasets). I'm
wondering what's the best way to do it. As objects (not in the OO
sense) in Haskell are
Hallo,
On 12/11/06, Stefan O'Rear [EMAIL PROTECTED] wrote:
No. Haskell's lists are linked lists, enlarge creates a single new link
without modifying (and copying) the original.
___
Thanks. Is there a way to mimic this behaviour with my own
No. Haskell's lists are linked lists, enlarge creates a single new link
without modifying (and copying) the original.
Thanks. Is there a way to mimic this behaviour with my own code?
Yes. Take a look at Data.Map. This data structure provides various
operations which create a new map from
Alex Queiroz wrote:
On 12/11/06, Stefan O'Rear [EMAIL PROTECTED] wrote:
No. Haskell's lists are linked lists, enlarge creates a single new link
without modifying (and copying) the original.
Thanks. Is there a way to mimic this behaviour with my own code?
It is the default for any data
On 12/12/2006, at 11:13 AM, Brandon S. Allbery KF8NH wrote:
On Dec 11, 2006, at 18:48 , Steve Downey wrote:
the typical good solution to this problem in c or c++ is to use a
string reverse function on the entire buffer, then re-reverse each
word. this leaves multiple spaces correctly
hello,all,
I am new to haskell,and have read some tutorial, but I would like to read
some real code from real haskell project, I believe this will help me
study and use haskell quickly.
would anyone please give me some suggestion about opensource project that
a new haskell user should study?
Hello, fellow Haskellers!
jcreigh, from #haskell, has found a great set of exercises to work
through. Check out the new wiki pages indexed at
http://haskell.org/haskellwiki/99_Haskell_exercises . These have all
been done in lisp, but of COURSE they can be done at least as well in
Haskell, if not
---
Haskell Weekly News
http://sequence.complete.org/
Issue 53 - December 12, 2006
---
Welcome to issue 53 of HWN, a weekly newsletter covering
101 - 122 of 122 matches
Mail list logo
