Person. Anupam Das
Papers
On the complexity of normalization for the planar -calculus das-2024-on
We sketch a tentative proof of P-completeness for the -convertibility problem on untyped planar (a.k.a. ordered or non-commutative) -terms.