We show that an algorithm implementing the Binary-Field Arithmetic operation of multiplicative inversion exists as a purely functional term which is typeable in Dual Light Affine Logic (DLAL). As a consequence, the set ΛDLAL of functional terms typeable in DLAL is large enough to program the whole set of arithmetic operations. Second, and most important, we show that ΛDLAL can be seen a domain specific language that forces programmer to think about algorithms under a non standard mental pattern which may result in more essential descriptions of known algorithms which, also, may be more efficient.
Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion? / Canavese, Daniele; Cesena, Emanuele; Ouchary, Rachid; Pedicini, M.; Roversi, L.. - STAMPA. - 8552:(2014), pp. 38-57. (Intervento presentato al convegno FOPARA 2013 tenutosi a Bertinoro nel August 2013) [10.1007/978-3-319-12466-7_3].
Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion?
CANAVESE, DANIELE;CESENA, EMANUELE;OUCHARY, RACHID;
2014
Abstract
We show that an algorithm implementing the Binary-Field Arithmetic operation of multiplicative inversion exists as a purely functional term which is typeable in Dual Light Affine Logic (DLAL). As a consequence, the set ΛDLAL of functional terms typeable in DLAL is large enough to program the whole set of arithmetic operations. Second, and most important, we show that ΛDLAL can be seen a domain specific language that forces programmer to think about algorithms under a non standard mental pattern which may result in more essential descriptions of known algorithms which, also, may be more efficient.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2514482
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo