WORST_CASE(?,O(n^1))

Solution:
---------

  "Cons" :: ["A"(7) x "A"(7)] -(7)-> "A"(7)
  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "Nil" :: [] -(0)-> "A"(7)
  "Nil" :: [] -(0)-> "A"(0)
  "foldl#3" :: ["A"(0) x "A"(7)] -(12)-> "A"(0)
  "main" :: ["A"(14)] -(15)-> "A"(0)


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




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