Simply typed convertibility is TOWER-complete even for safe lambda-terms - Archive ouverte HAL
Article Dans Une Revue Logical Methods in Computer Science Année : 2024

Simply typed convertibility is TOWER-complete even for safe lambda-terms

Résumé

We consider the following decision problem: given two simply typed λ-terms, are they β-convertible? Equivalently, do they have the same normal form? It is famously non-elementary, but the precise complexity — namely Tower-complete — is lesser known. One goal of this short paper is to popularize this fact. Our original contribution is to show that the problem stays Tower-complete when the two input terms belong to Blum and Ong's safe λ-calculus, a fragment of the simply typed λ-calculus arising from the study of higher-order recursion schemes. Previously, the best known lower bound for this safe β-convertibility problem was PSpace-hardness. Our proof proceeds by reduction from the star-free expression equivalence problem, taking inspiration from the author's work with Pradic on "implicit automata in typed λ-calculi". These results also hold for βη-convertibility.
Fichier principal
Vignette du fichier
2305.12601v4.pdf (644.22 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04688374 , version 1 (05-09-2024)

Licence

Identifiants

Citer

Lê Thành Dũng Nguyễn. Simply typed convertibility is TOWER-complete even for safe lambda-terms. Logical Methods in Computer Science, 2024, 20 (3), pp.21:1-21:15. ⟨10.46298/LMCS-20(3:21)2024⟩. ⟨hal-04688374⟩
8 Consultations
1 Téléchargements

Altmetric

Partager

More