matt (@themattchan) 's Twitter Profile
matt

@themattchan

meat robot

ID: 13581262

linkhttp://parametri.city calendar_today17-02-2008 11:10:58

7,7K Tweet

656 Followers

417 Following

Nihilist Arby's (@nihilist_arbys) 's Twitter Profile Photo

There are more people alive now than have ever died since humanity began which means that when you die you’ll be even more lonely, because there is no afterlife and you’ll just shut off like a shitty broken computer and bask in a solitudinal blackness for eternity Enjoy Arby’s

Tikhon Jelvis (@tikhonjelvis) 's Twitter Profile Photo

We're getting the South Bay Haskell meetup going again with a talk by Thomas D introducing dependent types. Thursday, September 26th in Sunnyvale. meetup.com/haskellhackers…

julesh (@_julesh_) 's Twitter Profile Photo

Mario Román (Mario Román) on profunctor optics - fresh out of the ACT school I think you can expect this stuff to be coming to a lens library near you

Mario Román (<a href="/mroman42/">Mario Román</a>) on profunctor optics - fresh out of the ACT school

I think you can expect this stuff to be coming to a lens library near you
Mark Hopkins (@antiselfdual) 's Twitter Profile Photo

Java dev: Haskell (so I've heard) is very abstract. Haskell dev, opening any Java project: why is there so much pointless abstraction!? Why is there an AbstractProtocolBeanFactory, when there will only ever be one implementation? Stop over-complicating things! Just be concrete.

gelisam (@haskell_cat) 's Twitter Profile Photo

I found a way to eliminate a monad transformer stack in an Applicative style: :{ runFunDay $ (\() w s result -> result ++ ", " ++ w ++ ", " ++ s) <$$> funReaderT "r" <**> funWriterT <**> funStateT "s" <**> funday1 myRWST :} "result, w, s'" gist.github.com/gelisam/d9b067…

matt (@themattchan) 's Twitter Profile Photo

I've always relied on the Feynman method: 1. Load problem into my head 2. Disappear for a long while 3. Fix the problem

Sy Brand (@tartanllama) 's Twitter Profile Photo

"Pokemon" is short for "Poket Monoid" where the binary associative operation is "fight" and the identity element is an opponent who immediately flees.

matt (@themattchan) 's Twitter Profile Photo

1. First language: Scheme 2. Had difficulties: Verilog 3. Most used: Haskell 4. Totally hate: Go 5. Most loved: Haskell 6. For beginners: Scheme

Csaba Hruska (@csaba_hruska) 's Twitter Profile Photo

New idea: 1. export whole program STG 2. do Control Flow Analysis on STG 3. defunctionalize STG (turn unknown calls to known ones) 4. feed back STG to GHC backend codegen

Picard Tips (@picardtips) 's Twitter Profile Photo

Picard technology tip: Sometimes your chief engineer can build new systems that are better than your existing enterprise software.