138 search results - page 1 / 28 » Soft Linear Logic and Polynomial Complexity Classes |
ENTCS
2008
13 years 4 months ago
2008
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
FOSSACS
2004
Springer
13 years 10 months ago
2004
Springer
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 affi...
JLP
2008
13 years 4 months ago
2008
A formulation of na
CIE
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
FSTTCS
2005
Springer
13 years 10 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...