Oct 5, 2007 · View a PDF of the paper titled Verification of Ptime Reducibility for system F Terms: Type Inference in<br> Dual Light Affine Logic, by Vincent ...
In the present work we address the problem of typing lambda-terms in second-order DLAL. For that we give a procedure which, starting with a term typed in system ...
In the present work we address the problem of typing lambda-terms in second-order DLAL. For that we give a procedure which, starting with a term typed in system ...
Verification of Ptime Reducibility for System F terms. Via Dual Light Affine Logic ... Type inference involves solving word-constraints over . Solution ...
Mar 27, 2006 · In a previous work we introduced Dual Light Affine Logic (DLAL) ([BT04]) as a variant of Light Linear Logic suitable for guaranteeing complexity ...
[PDF] Verification of Ptime reducibility for system F terms via Dual Light Affine ...
arxiv.org › pdf
Mar 27, 2006 · Type inference for light affine logic via constraints on words. Theoretical Computer Science, 328(3):289–323, 2004. [BC92]. S. Bellantoni and ...
Nov 15, 2007 · VERIFICATION OF PTIME REDUCIBILITY FOR SYSTEM F TERMS: TYPE INFERENCE IN DUAL LIGHT AFFINE LOGIC. VINCENT ATASSIa, PATRICK BAILLOT a, AND ...
This work gives a procedure which, starting with a term typed in system F, determines whether it is typable in DLAL and outputs a concrete typing if there ...
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic ; April 2006; Lecture Notes in Computer Science ; Source; arXiv ; Conference: ...
This work gives a procedure which, starting with a term typed in system F, finds all possible ways to decorate it into a DLAL typed term and shows that the ...