{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T07:37:46Z","timestamp":1775029066900,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642415814","type":"print"},{"value":"9783642415821","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41582-1_4","type":"book-chapter","created":{"date-parts":[[2013,11,15]],"date-time":"2013-11-15T12:38:21Z","timestamp":1384519101000},"page":"53-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Advances in Lazy SmallCheck"],"prefix":"10.1007","author":[{"given":"Jason S.","family":"Reich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Naylor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"Runciman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,16]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Claessen, K.: Shrinking and showing functions: (functional pearl). In: Proceedings of the 2012 Symposium on Haskell, pp. 73\u201380. Haskell \u201912, ACM (2012)","DOI":"10.1145\/2430532.2364516"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Claessen, K., Hughes, J.: QuickCheck: a lightweight tool for random testing of Haskell programs. In: Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming, pp. 268\u2013279. ICFP \u201900. ACM (2000)","DOI":"10.1145\/357766.351266"},{"key":"4_CR3","first-page":"85","volume-title":"MPC 2004. LNCS","author":"NA Danielsson","year":"2004","unstructured":"Danielsson, N.A., Jansson, P.: Chasing bottoms. In: Kozen, D. (ed.) MPC 2004. LNCS, vol. 3125, pp. 85\u2013109. Springer, Heidelberg (2004)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"34","author":"NG de Bruijn","year":"1972","unstructured":"de Bruijn, N.G.: Lambda calculus notation with nameless dummies: a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Math. 34, 381\u2013392 (1972)","journal-title":"Indagationes Math."},{"key":"4_CR5","unstructured":"Elliott, C.: Elegant memoization with functional memo tries. http:\/\/conal.net\/blog\/posts\/elegant-memoization-with-functional-memo-tries (October 2008). Accessed 26 July 2012"},{"issue":"04","key":"4_CR6","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1017\/S0956796800003713","volume":"10","author":"R Hinze","year":"2000","unstructured":"Hinze, R.: Generalizing generalized tries. J. Funct. Program. 10(04), 327\u2013351 (2000)","journal-title":"J. Funct. Program."},{"key":"4_CR7","first-page":"53","volume-title":"AFP 1995. LNCS","author":"J Hughes","year":"1995","unstructured":"Hughes, J.: The design of a pretty-printing library. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol. 925, pp. 53\u201396. Springer, Heidelberg (1995)"},{"key":"4_CR8","volume-title":"Software Abstractions: Logic, Language and Analysis","author":"D Jackson","year":"2012","unstructured":"Jackson, D.: Software Abstractions: Logic, Language and Analysis. MIT Press, Cambridge (2012). Revised edn"},{"key":"4_CR9","unstructured":"Katayama, S.: Systematic search for lambda expressions. In: Trends in Functional Programming, TFP2005, vol. 6, pp. 111\u2013126. Intellect Books (2007)"},{"key":"4_CR10","first-page":"25","volume-title":"AAIP 2009. LNCS","author":"P Koopman","year":"2010","unstructured":"Koopman, P., Plasmeijer, R.: Synthesis of functions using generic programming. In: Schmid, U., Kitzelmann, E., Plasmeijer, R. (eds.) AAIP 2009. LNCS, vol. 5812, pp. 25\u201349. Springer, Heidelberg (2010)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Marlow, S.: An extensible dynamically-typed hierarchy of exceptions. In: Proceedings of the 2006 ACM SIGPLAN Workshop on Haskell, pp. 96\u2013106. Haskell \u201906. ACM (2006)","DOI":"10.1145\/1159842.1159854"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0956796807006326","volume":"18","author":"C McBride","year":"2008","unstructured":"McBride, C., Paterson, R.: Applicative programming with effects. J. Funct. Program. 18(1), 1\u201313 (2008)","journal-title":"J. Funct. Program."},{"key":"4_CR13","first-page":"69","volume-title":"IFL 2011. LNCS","author":"JS Reich","year":"2012","unstructured":"Reich, J.S., Naylor, M., Runciman, C.: Lazy generation of canonical test programs. In: Gill, A., Hage, J. (eds.) IFL 2011. LNCS, vol. 7257, pp. 69\u201384. Springer, Heidelberg (2012)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Runciman, C., Naylor, M., Lindblad, F.: SmallCheck and Lazy SmallCheck: automatic exhaustive testing for small values. In: Proceedings of the First ACM SIGPLAN Symposium on Haskell, pp. 37\u201348. Haskell \u201908, ACM (2008)","DOI":"10.1145\/1543134.1411292"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Sheard, T., Peyton Jones, S.: Template metaprogramming for Haskell. In: Proceedings of the 2002 ACM SIGPLAN Workshop on Haskell, pp. 1\u201316. Haskell \u201902. ACM (2002)","DOI":"10.1145\/581690.581691"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Functional Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41582-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T08:25:41Z","timestamp":1676363141000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-41582-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415814","9783642415821"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41582-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"16 November 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}