def fmap
import bendtorch@1.3.0.0/PROOF.bend as PROOFimport Base
import bendtorch@1.3.0.0/main.bend as T
285def fmap(+h: Nat, +dm: T.Dm, xs: List<&1, T.FS>) -> List<&1, Array<F32>>:
286 match xs:
287 case Nil{}:
288 Nil{}
289 case Con{x, t}:
290 T.fs_o(T.fheads(h, 0n, dm, x)) <> fmap(h, dm, t)