WORST_CASE(?,O(n^1)) Solution: --------- 0 :: [] -(0)-> A(0) 0 :: [] -(0)-> A(12) 0 :: [] -(0)-> A(15) 0 :: [] -(0)-> A(7) 0 :: [] -(0)-> A(6) a__eq :: [A(0) x A(12)] -(11)-> A(0) a__inf :: [A(0)] -(10)-> A(0) a__length :: [A(0)] -(4)-> A(0) a__take :: [A(0) x A(0)] -(1)-> A(0) cons :: [A(0) x A(0)] -(0)-> A(0) cons :: [A(0) x A(0)] -(0)-> A(15) cons :: [A(0) x A(0)] -(0)-> A(1) cons :: [A(0) x A(0)] -(0)-> A(14) eq :: [A(0) x A(15)] -(15)-> A(15) eq :: [A(0) x A(0)] -(0)-> A(0) false :: [] -(0)-> A(15) false :: [] -(0)-> A(7) false :: [] -(0)-> A(6) inf :: [A(15)] -(15)-> A(15) inf :: [A(0)] -(0)-> A(0) length :: [A(15)] -(15)-> A(15) length :: [A(0)] -(0)-> A(0) mark :: [A(15)] -(5)-> A(0) nil :: [] -(0)-> A(0) nil :: [] -(0)-> A(15) nil :: [] -(0)-> A(7) nil :: [] -(0)-> A(6) s :: [A(0)] -(0)-> A(0) s :: [A(12)] -(12)-> A(12) s :: [A(15)] -(15)-> A(15) s :: [A(5)] -(5)-> A(5) take :: [A(15) x A(15)] -(15)-> A(15) take :: [A(0) x A(0)] -(0)-> A(0) true :: [] -(0)-> A(15) true :: [] -(0)-> A(7) true :: [] -(0)-> A(6) Cost Free Signatures: --------------------- 0 :: [] -(0)-> A_cf(0) a__eq :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0) a__inf :: [A_cf(0)] -(0)-> A_cf(0) a__length :: [A_cf(0)] -(0)-> A_cf(0) a__take :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0) cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0) eq :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0) false :: [] -(0)-> A_cf(0) inf :: [A_cf(0)] -(0)-> A_cf(0) length :: [A_cf(0)] -(0)-> A_cf(0) mark :: [A_cf(0)] -(0)-> A_cf(0) nil :: [] -(0)-> A_cf(0) s :: [A_cf(0)] -(0)-> A_cf(0) take :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0) true :: [] -(0)-> A_cf(0) Base Constructors: ------------------ 0_A :: [] -(0)-> A(1) cons_A :: [A(0) x A(0)] -(0)-> A(1) eq_A :: [A(0) x A(1)] -(1)-> A(1) false_A :: [] -(0)-> A(1) inf_A :: [A(1)] -(1)-> A(1) length_A :: [A(1)] -(1)-> A(1) nil_A :: [] -(0)-> A(1) s_A :: [A(1)] -(1)-> A(1) take_A :: [A(1) x A(1)] -(1)-> A(1) true_A :: [] -(0)-> A(1)