{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:45:08Z","timestamp":1757313908611},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540356318"},{"type":"electronic","value":"9783540356325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11783596_9","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:35:02Z","timestamp":1151490902000},"page":"90-114","source":"Crossref","is-referenced-by-count":2,"title":["Loopless Functional Algorithms"],"prefix":"10.1007","author":[{"given":"Richard S.","family":"Bird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"Introduction to Functional Programming Using Haskell","author":"R.S. Bird","year":"1998","unstructured":"Bird, R.S.: Introduction to Functional Programming Using Haskell. Prentice Hall, Englewood Cliffs (1998)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1145\/321765.321781","volume":"20","author":"G. Ehrlich","year":"1973","unstructured":"Ehrlich, G.: Loopless algorithms for generating permutations, combinations, and other combinatorial configurations. J. of ACM\u00a020, 500\u2013513 (1973)","journal-title":"J. of ACM"},{"issue":"5","key":"9_CR3","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1017\/S0956796803004763","volume":"13","author":"J.-C. Filliatre","year":"2003","unstructured":"Filliatre, J.-C., Pottier, F.: Producing all ideals of a forest, functionally. J. of Funct. Program.\u00a013(5), 945\u2013956 (2003)","journal-title":"J. of Funct. Program."},{"key":"9_CR4","unstructured":"Knuth, D.E.: SPIDERS (2001), A program downloadable from: \n                    \n                      www-cs-faculty.stanford.edu\/~knuth\/programs.html"},{"key":"9_CR5","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 4 (2004), \n                    \n                      www-cs-faculty.stanford.edu\/~knuth\/"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1006\/jagm.1993.1044","volume":"15","author":"Y. Koda","year":"1993","unstructured":"Koda, Y., Ruskey, R.: A Gray code for the ideals of a forest poset. J. of Algorithms\u00a015, 324\u2013340 (1993)","journal-title":"J. of Algorithms"},{"issue":"4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1017\/S0956796800001489","volume":"5","author":"C. Okasaki","year":"1995","unstructured":"Okasaki, C.: Simple and efficient purely functional queues and deques. J. of Funct. Program.\u00a05(4), 583\u2013592 (1995)","journal-title":"J. of Funct. Program."}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11783596_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:07:56Z","timestamp":1605625676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11783596_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540356318","9783540356325"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11783596_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}