On the complexity of normalization for the planar $\lambda$-calculus
Logic in Computer Science
2024-04-09 v1
Abstract
We sketch a tentative proof of P-completeness for the -convertibility problem on untyped planar (a.k.a. ordered or non-commutative) -terms.
Cite
@article{arxiv.2404.05276,
title = {On the complexity of normalization for the planar $\lambda$-calculus},
author = {Anupam Das and Damiano Mazza and Lê Thành Dũng Nguyên and Noam Zeilberger},
journal= {arXiv preprint arXiv:2404.05276},
year = {2024}
}
Comments
Abstract for the Trends in Linear Logic and Applications 2023 workshop, meant to be expanded into a proper paper in the future