On Thu, 7 Mar 2013, Dan Lior wrote:
Hello,
I'm new to Haskell and this is my first post to this forum.
A few questions right off the bat:
1) Is this the right place for newbies to post questions about Haskell?
2) Is there a FAQ for Haskell questions?
http://www.haskell.org/haskellwiki/C
On 8 March 2013 11:56, Brandon Allbery wrote:
> On Thu, Mar 7, 2013 at 7:45 PM, Dan Lior wrote:
>>
>> 1) Is this the right place for newbies to post questions about Haskell?
>
>
>
> This is most a list for announcements; beginn...@haskell.org is better for
> these kinds of questions, and haskell-
On Thu, Mar 7, 2013 at 7:45 PM, Dan Lior wrote:
> 1) Is this the right place for newbies to post questions about Haskell?
>
This is most a list for announcements; beginn...@haskell.org is better for
these kinds of questions, and haskell-c...@haskell.org for general
discussion.
pred :: Int -> I
Hello,
I'm new to Haskell and this is my first post to this forum.
A few questions right off the bat:
1) Is this the right place for newbies to post questions about Haskell?
2) Is there a FAQ for Haskell questions?
3) Are there any active Haskell user groups in the Chicago area?
A more techn
Also note that this will install ghc into the underlying unix
environment. If you want a pretty GUI, I don't know of any for Mac OS
X. A quick search on google for "mac haskell ide" brings up
http://www.hoovy.org/HaskellXcodePlugin/ -- this might help you.
I will note that if you are developing a
You need to install Xcode (from your Mac OS disk) before you can use ghc.
On 5/20/07, Wolfgang De Meuter <[EMAIL PROTECTED]> wrote:
Exactly what I mean. When you download and unpack the file you get a
unix folder with install stuff. After trying to follow the
installation instructions, it compla
Exactly what I mean. When you download and unpack the file you get a
unix folder with install stuff. After trying to follow the
installation instructions, it complains that I don't have a gcc on my
machine...
Wolf
On 20-mei-07, at 22:41, Tom Harper wrote:
http://haskell.org/ghc/download_
http://haskell.org/ghc/download_ghc_661.html#macosxppc
On 5/20/07, Wolfgang De Meuter <[EMAIL PROTECTED]> wrote:
Dear all,
I used to be a Gofer freak on my Mac back in the mid-nineties.
Recently I have regained interest in FP and I'm trying to get hold of
an implementation of Haskell on my G4.
Dear all,
I used to be a Gofer freak on my Mac back in the mid-nineties.
Recently I have regained interest in FP and I'm trying to get hold of
an implementation of Haskell on my G4. I must say that this hunt has
been quite frustrating until now. I don't know unix and I'm unwilling
to lear
Ryan Ingram wrote:
[EMAIL PROTECTED] is better for this type of question. Follow-up is set
to it.
Here's a test case for the problem I'm having; I'm using runhaskell from
ghc v6.6.
Problem #1) Without -fallow-undecidable-instances, I get the following
error:
Constraint is no smaller
Maybe this is not what you want, but you can also put the 'convl'
function in the 'ConvertToInt' class.
class ConvertToInt a where
conv :: a -> Int
convl :: [a] -> [Int]
With this approach you don't need any language extension.
regards,
Bas van Dijk
On 5/11/07, Ryan Ingram <[EMAIL PROTEC
Add: -fallow-overlapping-instances to your OPTIONS pragma and read
about overlapping instances in the GHC User Guide:
http://www.haskell.org/ghc/docs/latest/html/users_guide/type-extensions.html#instance-overlap
regards,
Bas van Dijk
On 5/11/07, Ryan Ingram <[EMAIL PROTECTED]> wrote:
Here's a
Here's a test case for the problem I'm having; I'm using runhaskell from ghc
v6.6.
Problem #1) Without -fallow-undecidable-instances, I get the following
error:
Constraint is no smaller than the instance head
in the constraint: ConvertToInt a
(Use -fallow-undecidable-instances to permi
On 02/05/07, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
Hello,
could someone please explain why "fix" is necessary here:
fix (\f l -> if null l then [] else let (s,e) = break (==' ') l in s:f (drop 1
e))
Source: http://www.haskell.org/haskellwiki/Blow_your_mind
Because you're writing a rec
Hello,
could someone please explain why "fix" is necessary here:
fix (\f l -> if null l then [] else let (s,e) = break (==' ') l in s:f (drop 1
e))
Source: http://www.haskell.org/haskellwiki/Blow_your_mind
Thanks.
phiroc
--- Begin Message ---
Hello,
could someone please explain why "fix" in
PROTECTED] [mailto:[EMAIL PROTECTED]
Sent: Tuesday, May 01, 2007 5:35 PM
To: Taillefer, Troy (EXP)
Subject: Re: [Haskell-cafe] RE:Cross-over from Haskell.org [Haskell] Re:
Newbie: what are the advantages of Haskell?
Taillefer, Troy (EXP) wrote:
> I really dislike Perl as a programming language
Rafael wrote:
Hi
HTTP. We also need better availability of libraries, and a more
standard and reliable way to install them and specify their
dependencies. We could also do with a good debugger. These are being
addressed by the Google Summer of Code project.
Hi Neil, a good debugger ? What is i
Simon
| -Original Message-
| From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Taillefer, Troy
| (EXP)
| Sent: 27 April 2007 22:32
| To: haskell@haskell.org
| Subject: [Haskell] Re: Newbie: what are the advantages of Haskell?
|
|
| Mike,
|
| It has affected my Java/C/C
Hi
HTTP. We also need better availability of libraries, and a more
standard and reliable way to install them and specify their
dependencies. We could also do with a good debugger. These are being
addressed by the Google Summer of Code project.
Hi Neil, a good debugger ? What is in Google Summer
[EMAIL PROTECTED] wrote:
> what are the advantages of haskell over semi-functional programming languages
> such as Perl, Common Lisp, etc.?
A fundamental building block that is superior in maintainability and
reusability to objects and procedures, a type system that is actually of
help and not a h
Hi
HTTP. We also need better availability of libraries, and a more
standard and reliable way to install them and specify their
dependencies. We could also do with a good debugger. These are being
addressed by the Google Summer of Code project.
In addition we could do will a million bindings to e
Michael T. Richter wrote:
> I wish I knew the language better so I could start working on
> those libraries.
Which ones? "those libraries" cannot come into existence until someone
says what's actually missing. (The bulk of CPAN is crap and is
certainly not worth being reimplemented.)
-Udo
--
On 4/27/07, Taillefer, Troy (EXP) <[EMAIL PROTECTED]> wrote:
[snip]
By the way Mike thanks you just totally cheered me up I guess I just
needed to sit back and think about what I have learned and how valuable
it is to me.
There had to be some reason you were still hanging around on this list.
Dear Phiroc,
I am also a newbie to Haskell, but I also must confess having a sort of
religious conversion. I also admit that the learning curve for Haskell, and
in particular associated theory is steep, and I am only on the fist rung of
the ladder. Some of what I say here has been echoed by
ttmrichter:
>
>On Fri, 2007-27-04 at 15:37 -0400, Taillefer, Troy (EXP)
>wrote:
>
> I really enjoy Functional programming (at least until I try to do
> something serious then frustration sets in). I can't produce software
> in a timely and cost effective fashion without a large body of hi
On Fri, 2007-27-04 at 15:37 -0400, Taillefer, Troy (EXP) wrote:
> I really enjoy Functional programming (at least until I try to do
> something serious then frustration sets in). I can't produce software in
> a timely and cost effective fashion without a large body of high
> quality, documented an
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Al Falloon wrote:
> Taillefer, Troy (EXP) wrote:
>> Java sense (i.e. "cut out any feature that can't be understood in five
>> minutes by a chimp")
>>
>> Got to love comments like this they are constructive, objective,
>> mature and accurate.
>>
>>
Albert Y. C. Lai wrote:
Derek Elkins wrote:
And then you come to Haskell and you -can- say, "Give me the something
that is not there yet."
Please give me the libraries that are not there yet! *duck*
We wait for people to need the libraries, then a large amount of delayed work is
forced.
_
Derek Elkins wrote:
And then you come to Haskell and you -can- say, "Give me the something
that is not there yet."
Please give me the libraries that are not there yet! *duck*
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailma
Original Message-
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]
On Behalf Of mike clemow
Sent: Friday, April 27, 2007 4:16 PM
To: haskell@haskell.org
Subject: Re: [Haskell] Re: Newbie: what are the advantages of Haskell?
Troy,
As a Java chimp embarking on the Haskell journey myself,
Tony Morris wrote:
mike clemow wrote:
Troy,
As a Java chimp embarking on the Haskell journey myself, I'd be
interested in hearing about specific ways that learning Haskell has
changed the way you program Java. How do you employ the "very
interesting concepts" that you have learned through your
mike clemow wrote:
> Troy,
>
> As a Java chimp embarking on the Haskell journey myself, I'd be
> interested in hearing about specific ways that learning Haskell has
> changed the way you program Java. How do you employ the "very
> interesting concepts" that you have learned through your study of
PROTECTED] [mailto:[EMAIL PROTECTED]
On Behalf Of Al Falloon
Sent: Friday, April 27, 2007 12:19 PM
To: haskell@haskell.org
Cc: haskell@haskell.org
Subject: [Haskell] Re: Newbie: what are the advantages of Haskell?
Taillefer, Troy (EXP) wrote:
> Java sense (i.e. "cut out any feature that can
n Haskell
and having so little to show for it.
Troy
-Original Message-
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]
On Behalf Of Al Falloon
Sent: Friday, April 27, 2007 12:19 PM
To: haskell@haskell.org
Cc: haskell@haskell.org
Subject: [Haskell] Re: Newbie: what are the advant
> I.e. you can teach Java without teaching generics or anonymous inner
classes.
but you shouldn't -
if you can teach the type-correct use of arrays (it's done for decades),
then you can teach generic collections (at least their proper usage),
and what's the problem with the anonymous class i
Am Freitag, 27. April 2007 18:18 schrieb Al Falloon:
> […]
> IOW: Java's advanced features are separable from its basic features.
> I.e. you can teach Java without teaching generics or anonymous inner
> classes. In Haskell, OTOH, you can't even learn how to do IO without
> learning Monads, or at l
Taillefer, Troy (EXP) wrote:
Java sense (i.e. "cut out any feature that can't be understood in five
minutes by a chimp")
Got to love comments like this they are constructive, objective, mature
and accurate.
Glad we have your expert opinion to give us the gospel.
Can I get an amen? How abou
elujah ?
Troy Taillefer Java chimpanzee
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]
On Behalf Of Sebastian Sylvan
Sent: Thursday, April 26, 2007 1:27 PM
To: [EMAIL PROTECTED]
Cc: haskell@haskell.org
Subject: Re: [Haskell] Newbie: what are the advantages of Hask
Keith Fahlgren wrote:
On 4/26/07 10:13 AM, Joe Thornber wrote:
On 26/04/07, Johannes Waldmann <[EMAIL PROTECTED]> wrote:
[EMAIL PROTECTED] wrote:
[...] semi-functional programming languages such as Perl [...]
now this is an interesting view ...
I seem to remember someone writing a book on f
On 4/26/07 10:13 AM, Joe Thornber wrote:
> On 26/04/07, Johannes Waldmann <[EMAIL PROTECTED]> wrote:
>> [EMAIL PROTECTED] wrote:
>>
>> > [...] semi-functional programming languages such as Perl [...]
>>
>> now this is an interesting view ...
>
> I seem to remember someone writing a book on functio
day
these components will actually get written.
Troy
-Original Message-
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]
On Behalf Of [EMAIL PROTECTED]
Sent: Thursday, April 26, 2007 12:48 PM
To: haskell@haskell.org
Subject: [Haskell] Newbie: what are the advantages of Haskell?
Hello,
wh
Phiroc,
I'm new to these ideas too--especially since my college math training
is non-existent. I found the following wikipedia articles
particularly illuminating on the topic of side-effects:
http://en.wikipedia.org/wiki/Side_effect_%28computer_science%29
and
http://en.wikipedia.org/wiki/Refe
[EMAIL PROTECTED] wrote:
> Hello,
>
> what are the advantages of haskell over semi-functional programming
> languages such as Perl, Common Lisp, etc.?
>
> What are the mysterious "side effects" which are avoided by using
> Haskell, which everyone talks about? Null pointers?
>
> Don't you ever g
(note to Haskellers: Yeah, I'm handwaving things here, no need to point out
counter-examples to my generalisations!)
On 4/26/07, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
We'll do this one first:
What are the mysterious "side effects" which are avoided by using Haskell,
which
everyone talks a
On 26/04/07, Johannes Waldmann <[EMAIL PROTECTED]> wrote:
[EMAIL PROTECTED] wrote:
> [...] semi-functional programming languages such as Perl [...]
now this is an interesting view ...
I seem to remember someone writing a book on functional programming in
Perl, which seemed odd to me.
- Joe
_
If this is interesting then please enlighten a poor, ignorant PERL hacker.
Quoting Johannes Waldmann <[EMAIL PROTECTED]>:
> [EMAIL PROTECTED] wrote:
>
> > [...] semi-functional programming languages such as Perl [...]
>
> now this is an interesting view ...
>
>
__
[EMAIL PROTECTED] wrote:
[...] semi-functional programming languages such as Perl [...]
now this is an interesting view ...
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Hello,
what are the advantages of haskell over semi-functional programming languages
such as Perl, Common Lisp, etc.?
What are the mysterious "side effects" which are avoided by using Haskell, which
everyone talks about? Null pointers?
Don't you ever get null pointers in Haskell, including when
oh, sorry, I sent to a wrong mailing list.
I will ask for help there, thank you, and sorry for disturb you all.
On 12/12/06, Donald Bruce Stewart <[EMAIL PROTECTED]> wrote:
notyycn:
>
>hello,all,
>
> I am new to haskell,and have read some tutorial, but I
>would like to read some
notyycn:
>
>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
>o
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
I agree with the suggestions of the other posters. Sometimes I'll also use
"error " to get a "one time" breakpoint :-)
cheers
"Hunter Kelly" <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]
Yes, thank you, that did the trick! It produced the output for all steps,
and in the order I w
On Dec 29, 2005, at 9:06 AM, Hunter Kelly wrote:
Hi there, I'm having some trouble trying to get information out
of a HashTable.
I'm using it to represent a set (I'm using a hash table for O(1)
speed reasons to compare against Data.Sets O(lgN) operations).
I'm trying to write a simple functio
Hunter Kelly wrote:
How can I get at the underlying value? Can I only access it from
within a "do" construct?
Yes, I'm afraid so
Is there anyway to get at this function to return just True or False?
No, (unless you use something unsafe that I would not recommend)
Or has using something t
Hi there, I'm having some trouble trying to get information out
of a HashTable.
I'm using it to represent a set (I'm using a hash table for O(1)
speed reasons to compare against Data.Sets O(lgN) operations).
I'm trying to write a simple function, member, which returns whether
or not a key is in t
On Dec 28, 2005, at 12:07 PM, Hunter Kelly wrote:
Yes, thank you, that did the trick! It produced the output for all
steps,
and in the order I would expect.
Are there other techniques that people use to get debugging output?
Well, if you are writing code in the IO monad, obviously you ca
Hi,
Mostly I just use ghci. If something isn't working (or even sometimes
if it is), I break it down into smaller parts until I can understand
and test each part separately. Usually once the functions are broken
into small, easy to manage pieces, it becomes obvious where the error
is.
Sometimes t
Yes, thank you, that did the trick! It produced the output for all steps,
and in the order I would expect.
Are there other techniques that people use to get debugging output?
H
On 12/28/05, Robert Dockins <[EMAIL PROTECTED]> wrote:
>
> On Dec 28, 2005, at 6:10 AM, Hunter Kelly wrote:
>
> > Heya
On Dec 28, 2005, at 6:10 AM, Hunter Kelly wrote:
Heya, I decided to play around with Haskell and see what it's like.
I used a small problem to explore it. Basically, given two words,
find the least number of 1 letter changes that will go from one
word to the other (e.g. for "fig" and "dog" ei
Heya, I decided to play around with Haskell and see what it's like.
I used a small problem to explore it. Basically, given two words,
find the least number of 1 letter changes that will go from one
word to the other (e.g. for "fig" and "dog" either fig -> fog -> dog or
fig -> dig -> dog).
I cam
On 10/4/05, Mike Crowe <[EMAIL PROTECTED]> wrote:
> This may be unfair to ask, but is anybody willing to give an example?
> There are great examples for writing factorials. However, that's not really
> useful. I'm looking for a real-world example of using the language.
You might be interested i
On 10/5/05, Sebastian Sylvan <[EMAIL PROTECTED]> wrote:
> On 10/4/05, Mike Crowe <[EMAIL PROTECTED]> wrote:
> > Thanks, all, especially Cale for the detail.
> >
> > This may be unfair to ask, but is anybody willing to give an example?
> > There are great examples for writing factorials. However,
On 10/4/05, Mike Crowe <[EMAIL PROTECTED]> wrote:
> Thanks, all, especially Cale for the detail.
>
> This may be unfair to ask, but is anybody willing to give an example?
> There are great examples for writing factorials. However, that's not really
> useful. I'm looking for a real-world example
ce time to design and make better code
is very intriguing.
I was looking at prototyping in Python using wxWindows as the GUI. I
see Haskell has wxWindows libraries as well.
So, here's some newbie questions I couldn't get from 2-3h on the various
web sites:
1) Can I develop a Windows appl
potential large application to develop. The
> idea of a language which can reduce time to design and make better code
> is very intriguing.
>
> I was looking at prototyping in Python using wxWindows as the GUI. I
> see Haskell has wxWindows libraries as well.
>
> So, here&#x
On Tue, 2005-10-04 at 11:31 +0100, Jon Fairbairn wrote:
> On 2005-10-04 at 00:01EDT Mike Crowe wrote:
> > Hi folks,
> >
> > I ran across Haskell at the Great Win32 Computer Language Shootout. A
> > friend approached me with a potential large application to develop. The
> > idea of a language w
On 2005-10-04 at 00:01EDT Mike Crowe wrote:
> Hi folks,
>
> I ran across Haskell at the Great Win32 Computer Language Shootout. A
> friend approached me with a potential large application to develop. The
> idea of a language which can reduce time to design and make better code
> is very intri
wxWindows as the GUI. I
see Haskell has wxWindows libraries as well.
So, here's some newbie questions I couldn't get from 2-3h on the various
web sites:
1) Can I develop a Windows application to sell? Or is Haskell not
really geared for that?
2) Say a team wants to develo
On Mon, 14 Feb 2005 12:27:51 -0500, robert dockins
<[EMAIL PROTECTED]> wrote:
> [Dijkstra's] algorithm relies pretty fundamentally on mutability, which makes
> it
> a less than wonderful fit for a functional language. If you want to
> use this algorithm in particular, I would recommend a mutabl
On Mon, 14 Feb 2005 15:00:17 +0100
RCP-Software <[EMAIL PROTECTED]> wrote:
> For input and output I need an appropriate graph representation. It
> should be as simple to implement as possible - speed and memory
> consumption does not matter. The graph consists of vertices (including
> the sourc
G'day all.
Quoting robert dockins <[EMAIL PROTECTED]>:
> This algorithm relies pretty fundamentally on mutability, which makes it
> a less than wonderful fit for a functional language.
Right, which makes me wonder if this is the algorithm that you really want.
Does it have to be Dijkstra's al
On 2005-02-14, robert dockins <[EMAIL PROTECTED]> wrote:
> This algorithm relies pretty fundamentally on mutability, which makes
> it a less than wonderful fit for a functional language.
True
> If you want to use this algorithm in particular, I would recommend a
> mutable array indexed on the ver
This algorithm relies pretty fundamentally on mutability, which makes it
a less than wonderful fit for a functional language. If you want to
use this algorithm in particular, I would recommend a mutable array
indexed on the vertex pair (u,v). See:
http://www.haskell.org/ghc/docs/latest/html/
Hi!
I am new to functional Programming and need some advice. I want to
implement Dijkstra's algorithm for the shortest path problem. The
algorithm calculates the shortest path from a single vertex in a
directed graph to any other connected vertex (
http://en.wikipedia.org/wiki/Dijkstra%27s_algo
Francis Girard <[EMAIL PROTECTED]> writes:
> But I can't help thinking that the distinction between "being" a list of
> integers and "being" a function that "returns" a list of integers (without
> arguments) is not always clear in FP ... since there is not really such a
> thing as returning a v
On Monday 24 January 2005 21:47, Francis Girard wrote:
> But I can't help thinking that the distinction between "being" a list of
> integers and "being" a function that "returns" a list of integers (without
> arguments) is not always clear in FP ... since there is not really such a
> thing as retur
Thank you,
I understand the point.
But I can't help thinking that the distinction between "being" a list of
integers and "being" a function that "returns" a list of integers (without
arguments) is not always clear in FP ... since there is not really such a
thing as returning a value in declara
Notice that 'hamming' *is* a list of integers, not a function to produce them:
hamming :: [Integer]
Thus, the "magic" here is that you can define this list as a value, without
having to actually evaluate any element until it's needed, either by direct
reference from another function, or indirec
It doesn't have to be a top level definition, it works anyway.
-- Lennart
Bruno Abdon wrote:
'hamming', in your code, is a top-level definition. When used three
times inside its own definition, it's the same variable being used
three times. You don't recompute a variable value in order to r
'hamming', in your code, is a top-level definition. When used three
times inside its own definition, it's the same variable being used
three times. You don't recompute a variable value in order to reuse
it.
As an example, if you do
foo :: [Integer]
foo = [1,2,3] + [4,5]
bar = foo ++ foo ++ foo
Hi,
The classical Hamming problem have the following solution in Haskell :
*** BEGIN SNAP
-- hamming.hs
-- Merges two infinite lists
merge :: (Ord a) => [a] -> [a] -> [a]
merge (x:xs)(y:ys)
| x == y= x : merge xs ys
| x < y= x : merge xs (y:ys)
| otherwise = y : merge (x:xs) ys
-
I maybe don't fully grasp your goals here, but this sounds similar to some
early problems I ran into with Haskell (coming from comparable background),
and here are a couple of comments that _might_ just help:
(a) adding a type context to a 'data' declaration seems to be very rarely,
if ever, of
Hi,
I very recently just came to Haskell from the Java and Perl worlds, so
my understanding of Haskell's type system is still a little vague.
The tutorial and Google didn't seem to have an answer to my question,
so I am hoping someone here might be able to help me. I am writing
some code compara
A.J. Bonnema wrote:
If I use isSpace from the hugs interpretor, it works.
If I use isSpace from a test.hs file I get the error message:
Undefined variable "isSpace"
From ghc I get the error message:
Variable not in scope: "isSpace"
What is wrong?
Hugs automatically imports a few extra things as w
If I use isSpace from the hugs interpretor, it works.
If I use isSpace from a test.hs file I get the error message:
Undefined variable "isSpace"
From ghc I get the error message:
Variable not in scope: "isSpace"
What is wrong?
Guus.
--
A.J. Bonnema, Leiden The Netherlands,
user #328198 (Linux Count
[EMAIL PROTECTED] wrote:
Hi there.
I got this question while I'm messing around with my toy monad.
I was thinking about creating a generic monad that can persist state change
even when fail is called. The StateT monad will discard the state change so
it makes it hard to add tracing to the progra
> I was thinking about creating a generic monad that can persist state change
> even when fail is called. The StateT monad will discard the state change so
> it makes it hard to add tracing to the program. (at least to me. If there's
> any nice way of doing this, please kindly instruct me.)
If yo
Hi there.
I got this question while I'm messing around with my toy monad.
I was thinking about creating a generic monad that can persist state change
even when fail is called. The StateT monad will discard the state change so
it makes it hard to add tracing to the program. (at least to me. If
is "HaskellScript" still working?
I tried mucking around with this lately using the
latest version of Hugs but the example scripts seemed
broken.
__
Do you Yahoo!?
Yahoo! Finance: Get your refund fast by filing online.
http://taxes.yahoo.com/filing.html
___
Hello,
Please help me with this:
I'm absolute newbie in Haskell,
I hope I'm posting to right forum.
(1) For "abcdefgh" -> ["ab","cd","ef"]
I figured this out:
foo (x:y:z) = ( (x:y) :(foo z))
Now how generalize this to club 'n
I've found out what was wrong. I should have written:
perms (a:as) = concatMap (\b -> map ((:) (fst b)) (perms (snd b))) (del
(a:as))
but I still don't understand why it had the error message it did.
Ie, how did it infer the type of my lambda function to be
"([a],[a]) -> [[a]]"?
Cheers,
Mark
Hi,
I have recently started learning Haskell and, in writing a HUGS
module to generate permutations, have been told I have an error
but I don't understand why.
The module is:
module Arrange where
--
--
perms :: [a] -> [[a]]
perms [] = [[]]
perms (a:as) = concatMap (\b -> fst b:perms (snd b)) (d
> Date: Fri, 8 Feb 2002 18:35:14 -0200
> From: =?iso-8859-1?Q?Jos=E9_Romildo_Malaquias?= <[EMAIL PROTECTED]>
> To: [EMAIL PROTECTED]
> Subject: [Newbie] Programming with MArray
>
>
> --82I3+IH0IqGh5yIs
> Content-Type: text/plain; charset=iso-8859-1
> Cont
Hello.
To learn how to program with muttable arrays in Haskell, I have done
a very simple program to sum two arrays. I am submitting it to this
group so that it can be reviewd and commented. I have not find
examples on how to program with muttable arrays.
I would like for instance to see comment
Hi,
I was investigating the prelude the other day. I was bewildered with the
highly complicated expressions, and interesting syntax.
My question is : "are there any tweaks in the prelude?" I mean : are there
any language constructs which have some sort of special treatment? Which
ones are hard w
In my last post I goofed and attributed Neil Winstanley's "What the hell
are monads?" to Philip Wadler. Sorry, Neil.
// David
--
David Hughes-+-office: +41 22 767 4047
UNIX Sysadmin, SERCo SA -+-mobile: +41 79 201 4732
Computing Centre, CERN
> I have been programming with imperative languages for 15 years. Now I
> started learning Haskell, and functional programming (and I am very
> determined to learn it well). It seems to me that I can still use functional
> programming paradigm with an imperative language. How can I benefit more
>
Greetings,
I have been programming with imperative languages for 15 years. Now I
started learning Haskell, and functional programming (and I am very
determined to learn it well). It seems to me that I can still use functional
programming paradigm with an imperative language. How can I benefit mor
ly if they are used to Maybe in non-monadic usage.)
I have some email exchanges somewhere where I explained some of these
concepts, perhaps I will edit them and add them to the Wiki, or better
yet, find the best explanations from the list and add them... and of
course any other newbie questions other
At 3:07 PM -0500 7/24/01, Cagdas Ozgenc wrote:
>Hi, I am extremely new to Haskell. This will be my first question,
> so go easy. I have just read Chapter 1 on Simon Thompson's book.
> for example a function declaration is given as follows
>
> scale : : Picture -> Int -> Picture
>
1 - 100 of 120 matches
Mail list logo
