Comments on: Sieve of Euler in Erlang

By: Harsh

Harsh — Wed, 23 Jun 2010 16:56:34 +0000

I’ve not tried/used/compared Clojure, can’t say anything about it. I think Haskell is good. No idea on books, who uses them anymore to learn languages?

By: Pathik

Pathik — Wed, 23 Jun 2010 15:36:49 +0000

What are your views on Haskell vs Clojure? If a n00b were to be interested in functional programming? Also, recommend a good book.

By: Harsh

Harsh — Tue, 15 Jun 2010 18:34:59 +0000

I’d say go ahead with Haskell instead

By: Abhinandh

Abhinandh — Tue, 15 Jun 2010 13:14:20 +0000

So this is what you were busy with, generating prime numbers
I might try learning erlang (after my currently happening adventures with opengl are over ), looks scary though!

By: Harsh

Harsh — Mon, 14 Jun 2010 06:09:11 +0000

Ah yes, the combination formed a tag and escaped I s’pose. Fixed, thanks!

By: Jim Walls

Jim Walls — Mon, 14 Jun 2010 02:13:13 +0000

Hi All:
Is there a typing error in Angel’s code at line 30 in the “pretty print” and in the source code?

I think it should read:
30 compare(X,Y) when X < Y -> smaller;

Cheers, grandad

By: Angel

Angel — Wed, 09 Jun 2010 07:50:57 +0000

Ok the code shows now pretty printed!, No problem for credits.

You’ll find it a bit slow (message passing is almost as heavier as processes main loop). If you want to optimize this, you should try to accumulate some primes before spawing a new process. Also youll see that messaging is syncronous (see the receive ok -< ok clause) thus limiting a bit the performance on multicore.

By: Harsh

Harsh — Tue, 08 Jun 2010 18:05:30 +0000

Its a great implementation, thanks for sharing this!

P.s. -> I’ve moved your code from comments area into the main article cause it seemed to be breaking the layout. Hope you don’t mind. Ready to move it back if you do or feel that the crediting isn’t visible enough!

By: Angel

Angel — Tue, 08 Jun 2010 15:56:14 +0000

Great!!

If you want to see a JFP-like sieve on erlang i managed to translate it to erlang when i began to learn erlang. I use processes to mimic the lazy features of haskell, thus spawing a new process when needed.

it uses one erlang process for every sieve cell, in later versions i manage to account and check a variable number of primes on every process, thus reducing message overhead on the first stages of the sieve.

I hope you like it!

/angel