Polynomial time in untyped elementary linear logic - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2020

Polynomial time in untyped elementary linear logic

Résumé

We show how to represent polynomial time computation in an untyped version of proof-nets for elementary linear logic. This follows previous work by P. Baillot but which was developed in a typed and affine setting. We describe how these two properties can be adapted.
Fichier principal
Vignette du fichier
ptimeell.pdf (469.34 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02333452 , version 1 (06-05-2020)

Identifiants

Citer

Olivier Laurent. Polynomial time in untyped elementary linear logic. Theoretical Computer Science, 2020, 813, pp.117-142. ⟨10.1016/j.tcs.2019.10.002⟩. ⟨hal-02333452⟩
50 Consultations
49 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More