Typing a Core Binary Field Arithmetic in a Light Logic
Logic in Computer Science
2011-06-29 v1
Abstract
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 linear logic where only functional programs with polynomial evaluation cost can be typed, we obtain the core of a functional programming setting for binary field arithmetic with built-in polynomial complexity.
Cite
@article{arxiv.1106.5622,
title = {Typing a Core Binary Field Arithmetic in a Light Logic},
author = {Emanuele Cesena and Marco Pedicini and Luca Roversi},
journal= {arXiv preprint arXiv:1106.5622},
year = {2011}
}