fact: Fixpoint insertInOrder (ls : list (A * B))(a : A)(b : B) := match ls with | nil => (a, b)::ls | (a', b')::ls' => if (leA a a') then ((a, b)::ls) else (a', b')::(insertInOrder ls' a b) end.
imports: FCF FCF.PRF Permutation