def ffmap
import bendtorch@1.3.0.0/PROOF.bend as PROOFimport Base
import bendtorch@1.3.0.0/main.bend as T
437def ffmap(+h: Nat, +dm: T.Dm, xs: List<&1, T.FS>) -> List<&1, Array<F32>>:
438 match xs:
439 case Nil{}:
440 Nil{}
441 case Con{x, t}:
442 T.fs_o(T.fheads_full(h, 0n, dm, x)) <> ffmap(h, dm, t)