Soft Linear Logic (SLL) is a subsystem of second-order linear logic with restricted rules for exponentials, which is correct and complete for PTIME. We design a type assignment system for the ?-calculus (STA), which assigns to ?-terms as types (a proper subset of) SLL formulas, in such a way that typable terms inherit the good complexity properties of the logical system. Namely STA enjoys subject reduction and normalization, and it is correct and complete for PTIME and PTIME.</p
Dans la première partie, on propose un système de type pour le lambda-calcul, dans le style du calcu...
20 pagesSoft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME...
We study the type inference problem for the Soft Type Assignment system (STA) for lambda-calculus in...
Soft Linear Logic (SLL) is a subsystem of second-order linear logic with restricted rules for expone...
Abstract. Soft Linear Logic (SLL) is a subsystem of second-order linear logic with restricted rules ...
Using Soft Linear Logic (SLL) as case study, we analyze a method for transforming a light logic into...
Using Soft Linear Logic (SLL) as case study, we analyze a method for transforming a light logic into...
We describe some results inspired to Lafont’s Soft Linear Logic (SLL) which is a subsystem of second...
AbstractWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem o...
Using Soft Linear Logic (SLL) as case study, we analyze a method for transforming a light logic into...
AbstractWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem o...
In the first part, we propose, inspired by Soft Linear Logic, a type assignment system for lambda-ca...
In the first part, we propose, inspired by Soft Linear Logic, a type assignment system for lambda-ca...
International audienceWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is...
Dans la première partie, on propose un système de type pour le lambda-calcul, dans le style du calcu...
Dans la première partie, on propose un système de type pour le lambda-calcul, dans le style du calcu...
20 pagesSoft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME...
We study the type inference problem for the Soft Type Assignment system (STA) for lambda-calculus in...
Soft Linear Logic (SLL) is a subsystem of second-order linear logic with restricted rules for expone...
Abstract. Soft Linear Logic (SLL) is a subsystem of second-order linear logic with restricted rules ...
Using Soft Linear Logic (SLL) as case study, we analyze a method for transforming a light logic into...
Using Soft Linear Logic (SLL) as case study, we analyze a method for transforming a light logic into...
We describe some results inspired to Lafont’s Soft Linear Logic (SLL) which is a subsystem of second...
AbstractWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem o...
Using Soft Linear Logic (SLL) as case study, we analyze a method for transforming a light logic into...
AbstractWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem o...
In the first part, we propose, inspired by Soft Linear Logic, a type assignment system for lambda-ca...
In the first part, we propose, inspired by Soft Linear Logic, a type assignment system for lambda-ca...
International audienceWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is...
Dans la première partie, on propose un système de type pour le lambda-calcul, dans le style du calcu...
Dans la première partie, on propose un système de type pour le lambda-calcul, dans le style du calcu...
20 pagesSoft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME...
We study the type inference problem for the Soft Type Assignment system (STA) for lambda-calculus in...
DOI
Add to ORKG