This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th Annual IEEE Symposium on Logic in Computer Science (LICS'04)
Light Types for Polynomial Time Computation in Lambda-Calculus
Turku, Finland
July 13-July 17
ISBN: 0-7695-2192-4
Patrick Baillot, Universit? Paris-Nord, France
Kazushige Terui, National Institute of Informatics, Tokyo, Japan
We propose a new type system for lambda-calculus ensuring that well-typed programs can be executed in polynomial time: Dual light affine logic (DLAL). DLAL has a simple type language with a linear and an intuitionistic type arrow, and one modality. It corresponds to a fragment of Light affine logic (LAL). We show that contrarily to LAL, DLAL ensures good properties on lambda-terms: subject reduction is satisfied and a well-typed term admits a polynomial bound on the reduction by any strategy. Finally we establish that as LAL, DLAL allows to represent all polytime functions.
Citation:
Patrick Baillot, Kazushige Terui, "Light Types for Polynomial Time Computation in Lambda-Calculus," lics, pp.266-275, 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.