WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(0)
  add :: [A(0) x A(0)] -(1)-> A(0)
  cons :: [A(0)] -(0)-> A(0)
  dbl :: [A(0)] -(1)-> A(0)
  first :: [A(0) x A(0)] -(1)-> A(0)
  nil :: [] -(0)-> A(0)
  recip :: [A(0)] -(0)-> A(0)
  s :: [] -(0)-> A(0)
  sqr :: [A(0)] -(1)-> A(0)
  terms :: [A(0)] -(2)-> A(0)


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