Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-32495-6_2 | FOPARA'11 Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis |
Keywords | DocType | Volume |
light logic,core application programming interface,binary-field arithmetic,light type assignment system,typeable functional assembly,functional programming,type functional program,polynomial evaluation cost,system dual light affine,core binary-field arithmetic,formal system,built-in polynomial complexity,linear logic,fixed point | Conference | abs/1106.5622 |
Citations | PageRank | References |
2 | 0.41 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emanuele Cesena | 1 | 37 | 5.28 |
| Marco Pedicini | 2 | 60 | 10.43 |
| Luca Roversi | 3 | 183 | 21.03 |