Typing a Core Binary Field Arithmetic in a Light Logic

arxiv: 1106.5622 · v1 · pith:BD7NRUEQnew · submitted 2011-06-28 · 💻 cs.LO

Typing a Core Binary Field Arithmetic in a Light Logic

Emanuele Cesena , Marco Pedicini , Luca Roversi This is my paper

classification 💻 cs.LO

keywords arithmeticbinarycorefielddlalfunctionallogicpolynomial

0 comments p. Extension

pith:BD7NRUEQ Add to your LaTeX paper

What is a Pith Number?

\usepackage{pith}
\pithnumber{BD7NRUEQ}

Prints a linked pith:BD7NRUEQ badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original 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.

This paper has not been read by Pith yet.

Typing a Core Binary Field Arithmetic in a Light Logic

discussion (0)