WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(0)
  0 :: [] -(0)-> A(14)
  0 :: [] -(0)-> A(8)
  cons :: [A(0)] -(1)-> A(1)
  cons :: [A(0)] -(0)-> A(0)
  cons :: [A(0)] -(15)-> A(15)
  cons :: [A(0)] -(7)-> A(7)
  filter :: [A(1) x A(0) x A(0)] -(15)-> A(0)
  nats :: [A(4)] -(10)-> A(1)
  s :: [A(0)] -(0)-> A(0)
  s :: [A(0)] -(0)-> A(14)
  s :: [A(0)] -(0)-> A(6)
  sieve :: [A(1)] -(3)-> A(0)
  zprimes :: [] -(14)-> A(0)


Cost Free Signatures:
---------------------




Base Constructors:
------------------
  0_A :: [] -(0)-> A(1)
  cons_A :: [A(0)] -(1)-> A(1)
  s_A :: [A(0)] -(0)-> A(1)