Re: [Haskell-cafe] I need help getting started

2010-04-25 Thread John Bender
Mitchell You might also be interested in the beginners mailing list. I've been enjoying for about a month now! http://www.haskell.org/mailman/listinfo/beginners On Sat, Apr 24, 2010 at 9:57 PM, Luke Palmer lrpal...@gmail.com wrote: On Sat, Apr 24, 2010 at 10:34 PM, mitch...@kaplan2.com

Re: [Haskell-cafe] I need help getting started

2010-04-25 Thread Daniel Fischer
Am Sonntag 25 April 2010 06:34:32 schrieb mitch...@kaplan2.com: Luke already explained the type error, so I'll focus on the implementation. Hi, I'm just starting to learn, or trying to learn Haskell. I want to write a function to tell me if a number's prime. This is what I've got: f

Re: [Haskell-cafe] I need help getting started

2010-04-25 Thread David Anderson
On Sun, Apr 25, 2010 at 6:34 AM, mitch...@kaplan2.com wrote: Hi, I’m just starting to learn, or trying to learn Haskell.  I want to write a function to tell me if a number’s prime.  This is what I’ve got: f x n y = if n=y   then True   else   if gcd x n ==

[Haskell-cafe] I need help getting started

2010-04-25 Thread mitchell
Subject: Re: [Haskell-cafe] I need help getting started On Sat, Apr 24, 2010 at 10:34 PM, mitch...@kaplan2.com wrote: Hi, I’m just starting to learn, or trying to learn Haskell.  I want to write a function to tell me if a number’s prime.  This is what I’ve got: f x n y = if n=y

RE: [Haskell-cafe] I need help getting started

2010-04-25 Thread mitchell
need help getting started Mitchell You might also be interested in the beginners mailing list. I've been enjoying for about a month now! http://www.haskell.org/mailman/listinfo/beginners On Sat, Apr 24, 2010 at 9:57 PM, Luke Palmer lrpal...@gmail.com wrote: On Sat, Apr 24, 2010 at 10

RE: [Haskell-cafe] I need help getting started

2010-04-25 Thread mitchell
-cafe] I need help getting started mitch...@kaplan2.com writes: I'm just starting to learn, or trying to learn Haskell. I want to write a function to tell me if a number's prime. This is what I've got: Have you read through any tutorials? Do you need to write this prime detection function

RE: [Haskell-cafe] I need help getting started

2010-04-25 Thread mitchell
: Sunday, April 25, 2010 4:47 AM To: haskell-cafe@haskell.org Cc: mitch...@kaplan2.com Subject: Re: [Haskell-cafe] I need help getting started Am Sonntag 25 April 2010 06:34:32 schrieb mitch...@kaplan2.com: Luke already explained the type error, so I'll focus on the implementation. Hi, I'm

RE: [Haskell-cafe] I need help getting started

2010-04-25 Thread mitchell
peeves. Mitchell -Original Message- From: David Anderson [mailto:d...@natulte.net] Sent: Sunday, April 25, 2010 11:18 AM To: mitch...@kaplan2.com Cc: haskell-cafe@haskell.org Subject: Re: [Haskell-cafe] I need help getting started On Sun, Apr 25, 2010 at 6:34 AM, mitch

Re: [Haskell-cafe] I need help getting started

2010-04-25 Thread Daniel Fischer
Am Sonntag 25 April 2010 17:49:05 schrieb mitch...@kaplan2.com: Hi David, Thanks for the suggestion.  I took a quick look at your article, and I'll have to spend a little more time on it.  Delicious Primes?  Great name. And it's a good read. I find this definition of prime numbers

[Haskell-cafe] I need help getting started

2010-04-24 Thread mitchell
Hi, I'm just starting to learn, or trying to learn Haskell. I want to write a function to tell me if a number's prime. This is what I've got: f x n y = if n=y then True else if gcd x n == 1 then f x (n+1) y else False primeQ x

Re: [Haskell-cafe] I need help getting started

2010-04-24 Thread Ivan Lazar Miljenovic
mitch...@kaplan2.com writes: I'm just starting to learn, or trying to learn Haskell. I want to write a function to tell me if a number's prime. This is what I've got: Have you read through any tutorials? Do you need to write this prime detection function yourself (if so, is this homework?)

Re: [Haskell-cafe] I need help getting started

2010-04-24 Thread Luke Palmer
On Sat, Apr 24, 2010 at 10:34 PM, mitch...@kaplan2.com wrote: Hi, I’m just starting to learn, or trying to learn Haskell.  I want to write a function to tell me if a number’s prime.  This is what I’ve got: f x n y = if n=y   then True   else   if gcd x n ==