Hacker News Board Hacker News, browsed like a classic message board
Live data from Hacker News

The New Haskell.org

haskell.org

Post reply on HN
Print view View original

41–50 of 110 posts

Re: The New Haskell.org

#41

Post by tormeh »

skrebbel wrote: post #12
bonn1 wrote: post #8

Out of curiosity: Who has written Haskell & deployed to production in the last 24h and if yes for what kind of app?

I know Amsterdam startup http://www.silk.co has their entire backend written in Haskell. I'm not sure they deploy in weekends though. Their CEO Salar told me that that, among other things, it gives them a hiring edge. People move to Amsterdam from all kinds of places just so they can write Haskell professionally.

My impression is that there's nothing wrong with Amsterdam. Nice and liberal under a good state.

Re: The New Haskell.org

#42

Post by tomjakubowski »

pasta-driven wrote: post #37
arianvanp wrote: post #19

Earlier quoted context omitted.

Two problems: 1. multi-line expressions aren't supported by the REPL. 2. You will need to use `let x = ..` syntax in the REPL (This is because the REPL are just so called IO-actions and the `let` syntax defines variables within its lexical scope) You could try this: > let sieve (p:xs) = p : sieve [x | x let primes = sieve [2..] > primes !! 3 > primes !! 4 Nice part abou this code is eventhough you express calculating…

This online REPL does not support `let` either. `let x = 4` is not an expression there.

At the online REPL, you have to write something like:

    let primes = sieve [2..] where sieve (p:xs) = p : sieve [x| x
Which is rather annoying.

Re: The New Haskell.org

#44

Post by thomasahle »

I don't understand why they want to use this code

primes = sieve [2..] where sieve (p:xs) = p : sieve [x | x As their first example of Haskell. It's a prime generator based on trial division. And not even trial division up to sqrt of the number you test, but all the way up.

I like the idea of a small snippet showing of the power of haskell, but there are many much better examples imho. Perhaps the website could just choose one at random at each load?

Re: The New Haskell.org

#45

Post by pervycreeper »

thomasahle wrote: post #44

I don't understand why they want to use this code primes = sieve [2..] where sieve (p:xs) = p : sieve [x | x As their first example of Haskell. It's a prime generator based on trial division. And not even trial division up to sqrt of the number you test, but all the way up. I like the idea of a small snippet showing of the power of haskell, but there are many much better examples imho. Perhaps the website could just…

If the point is to show the power and elegance of the language, why would they complicate the expression with optimizations? The sqrt example is obvious to anyone who understands that line anyway.

Re: The New Haskell.org

#46

Post by kryptiskt »

If I go to downloads for Windows, I get the opportunity to download an installer for something called MinGHC with no indication of what version it is, and no indication if it is a 32 or 64 bit GHC. Whichever it is, if I want the other one, I'm apparently out of luck.

The Haskell Platform is nowhere to be seen, why?

It looks nice on the surface, but the actual content needs work. And the link to more content is well-hidden at the absolute bottom of the page.

Re: The New Haskell.org

#47

Post by vmiroshnikov »

skrebbel wrote: post #21
vmiroshnikov wrote: post #17

Earlier quoted context omitted.

You need to check syntax, or try some more basic examples first. In this case you pasted piece of code that won't work itself. If you want to get know more about it: http://learnyouahaskell.com/syntax-in-functions

Sure, but my point is that maybe the top example should be one that'd work verbatim in the REPL, to not scare noobs like me away.

Oops, I missed that. Indeed example is not REPL ready.

Re: The New Haskell.org

#48

Post by doctorstupid »

"Hi there, [name]! That's a pretty name. Honest. You're getting the hang of this!"

I fear that this style of childish and somewhat condescending tutorial content is becoming fashionable. Was it the best fit for the audience?

Re: The New Haskell.org

#50

Post by sigilion »

thomasahle wrote: post #44

I don't understand why they want to use this code primes = sieve [2..] where sieve (p:xs) = p : sieve [x | x As their first example of Haskell. It's a prime generator based on trial division. And not even trial division up to sqrt of the number you test, but all the way up. I like the idea of a small snippet showing of the power of haskell, but there are many much better examples imho. Perhaps the website could just…

It's the Sieve of Eratosthenes, which is a fairly classic algorithm.
Post reply on HN