primes.nix

with builtins;
let
  div = x: y: if y / x * x == y then true else false;
  divany = L: x:
    if (length L) == 0 then
      false
    else if (div (head L) x) then
      true
    else
      (divany (tail L) x);
  cPrimes = L: candidate: max:
    if candidate > max then
      L
    else if candidate == 2 then
      (cPrimes [ 2 ] (candidate + 1) max)
    else if (divany L candidate) then
      (cPrimes L (candidate + 1) max)
    else
      (cPrimes (L ++ [ candidate ]) (candidate + 1) max);
  primes = x: (cPrimes [ ] 2 x);
in primes 100