{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:15Z","timestamp":1725663855520},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540539810"},{"type":"electronic","value":"9783540464990"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3540539816_77","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:18:58Z","timestamp":1330190338000},"page":"379-393","source":"Crossref","is-referenced-by-count":1,"title":["On addition schemes"],"prefix":"10.1007","author":[{"given":"Sre\u0107ko","family":"Brlek","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Cast\u00e9ran","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Strandh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,6]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"F. Bergeron, J. Berstel, S. Brlek, A Unifying Approach to the Generation of Addition Chains, Proceedings of the XV Latino-American Conference on Informatics, 10\u201314 July (1989) 29\u201438.","DOI":"10.1016\/0196-6774(89)90036-9"},{"key":"23_CR2","unstructured":"F. Bergeron, J. Berstel, S. Brlek, Efficient Computation of Addition Chains, Submitted."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"F. Bergeron, J. Berstel, S. Brlek, C. Duboc, Addition Chains using Continued Fractions, Journal of Algorithms (1988) 403\u2013412.","DOI":"10.1016\/0196-6774(89)90036-9"},{"key":"23_CR4","unstructured":"D. Bj\u00f8rner, A.P. Ershov, N.D. Jones (eds.) Partial Evaluation and Mixed Computation, North Holland, (1988)."},{"key":"23_CR5","unstructured":"F. Bergeron, J. Olivos, Vectorial Addition Chains Using Euclid's Algorithm, (1989) Submitted."},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1090\/S0002-9904-1939-07068-7","volume":"45","author":"A. Brauer","year":"1939","unstructured":"A. Brauer, On Addition Chains, Bull.Amer.Math.Soc. 45, (1939) 736\u2013739.","journal-title":"Bull.Amer.Math.Soc."},{"key":"23_CR7","volume-title":"Cha\u00eenes d'additions et structures de contr\u00f4le","author":"S. Brlek","year":"1991","unstructured":"S. Brlek, P. Cast\u00e9ran, R. Strandh, Cha\u00eenes d'additions et structures de contr\u00f4le, Journ\u00e9es JFLA 91, Gresse-en-Vercors, France, January 28\u201329, (1991)."},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(87)90183-9","volume":"24","author":"M. Castan","year":"1987","unstructured":"M. Castan, M.-H. Durand, M. Lema\u00eetre, A Set of Combinators for Abstraction in Linear Space, Information Processing Letter 24, (1987) 183\u2013188","journal-title":"Information Processing Letter"},{"key":"23_CR9","unstructured":"H.B. Curry, R. Feys, Combinatory Logic, North Holland (1974)."},{"key":"23_CR10","first-page":"1","volume":"3","author":"P. Downey","year":"1974","unstructured":"P. Downey, B. Leong, R. Sethi, Computing Sequences with Additions Chains, SIAM J.Computing 3, (1974) 1\u201310.","journal-title":"SIAM J.Computing"},{"key":"23_CR11","unstructured":"R.K. Dybvig, The Scheme Programming Language, Prentice Hall (1987)."},{"key":"23_CR12","unstructured":"P. Fradet, D. Le Metayer, Compilation of Functional Languages by Program Transformation, INRIA Research, Report 1040 (1989)."},{"key":"23_CR13","unstructured":"D.E. Knuth, The Art of Computer Programming, vol.2, Addison Wesley (1981)."},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"D. Kranz, R. Kelsey, J.A. Rees, P. Hudak, J. Philbin, N.I. Adams, Orbit: An Optimizing Compiler for Scheme, Proceedings of the SIGPLAN '86 Symposium on Compiler Construction, July 1986.","DOI":"10.1145\/12276.13333"},{"key":"23_CR15","first-page":"41","volume":"47","author":"A. Scholz","year":"1937","unstructured":"A. Scholz, Jahresbericht, Deutsche Math.-Verein. 47, (1937) 41.","journal-title":"Deutsche Math.-Verein."},{"key":"23_CR16","volume-title":"The Scott-Strachey Approach to Programming Language Theory","author":"J.E. Stoy","year":"1977","unstructured":"J.E. Stoy, The Scott-Strachey Approach to Programming Language Theory, MIT Press, Cambridge (1977)."},{"key":"23_CR17","unstructured":"G.L. Steele, G.J. Sussman, Scheme: an Interpreter for the Extended Lambdacalculus, Memo 349, MIT Artificial Intelligence Laboratory (1975)."},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"M. Wand, Continuation-Based Program Transformation Strategies, J. of Computer Languages, (1978) 241\u2013263.","DOI":"10.1016\/0096-0551(78)90042-5"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3540539816_77.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:51:43Z","timestamp":1605628303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540539816_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540539810","9783540464990"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3540539816_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}