{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T22:22:50Z","timestamp":1693866170712},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1987,2,1]],"date-time":"1987-02-01T00:00:00Z","timestamp":539136000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1987,2]]},"DOI":"10.1007\/bf00290706","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T06:39:30Z","timestamp":1096958370000},"page":"57-77","source":"Crossref","is-referenced-by-count":14,"title":["Partial parametrization eliminates multiple traversals of data structures"],"prefix":"10.1007","volume":"24","author":[{"given":"Masato","family":"Takeichi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF00264249","volume":"21","author":"R.S. Bird","year":"1984","unstructured":"Bird, R.S.: Using circular programs to eliminate multiple traversais of data. Acta Inf. 21, 239?250 (1984)","journal-title":"Acta Inf."},{"key":"CR2","volume-title":"Recursive Programming Techniques","author":"W.H. Burge","year":"1975","unstructured":"Burge, W.H.: Recursive Programming Techniques. Reading, MA: Addison-Wesley 1975"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R.M. Burstall","year":"1977","unstructured":"Burstall, R.M., Darlington, J.: A transformation system for developing recursive programs. J. ACM 24, 44?67 (1977)","journal-title":"J. ACM"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Friedman, D.P., Wise, D.S.: CONS should not evaluate its arguments. Proc. 3rd International Colloquium on Automata, Languages and Programming, pp. 257?284. Edinburgh (1976)","DOI":"10.1016\/0304-3975(76)90070-0"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Henderson, P., Morris, J.M.: A lazy evaluator. Proc. 3rd Symp. on Principle of Programming Languages, pp. 95?103. Atlanta, GA (1976)","DOI":"10.1145\/800168.811543"},{"key":"CR6","unstructured":"Hughes, R.J.M.: The design and implementation of programming languages. D.Phil. thesis. Oxford University 1984"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Hughes, R.J.M.: Super-combinators: a new implementation method for applicative languages. Proc. 1982 ACM Symp. Lisp and Functional Programming, pp. 1?10. Pittsburgh, PA (1982)","DOI":"10.1145\/800068.802129"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Hughes, R.J.M.: Lazy memo-functions. Functional Programming Languages and Computer Architecture. Lect. Notes Comp. Sci. 201, pp. 129?146. Berlin, Heidelberg, New York: 1985","DOI":"10.1007\/3-540-15975-4_34"},{"key":"CR9","unstructured":"Johnsson, T.: Lambda-lifting: Transforming Programs to Recursive Equations, ibid."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Milner, R.: A proposal for Standard ML. Proc. 1984 ACM Symp. LISP and Functional Programming, pp. 184?197. Austine, TX (1984)","DOI":"10.1145\/800055.802035"},{"key":"CR11","unstructured":"Turner, D.A.: Aspects of the implementation of programming languages. D.Phil. thesis. Oxford University 1981"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/S0022-0000(74)80048-6","volume":"9","author":"J. Vuillemin","year":"1974","unstructured":"Vuillemin, J.: Correct and optimal implementations of recursion in a simple programming language. J. Comp. Syst. Sci. 9, 332?354 (1974)","journal-title":"J. Comp. Syst. Sci."},{"key":"CR13","unstructured":"Wadsworth, C.P.: Semantics and Pragmatics of the Lambda-Calculus. D.Phil. thesis. Oxford University 1971"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00290706.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00290706\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00290706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T12:46:31Z","timestamp":1682772391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00290706"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,2]]}},"alternative-id":["BF00290706"],"URL":"https:\/\/doi.org\/10.1007\/bf00290706","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,2]]}}}