Optimizing Optimal Reduction: A Type Inference Algorithm for Elementary Affine Logic

Simple item page
dc.creatorCoppola, Paolo
dc.creatorMartini, Simone
dc.date2003-05-15
dc.date.accessioned2026-07-07T07:54:02Z
dc.date.available2026-07-07T07:54:02Z
dc.descriptionWe present a type inference algorithm for lambda-terms in Elementary Affine Logic using linear constraints. We prove that the algorithm is correct and complete.
dc.identifierhttps://arxiv.org/abs/cs/0305011
dc.identifierhttp://arxiv.org/abs/cs/0305011
dc.identifierACM Transactions on Computational Logic, vol 7 (2006) pp. 219 - 260.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126449
dc.subjectLogic in Computer Science
dc.subjectF.4.1: D.3
dc.titleOptimizing Optimal Reduction: A Type Inference Algorithm for Elementary Affine Logic
dc.typetext

Files

Collections

arXiv