1D languages encode these relations grammatically. There is no reason why a 2D language couldn't also be grammatical. Sure it is harder to write a 2D parser perhaps, but people have still played with the idea a little bit. There is just no huge economic incentive to do so other than simple aesthetics.
Working on verifiable correctness for programs written in LM or anything that generates annotated assembly. Basically low-level proofs that accessed memory is valid and live or that function pre/post-conditions are met.
The goal is that these proofs are compiler agnostic, so more people can use them.