( en | de | ru )

 

Disambiguation of "Roversi, Luca"

Author of the publication

copydeleteadd this publication to your clipboard
Typing a Core Binary Field Arithmetic in a Light Logic

, , and . CoRR, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Luca Rizzini

Luca Tranchini

Luca Tuninetti

Alfonz Luca

Marcello Lucà

 

Other publications of authors with the same name

Light Affine Logic (Proof Nets, Programming Notation, P-Time Correctness and Completeness), and . CoRR, (2000)On the Expressivity of Total Reversible Programming Languages., , and . RC, volume 12227 of Lecture Notes in Computer Science, page 128-143. Springer, (2020)Quantum-Classical Sentiment Analysis., and . CoRR, (2024)The Fixed Point Problem for General and for Linear SRL Programs is Undecidable., , and . ICTCS, volume 2243 of CEUR Workshop Proceedings, page 128-139. CEUR-WS.org, (2018)Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion?, , , , and . FOPARA, volume 8552 of Lecture Notes in Computer Science, page 38-57. Springer, (2013)Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets., and . TYPES, volume 5497 of Lecture Notes in Computer Science, page 306-322. Springer, (2008)A Type-Free Resource-Aware Lambda-Calculus.. CSL, volume 1258 of Lecture Notes in Computer Science, page 399-413. Springer, (1996)Weak Affine Light Typing: Polytime intensional expressivity, soundness and completeness. CoRR, (2007)Communication, and concurrency with logic-based restriction inside a calculus of structures. CoRR, (2012)Taming Modal Impredicativity: Superlazy Reduction., , and . LFCS, volume 5407 of Lecture Notes in Computer Science, page 137-151. Springer, (2009)