I'm not sure if there's something fundamental preventing the inclusion of a function of type
vmap
:: Short (NumCols p - 1)
=> R (f :->: g) p -> V f p -> V g p
in sculls.
One might then use a record of functions like
funcs :: R (I :->: I) (Row0 .& "int" .= Int .& "string" .= String)
funcs = mkR
.* (A (\(I x) -> I (2 * x)) :: (I :->: I) "int" Int)
.* (A (\(I x) -> I (reverse x)) :: (I :->: I) "string" String)
to eliminate a variant like V I (Row0 .& "int" .= Int .& "string" .= String).
I'm not sure if there's something fundamental preventing the inclusion of a function of type
in
sculls.One might then use a record of functions like
to eliminate a variant like
V I (Row0 .& "int" .= Int .& "string" .= String).