Soft lambda-calculus: a language for polynomial time computation [article]

Patrick Baillot, Virgile Mogbil
<span title="2003-12-07">2003</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affine variant of this logic. We prove that the (untyped) terms of this calculus are reducible in polynomial time. We then extend the type system of Soft logic with recursive types. This allows us to consider non-standard types for representing lists. Using these datatypes we examine the concrete expressivity of Soft
more &raquo; ... a-calculus with the example of the insertion sort algorithm.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="">arXiv:cs/0312015v1</a> <a target="_blank" rel="external noopener" href="">fatcat:kyrtagxsybfe3gy27u4jayh7sm</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" href="" title=" access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> </button> </a>