Add to ORKGAbstract. 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 FP-TIME
International audienceWe extend the Soft Linear Logic of Lafont with a new kind of modality, called ...
International audienceWe extend the Soft Linear Logic of Lafont with a new kind of modality, called ...
Abstract. We study the type inference problem for the Soft Type As-signment system (STA) for λ-calcu...
Soft Linear Logic (SLL) is a subsystem of second-order linear logic with restricted rules for expone...
Soft Linear Logic (SLL) is a subsystem of second-order linear logic with restricted rules for expone...
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...
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...
AbstractWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem o...
International audienceWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is...
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 extend the Soft Linear Logic of Lafont with a new kind of modality, called ...
International audienceWe extend the Soft Linear Logic of Lafont with a new kind of modality, called ...
International audienceWe extend the Soft Linear Logic of Lafont with a new kind of modality, called ...
Abstract. We study the type inference problem for the Soft Type As-signment system (STA) for λ-calcu...
Soft Linear Logic (SLL) is a subsystem of second-order linear logic with restricted rules for expone...
Soft Linear Logic (SLL) is a subsystem of second-order linear logic with restricted rules for expone...
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...
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...
AbstractWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem o...
International audienceWe describe some results inspired to Lafont's Soft Linear Logic (SLL) which is...
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 extend the Soft Linear Logic of Lafont with a new kind of modality, called ...
International audienceWe extend the Soft Linear Logic of Lafont with a new kind of modality, called ...
International audienceWe extend the Soft Linear Logic of Lafont with a new kind of modality, called ...
Abstract. We study the type inference problem for the Soft Type As-signment system (STA) for λ-calcu...