Entities Mentioned

• Haskell
• Scheme

1. The Countdown code I showed you isn't really taking advantage of Haskell's laziness. We should only have to check entries up until the point that we have enough matches (in the current code 'take 4 $ getAnagrams') and that's good. However, we ha...
   Read and post comments |
   Send to a friend (Read Full Article)
   
   

   Related Articles

   • "Osfameron": Five things I hate about Perl
   • also written by osfameron
   • Stacktrace.it - Aperiodico di resistenza informatica
   • also written by osfameron
   • Monad Wars - 1: the Prompt - Vox
   • also published in osfameron’s blog
   • "Osfameron": Monads in Perl (take 1)
   • also written by osfameron
   • "Osfameron": F# talk in Liverpool
   • also written by osfameron

   • Why monads have not taken the Common Lisp world by storm
   • also written by osfameron
   • Supercompilation for Haskell
   • also mentions Haskell
   • osfameron's blog - Vox
   • also published in osfameron’s blog
   • Analyzing Book Sales
   • also mentions Scheme
   • "Osfameron": Countdown words game solver in Haskell
   • also written by osfameron

Login to comment.