WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(6)
  0 :: [] -(0)-> A(1)
  0 :: [] -(0)-> A(11)
  0 :: [] -(0)-> A(13)
  0 :: [] -(0)-> A(7)
  cons :: [A(0) x A(0)] -(0)-> A(0)
  cons :: [A(0) x A(0)] -(0)-> A(3)
  conv :: [A(11)] -(3)-> A(0)
  half :: [A(6)] -(1)-> A(11)
  lastbit :: [A(1)] -(1)-> A(0)
  nil :: [] -(0)-> A(12)
  s :: [A(6)] -(6)-> A(6)
  s :: [A(1)] -(1)-> A(1)
  s :: [A(11)] -(11)-> A(11)
  s :: [A(0)] -(0)-> A(0)


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

  0 :: [] -(0)-> A_cf(0)
  cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  conv :: [A_cf(0)] -(0)-> A_cf(0)
  half :: [A_cf(0)] -(0)-> A_cf(0)
  lastbit :: [A_cf(0)] -(0)-> A_cf(0)
  nil :: [] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)


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