WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(1)
  0 :: [] -(0)-> A(0)
  0 :: [] -(0)-> A(8)
  add :: [A(0) x A(6)] -(12)-> A(0)
  cons :: [A(12)] -(12)-> A(12)
  cons :: [A(0)] -(0)-> A(0)
  cons :: [A(7)] -(7)-> A(7)
  dbl :: [A(0)] -(1)-> A(0)
  first :: [A(0) x A(12)] -(5)-> A(0)
  nil :: [] -(0)-> A(0)
  recip :: [A(0)] -(1)-> A(1)
  s :: [] -(0)-> A(1)
  s :: [] -(0)-> A(0)
  s :: [] -(0)-> A(15)
  sqr :: [A(1)] -(8)-> A(1)
  terms :: [A(12)] -(15)-> A(0)


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




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