Typing Lambda Terms in Elementary Logic with Linear Constraints
- Cite this paper as:
- Coppola P., Martini S. (2001) Typing Lambda Terms in Elementary Logic with Linear Constraints. In: Abramsky S. (eds) Typed Lambda Calculi and Applications. TLCA 2001. Lecture Notes in Computer Science, vol 2044. Springer, Berlin, Heidelberg
We present a type inference algorithm for λ-terms in Elementary Affine Logic using linear constraints. We prove that the algorithm is correct and complete.
Unable to display preview. Download preview PDF.