Back to Search
Start Over
On the complexity of normalization for the planar $\lambda$-calculus
- Publication Year :
- 2024
-
Abstract
- 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.<br />Comment: Abstract for the Trends in Linear Logic and Applications 2023 workshop, meant to be expanded into a proper paper in the future
- Subjects :
- Computer Science - Logic in Computer Science
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2404.05276
- Document Type :
- Working Paper