On the elementary affine λ-calculus with and without type fixpoints

Abstract : The elementary affine λ-calculus was introduced as a polyvalent setting for implicit computational complexity, allowing for characterizations of polynomial time and hyperexponential time predicates. But these results rely on type fixpoints (a.k.a. recursive types), and it was unknown whether this feature of the type system was really necessary. We give a positive answer by showing that without type fixpoints, we get a characterization of regular languages instead of polynomial time. The proof uses the semantic evaluation method. We also propose an aesthetic improvement on the characterization of the function classes FP and k-FEXPTIME in the presence of recursive types.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02153709
Contributor : Lê Thành Dũng Nguyễn <>
Submitted on : Wednesday, June 12, 2019 - 2:11:38 PM
Last modification on : Saturday, June 15, 2019 - 8:40:31 PM

File

post-proceedings-dice-fopara.p...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02153709, version 1

Collections

Citation

Lê Thành Dũng Nguyễn. On the elementary affine λ-calculus with and without type fixpoints. 2019. ⟨hal-02153709⟩

Share

Metrics

Record views

26

Files downloads

8