Typing Lambda Terms in Elementary Logic with Linear Constraints

  • Paolo Coppola
  • Simone Martini
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2044)


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.

Unable to display preview. Download preview PDF.


  1. 1.
    Andrea Asperti. Light affine logic. In Proc. of the 13-th Annual IEEE Symposium on Logic in Computer Science (LICS’ 98), pages 300–308, Indianapolis, U.S.A., 1998.Google Scholar
  2. 2.
    Andrea Asperti, Paolo Coppola, and Simone Martini. (Optimal) duplication is not elementary recursive. In ACM POPL’00, pages 96–107, Boston, Massachusetts, January 19–21, 2000.Google Scholar
  3. 3.
    Andrea Asperti and Stefano Guerrini. The Optimal Implementation of Functional Programming Languages, volume 45 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1998.Google Scholar
  4. 4.
    Nick Benton, Gavin Bierman, Valeria de Paiva, and Martin Hyland. A term calculus for intuitionistic linear logic. TLCA’93, volume 664 of Lecture Notes in Computer Science, pages 75–90, March 1993.Google Scholar
  5. 5.
    Vincent Danos, Jean-Baptiste Joinet and Harold Schellinx. On the linear decoration of intuitionistic derivations. Archive for Mathematical Logic, 33:387–412, 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Jean-Yves Girard. Light linear logic. Information and Computation, 204:143–175, 1998.MathSciNetGoogle Scholar
  7. 7.
    Vinod K. Kathail. Optimal Interpreters for Lambda-calculus Based Functional Programming Languages. PhD thesis, MIT, May 1990.Google Scholar
  8. 8.
    John Lamping. An Algorithm for Optimal Lambda Calculus Reduction. In ACM POPL’ 90, pages 16–30, New York, NY, USA, 1990.Google Scholar
  9. 9.
    Jean-Jacques Lévy. Optimal reductions in the lambda-calculus. In Jonathan P. Seldin and J. Roger Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 159–191. Academic Press, London, 1980.Google Scholar
  10. 10.
    Harry G. Mairson. A simple proof of a theorem of Statman. Theoretical Computer Science, 103(2):387–394, September 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Alberto Pravato and Luca Roversi. Λ! considered both as a paradigmatic language and a meta-language. In Fifth Italian Conference on Theoretical Computer Science, Salerno (Italy), 1995.Google Scholar
  12. 12.
    Luca Roversi. A Polymorphic Language which Is Typable and Poly-step. In Proc. of the Asian Computing Science Conference (ASIAN’98), volume 1538 of Lecture Notes in Computer Science, pages 43–60, Manila (The Philippines), 1998.Google Scholar
  13. 13.
    Harold Schellinx. The Noble Art of Linear Decorating. PhD thesis, Institute for Logic, Language and Computation, University of Amsterdam, 1994.Google Scholar

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