bos

7 ms·

1. 61.▲
   by bos 14y ago

   In my experience, Haskell is not yet a great language for numerically intensive computing. I'll explain in a bit, but before I do, let me first address your question about "can I bang on bits?". Yes, you can allocate memory and do all the l
2. 62.▲
   by bos 14y ago

   Its author, Paul Hudak, is undergoing a lung biopsy today. Send your best wishes his way.
3. 63.▲
   (Re)accouncing statprof, a sampling/statistical profiler for Python(serpentine.com)

   4 points by bos 15y ago|0 comments
4. 64.▲
   Github is making me feel stupid(er)(serpentine.com)

   179 points by bos 15y ago|52 comments
5. 65.▲
   by bos 15y ago

   Facebook engineer here, working on this problem with Joshua. What this comes down to is that git uses a lot of essentially O(n) data structures, and when n gets big, that can be painful. A few examples: * There's no secondary index from fil
6. 66.▲
   by bos 15y ago

   Our app consists of two parts: there's a client component that integrates into Outlook, and a server part that does all the actual heavy lifting. The client-side code is written in C# because the .net APIs for Office are the easiest to deal
7. 67.▲
   by bos 15y ago

   > It's worth noting that QuickCheck is used with functional code only. That's actually not true. You can use QuickCheck with "normal" code that has side effects, too, and it's every bit as useful there.
8. 68.▲
   Learn Haskell for systems programming at Stanford(serpentine.com)

   4 points by bos 15y ago|0 comments