A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Light types for polynomial time computation in lambda-calculus
2004
Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
Preserved Fulltext
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.
doi:10.1109/lics.2004.1319621
dblp:conf/lics/BaillotT04
fatcat:vgv6qbozbffv7axhycotxzsjpa