#haskell - Mon 19 Feb 2007 between 21:40 and 21:48

NY Lost Funds



soreargvdm_other: soon lambdabot will move to a 16-core machine - then the difference will be obvious
donssorear: yeah, we found a kernel bug. have to update the kernel first
LoganCapaldo_Is there a quick little example set for ReadP?
gvdm_othersorear: well, there will at least be wins over stuff like C, where you have to think about concurrency fully to do it at all
donsunlike here, where you can write concurrent code in one line, in an irc channel...
and who says concurrency's hard?! :-)
dancori do all my concurrency coding in-channel
xicgvdm_other: haskell is probably the best language for doing concurrency, with it's main competitor probably being erlang. but haskell beats erlang :)
nostrademonsxic: I prefer Erlang for concurrency, actually
soreardons: kernel bug!? I'm ... suprised and amazed.
DariusConcurrent constraint/logic languages are pretty slick.
gvdm_otherI've been told erlang whips all when it comes to light weight threading
nostrademonsI think message-passing is a more intuitive way to design programs than STM
DariusDoing message-passing concurrency in Haskell is pretty clean as well.
donssorear: really? 16 cores is going to stress and old kernel. something about it saying "oops...smp"
nostrademonsyeah, Haskell's no slouch
xicnostrademons: you can build a message-passing system on top of STM
nostrademonsit's just not designed for concurrency like Erlang
donsor just use Chan
actionDarius likes Chan.
Dariuslikes Chan.
actionnostrademons likes Chan too
nostrademonslikes Chan too
xicgvdm_other: ghc's light weight threads are damn good
Cale> let nfib 0 = 1; nfib 1 = 1; nfib x = a `par` b `seq` (a+b) where a = nfib (x - 2); b = nfib (x - 1) in nfib 30
lambdabot1346269
ddariusI don't think I ever really stressed them with my embedding of pi-calculus into Haskell.
Cale> let nfib 0 = 1; nfib 1 = 1; nfib x = a `par` b `seq` (a+b) where a = nfib (x - 2); b = nfib (x - 1) in nfib 32
lambdabot3524578
dancorhow slow will he go?!
CaleIt is fast :)
ddarius> let nfib 0 = 1; nfib 1 = 1; nfib x = nfib (x-1) + nfib (x-2) in nfib 32
Cale> let nfib 0 = 1; nfib 1 = 1; nfib x = a `par` b `seq` (a+b) where a = nfib (x - 2); b = nfib (x - 1) in nfib 40
lambdabot3524578
Terminated
dancorBurninated
Cale> let nfib 0 = 1; nfib 1 = 1; nfib x = a `par` b `seq` (a+b) where a = nfib (x - 2); b = nfib (x - 1) in nfib 34
lambdabot9227465
Cale> let nfib 0 = 1; nfib 1 = 1; nfib x = a `par` b `seq` (a+b) where a = nfib (x - 2); b = nfib (x - 1) in nfib 36
lambdabotTerminated
CaleOnly one more to try :)
> let nfib 0 = 1; nfib 1 = 1; nfib x = a `par` b `seq` (a+b) where a = nfib (x - 2); b = nfib (x - 1) in nfib 35

Page: 1 8 15 22 29 36 43 50 57 64 71 78 85 

IrcArchive

NY Lost Funds