2003/12/07 by Patrick Baillot, Baillot, Patrick, Virgile Mogbil +1 · 1 citation
Computer Science · #Computational Complexity (cs.CC) #F.4 #F.4.1 #F.4.2 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.CC #cs.LO
paper · pdf · doi:10.48550/arxiv.cs/0312015
20 pages
arxiv created 2003/12/07 · arxiv updated 2009/12/01
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 lambda-calculus with the example of the insertion sort algorithm.