2 citations · 3 across the 9 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2011★ 1 cited
Typing a Core Binary Field Arithmetic in a Light Logic
Emanuele Cesena, Marco Pedicini, Luca Roversi
We design a library for binary field arithmetic and we supply a core API which is completely developed in DLAL, extended with a fix point formula. Since DLAL is a restriction of li…
cs.LO2006
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus
Patrick Baillot, Marco Pedicini
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in th…
cs.LO2004★ 2 cited
PELCR: Parallel Environment for Optimal Lambda-Calculus Reduction
M. Pedicini, F. Quaglia
In this article we present the implementation of an environment supporting Lévy's \emph{optimal reduction} for the -calculus \cite{Lev78} on parallel (or distributed) computing…