Typing Lambda Terms in Elementary Logic with Linear Constraints-Reference-Cited by-同舟云学术

Typing Lambda Terms in Elementary Logic with Linear Constraints

Published:2001 Issue: Volume: Page:76-90
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Coppola Paolo,Martini Simone

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45413-6_10

Reference13 articles.

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. Lect Notes Comput Sci;N. Benton,1993

5. Vincent Danos, Jean-Baptiste Joinet and Harold Schellinx. On the linear decoration of intuitionistic derivations. Archive for Mathematical Logic, 33:387–412, 1995.

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Polynomial Time and Dependent Types;Proceedings of the ACM on Programming Languages;2024-01-05

2. Non-linearity as the Metric Completion of Linearity;Lecture Notes in Computer Science;2013

3. Controlling Program Extraction in Light Logics;Lecture Notes in Computer Science;2011

4. A Semantic Proof of Polytime Soundness of Light Affine Logic;Theory of Computing Systems;2009-04-07

5. Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic;Computer Science Logic;2006