{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:20:04Z","timestamp":1726410004262},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642133206"},{"type":"electronic","value":"9783642133213"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13321-3_1","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T06:24:11Z","timestamp":1277187851000},"page":"1-18","source":"Crossref","is-referenced-by-count":0,"title":["The Algorithmics of Solitaire-Like Games"],"prefix":"10.1007","author":[{"given":"Roland","family":"Backhouse","sequence":"first","affiliation":[]},{"given":"Wei","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jo\u00e3o F.","family":"Ferreira","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Golomb, S.W.: Polyominoes. George Allen & Unwin Ltd. (1965)"},{"issue":"465","key":"1_CR2","doi-asserted-by":"publisher","first-page":"210","DOI":"10.2307\/3618440","volume":"73","author":"N. Mackinnon","year":"1989","unstructured":"Mackinnon, N.: An algebraic tiling proof. The Mathematical Gazette\u00a073(465), 210\u2013211 (1989)","journal-title":"The Mathematical Gazette"},{"key":"1_CR3","unstructured":"Piponi, D.: Arboreal isomorphisms from nuclear pennies (September 2007), Blog post available at, http:\/\/blog.sigfpe.com\/2007\/09\/arboreal-isomorphisms-from-nuclear.html"},{"key":"1_CR4","unstructured":"Chen, W., Backhouse, R.: From seven-trees-in-one to cyclotomics (2010) (submitted for publication), http:\/\/cs.nott.ac.uk\/~wzc"},{"key":"1_CR5","first-page":"133","volume":"5","author":"N.G. Bruijn de","year":"1972","unstructured":"de Bruijn, N.G.: A Solitaire game and its relation to a finite field. J. of Recreational Math.\u00a05, 133\u2013137 (1972)","journal-title":"J. of Recreational Math."},{"key":"1_CR6","volume-title":"Winning Ways","author":"E.R. Berlekamp","year":"1982","unstructured":"Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways, vol.\u00a0I, II. Academic Press, London (1982)"},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1515\/crll.1857.54.344","volume":"54","author":"M. Reiss","year":"1857","unstructured":"Reiss, M.: Beitrage zur Theorie der Solit\u00e4r-Spiels. Crelle\u2019s J.\u00a054, 344\u2013379 (1857)","journal-title":"Crelle\u2019s J."},{"key":"1_CR8","unstructured":"Dijkstra, E.W.: The checkers problem told to me by M.O. Rabin (September 1992), http:\/\/www.cs.utexas.edu\/users\/EWD\/ewd11xx\/EWD1134.PDF"},{"key":"1_CR9","unstructured":"Piponi, D.: Using thermonuclear pennies to embed complex numbers as types (October 2007), Blog post available at, http:\/\/blog.sigfpe.com\/2007\/10\/using-thermonuclear-pennies-to-embed.html"},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-4049(95)00098-H","volume":"103","author":"A. Blass","year":"1995","unstructured":"Blass, A.: Seven trees in one. Journal of Pure and Applied Algebra\u00a0103(1), 1\u201321 (1995)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/964001.964008","volume-title":"Proceedings of the 31st Annual ACM SIGPLAN-SIGACT Symposium on the Principles of Programming Languages","author":"M. Fiore","year":"2004","unstructured":"Fiore, M.: Isomorphisms of generic recursive polynomial types. In: Proceedings of the 31st Annual ACM SIGPLAN-SIGACT Symposium on the Principles of Programming Languages, pp. 77\u201388. ACM Press, New York (2004)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Lawvere, F.W.: Some thoughts on the future of category theory. Lecture Notes in Mathematics, vol.\u00a01488, pp. 1\u201313 (1991)","DOI":"10.1007\/BFb0084208"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13321-3_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:04:47Z","timestamp":1606187087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13321-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642133206","9783642133213"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13321-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}