# In reply to @joetroll "this is very cool!": sorta, so `lift[S](f)` where `f :
# A -> B` and so `lift[S](f): S[A] -> S[B]` `S` can be understood to have a
# grammar like:
S ::= ?, here
      seq[S]
      Option[S]
      (S_0, ..., S_n)
# so it facilitates concurrency but also some destructuring