1. 15
  1.  

  2. 3

    Very cool indeed, thank you for posting it.

    For people uncertain of where to go from the home page, may I recommend the Quick Tour? I was unfamiliar with (the Haskell? meaning of) sigils like :: or ++, so I couldn’t quite parse the twinPrimes example on the homepage; but the explained examples in the Quick Tour (including twinPrimes) are easier to follow.

    1. 2

      looks very interesting! part of me is uneasy about hiding an expensive backtracking operation behind a pattern match, but realistically the problems it solves would likely have needed the backtracking anyway, and it’s just a matter of building up an intuition for the performance