Sun, 6 Nov 2005 00:00:00 UT

Lessons from the ScrapHeap Challenge at OOPSLA 2005
Nat Pryce wrote about the Lessons from the Scraphead Challenge. I interpret his results slighlty differently, but I agree with much of what he says.
Loosely Structure Data vs Highly Structured Data
I'd call this easily accessible data vs hard to access data. Highly structured data works fine in Haskell.
Dynamic Typing vs Static Typing
I'd call this manifest typing vs type inference.
Most of the rest look like they'd benefit from monads, but I'll have to think about it. I had some great thoughts that flew away before I finished this entry.
I'd like to hold a ScrapHeap Challenge on #haskell sometime soon.

« previous see more nibbly bits! next »