Soft lambda-calculus: a language for polynomial time computation
| dc.creator | Baillot, Patrick | |
| dc.creator | Mogbil, Virgile | |
| dc.date | 2003-12-07 | |
| dc.date.accessioned | 2026-07-07T03:20:42Z | |
| dc.date.available | 2026-07-07T03:20:42Z | |
| dc.description | 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. | |
| dc.description | 20 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0312015 | |
| dc.identifier | http://arxiv.org/abs/cs/0312015 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31916 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Computational Complexity | |
| dc.subject | F.4; F.4.1; F.4.2 | |
| dc.title | Soft lambda-calculus: a language for polynomial time computation | |
| dc.type | text |