WORST_CASE(?,O(n^1))

Solution:
---------

  "Cons" :: ["A"(0) x "A"(11)] -(11)-> "A"(11)
  "Cons" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "Cons" :: ["A"(0) x "A"(3)] -(3)-> "A"(3)
  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "Nil" :: [] -(0)-> "A"(11)
  "Nil" :: [] -(0)-> "A"(1)
  "Nil" :: [] -(0)-> "A"(14)
  "Nil" :: [] -(0)-> "A"(8)
  "main" :: ["A"(15)] -(16)-> "A"(0)
  "map#2" :: ["A"(1)] -(2)-> "A"(0)
  "rmap#2" :: ["A"(11) x "A"(3)] -(11)-> "A"(3)


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




Base Constructors:
------------------
  "\"Cons\"_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "\"Nil\"_A" :: [] -(0)-> "A"(1)