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
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
[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
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 oth
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
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
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
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 of using the
language. Specifically, the first page of
I wouldn't really consider any of those a particularly quick question,
but I'll give them a shot :)
On 04/10/05, Mike Crowe <[EMAIL PROTECTED]> wrote:
> Hi folks,
>
> I ran across Haskell at the Great Win32 Computer Language Shootout. A
> friend approached me with a potential large application to
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
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 intriguing.
I was looking at prototyping in Python using w
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
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
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
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
___
I've only recently started dabbling in Haskell, and functional
programming in general, and am having a few problems, one particular to
Haskell as a functional language, the other with Haskell's type classes. Just
in case it matters, I'm using "interactive Haskell B. version 0.999.7 SPARC
50 matches
Mail list logo
