New! You can now keep track of new articles from ACM Transactions on Computational Logic (TOCL) on your personalized homepage!
We propose a type inference algorithm for lambda terms in elementary affine logic (EAL). The algorithm decorates the syntax tree of a simple typed lambda term and collects a set of linear constraints. The result is a parametric elementary type that can be instantiated with any solution of the set...