Short answer: no, and what it gives is quite different.
Long answer:
Erlang gives me two things that are hard to replicate:
1. firm-realtime performance, even at high load: the distributed GC is very
nice
2. a very well defined model for handling, and recovering from failure
Hot code reload is
On Thu, Nov 3, 2011 at 9:09 PM, Ryan Newton wrote:
> > I have interfaced Erlang and Haskell... And delivered it as a product. I
> > just came up with a dead-simple text based communication syntax from
> Erlang
> > to Haskell that was very easily testable. It allowed for complete
> isolation
>
>
> I have interfaced Erlang and Haskell... And delivered it as a product. I
> just came up with a dead-simple text based communication syntax from Erlang
> to Haskell that was very easily testable. It allowed for complete isolation
Interesting. I can't imagine there are too many people who have
Yeah, I was going to mention Smalltalk too, as one of the languages NOT using
plain text to store programs — which led to a very strong boundary between ST
and other world, not doing any favors to the first.
The idea of using some non-plaintext-based format to store programs appeared
lots of ti
The world needs programmers to accept and take seriously Greg
Wilson's extensible programming, and stop laughing it off as "lolwut
wysiwyg msword for programming", and start implementing it.
http://third-bit.com/blog/archives/4302.html
Who is "the world"? For starters, I don't think it is Greg
Yes I did, in detail. There are two trivial solutions I like:
1. The BERT library (http://bert-rpc.org/) uses Erlang terms for the
protocol, and has straightforward mappings to Haskell equivalents.
- Pros: trivial on both sides, Erlang terms are really good primitives to
build a protocol from
- Co
On 11-10-21 01:57 PM, aditya siram wrote:
> Non snarky question - what does it need?
On 11-10-21 01:58 PM, Tom Murphy wrote:
Ok, I'll bite: what's it need?
Thank you for asking.
The world needs another tutorial on lazy evaluation for Haskell. There
are currently only 0.5, and it is written b
askell.org
Date: Fri, 21 Oct 2011 15:37:42
To:
Subject: [Haskell-cafe] Message
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
___
Haskell-Cafe ma
Ok, I'll bite: what's it need?
- Tom / amindfv
On Fri, Oct 21, 2011 at 1:51 PM, Albert Y. C. Lai wrote:
> On 11-10-21 03:59 AM, Ivan Lazar Miljenovic wrote:
>
>> 2011/10/21 Goutam Tmv:
>>
>>> Would you ever see yourself write a web application like Twitter or
>>> Facebook
>>> in Haskell?
>>>
>
Non snarky question - what does it need?
-deech
On Fri, Oct 21, 2011 at 12:51 PM, Albert Y. C. Lai wrote:
> On 11-10-21 03:59 AM, Ivan Lazar Miljenovic wrote:
>>
>> 2011/10/21 Goutam Tmv:
>>>
>>> Would you ever see yourself write a web application like Twitter or
>>> Facebook
>>> in Haskell?
>>
>
On 11-10-21 03:59 AM, Ivan Lazar Miljenovic wrote:
2011/10/21 Goutam Tmv:
Would you ever see yourself write a web application like Twitter or Facebook
in Haskell?
No. But then, I wouldn't write a web application like either of them
in _any_ language.
+1
The world does not need another Twit
On Fri, Oct 21, 2011 at 8:02 AM, Yves Parès wrote:
> That's interesting, have you ever worked on interfacing Erlang with
> Haskell?
>
I have interfaced Erlang and Haskell... And delivered it as a product. I
just came up with a dead-simple text based communication syntax from Erlang
to Haskell t
That's interesting, have you ever worked on interfacing Erlang with Haskell?
BTW, Twitter switched to Scala, so obviously their initial choice of Ruby
end up invalidated.
2011/10/21 Alex Kropivny
> Let's look at this from a high, project management level. Twitter ran on...
> Ruby initially? Fac
I don't know if you are familiar with it, but perhaps this article can be of
interest to you:
http://www.paulgraham.com/avg.html
And a little historical summary:
http://en.wikipedia.org/wiki/Viaweb
Best regards,
Øystein Kolsrud
2011/10/21 Goutam Tmv
> Would you ever see yourself write a web
Let's look at this from a high, project management level. Twitter ran on...
Ruby initially? Facebook ran on PHP.
Immediately this tells me that programming language choice wasn't a factor
in their success. One succeeded in building a large throughput system with a
"slow" language, the other succee
I don't think I'm going to write next twitter or facebook but yes, it
is on my TODO list. If such an applications can be written with
languages like PHP then why not. Can't think of any language that is
worse than PHP but still there are lots of web applications written
with that. Even I have writt
2011/10/21 Goutam Tmv :
> Would you ever see yourself write a web application like Twitter or Facebook
> in Haskell?
No. But then, I wouldn't write a web application like either of them
in _any_ language.
Now, if your question was "is Haskell a good language for writing
large-scale web applicati
This is clearly a job for node.js and the /dev/null data store, since
they are so web scale~
Less sarcasm: I think any of the main Haskell web frameworks (Yesod,
Happstack, Snap) could scale better than Ruby or PHP, and would use
any of those in a heartbeat for such a venture. I'd personally use
Y
Wow, controversial point I guess...
I would add: and if yes, what would you use and why?
2011/10/21 Goutam Tmv
> Would you ever see yourself write a web application like Twitter or
> Facebook in Haskell?
>
> ___
> Haskell-Cafe mailing list
> Haskell-C
Would you ever see yourself write a web application like Twitter or Facebook in
Haskell?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Simon Richard Clarkstone <[EMAIL PROTECTED]> writes:
>> I can also do
>>
>> readFile "readme.markdown" <.> lines <.> length
>>
>> by making
(<.>) = flip fmap
?
-k
--
If I haven't seen further, it is by standing in the footprints of giants
___
Haske
jinjing wrote:
I found that as I can do
xs.map(+1).sort
by redefine . to be
a . f = f a
infixl 9 .
This looks rather like ($), but backwards. I believe the F# name for
this operator is (|>), which is also a legal name for it in Haskell.
Odd, since (|) alone isn't legal. Calling it
I found that as I can do
xs.map(+1).sort
by redefine . to be
a . f = f a
infixl 9 .
I can also do
readFile "readme.markdown" <.> lines <.> length
by making
a <.> b = a .liftM b
infixl 9 <.>
Kinda annoying, but the option is there.
- jinjing
_
> I have seen postings about work on message-passing IPCs for
> Haskell. I like STM but want to keep an open mind ... I can't find
> those postings. Can something remind of this work and where/how I can
> read about?
I made a quick hack composing BSD sockets from Network.Socket for higher le
Hello,
I have seen postings about work on message-passing IPCs for Haskell. I
like STM but want to keep an open mind ... I can't find those postings. Can
something remind of this work and where/how I can read about?
Very kind regards, Vasili
___
Ha
After some fiddling with this style, here is what I came up with
for the 8 queens problem in the 99 problem set. It's quite entertaining ...
( note: it's brute force and requires a combination library )
queens2 n = n.permutations.filter all_satisfied where
all_satisfied queens = queens.diff_col
On Fri, Jun 20, 2008 at 07:57:58AM +0200, Ketil Malde wrote:
> "Albert Y. C. Lai" <[EMAIL PROTECTED]> writes:
>
> >> While we are kind of on this topic, what makes the characters ħ þ
> >> prefix operator by default, while º and most other odd ones infix?
>
> > alphanumeric vs non-alphanumeric
>
"Albert Y. C. Lai" <[EMAIL PROTECTED]> writes:
>> While we are kind of on this topic, what makes the characters ħ þ
>> prefix operator by default, while º and most other odd ones infix?
> alphanumeric vs non-alphanumeric
Testing this, I find that isAlpha is True also for 'º', but as the OP
claim
On Thu, 2008-06-19 at 15:24 -0400, Brent Yorgey wrote:
>
> On Thu, Jun 19, 2008 at 3:35 AM, Ketil Malde <[EMAIL PROTECTED]> wrote:
> jinjing <[EMAIL PROTECTED]> writes:
>
> > Any way here's the code:
>
> > module Dot where
> > import Prelude hiding
Adam Vogt wrote:
While we are kind of on this topic, what makes the characters ħ þ prefix
operator by default, while º and most other odd ones infix?
alphanumeric vs non-alphanumeric
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.
On Thu, Jun 19, 2008 at 3:35 AM, Ketil Malde <[EMAIL PROTECTED]> wrote:
> jinjing <[EMAIL PROTECTED]> writes:
>
> > Any way here's the code:
>
> > module Dot where
> > import Prelude hiding ( (.) )
>
> > (.) :: a -> (a -> b) -> b
> > a . f = f a
>
> > infixl 9 .
>
> Isn't this (roughly?) the same
2008/6/19 jinjing <[EMAIL PROTECTED]>:
> encode xs = xs.group.map token where token x = (x.length, x.head)
Working in this direction is a question of taste, but the choice of
the dot for the operator is a pretty bad idea...
On the other hand, my favourite would be :
encode = map (length &&& head
* On Thursday, June 19 2008, Ketil Malde wrote:
>As a side note, may I advise you to use another symbol, and leave the
>poor dot alone? Overloading it as a module separator is bad enough.
>If you have a keyboard that allows greater-than-ascii input, there are
>plenty of options: « » ¡ £ ¥ ł € ® ª.
On 2008.06.19 11:33:56 +0800, jinjing <[EMAIL PROTECTED]> scribbled 0.5K
characters:
> Hi guys,
>
> This is my second attempt to learn Haskell :)
>
> Any way here's the code:
>
> module Dot where
> import Prelude hiding ( (.) )
>
> (.) :: a -> (a -> b) -> b
> a . f = f a
>
> infixl 9 .
>
> So for
On Thu, 2008-06-19 at 11:33 +0800, jinjing wrote:
> Hi guys,
>
> This is my second attempt to learn Haskell :)
>
> Any way here's the code:
>
> module Dot where
> import Prelude hiding ( (.) )
>
> (.) :: a -> (a -> b) -> b
> a . f = f a
>
> infixl 9 .
Note that if you redefine (.) compositio
jinjing <[EMAIL PROTECTED]> writes:
> Any way here's the code:
> module Dot where
> import Prelude hiding ( (.) )
> (.) :: a -> (a -> b) -> b
> a . f = f a
> infixl 9 .
Isn't this (roughly?) the same as flip ($)?
As a side note, may I advise you to use another symbol, and leave the
poor dot a
Hi guys,
This is my second attempt to learn Haskell :)
Any way here's the code:
module Dot where
import Prelude hiding ( (.) )
(.) :: a -> (a -> b) -> b
a . f = f a
infixl 9 .
So for example, 99 questions: Problem 10
(*) Run-length encoding of a list.
comparing:
encode xs = map (\x -> (l
To the list Haskell-cafe admin...
May I suggest that the maximum message length for postings to the
haskell-cafe list without moderation be raised from its current 5K
limit? It seems to me that a value of (say) 20K would reduce the
moderator's workload without obviously allowing too many undes
38 matches
Mail list logo
