Chapter

Typed Lambda Calculi and Applications

Volume 2044 of the series Lecture Notes in Computer Science pp 76-90

Date:

Typing Lambda Terms in Elementary Logic with Linear Constraints

  • Paolo CoppolaAffiliated withDipartimento di Matematica e Informatica, Università di Udine
  • , Simone MartiniAffiliated withDipartimento di Matematica e Informatica, Università di Udine

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We present a type inference algorithm for λ-terms in Elementary Affine Logic using linear constraints. We prove that the algorithm is correct and complete.