{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:05:35Z","timestamp":1725537935977},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642046513"},{"type":"electronic","value":"9783642046520"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04652-0_2","type":"book-chapter","created":{"date-parts":[[2009,9,15]],"date-time":"2009-09-15T09:34:58Z","timestamp":1253007298000},"page":"39-65","source":"Crossref","is-referenced-by-count":0,"title":["Spider Spinning for Dummies"],"prefix":"10.1007","author":[{"given":"Richard S.","family":"Bird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","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. ACM\u00a020, 500\u2013513 (1973)","journal-title":"J. ACM"},{"issue":"5","key":"2_CR2","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1017\/S0956796803004763","volume":"13","author":"J.-C. Filli\u00e2tre","year":"2003","unstructured":"Filli\u00e2tre, J.-C., Pottier, F.: Producing all ideals of a forest, functionally. Journal of Functional Programming\u00a013(5), 945\u2013956 (2003)","journal-title":"Journal of Functional Programming"},{"key":"2_CR3","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. Journal of Algorithms\u00a015, 324\u2013340 (1993)","journal-title":"Journal of Algorithms"},{"key":"2_CR4","unstructured":"Knuth, D.E.: SPIDERS: (2001), \n                  \n                    http:\/\/www-cs-faculty.stanford.edu\/~knuth\/programs.html"},{"key":"2_CR5","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"2005","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol.\u00a04, Fascicles 2,3,4. Addison-Wesley, Reading (2005)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-39993-3_11","volume-title":"From Object-Orientation to Formal Methods","author":"D.E. Knuth","year":"2004","unstructured":"Knuth, D.E., Ruskey, F.: Efficient Coroutine Generation of Constrained Gray Sequences (aka Deconstructing Coroutines). In: Owe, O., Krogdahl, S., Lyche, T. (eds.) From Object-Orientation to Formal Methods. LNCS, vol.\u00a02635, pp. 183\u2013208. Springer, Heidelberg (2004)"},{"issue":"4","key":"2_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. Journal of Functional Programming\u00a05(4), 583\u2013592 (1995)","journal-title":"Journal of Functional Programming"}],"container-title":["Lecture Notes in Computer Science","Advanced Functional Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04652-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T23:18:07Z","timestamp":1552173487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04652-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046513","9783642046520"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04652-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}