Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference29 articles.
1. Verification of Ptime reducibility for system F terms: type inference in dual light affine logic;Atassi;Log. Methods Comput. Sci.,2007
2. A polytime functional language from light linear logic;Baillot,2010
3. Linear logic by levels and bounded time complexity;Baillot;Theor. Comput. Sci.,2010
4. Elementary complexity and geometry of interaction;Baillot;Fundam. Inform.,2000
5. Light types for polynomial time computation in lambda calculus;Baillot;Inf. Comput.,2009