Typing lambda terms in Elementary Logic with linear constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2044 LNCS, Issue , 2001, Pages 76-90

  Coppola, Paolo ^a   Martini, Simone ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; INFERENCE ENGINES; PATHOLOGY; ALGORITHMS;

ELEMENTARY AFFINE LOGIC; LAMBDA TERMS; LINEAR CONSTRAINTS; TYPE INFERENCE ALGORITHM;

COMPUTER CIRCUITS; INFERENCE ENGINES;

EID: 84888877515     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45413-6_10     Document Type: Conference Paper

References (13)

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.
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.
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.
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.
5. Vincent Danos, Jean-Baptiste Joinet and Harold Schellinx. On the linear deco-ration of intuitionistic derivations. Archive for Mathematical Logic, 33:387-412, 1995.
6. Jean-Yves Girard. Light linear logic. Information and Computation, 204:143-175, 1998.
7. Vinod K. Kathail. Optimal Interpreters for Lambda-calculus Based Functional Programming Languages. PhD thesis, MIT, May 1990.
8. John Lamping. An Algorithm for Optimal Lambda Calculus Reduction. In ACM POPL '90, pages 16-30, New York, NY, USA, 1990.
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.
10. Harry G. Mairson. A simple proof of a theorem of Statman. Theoretical Computer Science, 103(2):387-394, September 1992.
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.
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.
13. Harold Schellinx. The Noble Art of Linear Decorating. PhD thesis, Institute for Logic, Language and Computation, University of Amsterdam, 1994.