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.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...