On the complexity of normalization for the planar $λ$-calculus
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866929305505759232 |
|---|---|
| author | Das, Anupam Mazza, Damiano Nguyên, Lê Thành Dũng Zeilberger, Noam |
| author_facet | Das, Anupam Mazza, Damiano Nguyên, Lê Thành Dũng Zeilberger, Noam |
| contents | We sketch a tentative proof of P-completeness for the $β$-convertibility problem on untyped planar (a.k.a. ordered or non-commutative) $λ$-terms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_05276 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the complexity of normalization for the planar $λ$-calculus Das, Anupam Mazza, Damiano Nguyên, Lê Thành Dũng Zeilberger, Noam Logic in Computer Science We sketch a tentative proof of P-completeness for the $β$-convertibility problem on untyped planar (a.k.a. ordered or non-commutative) $λ$-terms. |
| title | On the complexity of normalization for the planar $λ$-calculus |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2404.05276 |