WORST_CASE(?,O(n^2)) Solution: --------- 0 :: [] -(0)-> A(4, 4) 0 :: [] -(0)-> A(6, 10) a__first :: [A(4, 4) x A(4, 4)] -(1)-> A(0, 4) a__from :: [A(4, 4)] -(2)-> A(0, 4) cons :: [A(4, 4) x A(0, 0)] -(4)-> A(4, 4) cons :: [A(0, 4) x A(0, 0)] -(0)-> A(0, 4) first :: [A(8, 4) x A(8, 4)] -(4)-> A(4, 4) first :: [A(0, 0) x A(0, 0)] -(0)-> A(0, 0) first :: [A(4, 4) x A(4, 4)] -(0)-> A(0, 4) from :: [A(8, 4)] -(4)-> A(4, 4) from :: [A(0, 0)] -(0)-> A(0, 0) from :: [A(4, 4)] -(0)-> A(0, 4) mark :: [A(4, 4)] -(1)-> A(0, 4) nil :: [] -(0)-> A(4, 4) nil :: [] -(0)-> A(6, 10) s :: [A(4, 4)] -(4)-> A(4, 4) s :: [A(0, 0)] -(0)-> A(0, 0) s :: [A(0, 4)] -(0)-> A(0, 4) Cost Free Signatures: --------------------- 0 :: [] -(0)-> A_cf(0, 0) 0 :: [] -(0)-> A_cf(4, 0) 0 :: [] -(0)-> A_cf(6, 2) a__first :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0) a__first :: [A_cf(4, 0) x A_cf(4, 0)] -(4)-> A_cf(4, 0) a__from :: [A_cf(0, 0)] -(0)-> A_cf(0, 0) a__from :: [A_cf(4, 0)] -(4)-> A_cf(4, 0) cons :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0) cons :: [A_cf(4, 0) x A_cf(0, 0)] -(4)-> A_cf(4, 0) first :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0) first :: [A_cf(4, 0) x A_cf(4, 0)] -(4)-> A_cf(4, 0) from :: [A_cf(0, 0)] -(0)-> A_cf(0, 0) from :: [A_cf(4, 0)] -(4)-> A_cf(4, 0) mark :: [A_cf(0, 0)] -(0)-> A_cf(0, 0) mark :: [A_cf(4, 0)] -(0)-> A_cf(4, 0) nil :: [] -(0)-> A_cf(0, 0) nil :: [] -(0)-> A_cf(4, 0) nil :: [] -(0)-> A_cf(6, 2) s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0) s :: [A_cf(4, 0)] -(4)-> A_cf(4, 0) Base Constructors: ------------------ 0_A :: [] -(0)-> A(1, 0) 0_A :: [] -(0)-> A(0, 1) cons_A :: [A(1, 0) x A(0, 0)] -(1)-> A(1, 0) cons_A :: [A(0, 1) x A(0, 0)] -(0)-> A(0, 1) first_A :: [A(1, 0) x A(1, 0)] -(1)-> A(1, 0) first_A :: [A(1, 1) x A(1, 1)] -(0)-> A(0, 1) from_A :: [A(1, 0)] -(1)-> A(1, 0) from_A :: [A(1, 1)] -(0)-> A(0, 1) nil_A :: [] -(0)-> A(1, 0) nil_A :: [] -(0)-> A(0, 1) s_A :: [A(1, 0)] -(1)-> A(1, 0) s_A :: [A(0, 1)] -(0)-> A(0, 1)