On the complexity of normalization for the planar λ-calculus
Abstract
We sketch a tentative proof of P-completeness for the β-convertibility problem on untyped planar (a.k.a. ordered or non-commutative) λ-terms.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.