Light types for polynomial time computation in lambda-calculus

P. Baillot, K. Terui
<span title="">2004</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="" style="color: black;">Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.</a> </i> &nbsp;
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.
more &raquo; ... nally we establish that as LAL, DLAL allows to represent all polytime functions.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1109/lics.2004.1319621</a> <a target="_blank" rel="external noopener" href="">dblp:conf/lics/BaillotT04</a> <a target="_blank" rel="external noopener" href="">fatcat:vgv6qbozbffv7axhycotxzsjpa</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>