{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:06:51Z","timestamp":1751983611854},"reference-count":27,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5737,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1016\/s0304-3975(97)00065-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:48:18Z","timestamp":1027630098000},"page":"203-219","source":"Crossref","is-referenced-by-count":23,"title":["Generating power of lazy semantics"],"prefix":"10.1016","volume":"187","author":[{"given":"Jerzy","family":"Karczmarczuk","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00065-0_BIB1","series-title":"Structure and Interpretation of Computer Programs","author":"Abelson","year":"1984"},{"issue":"2","key":"10.1016\/S0304-3975(97)00065-0_BIB2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/spe.4380190202","article-title":"Circular programs and self-referential structures","volume":"19","author":"Allison","year":"1989","journal-title":"Software Practice and Experience"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB3","series-title":"Introduction to Functional Programming","author":"Bird","year":"1988"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB4","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1145\/322092.322099","article-title":"Fast algorithms for manipulating formal power series","volume":"25","author":"Brent","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB5","series-title":"Recursive Programming Techniques","author":"Burge","year":"1975"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB6","doi-asserted-by":"crossref","unstructured":"W.H. B\u00fcrge, S.M. Watt, Infinite Structures in Scratchpad II, EUROCAL'87, Lecture Notes in Computer Science, vol. 378, pp. 138\u2013148.","DOI":"10.1007\/3-540-51517-8_103"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB7","article-title":"Field theory","author":"Cvitanovi\u010d","year":"1983","journal-title":"Nordita Lecture Notes"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB8","series-title":"Phase Transitions and Critical Phenomena","first-page":"1","article-title":"Graph theory and embeddings","author":"Domb","year":"1974"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB9","author":"Fuchssteiner","year":"1995"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB10","series-title":"Proc. 1994 Glasgow Workshop on Functional Programming","article-title":"A tutorial on co-induction and functional programming","author":"Gordon","year":"1994"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB11","first-page":"37","author":"Gosper","year":"1972","journal-title":"MIT AI Laboratory Memo 239"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB12","series-title":"Concrete Mathematics","author":"Graham","year":"1989"},{"issue":"2","key":"10.1016\/S0304-3975(97)00065-0_BIB13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/190694.190695","article-title":"Introduction to Gauss","volume":"28","author":"Guntz","year":"1994","journal-title":"Sigsam Bull."},{"key":"10.1016\/S0304-3975(97)00065-0_BIB14","article-title":"Report on the programming language Haskell (Version 1.3)","author":"Hudak","year":"1996","journal-title":"Tech. Report Yale University\/Glasgow University"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB15","series-title":"Gofer, Functional Programming Environment","author":"Jones","year":"1991"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB16","series-title":"Functional Programming Languages in Education, FPLE '95","first-page":"121","article-title":"Functional programming and mathematical objects","volume":"vol. 1022","author":"Karczmarczuk","year":"1995"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB17","article-title":"The art of computer programming","volume":"vol. 2","author":"Knuth","year":"1981"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/322063.322068","volume":"25","author":"Kung","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB19","series-title":"Proc. ACM Symp. on Symbolic and Algebraic Computation","first-page":"260","article-title":"Newton's method: a great algebraic algorithm","author":"Lipson","year":"1976"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB20","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/spe.4380200704","article-title":"Squinting at power series","volume":"20","author":"McIlroy","year":"1990","journal-title":"Software \u2014Practice and Experience"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB21","first-page":"105","article-title":"Symbolic Newton iteration and its applications, Symbolic and Algebraic Computations by Computers","author":"Moritsugu","year":"1985"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB22","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1006\/jcph.1993.1074","article-title":"Automatic feynman graph generation","volume":"105","author":"Nogueira","year":"1993","journal-title":"J. Comput. Phys."},{"key":"10.1016\/S0304-3975(97)00065-0_BIB23","article-title":"Hope+","author":"Perry","year":"1987"},{"key":"10.1016\/S0304-3975(97)00065-0_BIB24","unstructured":"D.A. Turner, Elementary strong functional programming, Proc. Functional Programming Languages in Education (FPLE '95), Nijmegen, Lecture Notes in Computer Science, vol. 1022, Springer, Berlin, pp. 1\u201313."},{"key":"10.1016\/S0304-3975(97)00065-0_BIB25","series-title":"Algorithms and Complexity","first-page":"431","article-title":"Average-case analysis of algorithms and data structures","author":"Vitter","year":"1990"},{"issue":"8","key":"10.1016\/S0304-3975(97)00065-0_BIB26","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1109\/12.57047","article-title":"Exact real computer arithmetic with continued fractions","volume":"39","author":"Vuillemin","year":"1990","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(97)00065-0_BIB27","series-title":"Effective Polynomial Computation","author":"Zippel","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000650?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000650?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:59:28Z","timestamp":1555405168000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0304397597000650"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00065-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}