On the complexity of normalization for the planar $\lambda$-calculus
<|reference_start|>On the complexity of normalization for the planar $\lambda$-calculus: We sketch a tentative proof of P-completeness for the $\beta$-convertibility problem on untyped planar (a.k.a. ordered or non-commutative) $\lambda$-terms.<|reference_end|>
@article{das2024on,
    title={On the complexity of normalization for the planar $\lambda$-calculus},
    author={Anupam Das, Damiano Mazza, L^e Th`anh D~ung Nguy^en, Noam
  Zeilberger},
    journal={arXiv preprint arXiv:2404.05276},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.05276},
    primaryClass={cs.LO}
}