#haskell - Fri 20 Apr 2007 between 00:01 and 00:29

NY Lost Funds



sorear@where darcs-grah
lambdabotI know nothing about darcs-grah.
sorear@where darcs-graph
lambdabothttp://www.cse.unsw.edu.au/~dons/code/darcs-graph/
actionsorear has finally started designing aptage!
sorearhas finally started designing aptage!
@seen dons
lambdabotdons is in #haskell-soc and #haskell. I last heard dons speak 13h 47m 12s ago.
sorear@ask dons what are the criteria for adding a project to your bunch of darcs graphs?
lambdabotConsider it noted.
sorear@ask dons how do you get the little "x"s on your darcs graphs?
lambdabotConsider it noted.
sorear@flush
thedatabasehey ekidd --- I've really enjoyed all your probability articles! They've given me a great excuse to dust off my haskell socks (last worn in Glasgow, circa 96)
ekiddthedatabase: Thanks!
thedatabaseI had a question about your darcs repository (I'm a bit behind on how the haskell community does things)
ekiddOK
thedatabaseDoes your creation of the darcs repo make you de facto maintainer of "the" probability library, and do you expect people to weigh in with how-you-say "hack"s?
Or do you expect everyone will continue to hack away at their own (eg PFP)?
ekiddWell, I'd like to eventually get my probability library into some sort of generally useful shape, but there's a lot of work and peer review before I get there.
Two-thirds of the functionality is actually under "examples" right now--only a few core datatypes and PerhapsT are actually in the exported library.
fantasmahow can I make this so it only takes the maximum value for each a given each n [((a-1)^n+(a+1)^n) `mod` a^2 | a <- [3..100], n <- [1..a]]
thedatabaseI noticed that! So you expect to migrate things when you flesh them out? I actually had a follow up question... I had coded up a distribution and was wondering the best way to use it with your library; if you had time maybe I could hpaste it?
dolio> [ maximum [ ((a-1)^n+(a+1)^n `mod` a^2 | n <- [1..a] ] | a <- [3..100] ]
lambdabotParse error
dolio> [ maximum [ ((a-1)^n+(a+1)^n) `mod` a^2 | n <- [1..a] ] | a <- [3..100] ]
lambdabot[6,8,10,24,42,48,54,80,110,120,130,168,210,224,238,288,342,360,378,440,506,5...
ekiddthedatabase: I'd be happy to take a look!
fantasmadolio: you are awesome thank you
ekiddthedatabase: If you post something for me, be sure to mention "emk" so that my software beeps at me... :-)
sorearekidd: not ekidd?
ekiddsorear: Oops.
Sorry, my brain is totally fried.
ddariusWell if emk is on, use emk otherwise use ekidd, else use @tell.
ekiddekidd is my default handle now, so that's best for use with @tell.
sorear@seen emk
lambdabotemk has changed nick to ekidd.
ekidd is in #haskell. I last heard ekidd speak 26s ago.
sorear^^ cool lambdabot feature
alas it only affects @seen
ekiddAh, very nice.

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

IrcArchive

NY Lost Funds