On 2008-09-27, Andrew Coppin <[EMAIL PROTECTED]> wrote: > Brandon S. Allbery KF8NH wrote: >> Oleg Kiselyov. http://okmij.org/ftp/ >> He's somewhat legendary in the Haskell community for his ability to >> make Haskell do what people think it can't, and his tendency to >> program at the type level instead of at the value level like most >> people. :) > > Ah - so the "Prolog programs as type signatures" thing is *his* fault?! ;-)
No, he merely takes advantage of it. The fault is that constraint satisfaction is natural match for type-inference, because it's essentially what type-inference is. Given that that's essentially what Prolog is too, it shouldn't be surprising that you can express quite a lot with the type system. -- Aaron Denney -><- _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
