Composition is almost as good as s-1-1

The author establishes a polynomial upper bound on the time complexity of s-1-1 in programming systems with a linear time instance of composition. He also exhibits a family of acceptable such programming systems for which the upper bound is optimal. He deduces several bounds on the time complexity of composition, s-1-1, and various classes of control structures in effective or arbitrary programming systems with a linear or polynomial time instance of composition. In particular, he shows that any programming system with a polynomial time instance of composition has an exponential time instance of s-1-1