{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:22:56Z","timestamp":1725495776559},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540766360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76637-7_4","type":"book-chapter","created":{"date-parts":[[2007,11,20]],"date-time":"2007-11-20T07:47:52Z","timestamp":1195544872000},"page":"38-53","source":"Crossref","is-referenced-by-count":2,"title":["Monadic, Prompt Lazy Assertions in Haskell"],"prefix":"10.1007","author":[{"given":"Olaf","family":"Chitil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Huch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"IFL 2006","author":"O. Chitil","year":"2007","unstructured":"Chitil, O., Huch, F.: A pattern logic for prompt lazy assertions in Haskell. In: Horvath, A.B.Z. (ed.) IFL 2006. LNCS, vol.\u00a04449, Springer, Heidelberg (2007)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Implementation of Functional Languages","author":"O. Chitil","year":"2004","unstructured":"Chitil, O., McNeill, D., Runciman, C.: Lazy assertions. In: Trinder, P., Michaelson, G.J., Pe\u00f1a, R. (eds.) IFL 2003. LNCS, vol.\u00a03145, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"4_CR3","first-page":"268","volume-title":"Proc. 5th Intl. ACM Conference on Functional Programming","author":"K. Claessen","year":"2000","unstructured":"Claessen, K., Hughes, R.J.M.: QuickCheck: a lightweight tool for random testing of Haskell programs. In: Proc. 5th Intl. ACM Conference on Functional Programming, pp. 268\u2013279. ACM Press, New York (2000)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-540-27764-4_6","volume-title":"Mathematics of Program Construction","author":"N.A. Danielsson","year":"2004","unstructured":"Danielsson, N.A., Jansson, P.: Chasing bottoms, a case study in program verification in the presence of partial and infinite values. In: Kozen, D. (ed.) MPC 2004. LNCS, vol.\u00a03125, pp. 85\u2013109. Springer, Heidelberg (2004)"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1145\/581478.581484","volume-title":"ICFP 2002","author":"R.B. Findler","year":"2002","unstructured":"Findler, R.B., Felleisen, M.: Contracts for higher-order functions. In: ICFP 2002, pp. 48\u201359. ACM Press, New York (2002)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Gill, A.: Debugging Haskell by observing intermediate datastructures. Electronic Notes in Theoretical Computer Science\u00a041(1) (2001) (Proc. 2000 ACM SIGPLAN Haskell Workshop)","DOI":"10.1016\/S1571-0661(05)80538-9"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/11737414_15","volume-title":"Functional and Logic Programming","author":"R. Hinze","year":"2006","unstructured":"Hinze, R., Jeuring, J., L\u00f6h, A.: Typed contracts for functional programming. In: Hagiya, M., Wadler, P. (eds.) FLOPS 2006. LNCS, vol.\u00a03945, pp. 208\u2013225. Springer, Heidelberg (2006)"},{"issue":"4","key":"4_CR8","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1017\/S0956796898003050","volume":"8","author":"G. Hutton","year":"1998","unstructured":"Hutton, G., Meijer, E.: Monadic parsing in Haskell. J. Funct. Program.\u00a08(4), 437\u2013444 (1998)","journal-title":"J. Funct. Program."},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1017\/S0956796898003001","volume":"8","author":"C. Okasaki","year":"1998","unstructured":"Okasaki, C.: Functional pearl: Even higher-order functions for parsing or Why would anyone ever want to use a sixth-order function? Journal of Functional Programming\u00a08(2), 195\u2013199 (1998)","journal-title":"Journal of Functional Programming"},{"key":"4_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511530104","volume-title":"Purely Functional Data Structures","author":"C. Okasaki","year":"1998","unstructured":"Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, Cambridge (1998)"},{"key":"4_CR11","volume-title":"ACM Workshop on Haskell","author":"M. Wallace","year":"2001","unstructured":"Wallace, M., Chitil, O., Brehm, T., Runciman, C.: Multiple-view tracing for Haskell: a new Hat. In: ACM Workshop on Haskell, ACM Press, New York (2001)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76637-7_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:56:26Z","timestamp":1619520986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76637-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540766360"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76637-7_4","relation":{},"subject":[]}}