One thing I think will eventually come out of linear logic is that in classical linear logic there's no intrinsic division between inputs in outputs. In LL it's the case that implication, which corresponds to functions in programming, is decomposed into a linear implication, which is a pure application, and an exponential which handles copying. But even further than that, in classic linear logic there is a symmetric version of implication called par. A -o B is the same as Not A `par` B.<p>It's this symmetry that intrigues me, because it points to a way of programming beyond functional programming that still maintains its fundamental good properties.