A feasible algorithm for typing in Elementary Affine Logic
| dc.creator | Baillot, Patrick | |
| dc.creator | Terui, Kazushige | |
| dc.date | 2004-12-08 | |
| dc.date.accessioned | 2026-07-07T03:22:09Z | |
| dc.date.available | 2026-07-07T03:22:09Z | |
| dc.description | We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type system we consider (denoted EAL*) is a variant without sharing and without polymorphism. Our algorithm improves over the ones already known in that it offers a better complexity bound: if a simple type derivation for the term t is given our algorithm performs EAL* type inference in polynomial time. | |
| dc.description | 20 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0412028 | |
| dc.identifier | http://arxiv.org/abs/cs/0412028 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32484 | |
| dc.subject | Logic in Computer Science | |
| dc.title | A feasible algorithm for typing in Elementary Affine Logic | |
| dc.type | text |