Out of curiosity: Who has written Haskell & deployed to production in the last 24h and if yes for what kind of app?
The New Haskell.org
11–20 of 110 posts
Re: The New Haskell.org
#12Out of curiosity: Who has written Haskell & deployed to production in the last 24h and if yes for what kind of app?
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.
Re: The New Haskell.org
#13Interestingly, my love for Haskell was re-kindled today and I went to the site to download the latest platform. There is so much wrong with the new site - 1. Earlier, there was a lot of information on the Home Page. Now there's almost nothing. Yes the earlier page was a bit too busy, but crucially comprised simple HTML links and was fast to load. 2. Now there's a big banner saying "Open Source Community Effort for 20…
You can a sit in a small cubic room and whisper about yours ideas all day long, hoping that someday somebody will notice your thoughts and work on it further.
Or you can put up somewhere and present it in a way that causes least drag, so anyone with a slight interest can pick on it.
Or you can use a combination of both.
Today in our fast society, I think it's the balance that matters the most. If you have something interesting to talk about and you are not working hard to let others know about it, then you are doing everybody a disservice.
Re: The New Haskell.org
#14Re: The New Haskell.org
#15This new, awesome site is using the framework Yesod[0], which is kinda like the Rails of the Haskell world, only it can do rad stuff like prevent XSS and 404s at compile time . Yes, you read that right. [0] http://www.yesodweb.com/
Re: The New Haskell.org
#16First, I got
:1:8: parse error on input `='
Hm so apparently definitions aren't expressions? Or something?I decided to remove the `primes = ` part, which made my browser really slow and had no result. I'm assuming it was computing all primes in the background.
Now, of course, maybe I should try to understand the sieve example before running it, but isn't the whole point of having a REPL box on the front page that you can facilitate people who learn the other way around? It would be great if there'd be some code or expressions available at my fingertips that would actually work in that REPL.
In other words, maybe make the first example be something that actually terminates?
Please read this as constructive criticism, which is how it is intended.
EDIT: Only now I'm noticing that exactly the things I ask for are listed to the right of the "try" box. Pardon my lazy reading, I'm really enjoying the tutorial right now. Still, making the `sieve` example terminate would be nice. But I believe my nitpick is maybe a bit much of a nitpick now.
Re: The New Haskell.org
#17I'm new to Haskell, and I like this page. So, wanting to get a feel for it, I tried typing the sieve example from the top of the page into the "Type Haskell expressions in here." box right beneath it. First, I got :1:8: parse error on input `=' Hm so apparently definitions aren't expressions? Or something? I decided to remove the `primes = ` part, which made my browser really slow and had no result. I'm assuming it w…
If you want to get know more about it: http://learnyouahaskell.com/syntax-in-functions
Re: The New Haskell.org
#18Out of curiosity: Who has written Haskell & deployed to production in the last 24h and if yes for what kind of app?
Re: The New Haskell.org
#19I'm new to Haskell, and I like this page. So, wanting to get a feel for it, I tried typing the sieve example from the top of the page into the "Type Haskell expressions in here." box right beneath it. First, I got :1:8: parse error on input `=' Hm so apparently definitions aren't expressions? Or something? I decided to remove the `primes = ` part, which made my browser really slow and had no result. I'm assuming it w…
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 ALL primes. It will only calculate upto the 3rd and the 4th prime due to lazy evaluation. This is one of the great strengths of haskell.Re: The New Haskell.org
#20Out of curiosity: Who has written Haskell & deployed to production in the last 24h and if yes for what kind of app?