{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:06:37Z","timestamp":1774987597271,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540356318","type":"print"},{"value":"9783540356325","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11783596_15","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T14:35:02Z","timestamp":1151505302000},"page":"235-252","source":"Crossref","is-referenced-by-count":14,"title":["Recursion Schemes for Dynamic Programming"],"prefix":"10.1007","author":[{"given":"Jevgeni","family":"Kabanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Varmo","family":"Vene","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","volume-title":"Dynamic Programming","author":"R. Bellman","year":"1957","unstructured":"Bellman, R.: Dynamic Programming. Princeton Univ. Press, Princeton (1957)"},{"key":"15_CR2","series-title":"NATO ASI Series F","first-page":"3","volume-title":"Logic of Programming and Calculi of Discrete Design","author":"R.S. Bird","year":"1987","unstructured":"Bird, R.S.: An introduction to the theory of lists. In: Broy, M. (ed.) Logic of Programming and Calculi of Discrete Design. NATO ASI Series F, vol.\u00a036, pp. 3\u201342. Springer, Berlin (1987)"},{"key":"15_CR3","series-title":"Prentice Hall Int. Series in Computer Science","volume-title":"Algebra of Programming","author":"R. Bird","year":"1997","unstructured":"Bird, R., de Moor, O.: Algebra of Programming. Prentice Hall Int. Series in Computer Science, vol.\u00a0100. Prentice Hall, London (1997)"},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.ic.2005.08.005","volume":"204","author":"V. Capretta","year":"2006","unstructured":"Capretta, V., Uustalu, T., Vene, V.: Recursive coalgebras from comonads. Inform. and Comput.\u00a0204(4), 437\u2013468 (2006)","journal-title":"Inform. and Comput."},{"key":"15_CR5","unstructured":"Fokkinga, M.: Law and Order in Algorithmics. PhD thesis. Dept. of Informatics, Univ. of Twente (1992)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-47797-7_5","volume-title":"Algebraic and Coalgebraic Methods in the Mathematics of Program Construction","author":"J. Gibbons","year":"2002","unstructured":"Gibbons, J.: Calculating functional programs. In: Blackhouse, R., Crole, R.L., Gibbons, J. (eds.) Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. LNCS, vol.\u00a02297, pp. 149\u2013202. Springer, Heidelberg (2002)"},{"key":"15_CR7","unstructured":"Hagino, T.: A Categorical Programming Language. PhD thesis CST-47-87. Laboratory for Foundations of Computer Science, Dept. of Computer Science, Univ. of Edinburgh (1987)"},{"issue":"2-3","key":"15_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0167-6423(90)90023-7","volume":"14","author":"G. Malcolm","year":"1990","unstructured":"Malcolm, G.: Data structures and program transformation. Sci. of Comput. Program.\u00a014(2-3), 255\u2013279 (1990)","journal-title":"Sci. of Comput. Program."},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/3540543961_7","volume-title":"Functional Programming Languages and Computer Architecture","author":"E. Meijer","year":"1991","unstructured":"Meijer, E., Fokkinga, M., Paterson, R.: Functional programming with bananas, lenses, envelopes and barbed wire. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol.\u00a0523, pp. 124\u2013144. Springer, Heidelberg (1991)"},{"issue":"1","key":"15_CR10","first-page":"5","volume":"10","author":"T. Uustalu","year":"1999","unstructured":"Uustalu, T., Vene, V.: Primitive (co)recursion and course-of-value (co)iteration, categorically. Informatica\u00a010(1), 5\u201326 (1999)","journal-title":"Informatica"},{"issue":"3","key":"15_CR11","first-page":"366","volume":"8","author":"T. Uustalu","year":"2001","unstructured":"Uustalu, T., Vene, V., Pardo, A.: Recursion schemes from comonads. Nordic J. of Computing\u00a08(3), 366\u2013390 (2001)","journal-title":"Nordic J. of Computing"},{"key":"15_CR12","unstructured":"Vene, V.: Categorical Programming with Inductive and Coinductive Types. PhD thesis. vol.\u00a023 of Diss. Math. Univ. Tartuensis. Dept. of Computer Science, Univ. of Tartu (2000)"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11783596_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:07:49Z","timestamp":1605643669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11783596_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540356318","9783540356325"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11783596_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}