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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Asperti, A., Roversi, L.: Intuitionistic light affine logic. ACM ToCL 3(1), 1–39 (2002)
Atassi, V., Baillot, P., Terui, K.: Verification of PTIME reducibility for System F terms: Type inference in dual light affine logic. Logical Methods in Computer Science 3(4) (2007)
Avanzi, R.M., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press (2005)
Baillot, P., Gaboardi, M., Mogbil, V.: A PolyTime Functional Language from Light Linear Logic. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 104–124. Springer, Heidelberg (2010)
Baillot, P., Mogbil, V.: Soft lambda-Calculus: A Language for Polynomial Time Computation. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 27–41. Springer, Heidelberg (2004)
Baillot, P., Terui, K.: Light types for polynomial time computation in lambda calculus. I&C 207(1), 41–62 (2009)
Burrell, J.M., Cockett, R., Redmond, F.B.: POLA: a language for PTIME programming (2009); accepted for presentation at LCC 2009
Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51, 107–113 (2008)
Fong, K., Hankerson, D., Lopez, J., Menezes, A.: Field inversion and point halving revisited. IEEE Trans. Comput. 53(8), 1047–1059 (2004)
Hofmann, M.: The strength of non-size increasing computation. In: POPL, pp. 260–269 (2002)
Hofmann, M.: Linear types and non-size-increasing polynomial time computation. I&C 183(1), 57–85 (2003)
Hutton, G.: A tutorial on the universality and expressiveness of fold. JFP 9(4), 355–372 (1999)
Lafont, Y.: Soft linear logic and polynomial time. TCS 318(1-2), 163–180 (2004)
Pedicini, M., Quaglia, F.: PELCR: parallel environment for optimal lambda-calculus reduction. ACM Trans. Comput. Log. 8(3) (2007), http://dx.doi.org/10.1145/1243996.1243997
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cesena, E., Pedicini, M., Roversi, L. (2012). Typing a Core Binary-Field Arithmetic in a Light Logic. In: Peña, R., van Eekelen, M., Shkaravska, O. (eds) Foundational and Practical Aspects of Resource Analysis. FOPARA 2011. Lecture Notes in Computer Science, vol 7177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32495-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-32495-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32494-9
Online ISBN: 978-3-642-32495-6
eBook Packages: Computer ScienceComputer Science (R0)