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

NY Lost Funds



lambdabotTerminated
Calenope
dancorhaskell the language of choice for all your n <= 34 problems
CaleIt is exponential time though.
chessguythree strikes, you're out
donsmm. remember that number once i switch on to the 16 core box
hoepfully we can compute a few more fibs
soreardons: it won't change.
Calen=34 takes a significant amount of time on my uniprocessor machine :)
soreardons: RLIMIT_CPU is total
Caleabout 36 seconds without compiling.
sorearCale: note that lambdabot compiles. (I don't think it uses -O however)
xerox?index par
lambdabotGHC.Conc, Control.Parallel, Graphics.HGL.Utils, Graphics.HGL
actionLoganCapaldo_ tries again, more specifically
LoganCapaldo_tries again, more specifically
How does one "run" a ReadP parser?
donsit uses -O now
sorear> let psum [] = 0; psum [x] = x ; psum xl = psum (psum2 xl) where psum2 (x:y:s
lambdabotParse error
sorearLoganCapaldo_: readP_to_S
chessguydons, come on. what do you know about lambdabot?
sorear> readP_to_S (many1 (char 'a')) "aaaab"
lambdabotNot in scope: `many1'
Caleyeah, it's significantly faster when compiled
LoganCapaldo_sorear, yes I know :) Ok baby steps
ok
sorear7 down, 17 to go ... (nobench tests)
ddarius@type readP
lambdabotNot in scope: `readP'
ddarius@index readP
lambdabotbzzt
sorearafter 1h roughly
donssorear: yeah, the timeout could be lowered
soreardons: how fast is nobench for you? :)
donshey, have you noticed hugs really thrashes memory on parsing?
sorearnope
donsi get like 250M consistenly on hugs startup when it sucks in all the src
yeah, about an hour. or a bit more.
sorearwell, I've 384mb of core, and normally use 8m of it, so I didn't notice :)
donssorear: i'd like to generate a table something like http://www.antoniocangiano.com/articles/2007/02/19/ruby-implementations-shootout-ruby-vs-yarv-vs-jruby-vs-gardens-point-ruby-net-vs-rubinius-vs-cardinal

Page: 2 9 16 23 30 37 44 51 58 65 72 79 86 

IrcArchive

NY Lost Funds