{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T10:49:04Z","timestamp":1720435744786},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1016\/j.scico.2015.04.001","type":"journal-article","created":{"date-parts":[[2015,5,2]],"date-time":"2015-05-02T12:01:31Z","timestamp":1430568091000},"page":"365-394","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"P3","title":["Light combinators for finite fields arithmetic"],"prefix":"10.1016","volume":"111","author":[{"given":"D.","family":"Canavese","sequence":"first","affiliation":[]},{"given":"E.","family":"Cesena","sequence":"additional","affiliation":[]},{"given":"R.","family":"Ouchary","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9016-074X","authenticated-orcid":false,"given":"M.","family":"Pedicini","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1871-6109","authenticated-orcid":false,"given":"L.","family":"Roversi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.scico.2015.04.001_br0010","series-title":"Foundational and Practical Aspects of Resource Analysis","first-page":"19","article-title":"Typing a core binary-field arithmetic in a light logic","volume":"vol. 7177","author":"Cesena","year":"2012"},{"issue":"1","key":"10.1016\/j.scico.2015.04.001_br0020","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ic.2008.08.005","article-title":"Light types for polynomial time computation in lambda calculus","volume":"207","author":"Baillot","year":"2009","journal-title":"Inf. Comput."},{"issue":"8","key":"10.1016\/j.scico.2015.04.001_br0030","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1109\/TC.2004.43","article-title":"Field inversion and point halving revisited","volume":"53","author":"Fong","year":"2004","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/j.scico.2015.04.001_br0040","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1017\/S0956796899003500","article-title":"A tutorial on the universality and expressiveness of Fold","volume":"9","author":"Hutton","year":"1999","journal-title":"J. Funct. Program."},{"key":"10.1016\/j.scico.2015.04.001_br0050","series-title":"Ninth Annual Conference of the EACSL","first-page":"469","article-title":"A P-time completeness proof for light logics","volume":"vol. 1683","author":"Roversi","year":"1999"},{"issue":"1","key":"10.1016\/j.scico.2015.04.001_br0060","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/504077.504081","article-title":"Intuitionistic light affine logic","volume":"3","author":"Asperti","year":"2002","journal-title":"ACM Trans. Comput. Log."},{"key":"10.1016\/j.scico.2015.04.001_br0070","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","article-title":"MapReduce: simplified data processing on large clusters","volume":"51","author":"Dean","year":"2008","journal-title":"Commun. ACM"},{"issue":"8","key":"10.1016\/j.scico.2015.04.001_br0080","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","article-title":"Can programming be liberated from the von Neumann style? A functional style and its algebra of programs","volume":"21","author":"Backus","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/j.scico.2015.04.001_br0090","series-title":"Foundational and Practical Aspects of Resource Analysis","first-page":"38","article-title":"Can a light typing discipline be compatible with an efficient implementation of finite fields inversion?","volume":"vol. 8552","author":"Canavese","year":"2014"},{"issue":"4","key":"10.1016\/j.scico.2015.04.001_br0100","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-3(4:10)2007","article-title":"Verification of PTIME reducibility for System F terms: type inference in dual light affine logic","volume":"3","author":"Atassi","year":"2007","journal-title":"Log. Methods Comput. Sci."},{"key":"10.1016\/j.scico.2015.04.001_br0110","series-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"Avanzi","year":"2005"},{"issue":"3","key":"10.1016\/j.scico.2015.04.001_br0120","doi-asserted-by":"crossref","DOI":"10.1145\/1243996.1243997","article-title":"PELCR: parallel environment for optimal lambda-calculus reduction","volume":"8","author":"Pedicini","year":"2007","journal-title":"ACM Trans. Comput. Log."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642315000672?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642315000672?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,11,2]],"date-time":"2019-11-02T06:37:17Z","timestamp":1572676637000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642315000672"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":12,"alternative-id":["S0167642315000672"],"URL":"https:\/\/doi.org\/10.1016\/j.scico.2015.04.001","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[2015,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Light combinators for finite fields arithmetic","name":"articletitle","label":"Article Title"},{"value":"Science of Computer Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.scico.2015.04.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}