Entities Mentioned

• Haskell

1. Cédric posted a nice puzzle on his blog:
   
   [W]rite a counter function that counts from 1 to max
   but only returns numbers whose digits don't repeat.
   
   Bob tweeted
   about a minimal solution in
   terms of execution time, although (like the guy in the cartoon)
   I still like my Haskell version of the sequence (up to some details
   with use of Data.Int.Int64 and typing the enumeration):
   
   f k = [ n | n
   
   And the function to compute the maximum gap:
   
   
   drop_tail k = reverse . (drop k) . reverse
   by_pairs u = ... (Read Full Article)
   
   

   Related Articles

   • Paul R Brown: Haskell, del.icio.us, and JSON
   • also written by Paul R. Brown (paulrbrown@gmail.com)
   • Paul R Brown: perpubplat 0.9 — You're Looking at It
   • also written by Paul R. Brown (paulrbrown@gmail.com)
   • Paul R Brown: A Little Lesson on Laziness and Unsafety
   • also written by Paul R. Brown (paulrbrown@gmail.com)
   • Paul R Brown: "Hello World" for Perpubplat
   • also written by Paul R. Brown (paulrbrown@gmail.com)
   • Paul R Brown: There are Apparently Lots of Haskell Jobs...
   • also written by Paul R. Brown (paulrbrown@gmail.com)

   • Paul R Brown: A Short Adventure with simpleHTTP
   • also written by Paul R. Brown (paulrbrown@gmail.com)
   • Supercompilation for Haskell
   • also mentions Haskell
   • Paul R Brown: New Features for Perpubplat and Ruminations on Service APIs for the Web
   • also written by Paul R. Brown (paulrbrown@gmail.com)
   • Paul R Brown: Darcs Repository for Perpubplat
   • also written by Paul R. Brown (paulrbrown@gmail.com)

Login to comment.