Typing Lambda Terms in Elementary Logic with Linear Constraints

  • Paolo Coppola
  • Simone Martini
Conference paper

DOI: 10.1007/3-540-45413-6_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2044)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Paolo Coppola
    • 1
  • Simone Martini
    • 1
  1. 1.Dipartimento di Matematica e InformaticaUniversità di UdineUdineItaly

Personalised recommendations