(** The following two theorems are simpler versions for the case where the function transformation does not depend on the compilation unit. *)

Theorem match_transform_program:
forall {A B V: Type} {LA: Linker A} {LV: Linker V}
(transf: A -> B)
(p: program A V),
match_program (fun cu f tf => tf = transf f) eq p (transform_program transf p).