Archivio Istituzionale della RicercaWe design a library for binary-field arithmetic and we supply a core application programming interface (API) completely developed in a formal system we introduce: Typeable Functional Assembly (TFA) which essentially is the system Dual Light Affine Logic (DLAL) introduced by Baillot and Terui and extended with a fix-point formula. TFA is a light type assignment system, in the sense that substructural rules on types of linear logic allow just to type functional programs with polynomial evaluation cost. As a consequence, we show the core of a functional programming setting for binary-field arithmetic with built-in polynomial complexity.
Typing a Core Binary-Field Arithmetic in a Light Logic / Cesena, Emanuele; M., Pedicini; L., Roversi. - 7177:(2012), pp. 19-35. (Intervento presentato al convegno Second International Workshop, FOPARA 2011, Revised Selected Papers tenutosi a Madrid, Spain nel May 2011) [10.1007/978-3-642-32495-6_2].
Typing a Core Binary-Field Arithmetic in a Light Logic
CESENA, EMANUELE;
2012
Abstract
We design a library for binary-field arithmetic and we supply a core application programming interface (API) completely developed in a formal system we introduce: Typeable Functional Assembly (TFA) which essentially is the system Dual Light Affine Logic (DLAL) introduced by Baillot and Terui and extended with a fix-point formula. TFA is a light type assignment system, in the sense that substructural rules on types of linear logic allow just to type functional programs with polynomial evaluation cost. As a consequence, we show the core of a functional programming setting for binary-field arithmetic with built-in polynomial complexity.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2506089
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo