Closure of FP under composition

Main result

• mem_FP_comp — polynomial-time string functions are closed under composition

theorem Complexity.mem_FP_comp {f g : List Bool → List Bool} (hf : f ∈ FP) (hg : g ∈ FP) : g ∘ f ∈ FP

The composition of two polynomial-time string functions is polynomial-time.