{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:47:09Z","timestamp":1725893229628},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642344060"},{"type":"electronic","value":"9783642344077"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34407-7_5","type":"book-chapter","created":{"date-parts":[[2012,11,5]],"date-time":"2012-11-05T19:58:14Z","timestamp":1352145494000},"page":"69-84","source":"Crossref","is-referenced-by-count":4,"title":["Lazy Generation of Canonical Test Programs"],"prefix":"10.1007","author":[{"given":"Jason S.","family":"Reich","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Naylor","sequence":"additional","affiliation":[]},{"given":"Colin","family":"Runciman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Abel, A.: Foetus \u2014 termination checker for simple functional programs (1998), \n \n http:\/\/www2.tcs.ifi.lmu.de\/~abel\/foetus.pdf"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/S0950-5849(97)00017-7","volume":"39","author":"A.S. Boujarwah","year":"1997","unstructured":"Boujarwah, A.S., Saleh, K.: Compiler test case generation methods: a survey and assessment. Information & Software Technology\u00a039, 617\u2013625 (1997)","journal-title":"Information & Software Technology"},{"issue":"5","key":"5_CR3","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"75","author":"N.G. Bruijn de","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 Mathematicae\u00a075(5), 381\u2013392 (1972)","journal-title":"Indagationes Mathematicae"},{"key":"5_CR4","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, ICFP 2000, pp. 268\u2013279. ACM (2000)","DOI":"10.1145\/357766.351266"},{"key":"5_CR5","unstructured":"Dietz, P.F.: The GCL ANSI Common Lisp test suite (2008), \n \n http:\/\/en.scientificcommons.org\/42309664"},{"key":"5_CR6","unstructured":"Jackson, D.: Software Abstractions: Logic, Language and Analysis, Revised edn. MIT Press (2012)"},{"key":"5_CR7","unstructured":"Katayama, S.: Systematic search for lambda expressions. In: Trends in Functional Programming, TFP 2005, vol.\u00a06, pp. 111\u2013126. Intellect Books (2007)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Naylor, M., Runciman, C.: The Reduceron reconfigured. In: Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming, ICFP 2010, pp. 75\u201386. ACM (2010)","DOI":"10.1145\/1863543.1863556"},{"key":"5_CR9","unstructured":"O\u2019Sullivan, B.: The criterion package, v0.5.1.1 (2011), \n \n http:\/\/hackage.haskell.org\/package\/criterion"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Palka, M.H., Claessen, K., Russo, A., Hughes, J.: Testing an optimising compiler by generating random lambda terms. In: Proceedings of the Sixth IEEE\/ACM Workshop on Automation of Software Test, AST 2011, pp. 91\u201397 (2011)","DOI":"10.1145\/1982595.1982615"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Partain, W.: The nofib benchmark suite of Haskell programs. In: Functional Programming, Workshops in Computing, Glasgow 1992, pp. 195\u2013202. Springer (1992)","DOI":"10.1007\/978-1-4471-3215-8_17"},{"key":"5_CR12","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, Haskell 2008, pp. 37\u201348. ACM (2008)","DOI":"10.1145\/1411286.1411292"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1017\/S0956796897002712","volume":"7","author":"P. Sestoft","year":"1997","unstructured":"Sestoft, P.: Deriving a lazy abstract machine. Journal of Functional Programming\u00a07, 231\u2013264 (1997)","journal-title":"Journal of Functional Programming"},{"key":"5_CR14","unstructured":"Tolmac, A., Chevalier, T.: The\u00a0GHC\u00a0Team: An external representation for the GHC Core Language (for GHC 6.10) (2009), \n \n http:\/\/www.haskell.org\/ghc\/docs\/6.10.4\/html\/ext-core\/core.pdf"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Functional Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34407-7_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:52:48Z","timestamp":1620118368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34407-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642344060","9783642344077"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34407-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}