Work

On the complexity of normalization for the planar $λ$-calculus

Year: 2024

Type: preprint

Abstract: We sketch a tentative proof of P-completeness for the $β$-convertibility problem on untyped planar (a.k.a. ordered or non-commutative) $λ$-terms.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2404.05276

Authors: Das, Anupam, Mazza, Damiano, Nguyên, Lê Thành Dũng, Zeilberger, Noam

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4394672986

Cites:

Cited by:

Related to: 10